Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing

Résumé : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [41 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01537872
Contributor : Michael Poss <>
Submitted on : Tuesday, June 13, 2017 - 10:13:47 AM
Last modification on : Thursday, May 9, 2019 - 11:05:53 AM
Long-term archiving on : Tuesday, December 12, 2017 - 10:51:00 AM

File

NETWORKSSPECIALISSUEKAAPTIVE.p...
Files produced by the author(s)

Identifiers

Citation

Marco Silva, Michael Poss, Nelson Maculan. Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing. Networks, Wiley, 2018, Special Issue: Special Issue “New Advances and Applications in Deterministic and Stochastic Network Optimization”, 72 (1), pp.151-170. ⟨10.1002/net.21807⟩. ⟨hal-01537872⟩

Share

Metrics

Record views

219

Files downloads

326