$k$ -Adaptive Routing for the Robust Network Loading Problem

Abstract : We experiment an alternative routing scheme for the Robust Network Loading problem. 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 its tractability. 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 instances from SNDlib.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01768637
Contributor : Michael Poss <>
Submitted on : Tuesday, April 17, 2018 - 1:24:28 PM
Last modification on : Thursday, May 9, 2019 - 11:01:06 AM

Identifiers

Citation

Marco Silva, Michael Poss, Nelson Maculan. $k$ -Adaptive Routing for the Robust Network Loading Problem. Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.95-104. ⟨10.1016/j.endm.2018.01.011⟩. ⟨hal-01768637⟩

Share

Metrics

Record views

182