A memetic algorithm for the patient transportation problem

Omega (United Kingdom)

Volumn 54, Issue , 2015, Pages 60-71

  Zhang, Zhenzhen ^a   Liu, Mengyang ^a   Lim, Andrew ^a,b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Dial a ride problem; Health service; Memetic algorithm; Multi trip; Vehicle scheduling

Indexed keywords

HOSPITALS; MATHEMATICAL OPERATORS;

DIAL-A-RIDE PROBLEM; HEALTH SERVICES; HONG-KONG; HOSPITAL AUTHORITIES; MEMETIC ALGORITHMS; MULTI TRIPS; SIDE CONSTRAINTS; TRANSPORTATION PROBLEM; TRANSPORTATION SERVICES; VEHICLE SCHEDULING;

AMBULANCES;

EID: 84923017719     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2015.01.011     Document Type: Article

References (58)

1. Alonso F., Alvarez M.J., Beasley J.E. A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of the Operational Research Society 2007, 59:963-976.
2. Azi N., Gendreau M., Potvin J.-Y. An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research 2007, 178:755-766.
3. Azi N., Gendreau M., Potvin J.-Y. An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research 2010, 202:756-763.
4. Baldacci R., Bartolini E., Mingozzi A. An exact algorithm for the pickup and delivery problem with time windows. Operations Research 2011, 59:414-426.
5. Bard J.F., Jarrah A.I. Integrating commercial and residential pickup and delivery networks. a case study. Omega 2013, 41:706-720.
6. Battarra M., Monaci M., Vigo D. An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Computers and Operations Research 2009, 36:3041-3050.
7. Beaudry A., Laporte G., Melo T., Nickel S. Dynamic transportation of patients in hospitals. OR Spectrum 2010, 32:77-107.
8. Braekers K., Caris A., Janssens G.K. Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological 2014, 67:166-186.
9. Brandão J., Mercer A. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research 1997, 100:180-191.
10. Brandão J.C.S., Mercer A. The multi-trip vehicle routing problems. The Journal of the Operational Research Society 1998, 49:799-805.
11. Cattaruzza D., Absi N., Feillet D., Vidal T. A memetic algorithm for the multi trip vehicle routing problem. European Journal of Operational Research 2014, 236:833-848.
12. Cordeau J.-F. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 2006, 54:573-586.
13. Cordeau J.-F., Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological 2003, 37:579-594.
14. Cordeau J.-F., Laporte G. The dial-a-ride problem. models and algorithms. Annals of Operations Research 2007, 153:29-46.
15. Diana M., Dessouky M.M. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B: Methodological 2004, 38:539-557.
16. Fleischmann B. The vehicle routing problem with multiple use of vehicles. Working paper; 1990.
17. Gschwind T., Irnich S. Effective handling of dynamic time windows and its application to solving the dial-a-ride problem. Transportation Science 2015, 1-20. forthcoming. 10.1287/trsc.2014.0531.
18. Guerriero F., Bruni M.E., Greco F. A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem. Asia-Pacific Journal of Operational Research 2013, 30.
19. Hanne T., Melo T., Nickel S. Bringing robustness to patient flow management through optimized patient transports in hospitals. Interfaces 2009, 39:241-255.
20. Hernandez F., Feillet D., Giroudeau R., Naud O. A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR 2014, 12:235-259.
21. Jain S., Hentenryck P.V. Large neighborhood search for dial-a-ride problems. Principles and practice of constraint programming, Lecture notes in computer science 2011, vol. 6876:400-413. Springer, Berlin, Heidelberg.
22. Jorgensen R.M., Larsen J., Bergvinsdottir K.B. Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society 2007, 58:1321-1331.
23. Karaoglan I., Altiparmak F., Kara I., Dengiz B. The location-routing problem with simultaneous pickup and delivery. formulations and a heuristic approach. Omega 2012, 40:465-477.
24. Kirchler D., Wolfler Calvo R. A granular tabu search algorithm for the dial-a-ride problem. Transportation Research Part B: Methodological 2013, 56:120-135.
25. Li H., Lim A. A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools 2003, 12:173-186.
26. Lim A, Zhang Z, Qin H. Pickup and delivery service with manpower planning in hong kong public hospitals. Transportation Science 2015, in press.
27. Liu R., Xie X., Garaix T. Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics. Omega 2014, 47:17-32.
28. Lu Q., Dessouky M. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science 2004, 38:503-514.
29. Ma H., Cheang B., Lim A., Zhang L., Zhu Y. An investigation into the vehicle routing problem with time windows and link capacity constraints. Omega 2012, 40:336-347.
30. Macedo R., Alves C., Valério de Carvalho J., Clautiaux F., Hanafi S. Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. European Journal of Operational Research 2011, 214:536-545.
31. Melachrinoudis E., Ilhan A.B., Min H. A dial-a-ride problem for client transportation in a health-care organization. Computers and Operations Research 2007, 34:742-759.
32. Mingozzi A., Roberti R., Toth P. An exact algorithm for the multitrip vehicle routing problem. INFORMS Journal on Computing 2013, 25:193-207.
33. Moscato P., Cotta C. A modern introduction to memetic algorithms. Handbook of metaheuristics, International series in operations research & management science 2010, vol. 146:141-183. Springer, US, Boston, MA.
34. Nagata Y, Kobayashi S. A memetic algorithm for the pickup and delivery problem with time windows using. In: Parallel problem solving from nature, PPSN XI. Berlin, Heidelberg: Springer; 2010. p. 536-45.
35. Olivera A., Viera O. Adaptive memory programming for the vehicle routing problem with multiple trips. Computers and Operations Research 2007, 34:28-47.
36. Parragh S. Ambulance routing problems with rich constraints and multiple objectives [Ph.D. thesis]. uniwien; 2009.
37. Parragh S.N., Cordeau J.-F., Doerner K.F., Hartl R.F. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectrum 2012, 34:593-633.
38. Parragh S.N., Doerner K.F., Hartl R.F. Variable neighborhood search for the dial-a-ride problem. Computers and Operations Research 2010, 37:1129-1138.
39. Parragh S.N., Schmid V. Hybrid column generation and large neighborhood search for the dial-a-ride problem. Computers and Operations Research 2013, 40:490-497.
40. Petch R.J., Salhi S. A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics 2003, 133:69-92.
41. Potvin J.-Y. State-of-the-art review-evolutionary algorithms for vehicle routing. INFORMS Journal on Computing 2009, 21:518-548.
42. Potvin J.-Y., Rousseau J.-M. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research 1993, 66:331-340.
43. Reinhardt L.B., Clausen T., Pisinger D. Synchronized dial-a-ride transportation of disabled passengers at airports. European Journal of Operational Research 2013, 225:106-117.
44. Rekiek B., Delchambre A., Saleh H.A. Handicapped person transportation. an application of the grouping genetic algorithm. Engineering Applications of Artificial Intelligence 2006, 19:511-520.
45. Ritzinger U., Puchinger J., Hartl RF. Dynamic programming based metaheuristics for the dial-a-ride problem. Annals of Operations Research 2015, 1-18. forthcoming. 10.1007/s10479-014-1605-7.
46. Ropke S., Cordeau J.-F., Laporte G. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 2007, 49:258-272.
47. Ropke S., Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 2006, 40:455-472.
48. Salhi S., Petch R. A GA based heuristic for the vehicle routing problem with multiple trips. Journal of Mathematical Modelling and Algorithms 2007, 6:591-613.
49. Savelsbergh M.W.P. The vehicle routing problem with time windows. minimizing route duration. ORSA Journal on Computing 1992, 4:146-154.
50. Sen A, Bülbül K. A survey on multi trip vehicle routing problem. In: International logistics and supply chain congress. Istanbul, Türkiye; 2008. p. 401-7.
51. Steiner M.T.A., Datta D., Steiner Neto P.J., Scarpin C.T., Rui Figueira J. Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil. Omega 2015, 52:53-64.
52. Sze S-N, Chiew K-L, Sze J-F. Multi-trip vehicle routing and scheduling problem with time window in real life. In: International conference of numerical analysis and applied mathematics, vol. 1479. AIP Publishing; 2012. p. 1151-4.
53. Taillard E.D., Laporte G., Gendreau M. Vehicle routing with multiple use of vehicles. The Journal of the Operational Research Society 1996, 47:1065-1070.
54. Toth P., Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 1997, 31:60-71.
55. Vidal T., Crainic T.G., Gendreau M., Lahrichi N., Rei W. A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Operations Research 2012, 60:611-624.
56. Vidal T., Crainic T.G., Gendreau M., Prins C. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers and Operations Research 2013, 40:475-489.
57. Vidal T., Crainic T.G., Gendreau M., Prins C. A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research 2014, 234:658-673.
58. Wolfler Calvo R., Colorni A. An effective and fast heuristic for the dial-a-ride problem. 4OR 2006, 5:61-73.