A tabu search heuristic for solving the multi-depot, multi-vehicle, double request dial-a-ride problem faced by a healthcare organisation

International Journal of Operational Research

Volumn 10, Issue 2, 2011, Pages 214-239

  Emanuel, Melachrinoudis ^a   Min, Hokey ^b  

^a Northeastern University   (United States)

^b BOWLING GREEN STATE UNIVERSITY   (United States)

Author keywords

A dial a ride problemtabu; Algorithm development; Healthcare supply chains; Search heuristics

Indexed keywords

EID: 79951640403     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2011.038585     Document Type: Article

References (44)

1. Attanasio, A., Cordeau, J-F., Ghiani, G. and Laporte, G. (2004) 'Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem', Parallel Computing, Vol. 30, No. 3, pp.377-387.
2. Badeau, P., Gendreau, M., Guertin, F., Potvin, J-Y. and Tallard, E. (1997) 'A parallel tabu search heuristic for the vehicle routing problem with time windows', Transportation Research Part C, Vol. 5, No. 2, pp.109-122.
3. Baugh, J.W., Krishna, G., Kakivaya, R. and Stone, J.R. (1998) 'Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing', Engineering Optimization, Vol. 30, No. 2, pp.91-123. (Pubitemid 128508626)
4. Bodin, L., Golden, B., Assad, A. and Ball, M. (1983) 'Routing and scheduling of vehicles and crews: the state of the art', Computers and Operations Research, Vol. 10, No. 2, pp.62-212.
5. Braysy, O. and Gendreau, M. (2001) 'Tabu search heuristics for the vehicle routing problem with time windows', Technical Report STF42 A01022, SINTEF Applied Mathematics, Research Council of Norway, Oslo, Norway.
6. Colorni, A. and Righini, G. (2001) 'Modeling and optimizing dial-a-ride problems', International Transactions in Operational Research, Vol. 8, No. 2, pp.155-166.
7. Cordeau, J-F. and Laporte, G. (2003a) 'The dial-a-ride problem (DARP): variants, modeling issues and algorithms', Quarterly Journal of the Belgian, French, and Italian Operations Research Societies, Vol. 1, No. 2, pp.89-101.
8. Cordeau, J-F and Laporte, G. (2003b) 'The tabu search heuristics for the static multi-vehicle dial-a-ride problem', Transportation Research Part B, Vol. 37, No. 6, pp.579-594. (Pubitemid 36586371)
9. Coslovich, L., Pesenti, R. and Ukovich, W. (2006) 'A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem', European Journal of Operational Research, Vol. 175, No. 3, pp.1605-1615. (Pubitemid 44436743)
10. Cremers, M.L.A.G., Haneveld, W.K.K. and van der Vlerk, M.H. (2009) 'A two stage model for a day-ahead paratransit planning problem', Mathematical Methods of Operations Research, Vol. 69, No. 2, pp.323-341.
11. De Backer, B., Furnon, V., Kilby, P., Prosser, P. and Shaw, P. (2000) 'Solving vehicle routing problems using constraint programming and metaheuristics', Journal of Heuristics, Vol. 6, No. 4, pp.501-523.
12. Desrosiers, J., Dumas, Y. and Soumis, F. (1986) 'A dynamic programming solution of the largescale single vehicle dial-a-ride problem with time windows', American Journal of Mathematical and Management Sciences, Vol. 6, No. 3, pp.301-325. (Pubitemid 17605969)
13. Donati, A.V., Montemanni, R., Casagrande, N., Rizzoli, A.E. and Gambardella, L.M. (2008) 'Time dependent vehicle routing problem with a multi colony system', European Journal of Operational Research, Vol. 185, No. 3, pp.1174-1191. (Pubitemid 47498811)
14. Environmental Systems Research Institute, Inc. (1998) Arc Logistics Route. Redlands, CA: Environmental Systems Research Institute, Inc.
15. Fu, L. (2002) 'Scheduling dial-a-ride paratransit under time-varying, stochastic congestion', Transportation Research Part B, Vol. 36, No. 4, pp.485-506. (Pubitemid 34444174)
16. Glover, F. (1986) 'Future paths for integer programming and links to artificial intelligence', Computers and Operations Research, Vol. 13, No. 5, pp.533-549. (Pubitemid 17480188)
17. Glover, F. and Laguna, M. (1997) Tabu Search. Boston, MA: Kluwer.
18. Hashimoto, H., Ibaraki, T., Imahori, S. and Yagiura, M. (2006) 'The vehicle routing problem with flexible time windows and traveling times', Discrete Applied Mathematics, Vol. 154, No. 16, pp.2271-2290. (Pubitemid 44287109)
19. Jozefowiez, N., Semet, F. and Talbi, E-G. (2008) 'Multi-objective vehicle routing problems', European Journal of Operational Research, Vol. 189, No. 2, pp.293-309. (Pubitemid 351288509)
20. Li, H. and Lim, A. (2002) 'A metaheuristic for the pickup and delivery problem with time windows', Research Paper, Department of Computer Science, National University of Singapore, Singapore.
21. LINDO Systems Inc. (2003) LINGO: The Modeling Language and Optimizer. Chicago, IL: LINDO Systems Inc.
22. Liu, C.M., Chang, T.C. and Huang, L.F. (2006) 'Multi-objective heuristics for the vehicle routing problem', Int. J. Operations Research, Vol. 3, No. 3, pp.173-181.
23. Luo, Y. and Schonfeld, P. (2007) 'A rejection-reinsertion heuristic for the static dial-a-ride problem', Transportation Research Part B, Vol. 41, No. 7, pp.736-755. (Pubitemid 46630221)
24. Melachrinoudis, E., Ilhan, A. and Min, H. (2007) 'A dial-a-ride problem for client transportation in a health-care organization', Computers and Operations Research, Vol. 34, No. 3, pp.742-759. (Pubitemid 44404098)
25. Min, H. (1991) 'A multiobjective vehicle routing problem with soft time windows: the case of public library distribution system', Socio-economic Planning Sciences, Vol. 25, No. 3, pp.179-188.
26. Paquette, J., Cordeau, J-F. and Laporte, G. (2009) 'Quality of service in dial-a-ride operations', Computers and Industrial Engineering, Vol. 56, No. 4, pp.1721-1734.
27. Park, Y. and Koelling, P. (1989) 'An interactive computerized algorithm for multicriteria vehicle routing problems', Computers and Industrial Engineering, Vol. 16, No. 4, pp.477-490. (Pubitemid 20622996)
28. Potvin, J-Y., Kervahut, T., Garcia, B.L. and Rousseau, J.-M. (1996) 'The vehicle routing problem with time windows part I: tabu search', ORSA Journal on Computing, Vol. 8, No. 2, pp.157-164.
29. Psaraftis, H.N. (1980) 'A dynamic programming solution to the single vehicle many-to-many dial-a-ride immediate request dial-a-ride problem', Transportation Science, Vol. 14, No. 2, pp.130-154.
30. 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem', Transportation Research B, Vol. 17, No. 2, pp.133-145.
31. Rajmohan, M. and Shahabudeen, P. (2009) 'Metaheuristic for solving routing problem in logistics management', Int. J. Operational Research, Vol. 6, No. 2, pp.223-246.
32. Rego, C. and Glover, F. (2002) 'Local search and metaheuristics', In G. Gutin and A.P. Punnen (Eds.), The Traveling Salesman Problem and Its Variation. Dordrecht, The Netherlands: Kluwer.
33. Sexton, T.R. and Bodin, L.D. (1985a) 'Optimizing single vehicle many-to-many operations with desired delivery times: I. scheduling', Transportation Science, Vol. 19, No. 4, pp.378-410.
34. Sexton, T.R. and Bodin, L.D. (1985b) 'Optimizing single vehicle many-to-many operations with desired delivery times: I. routing', Transportation Science, Vol. 19, No. 4, pp.411-435.
35. Sexton, T.R. and Choi, Y. (1986) 'Pickup and delivery of partial loads with soft time windows', American Journal of Mathematical and Management Sciences, Vol. 6, No. 3, pp.369-398. (Pubitemid 17605967)
36. Solomon, M. and Desrosiers, J. (1988) 'Time window constrained routing and scheduling problems', Transportation Science, Vol. 22, No. 1, pp.1-13. (Pubitemid 18663919)
37. Stein, D.M. (1978) 'Scheduling dial-a-ride transportation systems', Transportation Science, Vol. 12, No. 3, pp.232-249.
38. Steuer, R.E. (1986) Multiple Criteria Optimization: Theory, Computation and Application. New York: Wiley.
39. Tallard, E.P., Badeau, P., Gendreau, M., Guertin, F. and Potvin, J-Y. (1997) 'A tabu search heuristic for the vehicle routing problem with soft time windows', Transportation Science, Vol. 31, No. 1, pp.170-186. (Pubitemid 127597092)
40. Van Landeghem, H.R.G. (1988) 'A bi-criteria heuristic for the vehicle routing problem with time windows', European Journal of Operational Research, Vol. 36, No. 2, pp.217-226. (Pubitemid 18650928)
41. Wilson, N. and Colvin, N. (1977) 'Computer control of the Rochester dial-a-ride system', CTS Report R77-31, Department of Civil Engineering, MIT, Cambridge, Massachusetts.
42. Wilson, N. and Weissburg, H. (1976), 'Advanced dial-a-ride algorithms research project: final report', CTS Report R76-20, Department of Civil Engineering, MIT, Cambridge, Massachusetts.
43. Xiang, Z., Chu, C. and Chen, H. (2006) 'A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints', European Journal of Operational Research, Vol. 174, No. 2, pp.1117-1139. (Pubitemid 44093902)
44. Xiang, Z., Chu, C. and Chen, H. (2008) 'The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments', European Journal of Operational Research, Vol. 185, No. 2, pp.534-541.