A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 1899-1911

  Subramanian, A ^a   Drummond, L M A ^a   Bentes, C ^b   Ochi, L S ^a   Farias, R ^c  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b STATE UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Metaheuristic; Parallel computing; Pickup and delivery; Vehicle routing

Indexed keywords

BENCH-MARK PROBLEMS; ITERATED LOCAL SEARCH; METAHEURISTIC; MULTICORE ARCHITECTURES; MULTISTART; PARALLEL COMPUTING; PICKUP AND DELIVERY; VEHICLE ROUTING PROBLEMS;

HEURISTIC METHODS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; ROUTING ALGORITHMS; VEHICLES;

CLUSTER COMPUTING;

EID: 77951104453     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.10.011     Document Type: Article

References (45)

1. de Brito M.P., and Dekker R. Reverse Logistics: a framework. Reverse logistics-quantitative models for closed-loop supply chains (2004), Springer, Berlin 3-27
2. Dethloff J. Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23 1 (2001) 79-96
3. Subramanian A, Cabral LAF, Ochi LS. An efficient ILS heuristic for the vehicle routing problem with simultaneous pickup and delivery. Technical Report, Universidade Federal Fluminense; 2008, available at 〈http://www.ic.uff.br/PosGraduacao/RelTecnicos/401.pdf〉.
4. Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research 23 5 (1989) 377-386
5. Halse K. Modeling and solving complex vehicle routing problems. PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Denmark; 1992.
6. Salhi S., and Nagy G. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society 50 10 (1999) 1034-1042
7. Nagy G., and Salhi S. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research 162 (2005) 126-141
8. Rö̈pke S, Pisinger D. A unified heuristic for a large class of vehicle routing problems with backhauls. Technical Report 2004/14, University of Copenhagen; 2004.
9. Vural AV. A GA based meta-heuristic for capacitated vehicle routing problem with simultaneous pick-up and deliveries. Master's thesis, Graduate School of Engineering and Natural Sciences, Sabanci University; 2003.
10. Gökçe EI. A revised ant colony system approach to vehicle routing problems. Master's thesis, Graduate School of Engineering and Natural Sciences, Sabanci University; 2004.
11. Gajpal Y., and Abad P. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Computers & Operations Research 36 12 (2009) 3215-3223
12. Crispim J., and Brandao J. Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. Journal of the Operational Research Society 56 7 (2005) 1296-1302
13. Montané F.A.T., and Galvão R.D. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research 33 3 (2006) 595-619
14. Chen J.F., and Wu T.H. Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society 57 5 (2006) 579-587
15. Gribkovskaia I., Halskau Ø., Laporte G., and Vlcek M. General solutions to the single vehicle routing problem with pickups and deliveries. European Journal of Operational Research 180 (2007) 568-584
16. Bianchessi N., and Righini G. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research 34 2 (2007) 578-594
17. Wassan N.A., Wassan A.H., and Nagy G. A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization 15 4 (2008) 368-386
18. Zachariadis E.E., Tarantilis C.D., and Kiranoudis C.T. A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Systems with Applications 36 2 (2009) 1070-1081
19. Subramanian A, Cabral LAF. An ILS based heuristic for the vehicle routing problem with simultaneous pickup and delivery. In: Proceedings of the eighth european conference on evolutionary computation in combinatorial optimisation. Lecture notes in computer science, vol. 4972. Berlin: Springer; 2008. p. 135-46.
20. Dell'Amico M., Righini G., and Salanim M. A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Science 40 2 (2006) 235-247
21. Angelelli E, Mansini R. A branch-and-price algorithm for a simultaneous pick-up and delivery problem. Quantitative approaches to distribution logistics and supply chain management. Berlin, Heidelberg: Springer; 2002. p. 249-67.
22. Ralphs T.K., Ladányi L., and Saltzman M.J. Parallel branch, cut, and price for large-scale discrete optimization. Mathematical Programming 98 (2003) 253-280
23. Ralphs T.K., Ladányi L., and Saltzman M.J. A library hierarchy for implementing scalable parallel search algorithms. The Journal of Supercomputing 28 (2004) 215-234
24. Rochat Y., and Taillard R.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167
25. Schulze J, Fahle T. A parallel algorithm for the vehicle routing problem with time window constraints. Annals of Operations Research 86.
26. Gendreau M., Guertin F., Potvin J.-Y., and Taillard E. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33 4 (1999) 381-390
27. Gendreau M., Laporte G., and Semet F. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Computing 27 12 (2001) 1641-1653
28. Attanasio A., Cordeau J.-F., Ghiani G., and Laporte G. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing 30 3 (2004) 377-387
29. Caricato P., Ghiani G., Grieco A., and Guerriero E. Parallel tabu search for a pickup and delivery problem under track contention. Parallel Computing 29 5 (2003) 631-639
30. Ochi L.S., Vianna D.S., Drummond L.M.A., and Victor A.O. A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Generation Computer Systems 14 5-6 (1998) 285-292
31. Drummond L.M.A., Ochi L.S., and Vianna D.S. An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Generation Computer Systems 17 4 (2001) 379-386
32. Jozefowiez N., Semet F., and Talbi E.-G. Parallel and hybrid models for multi-objective optimization: application to the vehicle routing problem. PPSN VII: Proceedings of the 7th international conference on parallel problem solving from nature (2002), Springer, London, UK 271-280
33. Berger J., and Barkaoui M. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research 31 12 (2004) 2037-2053
34. Alba E, Dorronsoro B. Solving the vehicle routing problem by using cellular genetic algorithms. In: Gottlieb J, Raidl GR, editors. EvoCOP. Lecture notes in computer science, vol. 3004. Berlin: Springer; 2004. p. 11-20.
35. Gehring H., and Homberger J. Parallelization of a two-phase metaheuristic for routing problems with time windows. Journal of Heuristics 8 3 (2002) 251-276
36. Bouthillier A.L., and Crainic T.G. A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research 32 7 (2005) 1685-1708
37. Czarnas P. Parallel simulated annealing for the vehicle routing problem with time windows. In: 10th Euromicro workshop on parallel, distributed and network-based processing, Canary Islands Spain, 2002. p. 376-83.
38. Polacek M., Benkner S., Doerner K.F., and Hartl R.F. A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. BuR-Business Research 1 2 (2008) 207-218
39. Doerner K, Hartl RF, Kiechle G, Lucká M, Reimann M. Parallel ant systems for the capacitated vehicle routing problem. In: Gottlieb J, Raidl GR, editors. EvoCOP. Lecture notes in computer science, vol. 3004. Berlin: Springer; 2004. p. 72-83.
40. Crainic TG. Parallel solution methods for vehicle routing problems. The vehicle routing problem: latest advances and new challenges. Berlin: Springer; 2008. p. 171-98.
41. Mladenović N., and Hansen P. Variable neighborhood search. Computers & Operations Research 24 11 (1997) 1097-1100
42. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 1-4 (1993) 421-451
43. Taillard E., Badeau P., Gendreau M., Guertin F., and Potvin J.Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186
44. Cordeau J.-F., and Laporte G. Tabu search heuristics for the vehicle routing problem. Metaheuristic optimization via memory and evolution: tabu search and scatter search (2005), Kluwer Academic Publishers, Dordrecht 145-163
45. Gabriel E, Fagg GE, Bosilca G, Angskun T, Dongarra JJ, Squyres JM, et al. Open MPI: goals, concept, and design of a next generation MPI implementation. In: Proceedings, 11th European PVM/MPI users' group meeting, Budapest, Hungary, 2004. p. 97-104.