A dial-a-ride problem for client transportation in a health-care organization

Computers and Operations Research

Volumn 34, Issue 3, 2007, Pages 742-759

  Melachrinoudis, Emanuel ^a   Ilhan, Ahmet B ^a   Min, Hokey ^b  

^a Northeastern University   (United States)

^b UNIVERSITY OF LOUISVILLE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER APPLICATIONS; HEALTH CARE; SOCIETIES AND INSTITUTIONS; TRANSPORTATION;

CAB HEALTH AND RECOVERY SERVICES, INC. (CO); SOFT TIME WINDOWS; TRANSPORTATION NEEDS;

PROBLEM SOLVING;

EID: 33748771730     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.03.024     Document Type: Article

References (30)

1. Wilson N, Weissburg H. Advanced dial-a-ride algorithms research project: final report. CTS Report R76-20, Department of Civil Engineering, MIT, Cambridge, MA, 1976.
2. Wilson N, Colvin N. Computer control of the Rochester dial-a-ride system. CTS Report R77-31, Department of Civil Engineering, MIT, Cambridge, MA, 1977.
3. Stein D.M. Scheduling dial-a-ride transportation systems. Transportation Science 12 (1978) 232-249
4. Psaraftis H.N. A dynamic programming solution to the single vehicle many-to-many dial-a-ride immediate request dial-a-ride problem. Transportation Science 14 (1980) 130-154
5. 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Transportation Research 17B (1983) 133-145
6. Sexton TR, Bodin LD. Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transportation Science 1985a;19:378-410.
7. Sexton TR, Bodin LD. Optimizing single vehicle many-to-many operations with desired delivery times: I. Routing. Transportation Science 1985b;19:411-35.
8. Desrosiers J., Dumas Y., and Soumis F. A dynamic programming solution of the large-scale single vehicle dial-a-ride problem with time windows. American Journal of Mathematical and Management Sciences 6 (1986) 301-325
9. Baugh J.W., Krishna G., Kakivaya R., and Stone J.R. Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Engineering Optimization 30 (1998) 91-123
10. Colorni A., and Righini G. Modeling and optimizing dial-a-ride problems. International Transactions in Operational Research 8 (2001) 155-166
11. Fu L. Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transportation Research Part B 36 (2002) 485-506
12. Cordeau J-F, Laporte G. The dial-a-ride problem (DARP): variants, modeling issues and algorithms 1. Quarterly Journal of the Belgian, French, and Italian Operations Research Societies 2003; 89-101.
13. Van Landeghem H.R.G. A bi-criteria heuristic for the vehicle routing problem with time windows. European Journal of Operational Research 36 (1988) 217-226
14. Park Y., and Koelling P. An interactive computerized algorithm for multicriteria vehicle routing problems. Computers and Industrial Engineering 16 (1989) 477-490
15. Min H. A multiobjective vehicle routing problem with soft time windows: the case of public library distribution system. Socio-economic Planning Sciences 25 (1991) 179-188
16. Sexton T.R., and Choi Y. Pickup and delivery of partial loads with soft time windows. American Journal of Mathematical and Management Sciences 6 (1986) 369-398
17. Environmental Systems Research Institute, Inc. Arc logistics route. Redlands, CA; 1998.
18. LINDO Systems Inc. LINGO: the modeling language and optimizer. Chicago, IL; 2002.
19. Braysy O, Gendreau M. Tabu search heuristics for the vehicle routing problem with time windows. Technical Report STF42 A01022, SINTEF Applied Mathematics, Research Council of Norway, Oslo, Norway, 2001.
20. Glover F. Future paths for integer programming and links to artificial intelligence. Computer and Operations Research 13 (1986) 533-549
21. Glover F., and Laguna M. Tabu search (1997), Kluwer, Boston, MA
22. Potvin J.-Y., Kervahut T., Garcia B.L., and Rousseau J.-M. The vehicle routing problem with time windows part I: tabu search. ORSA Journal on Computing 8 (1996) 157-164
23. Taillard E.P., Badeau P., Gendreau M., Guertin F., and Potvin J.-Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186
24. Badeau P., Gendreau M., Guertin F., Potvin J.-Y., and Tallard E. A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research-C 5 (1997) 109-122
25. De Backer B., Furnon V., Kilby P., Prosser P., and Shaw P. Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics 6 (2000) 501-523
26. Deniz HB. A tabu search heuristic for the multi-depot, multi-vehicle dial-a-ride problem with double requests. Masters Science thesis, Northeastern University, Boston, MA, 2004.
27. Assad A.A. Modeling and implementation issues in vehicle routing. In: Golden B.L., and Assad A.A. (Eds). Vehicle routing: methods and studies (1988), Elsevier Science Publishers, North Holland 7-45
28. Solomon M., and Desrosiers J. Time window constrained routing and scheduling problems. Transportation Science 22 (1988) 1-13
29. Desrochers M., Lenstra J., Salvelsbergh M., and Soumis F. A classification scheme for vehicle routing and scheduling problems. European Journal of Operational Research 46 (1990) 322-333
30. Steuer R.E. Multiple criteria optimization: theory, computation and application (1986), Wiley, New York