A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit

European Journal of Operational Research

Volumn 242, Issue 2, 2015, Pages 369-382

  Polat, Olcay ^a   Kalayci, Can B ^a   Kulak, Osman ^a   Günther, Hans Otto ^b  

^a PAMUKKALE UNIVERSITY   (Turkey)

^b Seoul National University   (South Korea)

Author keywords

And delivery; Meta heuristics; Perturbation based neighborhood search; Vehicle routing with simultaneous pickup

Indexed keywords

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; NUMERICAL METHODS; PICKUPS; VEHICLES;

AND DELIVERY; MATHEMATICAL OPTIMIZATION MODEL; META HEURISTICS; NEIGHBORHOOD SEARCH; NEIGHBORHOOD SEARCH ALGORITHMS; SIMULTANEOUS PICKUP AND DELIVERIES; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 84920673949     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.10.010     Document Type: Article

References (40)

1. Ai, T. J., & Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 36, 1693-1702.
2. Altinel, K., & Öncan, T. (2005). A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. Journal of the Operational Research Society, 56, 954-961.
3. Berbeglia, G., Cordeau, J. -F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: A classification scheme and survey. TOP, 15, 1-31.
4. Catay, B. (2010). A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications, 37, 6809-6817.
5. Chen, J. F., & Wu, T. H. (2006). Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society, 57, 579-587.
6. Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle-dispatching problem. Journal of the Operational Research Society, 20, 309-318.
7. Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem. In A. M. Christofides, P. Toth, & C. Sandi (Eds.), Combinatorial optimization (pp. 315-338). Chichester:Wiley.
8. Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568-581.
9. Croes, G. A. (1958). A method for solving traveling salesman problems. Operations Research, 6, 791-812.
10. Dethloff, J. (2001). Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, 23, 79-96.
11. Doyuran, T., & Çatay, B. (2011). A robust enhancement to the Clarke-Wright savings algorithm. Journal of the Operational Research Society, 62, 223-231.
12. Eilon, S., Watson-Gandy, C. D. T., & Christofides, N. (1971). Distribution management: Mathematical modelling and practical analysis. London: Griffin.
13. Gajpal, Y., & Abad, P. (2009). An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Computers & Operations Research, 36, 3215-3223.
14. Goksal, F. P., Karaoglan, I., & Altiparmak, F. (2013). A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Computers & Industrial Engineering, 65, 39-53.
15. Hansen, P., Mladenović, N., & Pérez, J. M. (2010). Developments of variable neighborhood search. Annals of Operations Research, 175, 367-407.
16. Hemmelmayr, V. C., Doerner, K. F., & Hartl, R. F. (2009). A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research, 195, 791-802.
17. Jun, Y., & Kim, B.-I. (2012). New best solutions to VRPSPD benchmark problems by a perturbation based algorithm. Expert Systems with Applications, 39, 5641-5648.
18. Kytöjoki, J., Nuortio, T., Bräysy, O., & Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research, 34, 2743-2757.
19. Lin, S. (1965). Computer solutions of the traveling salesman problem. Bell Systems Technical Journal, 44, 2245-2269.
20. Liu, R., Xie, X., Augusto, V., & Rodriguez, C. (2013). Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. European Journal of Operational Research, 230, 475-486.
21. Min, H. (1989). The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research Part A, 23, 377-386.
22. Mingyong, L., & Erbao, C. (2010). An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Engineering Applications of Artificial Intelligence, 23, 188-195.
23. Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24, 1097-1100.
24. Montanë, F. A. T., & Galváo, R. D. (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computer and Operations Research, 33, 595-619.
25. Nagy, G., & Salhi, S. (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162.
26. Nagy, G., Wassan, N. A., Speranza, M. G., & Archetti, C. (2014). The vehicle routing problem with divisible deliveries and pickups. Transportation Science. doi:10.1287/trsc.2013.0501.
27. Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41, 421-451.
28. Parragh, S., Doerner, K., & Hartl, R. (2008). A survey on pickup and delivery problems. Journal für Betriebswirtschaft, 58, 21-51.
29. Polat, O., Günther, H. -O., & Kulak, O. (2014). The feeder network design problem: Application to container services in the Black Sea region. Maritime Economics &Logistics, 16, 343-369.
30. Prodhon, C., & Prins, C. (2014). A survey of recent research on location-routing problems. European Journal of Operational Research, 238, 1-17.
31. Ropke, S., & Pisinger, D. (2006). A unified heuristic for vehicle routing problems with backhauls. European Journal of Operational Research, 171, 750-775.
32. Salhi, S., & Nagy, G. (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society, 50, 1034-1042.
33. Stenger, A., Vigo, D., Enz, S., & Schwind, M. (2013). An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transportation Science, 47, 503-527.
34. Subramanian, A., & Cabral, L. D. A. F. (2008). An ILS based heuristic for the vehicle routing problem with simultaneous pickup and delivery and time limit. Lecture Notes in Computer Science, 4972, 135-146.
35. Subramanian, A., Drummond, L.M. A., Bentes, C., Ochi, L. S., & Farias, R. (2010). A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Computers and Operations Research, 37, 1899-1911.
36. Wassan, N. A., Wassan, A. H., & Nagy, G. (2008). A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization, 15, 368-386.
37. Zachariadis, E. E., & Kiranoudis, C. T. (2011). A local search metaheuristic algorithm for the vehiclerouting problem with simultaneous pick-ups and deliveries. Expert Systems with Applications, 38, 2717-2726.
38. Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2009). A hybrid metaheuristic algorithm for the vehiclerouting problem with simultaneous delivery and pick-up service. Expert Systems with Applications, 36, 1070-1081.
39. Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2010). An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. European Journal of Operational Research, 202, 401-411.
40. Zhang, T., Tian, W. -X., Zhang, Y. -J., & Liu, S. -X. (2008). Improved ant colony system for VRPSPD with maximum distance constraint. Systems Engineering - Theory &Practice, 28, 132-140.