Advertisement

Relax-and-Cut for Capacitated Network Design

  • Georg Kliewer
  • Larissa Timajev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)

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.

Keywords

Network Design Lagrangian Relaxation Valid Inequality Network Design Problem Bundle Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BMM97]
    Balakrishnan, A., Magnanti, T., Mirchandani, P.: Network design. In: Annotated Bibliographies in Combinatorial Optimization, pp. 311–334 (1997)Google Scholar
  2. [CCG03]
    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. [CFG01]
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  4. [CGF00]
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  5. [CGH04]
    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)zbMATHCrossRefGoogle Scholar
  6. [Cra00]
    Crainic, T.G.: Service network design in freight transportation. European Journal of Operational Research 122, 272–288 (2000)zbMATHCrossRefGoogle Scholar
  7. [DM02]
    Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Mathematical Programming 91(2), 201–213 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  8. [Fra97]
    Frangioni, A.: Dual Ascent Methods and Multicommodity Flow Problems. PhD thesis, Dipartimento di Informatica, Università di Pisa (1997)Google Scholar
  9. [GC94]
    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. [GCG03]
    Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Operations research 51(4), 655–667 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  11. [GCG04]
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  12. [Gui98]
    Guignard, M.: Efficient cuts in lagrangean ‘relax-and-cut’ schemes. European Journal of Operational Research 105, 216–223 (1998)zbMATHCrossRefGoogle Scholar
  13. [HFK01]
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  14. [HY00]
    Holmberg, K., Yuan, D.: A lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research 48, 461–481 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  15. [Luc92]
    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. [MLM04]
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  17. [MW84]
    Magnanti, T.L., Wong, R.T.: Network design and transportation planning: Models and algorithms. Transportation Science 18(1), 1–55 (1984)CrossRefGoogle Scholar
  18. [RG05]
    Ralphs, T., Galati, M.: Decomposition and dynamic cut generation in integer programming. Technical report, Lehigh University, PA (2005); To appear in Mathematical ProgrammingGoogle Scholar
  19. [SKK02a]
    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)CrossRefGoogle Scholar
  20. [SKK02b]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Georg Kliewer
    • 1
  • Larissa Timajev
    • 1
  1. 1.Department of Computer ScienceUniversity of PaderbornGermany

Personalised recommendations