Models and algorithms for robust network design with several traffic scenarios

Álvarez-Miranda E, Cacchiani V, Dorneth T, Jünger M, Liers F, Lodi A, Parriani T, Schmidt DR (2012)

Publication Status: Published

Publication Type: Book chapter / Article in edited volumes

Publication year: 2012

Publisher: Springer

Edited Volumes: Combinatorial Optimization

Series: Lecture Notes in Computer Science

City/Town: Berlin, Heidelberg

Book Volume: 7422

Pages Range: 261-272

Event location: Athens

ISBN: 9783642321467

DOI: 10.1007/978-3-642-32147-4_24

Abstract

We consider a robust network design problem: optimum integral capacities need to be installed in a network such that supplies and demands in each of the explicitly known traffic scenarios can be satisfied by a single-commodity flow. In Buchheim et al. (LNCS 6701, 7-17 (2011)), an integer-programming (IP) formulation of polynomial size was given that uses both flow and capacity variables. We introduce an IP formulation that only uses capacity variables and exponentially many, but polynomial time separable constraints. We discuss the advantages of the latter formulation for branch-and-cut implemenations and evaluate preliminary computational results for the root bounds. We define a class of instances that is difficult for IP-based approaches. Finally, we design and implement a heuristic solution approach based on the exploration of large neighborhoods of carefully selected size and evaluate it on the difficult instances. The results are encouraging, with a good understanding of the trade-off between solution quality and neighborhood size. © 2012 Springer-Verlag.

Authors with CRIS profile

Frauke Liers-Bergmann Professur für Optimization under Uncertainty & Data Analysis

Involved external institutions

University of Bologna / Università di Bologna IT Italy (IT) Universität zu Köln DE Germany (DE)

How to cite

APA:

Álvarez-Miranda, E., Cacchiani, V., Dorneth, T., Jünger, M., Liers, F., Lodi, A.,... Schmidt, D.R. (2012). Models and algorithms for robust network design with several traffic scenarios. In A. Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos (Eds.), Combinatorial Optimization. (pp. 261-272). Berlin, Heidelberg: Springer.

MLA:

Álvarez-Miranda, Eduardo, et al. "Models and algorithms for robust network design with several traffic scenarios." Combinatorial Optimization. Ed. A. Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos, Berlin, Heidelberg: Springer, 2012. 261-272.

BibTeX: Download