A Simplex-Based Tabu Search Method for Capacitated Network Design

References

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