Skip to main content
SpringerLink
Log in

A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper describes a slope scaling heuristic for solving the multicomodity capacitated fixed-charge network design problem. The heuristic integrates a Lagrangean perturbation scheme and intensification/diversification mechanisms based on a long-term memory. Although the impact of the Lagrangean perturbation mechanism on the performance of the method is minor, the intensification/diversification components of the algorithm are essential for the approach to achieve good performance. The computational results on a large set of randomly generated instances from the literature show that the proposed method is competitive with the best known heuristic approaches for the problem. Moreover, it generally provides better solutions on larger, more difficult, instances.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Balakrishnan, A., T.L. Magnanti, and P. Mirchandani. (1997). "Network Design." In M. Dell'Amico, F. Maffioli, and S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization. New York, NY: John Wiley & Sons, pp. 311–334.

    Google Scholar 

  • Crainic, T.G., M. Gendreau, and J. Fravolden. (2000). "A Simplex-Based Tabu Search Method for Capacitated Network Design." INFORMS Journal on Computing12, 223–236.

    Google Scholar 

  • Crainic, T.G., A. Frangioni, and B. Gendron. (2001). "Bundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design Problems." Discrete Applied Mathematics112, 73–99.

    Google Scholar 

  • Gendron, B. and T.G. Crainic. (1994). "Relaxations for Multicommodity Capacitated Network Design Problems." Publication CRT-965, Centre de recherche sur les transports, Université deMontréal.

  • Gendron, B. and T.G. Crainic. (1996). "Bounding Procedures for Multicommodity Capacitated Fixed Charge Network Design Problems." Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal.

  • Gendron, B., T.G. Crainic, and A. Frangioni. (1999). "Multicommodity Capacitated Network Design." In B. Sansò and P. Soriano (Eds.), Chapter 1 in Telecommunications Network Planning. Norwell, MA: Kluwer Academics Publishers, pp. 1–19.

    Google Scholar 

  • Ghamlouche, I., T.G. Crainic, and M. Gendreau. (2003). "Cycle Based Neighborhood Structures for Fixed-Charge Capacitated Multicommodity Network Design." Operations Research51(4), 655–667.

    Google Scholar 

  • Ghamlouche, I., T.G. Crainic, and M. Gendreau. (2004). "Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design." Annals of Operations Research 131, 109–133.

    Google Scholar 

  • Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers.

    Google Scholar 

  • Holmberg, K. and D. Yuan. (2000). "A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capaci-tated Network Design Problem." Operations Research48, 461–481.

    Google Scholar 

  • Kim, D. and P.M. Pardalos. (1999). "A Solution Approach to the Fixed Charge Network Flow Problem Using a Dynamic Slope Scaling Procedure." Operations Research Letters 24, 195–203.

    Google Scholar 

  • Kim, D. and P.M. Pardalos. (2000a). "Dynamic Slope Scaling and Trust Interval Techniques for Solving Concave Piecewise Linear Network Flow Problems." Networks35, 216–222.

    Google Scholar 

  • Kim, D. and P.M. Pardalos. (2000b). "A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems." Journal of Global Optimization17, 225–234.

    Google Scholar 

  • Magnanti, T.L. and R.T. Wong. (1984). "Network Design and Transportation Planning: Models and Algorithms." Transportation Science18, 1–55.

    Google Scholar 

  • Minoux, M. (1989). "Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications." Networks19, 313–360.

    Google Scholar 

  • Yaged, B. (1971). "Minimum Cost Routing for Static Network Models." Networks1, 139–172.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de management et technologie, École des Sciences de la gestion, Université du Québec à Montréal, C.P. 8888, succursale Centre-ville, Montréal, Québec, Canada, H3C 3P8

    Teodor Gabriel Crainic

  2. Centre de recherche sur les transports, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Québec, Canada, H3C 3J7

    Teodor Gabriel Crainic, Bernard Gendron & Geneviève Hernu

  3. Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Québec, Canada, H3C 3J7

    Bernard Gendron

Authors
  1. Teodor Gabriel Crainic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard Gendron
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Geneviève Hernu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crainic, T.G., Gendron, B. & Hernu, G. A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design. Journal of Heuristics 10, 525–545 (2004). https://doi.org/10.1023/B:HEUR.0000045323.83583.bd

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:HEUR.0000045323.83583.bd

Search

Navigation