Computer-aided complexity classification of dial-a-ride problems

INFORMS Journal on Computing

Volumn 16, Issue 2, 2004, Pages 120-132

  De Paepe, Willem E ^a   Lenstra, Jan Karel ^b   Sgall, Jiri ^c   Sitters, René A ^d   Stougie, Leen ^d  

^a Cap Gemini Ernst and Young   (Netherlands)

^b CWI   (Netherlands)

^c MATHEMATICAL INSTITUTE   (Czech Republic)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Computational complexity; Dial a ride; Vehicle routing

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; SCHEDULING; SERVERS; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

DIAL-A-RIDE PROBLEMS; POLYNOMIAL TIME; VEHICLE ROUTING;

PROBLEM SOLVING;

EID: 3843066616     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0052     Document Type: Article

References (27)

1. Afrati, F., S. Cosmadakis, C. H. Papadimitriou, G. Papageorgiou, N. Papakonstantinou. 1986. The complexity of the travelling repairman problem. Theoret. Informatics Appl. 20 79-87.
2. Ascheuer, N., S. O. Krumke, J. Rambau. 2000. Online dial-a-ride problems: Minimizing the completion time. Proc. 17th Internat. Sympos. on Theoret. Aspects of Comput. Sci., Lecture Notes in Computer Science, No. 1770. Springer, Berlin, Germany, 639-650.
3. Atallah, M. J., S. R. Kosaraju. 1988. Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM J. Comput. 17 849-870.
4. Conway, R. W., W. L. Maxwell, L. W. Miller. 1967. Theory of Scheduling. Addison-Wesley, Reading, MA.
5. de Paepe, W. E. 1998. Computer-aided complexity classification of dial-a-ride problems. M.Sc. thesis, Department of Economics and Econometrics, University of Amsterdam, Amsterdam, The Netherlands.
6. Desrochers, M., J. K. Lenstra, M. W. P. Savelsbergh. 1990. A classification scheme for vehicle routing and scheduling problems. Eur. J. Oper. Res. 46 322-332.
7. Feuerstein, E., L. Stougie. 2001. On-line single server dial-a-ride problems. Theoret. Comput. Sci. 268 91-105.
8. Frederickson, G. N., D. J. Guan. 1992. Preemptive ensemble motion planning on a tree. SIAM J. Comput. 21 1130-1152.
9. Frederickson, G. N., D. J. Guan. 1993. Non-preemptive ensemble motion planning on a tree. J. Algorithms 15 29-60.
10. Frederickson, G. N., M. S. Hecht, C. E. Kim. 1978. Approximation algorithms for some routing problems. SIAM J. Comput. 7 178-193.
11. Garey, M. R., D. S. Johnson. 1975. Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4 397-411.
12. Garey, M. R., D. S. Johnson, G. L. Miller, C. H. Papadimitriou. 1980. The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Methods 1 216-227.
13. Gonzalez, T. 1977. Optimal mean finish time preemptive schedules. Technical report 220, Computer Science Department, The Pennsylvania State University, University Park, PA.
14. Graham, R. L., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5 287-326.
15. Guan, D. J. 1988. Routing a vehicle of capacity greater than one. Discrete Appl. Math. 81 41-57.
16. Jackson, J. R. 1955. Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles, CA.
17. Karp, R. M. 1972. Reducibility among combinatorial problems. R. E. Miller, J. W. Thatcher, eds. Complexity of Comput. Comput. Plenum Press, New York, 85-103.
18. Kendall, D. G. 1953. Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. Ann. Math. Statist. 24 338-354.
19. Lageweg, B. J., J. K. Lenstra, E. L. Lawler, A. H. G. Rinnooy Kan. 1982. Computer-aided complexity classification of combinatorial problems. Comm. ACM 25 817-822.
20. Lawler, E. L., J. M. Moore. 1969. A functional equation and its application to resource allocation and sequencing problems. Management Sci. 16 77-84.
21. Lenstra, J. K., A. H. G. Rinnooy Kan. 1981. Complexity of vehicle routing and scheduling problems. Networks 11 221-227.
22. Lenstra, J. K., A. H. G. Rinnooy Kan, P. Brucker. 1977. Complexity of machine scheduling problems. Ann. Discrete Math. 1 343-362.
23. Middendorf, M. 1994. More on the complexity of common superstring and supersequence problems. Theoret. Comput. Sci. 125 205-228.
24. Sitters, R. A. 2001. Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines. K. Aardal, B. Gerards, eds. Integer Programming Combin. Optim., Lecture Notes in Comput. Sci., No. 2081. Springer, Berlin, Germany, 396-105.
25. Sitters, R. A. 2002. The minimum latency problem is NP-hard for weighted trees. W. J. Cook, A. S. Schulz, eds. Integer Programming Combin. Optim., Lecture Notes in Comput. Sci., No. 2337. Springer, Berlin, Germany, 230-239.
26. Smith, W. E. 1956. Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 59-66.
27. Tsitsiklis, J. N. 1992. Special cases of traveling salesman and repair-man problems with time windows. Networks 22 263-282.