An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads

Transportation Research Part C: Emerging Technologies

Volumn 27, Issue , 2013, Pages 169-188

  Şahin, Mustafa ^a   Çavuşlar, Gizem ^a   Öncan, Temel ^c   Şahin, Güvenç ^a   Tüzün Aksu, Dilek ^b  

^a SABANCI UNIVERSITY   (Turkey)

^b YEDITEPE UNIVERSITY   (Turkey)

^c GALATASARAY UNIVERSITY   (Turkey)

Author keywords

Pickup delivery; Simulated annealing; Split loads; Tabu search; Vehicle routing

Indexed keywords

OUTSOURCING; SIMULATED ANNEALING; TABU SEARCH; VEHICLE ROUTING; VEHICLES;

COURIER SERVICE; MULTI-VEHICLES; PICKUP AND DELIVERY; PICKUP AND DELIVERY PROBLEMS; PROBLEM SETS; SPLIT DELIVERY; SPLIT-LOAD; THIRD PARTY LOGISTICS;

PICKUPS;

ALGORITHM; HEURISTICS; LOGISTICS; SIMULATED ANNEALING; SPATIAL DISTRIBUTION;

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

References (20)

1. Archetti C., Speranza M.G. The split delivery vehicle routing problem: a survey. The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series 2008, vol. 43:103-122. Springer, New York, USA.
2. Archetti C., Speranza M.G. Vehicle routing problems with split deliveries. International Transactions in Operations Research 2012, 19:3-22.
3. Archetti C., Savelsbergh M.W.P., Speranza M.F. To split or not to split: that is the question. Transportation Research Part E 2008, 44:114-123.
4. Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 1964, 12(4):568-581.
5. Cordeau J.F., Laporte G., Ropke S. Recent models and algorithms for one-to-one pickup and delivery problems. The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series 2008, vol. 43:327-357. Springer, New York, USA.
6. Desrochers M., Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 1991, 10:27-36.
7. Dongarra, J.J., 2010. Performance of Various Computers Using Standard Linear Equations Software (Linpack Benchmark Report). Technical Report, University of Tennessee Computer Science Technical Report.
8. Dror M., Trudeau P. Savings by split delivery routing. Transportation Science 1989, 23(2):141-145.
9. Gribkovskaia, I., Laporte, G., 2008. One-to-many-to-one single vehicle pickup and delivery problems. In: Golden, B., Raghavan,S., Wasil, E. (Eds.), The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research/Computer Science Interfaces Series, vol. 43, Springer, New York, USA, pp. 359-377.
10. Lenstra J.K., Rinnooy Kan A.H.G. Complexity of vehicle routing and scheduling problems. Networks 1981, 11(2).
11. Li H., Lim A. Local search with annealing-like restarts to solve the VRPTW. European Journal of Operational Research 2003, 150(1):115-127.
12. Miller C.E., Tucker A.W., Zemlin R.A. Integer programming formulations and traveling salesman problems. Journal of the Association for Computing Machinery 1960, 7:326-329.
13. Mitra S. An algorithm for the generalized vehicle routing with backhauling. Asia-Pacific Journal of Operational Research 2005, 22(2):153-169.
14. Nowak, M., 2005. The Pickup and Delivery Problem with Split Loads. PhD Thesis, Georgia Institute of Technology.
15. Nowak M., Ergun O., White C.C. Pickup and delivery with split loads. Transportation Science 2008, 42(1):32-43.
16. Nowak M., Ergun O., White C.C. An empirical study on the benefit of split loads with the pickup and delivery problem. European Journal of Operational Research 2009, 198(3):734-740.
17. Osman I.H. Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches. OR Spectrum 1995, 17:211-225.
18. Ropke S., Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 2006, 40(4):455-472.
19. şahin, M., 2011. Multi Vehicle Pickup and Delivery Problem with Split Loads. Master's Thesis, Sabanci University.
20. Thangiah, S.R., Osman, I.H., Sun, T., 1994. Hybrid Genetic Algorithm Simulated Annealing and Tabu Search Methods for Vehicle Routing Problem with Time Windows. Technical Report 27, Computer Science Department, Slippery Rock University.