Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem

This paper addresses the robust uncapacitated multiple allocation p -hub median problem where the demand traffic between origin-destination pairs are subject to uncertainty. The employed robust optimization approach adjusts the level of conservatism by using a parameter called the budget of uncertai...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization letters Ročník 16; číslo 6; s. 1745 - 1772
Hlavný autor: Ghaffarinasab, Nader
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2022
Predmet:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Robust optimization
Benders decomposition
Hub location
Demand uncertainty
ISSN:1862-4472, 1862-4480
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper addresses the robust uncapacitated multiple allocation p -hub median problem where the demand traffic between origin-destination pairs are subject to uncertainty. The employed robust optimization approach adjusts the level of conservatism by using a parameter called the budget of uncertainty . A mixed-integer programming linear formulation is proposed for the problem and two exact solution procedures based on Benders decomposition are developed to solve large-scale instances of the problem. Extensive computational experiments are conducted to study the effect of incorporating uncertainty into the problem and to evaluate the performance of the proposed mathematical models as well as the solution algorithms.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-021-01799-w