A slope scaling/lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design

Journal of Heuristics

Volumn 10, Issue 5, 2004, Pages 525-545

  Crainic, Teodor Gabriel ^a,b   Gendron, Bernard ^b   Hernu, Geneviève ^b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Lagrangean heuristic; Long term memory; Multicommodity capacitated fixed charge network design; Slope scaling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; NETWORKS (CIRCUITS); PERTURBATION TECHNIQUES; PROBLEM SOLVING; STRUCTURAL DESIGN;

LAGRANGEAN HEURISTIC; LONG-TERM MEMORY; MULTICOMMODITY CAPACITATED FIXED-CHARGE NETWORK DESIGNS; SLOPE SCALING;

HEURISTIC METHODS;

EID: 6944233955     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:HEUR.0000045323.83583.bd     Document Type: Article

References (16)

1. 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.
2. Crainic, T.G., M. Gendreau, and J. Fravolden. (2000). "A Simplex-Based Tabu Search Method for Capacitated Network Design." INFORMS Journal on Computing 12, 223-236.
3. Crainic, T.G., A. Frangioni, and B. Gendron. (2001). "Bundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design Problems." Discrete Applied Mathematics 112, 73-99.
4. Gendron, B. and T.G. Crainic. (1994). "Relaxations for Multicommodity Capacitated Network Design Problems." Publication CRT-965, Centre de recherche sur les transports, Université de Montréal.
5. 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.
6. 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.
7. Ghamlouche, I., T.G. Crainic, and M. Gendreau. (2003). "Cycle Based Neighborhood Structures for Fixed-Charge Capacitated Multicommodity Network Design." Operations Research 51(4), 655-667.
8. 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.
9. Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers.
10. Holmberg, K. and D. Yuan. (2000). "A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem." Operations Research 48, 461-481.
11. 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.
12. Kim, D. and P.M. Pardalos. (2000a). "Dynamic Slope Scaling and Trust Interval Techniques for Solving Concave Piecewise Linear Network Flow Problems." Networks 35, 216-222.
13. Kim, D. and P.M. Pardalos. (2000b). "A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems." Journal of Global Optimization 17, 225-234.
14. Magnanti, T.L. and R.T. Wong. (1984). "Network Design and Transportation Planning: Models and Algorithms." Transportation Science 18, 1-55.
15. Minoux, M. (1989). "Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications." Networks 19, 313-360.
16. Yaged, B. (1971). "Minimum Cost Routing for Static Network Models." Networks 1, 139-172.