Complexity of the single vehicle scheduling problem on graphs

INFOR

Volumn 35, Issue 4, 1997, Pages 256-276

  Nagamochi, Hiroshi ^a,b   Mochizuki, Koji ^a,c   Ibaraki, Toshihide ^a,d,e  

^a KYOTO UNIVERSITY   (Japan)

^b IPSJ   (Japan)

^c IBM JAPAN LTD   (Japan)

^d TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^e UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Dynamic programming; Strong NP hardness; Tree; Vehicle scheduling problem

Indexed keywords

EID: 0141555971     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.1997.11732334     Document Type: Article

References (13)

1. R.E. Bellman and S.E. Dreyfus, Applied Dynamic Programming, Princeton University Press, Princeton, NJ (1962).
2. N. Christofides, "Worst-case analysis of a new heuristic for the traveling salesman problem", Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976).
3. J. Desrosiers, Y. Dumas and F. Soumis, "A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows", Am. J. Math. Mgmt. Sci., 6 (1986), pp. 301-325.
4. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company (1979).
5. M. Held and R.M. Karp, "Dynamic programming approach to sequencing problems", SIAM J. Appl. Math., 10 (1962).
6. Y. Karuno, H. Nagamochi and T. Ibaraki, "Vehicle scheduling on a tree with release and handling times", Lectures Notes in Computer Science, 762, Springer-Verlag (1993), pp. 486-495; a more detailed version in MIS (Mathematics of Industiral Systems) II, Annals of Operations Research, Baltzer Science Publishers, 69 (1997), pp. 193-207.
7. Y. Karuno, H. Nagamochi and T. Ibaraki, "Vehicle scheduling on a tree with release and handling times", Lectures Notes in Computer Science, 762, Springer-Verlag (1993), pp. 486-495; a more detailed version in MIS (Mathematics of Industiral Systems) II, Annals of Operations Research, Baltzer Science Publishers, 69 (1997), pp. 193-207.
8. H. Psaraftis, "A dynamic programming solution to the single vehicle, many-to-many, immediate request dial-a-ride problem", Trans. Sci., 14 (1980), pp. 130-154.
9. H. Psaraftis, M. Solomon, T. Magnanti and T. Kim, "Routing and scheduling on a shoreline with release times", Management Science, 36-2 (1990), pp. 212-223.
10. M. Solomon, "Algorithms for the vehicle routing and scheduling problem with time window constraints", Operations Research, 35-2 (1987), pp. 254-265.
11. M. Solomon and J. Desrosiers, "Time window constrained routing and scheduling problems: A survey", Transportation Sci., 22 (1988), pp. 1-13.
12. J. N. Tsitsiklis, "Special cases of traveling salesman and repairman problems with time windows, Networks, 22 (1992), pp. 263-282.
13. S. Warshall, "A theorem on Boolean matrices", J. ACM, 9 (1962), pp. 11-12.