A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing

Volumn 12, Issue 3, 2000, Pages 223-236

  Crainic, Teodor Gabriel ^a   Gendreau, Michel ^b   Farvolden, Judith M ^c  

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

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c Algorithmics Inc   (Canada)

Author keywords

Column generation; Fixed charge capacitated multicommodity network design; Tabu search

Indexed keywords

EID: 0011480479     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.12.3.223.12638     Document Type: Article

References (32)

1. Ahuja, R.K., T.L. Magnanti, J.B. Orlin. 1993. Network Flows-Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. Assad, A.A. 1978. Multicommodity network flows - a survey. Networks 8, 37-91.
3. Balakrishnan, A. 1984. Valid inequalities for the network design problem with an application to LTL consolidation problem. Ph.D. thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.
4. Balakrishnan, A., T.L. Magnanti, P. Mirchandani. 1997. Network design. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. Wiley, New York. 311-334.
5. Balakrishnan, A., T.L. Magnanti, R.T. Wong. 1989. A dual-ascent procedure for large-scale uncapacitated network design. Operations Research 37, 716-740.
6. CPLEX Documentation. 1993. Technical Report, CPLEX Optimization, Inc., Incline Village, NV.
7. Crainic, T.G., A. Frangioni, B. Gendron. 1998a. Bundle-based relaxation methods for multicommodity capacitated network design. Discrete Applied Mathematics, to appear.
8. Crainic, T.G., M. Gendreau. 1998. Cooperative parallel tabu search for capacitated network design. Publication CRT-98-71, Centre de Recherche sur les Transports, Université de Montréal, Montréal, QC, Canada.
9. Crainic, T.G., M. Gendreau, J.M. Farvolden. 1998b. A simplex-based tabu search method for capacitated network design. Publication CRT-98-37, Centre de Recherche sur les Transports, Université de Montréal, Montréal, QC, Canada.
10. Crainic, T.G., M. Gendreau, P. Soriano, M. Toulouse. 1993. A tabu search procedure for multicommodity location/allocation with balancing requirements. Annals of Operations Research 41, 359-383.
11. Crainic, T.G., J.-M. Rousseau. 1986. Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Research B: Methodology 20B, 225-242.
12. Farvolden, J.M., W.B. Powell. 1994. Subgradient methods for the service network design problem. Transportation Science 28, 256-272.
13. Farvolden, J.M., W.B. Powell, I.J. Lustig. 1992. A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem. Operations Research 41, 669-694.
14. Gendron, B. 1985. Modèles et algorithmes pour problèmes de planification de réseaux et de localisation. Ph.D. thesis, Département d'Informatique et Recherche Opérationnelle, Université de Montréal, Montréal, QC, Canada.
15. Gendron, B., 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.
16. Gendron, B., T.G. Crainic. 1996. Bounding procedures for multicommodity capacitated network design problems. CRT- 96-06, Centre de Recherche sur les Transports, Université de Montréal, Montréal, QC, Canada.
17. Gendron, B., T.G. Crainic, A. Frangioni. 1998. Multicommodity capacitated network design. B. Sansó, P. Soriano, eds. Telecommunications Network Planning. Kluwer, Norwell, MA. 1-19.
18. Glover, F. 1986. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 1, 533-549.
19. Glover, F. 1989. Tabu search - Part I. ORSA Journal on Computing 1, 190-206.
20. Glover, F. 1990. Tabu search - Part II. ORSA Journal on Computing 2, 4-32.
21. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer, Norwell, MA.
22. Helgason, R.V. 1980. A Lagrangean relaxation approach to the generalized fixed charge network flow problem. Ph.D. thesis, Southern Methodist University, Dallas, TX.
23. Jarvis, J.J., O. Mejia de Martinez. 1977. A sensitivity analysis of multicommodity network flows. Transportation Science 11, 299-306.
24. Kennington, J.L. 1978. A survey of linear cost multicommodity network flows. Operations Research 26, 209-236.
25. Koskosidis, Y.A., W.B. Powell, M.M. Solomon. 1992. An optimization-based heuristic for vehicle routing and scheduling with soft time windows constraints. Transportation Science 26, 69-85.
26. Lamar, B.W., Y. Sheffi, W.B. Powell. 1990. A capacity improvement lower bound for fixed charge network design problems. Operations Research 38, 704-710.
27. Magnanti, T.L., L.A. Wolsey. 1995. Optimal trees. M. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser, eds. Network Models, volume 7 of Handbooks in Operations Research and Management Science. North-Holland, Amsterdam. 503-615.
28. Magnanti, T.L., R.T. Wong. 1986. Network design and transportation planning: Models and algorithms. Transportation Science 18, 1-55.
29. Minoux, M. 1986. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks 19, 313-360.
30. Powell, W.B. 1986. A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Science 20, 246-357.
31. Rardin, R.L. 1982. Tight relaxations of fixed charge network flow problems. Report J-82-3, School of Industrial Engineering, Purdue University, West Lafayette, IN.
32. Rardin, R.L., U. Choe. 1982. Tighter relaxations of fixed charge network flow problems. Report J-79-18, School of Industrial Engineering, Purdue University, West Lafayette, IN.