Skip to main content
SpringerLink
Log in

Relax-and-Cut for Capacitated Network Design

  • Conference paper
Algorithms – ESA 2005 (ESA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3669))

Included in the following conference series:

Abstract

We present an evaluation of a Lagrangean-based branch-and-bound algorithm with additional valid inequalities for the capacitated network design problem. The focus is on two types of valid inequalities, the cover inequalities and local cuts. We show how these inequalities can be considered in a Lagrangean relaxation without destroying the computationally simple structure of the subproblems. We present an extensive computational study on a large set of benchmark data. The results show that the presented algorithm outperforms many other exact and heuristical solvers in terms of running time and solution quality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balakrishnan, A., Magnanti, T., Mirchandani, P.: Network design. In: Annotated Bibliographies in Combinatorial Optimization, pp. 311–334 (1997)

    Google Scholar 

  2. Chouman, M., Crainic, T.G., Gendron, B.: A cutting-plane algorithm based on cutset inequalities for multicommodity capacitated fixed charge network design. Technical report, Centre for Research on Transportation, Montreal, Canada (2003)

    Google Scholar 

  3. Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Discrete Applied Mathematics 112, 73–99 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Crainic, T.G., Gendreau, M., Farvolden, J.M.: A simplex-based tabu search method for capacitated network design. INFORMS Journal on Computing 12(3), 223–236 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Crainic, T.G., Gendron, B., Hernu, G.: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity fixed-charge network design. Journal of Heuristics 10(5), 525–545 (2004)

    Article  MATH  Google Scholar 

  6. Crainic, T.G.: Service network design in freight transportation. European Journal of Operational Research 122, 272–288 (2000)

    Article  MATH  Google Scholar 

  7. Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Mathematical Programming 91(2), 201–213 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Frangioni, A.: Dual Ascent Methods and Multicommodity Flow Problems. PhD thesis, Dipartimento di Informatica, Università di Pisa (1997)

    Google Scholar 

  9. Gendron, B., Crainic, T.G.: Relaxations for multicommodity capacitated network design problems. Technical report, Center for Research on Transportation, Montreal, Canada (1994)

    Google Scholar 

  10. Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Operations research 51(4), 655–667 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ghamlouche, I., Crainic, T.G., Gendreau, M.: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Annals of Operations research 131(1-4), 109–133 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Guignard, M.: Efficient cuts in lagrangean ‘relax-and-cut’ schemes. European Journal of Operational Research 105, 216–223 (1998)

    Article  MATH  Google Scholar 

  13. Hunting, M., Faigle, U., Kern, W.: A lagrangian relaxation approach to the edge-weighted clique problem. European Journal of Operational Research 131(1), 119–131 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Holmberg, K., Yuan, D.: A lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research 48, 461–481 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lucena, A.: Steiner problem in graphs: Lagrangian relaxation and cutting planes. In: COAL Bulletin, vol. 21, pp. 2–8. Mathematical Programming Society (1992)

    Google Scholar 

  16. Martinhon, C., Lucena, A., Maculan, N.: Stronger k-tree relaxations for the vehicle routing problem. European Journal of Operational Research 158(1), 56–71 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Magnanti, T.L., Wong, R.T.: Network design and transportation planning: Models and algorithms. Transportation Science 18(1), 1–55 (1984)

    Article  Google Scholar 

  18. Ralphs, T., Galati, M.: Decomposition and dynamic cut generation in integer programming. Technical report, Lehigh University, PA (2005); To appear in Mathematical Programming

    Google Scholar 

  19. Sellmann, M., Kliewer, G., Koberstein, A.: Lagrangian cardinality cuts and variable fixing for capacitated network design. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 845–858. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Sellmann, M., Kliewer, G., Koberstein, A.: Lagrangian cardinality cuts and variable fixing for capacitated network design. Technical report tr-ri-02-234, University of Paderborn (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Paderborn, Germany

    Georg Kliewer & Larissa Timajev

Authors
  1. Georg Kliewer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Larissa Timajev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark

    Gerth Stølting Brodal

  2. University of Rome “La Sapienza”, Rome, Italy

    Stefano Leonardi

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kliewer, G., Timajev, L. (2005). Relax-and-Cut for Capacitated Network Design. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_7

Download citation

  • DOI: https://doi.org/10.1007/11561071_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29118-3

  • Online ISBN: 978-3-540-31951-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation