Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing - Archive ouverte HAL Access content directly
Journal Articles Networks Year : 2018

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

Abstract

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

Dates and versions

hal-01537872 , version 1 (13-06-2017)

Identifiers

Cite

Marco Silva, Michael Poss, Nelson Maculan. Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing. Networks, 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⟩
172 View
508 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More