A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

European Journal of Operational Research

Volumn 90, Issue 1, 1996, Pages 45-55

  Malandraki, Chryssi ^b   Dial, Robert B ^a,b  

^a VOLPE NATIONAL TRANSPORTATION SYSTEMS CENTER   (United States)

^b United Parcel Service   (United States)

Author keywords

Dynamic programming; Heuristics; Routing; Time dependence; Transportation; Traveling salesman problem

Indexed keywords

DYNAMIC PROGRAMMING; HEURISTIC METHODS; PERSONAL COMPUTERS; RANDOM PROCESSES; TRANSPORTATION ROUTES;

RESTRICTED DYNAMIC PROGRAMMING HEURISTIC ALGORITHM; TIME DEPENDENCE; TRAVELING SALESMAN PROBLEM;

ALGORITHMS;

EID: 0030570064     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00299-1     Document Type: Article

References (19)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J-D. (1983), Data Structures and Algorithms, Addison-Wesley, Reading, MA.
2. Bell, W.J., Dalberto, L.M., Fisher, M.L., Greenfield, A.J., Jaikumar, R., Kedia, P., Mack, R.G., and Prutzman, P.J. (1983), "Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer", Interfaces 13/6, 4-23.
3. Bellman, R. (1962), "Dynamic programming treatment of the Traveling Salesman Problem", Journal of the ACM 9, 61-63.
4. Bodin, L., Golden, B., Assad, A., and Ball, M. (1983), "Routing and scheduling of vehicles and crews: The state of the art", Computers & Operations Research 10, 63-211.
5. Christofides, N. (1979), "The Travelling Salesman Problem", in: N. Christofides, A. Mingozzi, P. Toth and C. Sandi (eds.), Combinatorial Optimization, Wiley, New York, 131-149.
6. Dantzig, G.B., Fulkerson, D.R., and Johnson, S.M. (1954), "Solution of a large-scale Traveling-Salesman Problem", Operations Research 2, 393-410.
7. Dantzig, G.B., Fulkerson, D.R., and Johnson, S.M. (1959), "On a linear programming combinatorial approach to the Traveling-Salesman Problem", Operations Research 7, 58-66.
8. Fisher, M.L., GreenField, A.J., Jaikumar, R., and Lester, J.T. (1982), "A computerized vehicle routing application", Interfaces 12/4, 42-52.
9. Garey, M.R., and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York.
10. Held, M., and Karp, R.M. (1962), "A Dynamic Programming approach to sequencing problems", Journal of SIAM 10, 196-210.
11. Johnson, D.S., and Papadimitriou C.H. (1985a), "Computational complexity", in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, 37-85.
12. Johnson, D.S., and Papadimitriou C.H. (1985b), "Performance guarantees for heuristics", in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, 145-180.
13. Kostreva, M.M., and Wiecek, M.M. (1993), "Time dependency in multiple objective dynamic programming", Journal of Mathematical Analysis and Applications 173, 289-307.
14. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. (eds.) (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York.
15. Lenstra, J.K., and Rinnooy Kan, A.H.G. (1981), "Complexity of vehicle routing and scheduling problems", Networks 11, 221-227.
16. Malandraki, C. (1989), "Time dependent vehicle routing problems: Formulations, solution algorithms and computational experiments", Ph.D. Dissertation, Northwestern University, Evanston, IL.
17. Malandraki, C., and Daskin, M.S. (1992), "Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms", Transportation Science 26, 185-200.
18. Malandraki, C., and Dial, R.B. (1991), "A Dynamic Programming heuristic algorithm for the time dependent traveling salesman problem", Technical Report, Roadnet Technologies, Inc., Timonium, MD.
19. Orda, A., and Rom, R. (1990), "Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length", Journal of the ACM 37, 607-625.