Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics

Omega (United Kingdom)

Volumn 47, Issue , 2014, Pages 17-32

  Liu, Ran ^a,b   Xie, Xiaolan ^a,b   Garaix, Thierry ^a  

^a ECOLE DES MINES DE SAINT ETIENNE   (France)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Feasible local search; Home health care; Infeasible local search; Periodic vehicle routing; Tabu search

Indexed keywords

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

References (67)

1. Cordeau J.F., Laporte G., Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 2001, 52:928-936.
2. Bektas T. The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 2006, 34:209-219.
3. Carter A.E., Ragsdale C.T. Scheduling pre-printed newspaper advertising inserts using genetic algorithms. Omega 2002, 30:415-421.
4. Gendreau M., Hertz A., Laporte G., Stan M.A. Generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research 1998, 46:330-335.
5. Savelsbergh M.W.P. Local search in routing problems with time windows. Annals of Operations Research 1985, 4:285-305.
6. Cordeau J.F., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 1997, 30:105-119.
7. Begur S.V., Miller D.M., Weaver J.R. An integrated spatial DSS for scheduling and routing home-health-care nurses. Interfaces 1997, 27:35-48.
8. Cheng E., Rich J.L. A Home Health Care Routing and Scheduling Problem. Technical Report 1998, Rice University, Houston, Texas, USA.
9. Bertels S., Fahle T. A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Computers and Operations Research 2006, 33:2866-2890.
10. Eveborn P., Flisberg P., Rönnqvist M. Laps care-an operational system for staff planning of home care. European Journal of Operational Research 2006, 171:962-976.
11. Kergosien Y, Lenté C, Billaut JC. Home health care problem: an extended multiple traveling salesman problem. In: Proceedings of the multidisciplinary international conference on scheduling: theory and applications; 2009. p. 10-2.
12. Trautsamwieser A., Gronalt M., Hirsch P. Securing home health care in times of natural disasters. OR Spectrum 2011, 33:787-813.
13. Nickel S., Schröder M., Steeg J. Mid-term and short-term planning support for home health care services. European Journal of Operational Research 2012, 219:574-587.
14. Beltrami E.J., Bodin L.D. Networks and vehicle routing for municipal waste collection. Networks 1974, 4:65-94.
15. Russell R., Igo W. An assignment routing problem. Networks 1979, 9:1-17.
16. Christofides N., Beasley J.E. The period routing problem. Networks 1984, 14:237-256.
17. Chao I., Golden B.L., Wasil E. An improved heuristic for the period vehicle routing problem. Networks 1995, 26:25-44.
18. Mourgaya M., Vanderbeck F. Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research 2007, 183:1028-1041.
19. Hemmelmayr V.C., Doerner K.F., Hartl R.F. A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research 2009, 195:791-802.
20. Pirkwieser S, Raidl GR. Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques. In: Proceedings of the 8th metaheuristic international conference, MIC; 2009.
21. Pirkwieser S., Raidl G.R. Multilevel variable neighborhood search for periodic routing problems. Evolutionary computation in combinatorial optimization 2010, 226-238. Springer, Berlin/Heidelberg. P. Cowling, P. Merz (Eds.).
22. Pirkwieser S, Raidl GR. A column generation approach for the periodic vehicle routing problem with time windows. In: Proceedings of the international network optimization conference; 2009. p. 26-9.
23. Pirkwieser S, Raidl GR. Matheuristics for the periodic vehicle routing problem with time windows. In: Proceedings of matheuristics 2010: third international workshop on model-based metaheuristic; 2010b. p. 28-30.
24. Gulczynski D., Golden B., Wasil E. The period vehicle routing problem: new heuristics and real-world variants. Transportation Research Part E: Logistics and Transportation Review 2011, 47:648-668.
25. 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.
26. 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.
27. Cacchiani V., Hemmelmayr V.C., Tricoire F. A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Applied Mathematics 2014, 163(Part 1):53-64.
28. Baldacci R., Bartolini E., Mingozzi A., Valletta A. An exact algorithm for the period routing problem. Operations Research 2011, 59:228-241.
29. Lacomme P., Prins C., Ramdane-Chérif W. Evolutionary algorithms for periodic arc routing problems. European Journal of Operational Research 2005, 165:535-553.
30. Cornillier F., Boctor F.F., Laporte G., Renaud J. A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research 2008, 191:295-305.
31. Angelelli E., Bianchessi N., Mansini R., Speranza M.G. Short term strategies for a dynamic multi-period routing problem. Transportation Research Part C: Emerging Technologies 2009, 17:106-119.
32. Wen M., Cordeau J.F., Laporte G., Larsen J. The dynamic multi-period vehicle routing problem. Computers and Operations Research 2010, 37:1615-1623.
33. Angelelli E., Grazia Speranza M. The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research 2002, 137:233-247.
34. Francis P., Smilowitz K., Tzur M. The period vehicle routing problem with service choice. Transportation Science 2006, 40:439-454.
35. Yu B., Yang Z.Z. An ant colony optimization model: the period vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review 2011, 47:166-181.
36. França P.M., Gendreau M., Laporte G., Müller F.M. The m-traveling salesman problem with minmax objective. Transportation Science 1995, 29:267-275.
37. Somhom S., Modares A., Enkawa T. Competition-based neural network for the multiple travelling salesmen problem with minmax objective. Computers and Operations Research 1999, 26:395-407.
38. Modares A., Somhom S., Enkawa T. A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems. International Transactions in Operational Research 1999, 6:591-606.
39. Arkin E.M., Hassin R., Levin A. Approximations for minimum and min-max vehicle routing problems. Journal of Algorithms 2006, 59:1-18.
40. Golden B.L., Laporte G., Taillard É.D. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Computers and Operations Research 1997, 24:445-452.
41. Valle C.A., Martinez L.C., da Cunha A.S., Mateus G.R. Heuristic and exact algorithms for a min-max selective vehicle routing problem. Computers and Operations Research 2011, 38:1054-1065.
42. Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 1991, 54:7-22.
43. Savelsbergh M., Sol M. DRIVE: dynamic routing of independent vehicles. Operations Research 1998, 46:474-490.
44. Bard J.F., Jarrah A.I. Integrating commercial and residential pickup and delivery networks: a case study. Omega 2013, 41:706-720.
45. Bent R., Hentenryck P.V. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers and Operations Research 2006, 33:875-893.
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., Cordeau J.F. Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science 2009, 43:267-286.
48. Gribkovskaia I., Laporte G., Shlopak A. A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms. Journal of the Operational Research Society 2008, 59:1449-1459.
49. Qian F., Gribkovskaia I., Laporte G., Halskau Ø. Passenger and pilot risk minimization in offshore helicopter transportation. Omega 2012, 40:584-593.
50. 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.
51. Yu B., Yang Z.Z., Yao B. An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research 2009, 196:171-176.
52. Jozefowiez N., Semet F., Talbi E.-G. An evolutionary algorithm for the vehicle routing problem with route balancing. European Journal of Operational Research 2009, 195:761-769.
53. Reimann M., Doerner K., Hartl R.F. D-Ants: savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research 2004, 31:563-591.
54. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 2004, 31:1985-2002.
55. Gajpal Y., Abad P. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Computers and Operations Research 2009, 36:3215-3223.
56. Della Croce F., Garaix T., Grosso A. Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. Computers and Operations Research 2012, 39:1213-1217.
57. Brandão J. A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research 2004, 157:552-564.
58. Gendreau M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 1992, 40:1086-1094.
59. Braysy O., Gendreau M. Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transportation Science 2005, 39:104-118.
60. Pedamallu C.S., Ozdamar L. Investigating a hybrid simulated annealing and local search algorithm for constrained optimization. European Journal of Operational Research 2008, 185:1230-1245.
61. Tseng L.Y., Lin Y.T. A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 2009, 198:84-92.
62. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 1987, 35:254-265.
63. Gehring H, Homberger J. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows; 1999.
64. Paletta G. A multiperiod traveling salesman problem: heuristic algorithms. Computers and Operations Research 1992, 19:789-795.
65. Chao I.M., Golden B.L., Wasil E.A. A new heuristic for the period traveling salesman problem. Computers and Operations Research 1995, 22:553-565.
66. Giuseppe P. The period traveling salesman problem: a new heuristic algorithm. Computers and Operations Research 2002, 29:1343-1352.
67. Bertazzi L., Paletta G., Speranza M.G. An improved heuristic for the period traveling salesman problem. Computers and Operations Research 2004, 31:1215-1222.