Abstract
We present a branch-and-bound approach for the Capacitated Network Design Problem. We focus on tightening strategies such as variable fixing and local cuts that can be applied in every search node. Different variable fixing algorithms based on Lagrangian relaxations are evaluated solitarily and in combined versions. Moreover,we develop cardinality cuts for the problem and evaluate their usefulness empirically by numerous tests.
This work was partly supported by the German Science Foundation (DFG)project SFB-376,the project ”Optimierung in Netzwerken” under grant MO 285/15-1,and by the UP-TV project,partially funded by the IST program of the Commission of the European Union as project number 1999-20751,and by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.K. Ahuja, T.L. Magnati, J.B. Orlin.Network Flows. Prentice Hall,1993.
D. Bienstock, O. Günlük, S. Chopra, C.Y. Tsa.Mininum cost capacity installation for multicommodity flows.Mathematical Programming 81:177–199,1998.
D. Bienstock.Experiments with a network design algorithm using epsilon-approximate linear programs.CORC Report 1999-4.
T.G. Crainic, A. Frangioni, B. Gendron. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics 112:73–99,2001.
T.G. Crainic, M. Gendreau, and J.M. Farvolden. A simplex-based tabu search method for capacitated network design. INFORMS Journal on Computing 12(3):223–236,2000.
A. Frangioni. Dual Ascent Methods and Multicommodity Flow Problems.Ph.D. Dissertation TD 97-5, D p.d Informatica,Univ.d Pisa,1997.
I. Ghamlouche, T.G. Crainic, M Gendreau.Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design.Technical report CRT-2001-01.Centre de recherche sur les transports,Université de Montréal.
I. Ghamlouche, T.G. Crainic, M. Gendreau. Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design Technical report CRT-2002-01.Centre de recherche sur les transports,UniversitédeMontréal.
M. Held and R.M. Karp.The travelling-salesman problem and minimum spanning trees.Operations Research 18:1138–1162,1970.
M. Held and R.M. Karp.The travelling-salesman problem and minimum spanning trees:Part II.Mathematical Programming 1:6–25,1971.
K. Holmberg and D. Yuan.A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.Operations Research 48:461–481,2000.
S. Martello and P. Toth.An upper bound for the zero-one knapsack problem and a branch and bound algorithm. European Journal of Operational Research1:169–175,1977.
S. Martello and P. Toth. Knapsack Problems — Algorithms and Computer Implementations.Wiley Interscience 1990.
M. Sellmann and T. Fahle.Coupling Variable Fixing Algorithms for the Automatic Recording Problem.9th Annual European Symposium on Algorithms (ESA 2001),Springer LNCS 2161:134–145,2001.
M. Sellmann, G. Kliewer, A. Koberstein. Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design.Technical report tr-ri-02-234.University of Paderborn.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sellmann, M., Kliewe, G., Kobe stein, A. (2002). Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_73
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive