A hybrid primal heuristic for Robust Multiperiod Network Design
Please always quote using this URN: urn:nbn:de:0297-zib-44081
- We investigate the Robust Multiperiod Network Design Problem, a generalization of the classical Capacitated Network Design Problem that additionally considers multiple design periods and provides solutions protected against traffic uncertainty. Given the intrinsic difficulty of the problem, which proves challenging even for state-of-the art commercial solvers, we propose a hybrid primal heuristic based on the combination of ant colony optimization and an exact large neighborhood search. Computational experiments on a set of realistic instances from the SNDlib show that our heuristic can find solutions of extremely good quality with low optimality gap.
Author: | Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj |
---|---|
Document Type: | ZIB-Report |
Tag: | Multiperiod Network Design, Traffic Uncertainty, Robust Optimization, Multiband Robustness, Hybrid Heuristics |
MSC-Classification: | 68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area) |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING | |
Date of first Publication: | 2013/12/30 |
Series (Serial Number): | ZIB-Report (13-78) |
ISSN: | 1438-0064 |
Published in: | To appear in EvoApplications - Proc. of EvoStar 2014, Esparcia-Alcazar, A. et al. (Eds.), Lecture Notes in Computer Science, Springer, Heidelberg |
Licence (German): | Creative Commons - Namensnennung |