Premium
Solving the bifurcated and nonbifurcated robust network loading problem with k ‐adaptive routing
Author(s) -
Silva Marco,
Poss Michael,
Maculan Nelson
Publication year - 2018
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21807
Subject(s) - mathematical optimization , decision maker , computer science , routing (electronic design automation) , partition (number theory) , scheme (mathematics) , set (abstract data type) , realization (probability) , network routing , mathematics , operations research , computer network , mathematical analysis , statistics , combinatorics , programming language
We experiment with an alternative routing scheme for the robust network loading problem with demand uncertainty. Named k ‐adaptive, it is based on the fact that the decision‐maker chooses k second‐stage solutions and then commits to one of them only after realization of the uncertainty. This routing scheme, with its corresponding k ‐partition of the uncertainty set, is dynamically defined under an iterative method to sequentially improve the solution. The method has an inherent characteristic of multiplying the number of variables and constraints after each iteration, so that additional measures are introduced in the solution strategy in order to control time performance. We compare our k ‐adaptive results with the ones obtained through other routing schemes and also verify the effectiveness of the methods utilized using several realistic networks from SNDlib and other sources.