Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design

Annals of Operations Research

Volumn 131, Issue 1-4, 2004, Pages 109-133

  Ghamlouche, Ilfat ^a   Crainic, Teodor Gabriel ^b   Gendreau, Michel ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

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

Author keywords

cycle based neighbourhoods; fixed charge capacitated multicommodity network design; meta heuristics; path relinking; tabu search

Indexed keywords

EID: 4444328474     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000039515.90453.1d     Document Type: Article

References (20)

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: Wiley, pp. 311-334.
2. Crainic, T.G., A. Frangioni, and B. Gendron. (2001). "Bundle-Based Relaxation Methods for Multicommodity Capacitated Network Design." Discrete Applied Mathematics 112, 73-99.
3. Crainic, T.G., M. Gendreau, and J.M. Farvolden. (2000). "A Simplex-Based Tabu Search Method for Capacitated Network Design." INFORMS Journal on Computing 12(3), 223-236.
4. Gendron, B. and T.G. Crainic. (1994). "Relaxations for Multicommodity Network Design Problems." Publication CRT-965, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada.
5. Gendron, B. and T.G. Crainic. (1996). "Bounding Procedures for Multicommodity Capacitated Network Design Problems." Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada.
6. Gendron, B., T.G. Crainic, and A. Frangioni. (1998). "Multicommodity Capacitated Network Design." In B. Sansó and Soriano (eds.), Telecommunications Network Planning. Norwell, MA: Kluwer Academic, pp. 1-19.
7. Ghamlouche, I., T.G. Crainic, and M. Gendreau. (2002). "Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design." Publication CRT-2002-01, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada.
8. Ghamlouche, I., T.G. Crainic, and M. Gendreau. (2003). "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design." Operations Research 51(4), 655-667.
9. Glover, F. (1994). "Genetic Algorithms and Scatter Search: Unsuspected Potentials." Statistics and Computing 4, 131-140.
10. Glover, F. (1997). "A Template for Scatter Search and Path Relinking." In J. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Artificial Evolution, Lecture Notes in Computer Science, Vol. 1363. Berlin: Springer, pp. 13-54.
11. Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic.
12. Glover, F., M. Laguna, and R. Marti. (2000). "Fundamentals of scatter search and path relinking." Control and Cybernetics 39(3), 653-684.
13. Holmberg, K. and D. Yuan. (2000). "A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem." Operations Research 48(3), 461-481.
14. ILOG. (1999). ILOG CPLEX 6.5. Mountain View, CA: ILOG.
15. Laguna, M. and V.A. Armentano. (2001). "Lessons from Applying and Experimenting with Scatter Search." In C. Rego and B. Alidaee (eds.), Adaptive Memory and Evolution: Tabu Search and Scatter Search. Norwell, MA: Kluwer Academic, forthcoming.
16. Laguna, M. and R. Marti. (1999). "GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization." INFORMS Journal on Computing 11(1), 44-52.
17. Laguna, M., R. Marti, and V. Campos. (1999). "Intensification and Diversification with Elite Tabu Search Solutions for the Linear Ordering Problem." Computers & Operations Research 22, 1217-1230.
18. Magnanti, T.L. and R.T. Wong. (1986). "Network Design and Transportation Planning: Models and Algorithms." Transportation Science 18(1), 1-55.
19. Minoux, M. (1986). "Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications." Networks 19, 313-360.
20. Ribeiro, C.C., E. Uchoa, and R. Werneck. (2002). "A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs." INFORMS Journal on Computing 14(3), 228-246.