The A priori dynamic traveling salesman problem with time windows

Transportation Science

Volumn 38, Issue 4, 2004, Pages 459-472

  Larsen, Allan ^a   Madsen, Oli B G ^a   Solomon, Marius M ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Computational analysis; Dynamic vehicle routing; Heuristics; Time windows

Indexed keywords

ALGORITHMS; FLEET OPERATIONS; HEURISTIC METHODS; POSTAL SERVICES; REAL TIME SYSTEMS; TRANSPORTATION ROUTES;

COMPUTATIONAL ANALYSIS; DYNAMIC VEHICLE ROUTING; TIME WINDOWS;

TRAVELING SALESMAN PROBLEM;

EID: 10644230216     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0070     Document Type: Article

References (19)

1. Bertsimas, D., G. van Ryzin. 1991. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39 601-615.
2. Gendreau, M., J.-Y. Potvin. 1998. Fleet management and logistics. T. Crainic, G. Laporte, eds. Dynamic Vehicle Routing and Dispatching. Kluwer Academic Publishers, Boston, MA, 115-126.
3. Gendreau, M., G. Laporte, R. Séguin. 1996. Stochastic vehicle routing. Eur. J. Oper. Res. 88 3-12.
4. Gendreau, M., F. Guertin, J.-Y. Potvin, E. Taillard. 1999. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. 33 381-390.
5. Ichoua, S., M. Gendreau, J.-Y. Potvin. 2000. Diversion issues in real-time vehicle dispatching. Transportation Sci. 34 426-438.
6. Larsen, A. 2000. The dynamic vehicle routing problem. Unpublished doctoral dissertation, Technical University of Denmark, Lyngby, Denmark.
7. Larsen, A., O. Madsen, M. M. Solomon. 2002. Partially dynamic vehicle routing - Models and algorithms. J. Oper. Res. Soc. 53 637-646.
8. Larson, R., A. Odoni. 1980. Urban Operations Research. Prentice Hall, Englewood Cliffs, NJ.
9. Lin, S. 1965. Computer solutions of the traveling salesman problem. Bell System Tech. J. 44 2245-2269.
10. Lund, K., O. Madsen, J. Rygaard. 1996. Vehicle routing problems with varying degrees of dynamis. Technical report, IMM, Technical University of Denmark, Lyngby, Denmark.
11. Or, I. 1976. Travelling salesman-type combinatorial problems and their relation to the logistics of blood banking. Unpublished doctoral dissertation, Northwestern University, Evanston, IL.
12. Powell, W., P. Jaillet, A. Odoni. 1995. Network routing. M. Ball, T. Magnanti, C. Monma, G. Nemhauser, eds. Stochastic and Dynamic Networks and Routing. Elsevier Science, Amsterdam, The Netherlands, 141-295.
13. Powell, W., A. Marar, J. Gelfand, S. Bowers. 2002. Implementing real-time optimization models: A case application from the motor carrier industry. Oper. Res. 50 571-581.
14. Psaraftis, H. 1988. Vehicle routing: Methods and studies. B. Golden, A. Assad, eds. Dynamic Vehicle Routing Problems. North Holland, Amsterdam, The Netherlands, 223-248.
15. Psaraftis, H. 1995. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. 61 143-164.
16. Regan, A., H. Mahmassani, P. Jaillet. 1995. Improving efficiency of commercial vehicle operations using real-time information: Potential uses and assignment strategies. Transportation Res. Record 1493 188-198.
17. Regan, A., H. Mahmassani, P. Jaillet. 1996. Dynamic decision making for carrier fleet operations using real-time information. Transportation Res. Record 1537 91-97.
18. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 32 254-265.
19. Yang, J., P. Jaillet, H. Mahmassani. 1999. On-line algorithms for truck fleet assignment and scheduling under real-time information. Technical report, Department of Management Science and Information Systems, The University of Texas at Austin, Austin, TX.