A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods

Transportation Research Part C: Emerging Technologies

Volumn 55, Issue , 2015, Pages 273-297

  Hu, Zhi Hua ^a   Sheu, Jiuh Biing ^b   Zhao, Lei ^c   Lu, Chung Cheng ^d  

^a SHANGHAI MARITIME UNIVERSITY   (China)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c Shanghai Jiao Tong University   (China)

^d NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Closed loop vehicle routing problem; Incompatible goods; Reverse logistics; Simultaneous pickup and delivery; Variable neighborhood search

Indexed keywords

CONTAMINATION; OPTIMIZATION; SERVICE INDUSTRY; UNCERTAINTY ANALYSIS; VEHICLE ROUTING; VEHICLES;

INCOMPATIBLE GOODS; REVERSE LOGISTICS; SIMULTANEOUS PICKUP AND DELIVERIES; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE ROUTING PROBLEMS;

PICKUPS;

DEMAND ANALYSIS; ROUTING; TRANSPORT VEHICLE; TRANSPORTATION SYSTEM; UNCERTAINTY ANALYSIS;

CHINA;

EID: 84936986071     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2015.01.010     Document Type: Article

References (63)

1. Ai T.J., Kachitvichyanukul V. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 2009, 36(5):1693-1702.
2. Ak A., Erera A.L. A paired-vehicle recourse strategy for the vehicle routing problem with stochastic demands. Transport. Sci. 2007, 41(2):222-237.
3. Augerat P., Belenguer J.M., Benavent E., Corberán A., Naddef D., Rinaldi G. Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Research Report 949-M. Grenoble 1995, University Joseph Fourier, France.
4. Baldacci R., Bartolini E., Mingozzi A. An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 2011, 59(2):414-426.
5. Bertsimas D., Simchi-Levi D. The new generation of vehicle routing research: robust algorithms addressing uncertainty. Oper. Res. 1994, 44(2):286-304.
6. Chen L., Miller-Hooks E. Optimal team deployment in urban search and rescue. Transport. Res. Part B 2012, 46(8):984-999.
7. Clarke C., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 1964, 12(4):568-581.
8. Dethloff J. Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spectrum 2001, 23:79-96.
9. Dror M., Trudeau P. Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. 1986, 23(2):228-235.
10. Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: properties and solutions frameworks. Transport. Sci. 1989, 23(3):166-176.
11. Duhaime R., Riopel D., Langevin A. Value analysis and optimization of reusable containers at Canada post. Interfaces 2001, 31(3):3-15.
12. Erera A.L., Morales J.C., Savelsbergh M. The vehicle routing problem with stochastic demand and duration constraints. Transport. Sci. 2010, 44(4):474-492.
13. Feliciano L., Li J., Lee J., Pascall M.A. Efficacies of sodium hypochlorite and quaternary ammonium sanitizers for reduction of norovirus and selected bacteria during ware-washing operations. PLoS ONE 2012, 7(12).
14. Figliozzi M.A. Planning approximations to the average length of vehicle routing problems with time window constraints. Transport. Res. Part B 2009, 43(4):438-447.
15. Fleszar K., Osman I.H., Hindi K.S. A variable neighbourhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 2009, 195(3):803-809.
16. Gajpal Y., Abad P. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Comput. Oper. Res. 2009, 36(12):3215-3223.
17. Gao S., Chabini I. Optimal routing policy problems in stochastic time-dependent networks. Transport. Res. Part B 2006, 40(2):93-122.
18. Gendreau M., Laporte G., Séguin R. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transport. Sci. 1995, 29(2):143-155.
19. Gendreau M., Laporte G., Seguin R. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 1996, 44(3):469-477.
20. Geroliminis N., Karlaftis M.G., Skabardonis A. A spatial queuing model for the emergency vehicle districting and location problem. Transport. Res. Part B 2009, 43(7):798-811.
21. Gillett B.E., Miller L.R. A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 1974, 22(2):340-349.
22. González-Torre P.L., Adenso-Díaz B., Artiba H. Environmental and reverse logistics policies in European bottling and packaging firms. Int. J. Prod. Econ. 2004, 88(1):95-104.
23. Gribkovskaia I., Laporte G., Shyshou A. The single vehicle routing problem with deliveries and selective pickups. Comput. Oper. Res. 2008, 35(9):2908-2924.
24. Guide V.D.R., Van Wassenhove L.N. The evolution of closed-loop supply chain research. Oper. Res. 2009, 57(1):10-18.
25. Haimovich M., Kan A.R. Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 1985, 10(4):527-542.
26. Hamdi-Dhaoui K., Labadie N., Yalaoui A. Algorithms for the two dimensional bin packing problem with partial conflicts. RAIRO - Oper. Res. 2012, 46(1):41-62.
27. Hansen P., Mladenović N. Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 2001, 130(3):449-467.
28. Hansen P., Mladenović N., Pérez J.A.M. Variable neighbourhood search: methods and applications. Ann. Oper. Res. 2008, 175(1):367-407.
29. Hemmelmayr V.C., Doerner K.F., Hartl R.F. A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 2009, 195(3):791-802.
30. Hu Z.-H., Sheu J.-B. Post-disaster debris reverse logistics management under psychological cost minimization. Transport. Res. Part B 2013, 55:118-141.
31. Jarboui B., Derbel H., Hanafi S., Mladenović N. Variable neighborhood search for location routing. Comput. Oper. Res. 2013, 40(1):47-57.
32. Jun Y., Kim B.-I. New best solutions to VRPSPD benchmark problems by a perturbation based algorithm. Expert Syst. Appl. 2012, 39(5):5641-5648.
33. Karlaftis M.G., Vlahogianni E.I. Memory properties and fractional integration in transportation time-series. Transport. Res. Part C 2009, 17(4):444-453.
34. Karlaftis M.G., Kepaptsoglou K., Sambracos E. Containership routing with time deadlines and simultaneous deliveries and pick-ups. Transport. Res. Part E: Logist. Transport. Rev. 2009, 45(1):210-221.
35. Kuo Y., Wang C.-C. A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Expert Syst. Appl. 2012, 39(8):6949-6954.
36. Laporte G., Louveaux F.V., Hamme L.v. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 2002, 50(3):415-423.
37. Laporte G., Louveaux F., Mercure H. Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. 1989, 39(1):71-78.
38. Mihi Ramírez A. Product return and logistics knowledge: influence on performance of the firm. Transport. Res. Part E 2012, 48(6):1137-1151.
39. Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transport. Res. Part A 1989, 23(5):377-386.
40. Mladenović N., Hansen P. Variable neighborhood search. Comput. Oper. Res. 1997, 24(11):1097-1100.
41. Montané F.A.T., Galvão R.D. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput. Oper. Res. 2006, 33(3):595-619.
42. Murèa S., Demichelab M. The impact of reach and CLP regulations on the safety management of hazardous materials storage. Chem. Eng. Trans. 2013, 32:187-192.
43. Nagy G., Salhi S. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur. J. Oper. Res. 2005, 162(1):126-141.
44. Parragh S.N., Doerner K.F., Hartl R.F. A survey on pickup and delivery problems. J. Betrieb. 2008, 58(2):81-117.
45. Pishvaee M.S., Farahani R.Z., Dullaert W. A memetic algorithm for bi-objective integrated forward/reverse logistics network design. Comput. Oper. Res. 2010, 37(6):1100-1112.
46. Psarros I., Kepaptsoglou K., Karlaftis M.G. An empirical investigation of passenger wait time perceptions using hazard-based duration models. J. Public Transport. 2011, 14(3):109-122.
47. Secomandi N. A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 2001, 49(5):796-802.
48. Souza G.C. Closed-loop supply chains: a critical review, and future research. Decis. Sci. 2013, 44(1):7-38.
49. Stewart W.R., Golden B.L. Stochastic vehicle routing: a comprehensive approach. Eur. J. Oper. Res. 1983, 14(4):371-385.
50. Subramanian A., Drummond L.M.A., Bentes C., Ochi L.S., Farias R. A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 2010, 37(11):1899-1911.
51. Subramanian A., Uchoa E., Pessoa A.A., Ochi L.S. Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 2011, 39(5):338-341.
52. Tao G., Michalewicz Z. Inver-over operator for the TSP. LNCS 1998, 1498:803-812.
53. Tasan A.S., Gen M. A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput. Ind. Eng. 2012, 62(3):755-761.
54. Ukkusuri S.V., Patil G. Multi-period transportation network design under demand uncertainty. Transport. Res. Part B 2009, 43(6):625-642.
55. Vlahogianni E.I., Karlaftis M.G., Golias J.C. Short-term traffic forecasting: where we are and where we're going. Transport. Res. Part C 2014, 43:3-19.
56. Wang Y.W. Thermally incompatible hazards of aqueous tert-butyl hydroperoxide with various acids/alkalis. Ind. Eng. Chem. Res. 2012, 51(23):7845-7852.
57. Wassan N.A., Wassan A.H., Nagy G. A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J. Comb. Optim. 2008, 15(4):368-386.
58. Winder C., Zarei A. Incompatibilities of chemicals. J. Hazard. Mater. 2000, 79(1-2):19-30.
59. Yang L., Jing L.-B. Blue Book of Catering Industry: Annual Report on Catering Industry Development of China (2012) 2012, Social Science Academic Press (China), Beijing, (in Chinese).
60. Yang W., Mathur K., Ballou R.H. Stochastic vehicle routing problem with restocking. Transport. Sci. 2000, 34(1):99-112.
61. Zachariadis E.E., Tarantilis C.D., Kiranoudis C.T. An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. Eur. J. Oper. Res. 2010, 202(2):401-411.
62. Zerhouni H., Gayon J.P., Frein Y. Influence of dependency between demands and returns in a reverse logistics system. Int. J. Prod. Econ. 2013, 143(1):62-71.
63. Zhang T., Chaovalitwongse W.A., Zhang Y. Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Comput. Oper. Res. 2011, 39(10):2277-2290.