$k$ -Adaptive Routing for the Robust Network Loading Problem - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Discrete Mathematics Year : 2018

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


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.
Fichier principal
Vignette du fichier
INOC2017V22.pdf (222.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01768637 , version 1 (30-03-2021)



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



Gmail Facebook Twitter LinkedIn More