Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows—Theory, Algorithms, and Applications (1993) (Prentice-Hall, Engle-wood Cliffs, NJ) Google Scholar
• Balakrishnan A., Magnanti T. L., Mirchandani P. Network Design. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley and Sons, New York) 311–334Google Scholar
• CPLEXILOG CPLEX 6.5 (1999) (ILOG, Mountain View, CA) 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 Res. B: Methodology (1986) 20B:225–242Crossref, Google Scholar
• Crainic T. G., Frangioni A., Gendron B. Bundle-based relaxation methods for multicommodity capacitated network design. Discrete Appl. Math. (2001) 112:73–99Crossref, Google Scholar
• Crainic T. G., Gendreau M., Farvolden J. M. A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. (2000) 12(3):223–236Link, Google Scholar
• Crainic T. G., Gendreau M., Soriano P., Toulouse M. A tabu search procedure for multicommodity location/allocation with balancing requirements. Ann. Oper. Res. (1993) 41:359–383Crossref, Google Scholar
• Farvolden J. M., Powell W. B. Subgradient methods for the service network design problem. Transportation Sci. (1994) 28(3):256–272Link, Google 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, Québec, CanadaGoogle Scholar
• Gendron B., Crainic T. G. Bounding procedures for multicommodity capacitated network design problems. (1996) . Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal, Montréal, Québec, 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
• Ghamlouche I., Crainic T. G., Gendreau M. Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. (2001a) . Publication CRT-2001-01, Centre de recherche sur les transports, Université de Montréal, Montréal, Québec, CanadaGoogle Scholar
• Ghamlouche I., Crainic T. G., Gendreau M. Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. (2001b) . Publication CRT-2002-01, Centre de recherche sur les transports, Université de Montréal, Montréal, Québec, CanadaGoogle Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 1(3):533–549Crossref, Google Scholar
• Glover F. Tabu search—Part I. ORSA J. Comput. (1989) 1(3):190–206Link, Google Scholar
• Glover F. Tabu search—Part II. ORSA J. Comput. (1990) 2(1):4–32Link, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer, Norwell, MA) Crossref, Google Scholar
• Holmberg K., Yuan D. A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. (2000) 48(3):461–481Link, Google Scholar
• Jarvis J. J., Mejia de Martinez O. A sensitivity analysis of multicommodity network flows. Transportation Sci. (1977) 11(4):299–306Link, 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 Sci. (1992) 26:69–85Link, Google Scholar
• Magnanti T. L., Wong R. T. Network design and transportation planning: Models and algorithms. Transportation Sci. (1986) 18(1):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 Sci. (1986) 20(4):246–357Link, Google Scholar