2018
DOI: 10.1002/net.21807
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: We experiment 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 numbe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 44 publications
0
9
0
Order By: Relevance
“…Nemeth and Retvari [154] study an adaptive routing algorithm to control the rate at which traffic is sent along paths. Silva et al [200] consider a robust network design where the first stage determines potential routing schemes and the second stage selects which one to implement. In general, the Networks community tends to focus on adaptation in terms of routing in networks.…”
Section: Optimization Models and Network Adaptabilitymentioning
confidence: 99%
“…Nemeth and Retvari [154] study an adaptive routing algorithm to control the rate at which traffic is sent along paths. Silva et al [200] consider a robust network design where the first stage determines potential routing schemes and the second stage selects which one to implement. In general, the Networks community tends to focus on adaptation in terms of routing in networks.…”
Section: Optimization Models and Network Adaptabilitymentioning
confidence: 99%
“…There have been various research streams along these lines [4, 5, 14, 20, 81, 120]. In terms of computational complexity, the robust network design problem is co‐NP‐hard [26].…”
Section: Backbone Networkmentioning
confidence: 99%
“…A group of hybrid approaches, often referred to as semi-stable routing, have been recently proposed to combine static and dynamic routing [3,6,16,17,21]. Using a limited set of routing configurations, each designed for specific time intervals, allows for reducing the penalty of assuming the "worst case" traffic conditions, and, simultaneously, for controlling the reconfiguration frequency.…”
Section: Introductionmentioning
confidence: 99%