Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements

Published Online:https://doi.org/10.1287/trsc.1080.0234

References

  • Ahuja R. K., Magnanti T. J., Orlin J. B., Reddy M. R., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Applications of network optimization. Handbooks in Operations Research and Management Science, Network Models (1995) 7(North-Holland, Amsterdam) 1–83Google Scholar
  • Andersen J., Christiansen M. Optimal design of new rail freight services. J. Oper. Res. Soc. (2007) . ForthcomingGoogle Scholar
  • Armacost A. P., Barnhart C., Ware K. A. Composite variable formulations for the express shipment service network design. Transportation Sci. (2002) 36(1):1–20LinkGoogle Scholar
  • Balakrishnan A., Magnanti T. L., Mirchandani P., Dell'Amico M., Maffioli F., Martello S. Network design. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley & Sons, New York) 311–334Google Scholar
  • Bektaş T., Crainic T. G., Taylor G. D. A brief overview of intermodal transportation. Logistics Engineering Handbook (2008) 28(CRC Press, Boca Raton, FL) 1–16Google Scholar
  • Christiansen M., Fagerholt K., Ronen D. Ship routing and scheduling: Status and perspectives. Transportation Sci. (2004) 38(1):1–18LinkGoogle Scholar
  • Christiansen M., Fagerholt K., Nygreen B., Ronen D., Barnhart C., Laporte G. Maritime transportation. Handbooks in Operations Research and Management Science, Transportation (2007) 14(North-Holland, Amsterdam) 189–284Google Scholar
  • Cordeau J.-F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32(4):380–404LinkGoogle Scholar
  • Crainic T. G. Service network design in freight transportation. Eur. J. Oper. Res. (2000) 122:272–288CrossrefGoogle Scholar
  • Crainic T. G., Hall R. W. Long-haul freight transportation. Handbook of Transportation Science (2003) 2nd ed.(Kluwer Academic Publishers, New York) 451–516CrossrefGoogle Scholar
  • Crainic T. G., Rego C., Alidaee B. Parallel computation, co-operation, tabu search. Adaptive Memory and Evolution: Tabu Search and Scatter Search (2005) (Kluwer, Norwell, MA) 283–302CrossrefGoogle Scholar
  • Crainic T. G., Kim K. H., Barnhart C., Laporte G. Intermodal transportation. Handbooks in Operations Research and Management Science, Transportation (2007) 14(North-Holland, Amsterdam) 467–537Google Scholar
  • Crainic T. G., Laporte G. Planning models for freight transportation. Eur. J. Oper. Res. (1997) 97(3):409–438CrossrefGoogle Scholar
  • Crainic T. G., Nourredine H., Alba E. Parallel meta-heuristics applications. Parallel Metaheuristics (2005) (John Wiley & Sons, Hoboken, NJ) 447–494CrossrefGoogle 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–236LinkGoogle 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–383CrossrefGoogle Scholar
  • Cung V.-D., Martins S. L., Ribeiro C. C., Roucairol C., Ribeiro C. C., Hansen P. Strategies for the parallel implementations of metaheuristics. Essays and Surveys in Metaheuristics (2002) (Kluwer Academic Publishers, Norwell, MA) 263–308CrossrefGoogle Scholar
  • Ghamlouche I., Crainic T. G., Gendreau M. Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. (2003) 51(4):655–667LinkGoogle Scholar
  • Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 1(3):533–549CrossrefGoogle Scholar
  • Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Norwell, MA) CrossrefGoogle Scholar
  • Jørgensen R. M., Madsen O. B. G. Shortest paths and real road networks. (2004) . Working paper, Centre for Traffic and Transport, Technical University of Denmark, Kongens LyngbyGoogle 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(1):69–85LinkGoogle Scholar
  • Magnanti T. L., Wong R. T. Network design and transportation planning: Models and algorithms. Transportation Sci. (1984) 18(1):1–55LinkGoogle Scholar
  • Minoux M. Network synthesis and optimum network design problems: Models, solution methods, and applications. Networks (1986) 19:313–360CrossrefGoogle Scholar
  • Montgomery D. C.Design and Analysis of Experiments (2000) 5th ed.(John Wiley & Sons, Hoboken, NJ) Google Scholar
  • Pedersen M. B. Optimization models and solution methods for intermodal transportation. (2006) . Ph.D. thesis, Centre for Traffic and Transport, Technical University of Denmark, Kongens LyngbyGoogle Scholar
  • Pedersen M. B., Crainic T. G. Optimization of intermodal freight service on train canals. (2007) . Publication CIRRELT-2007-49, CIRRELT—Center for Research on Transportation, Université de Montréal, MontréalGoogle Scholar
  • Powell W. B. A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Sci. (1986) 20(4):246–357LinkGoogle Scholar
  • Smilowitz K. R., Atamtürk A., Daganzo C. F. Deferred item and vehicle routing within integrated networks. Transportation Res. Part E: Logist. Transportation (2003) 39:305–323CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.