The single vehicle routing problem with deliveries and selective pickups

Computers and Operations Research

Volumn 35, Issue 9, 2008, Pages 2908-2924

  Gribkovskaia, Irina ^a   Laporte, Gilbert ^b   Shyshou, Aliaksandr ^a  

^a MOLDE UNIVERSITY COLLEGE   (Norway)

^b HEC MONTRÉAL   (Canada)

Author keywords

Pickup and delivery problems; Reverse logistics; Selective pickups; Tabu search

Indexed keywords

COST ACCOUNTING; EARNINGS; HEURISTIC ALGORITHMS; LINEAR PROGRAMMING; PICKUPS; PROBLEM SOLVING;

COMPUTATIONAL RESULTS; DELIVERIES; DELIVERY DEMANDS; REVERSE LOGISTICS; SELECTIVE PICKUPS; SINGLE VEHICLE ROUTING; TABU SEARCH HEURISTIC;

VEHICLE ROUTING;

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

References (28)

1. Privé J., Renaud J., Boctor F.F., and Laporte G. Solving a vehicle routing problem arising in soft drink distribution. Journal of the Operational Research Society 57 (2006) 1045-1052
2. Aas B, Gribkovskaia I, Halskau Ø sr, Shlopak A, Routing of supply vessels to petroleum installations. International Journal of Physical Distribution and Logistics Management, 2007, forthcoming.
3. Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research 23A (1989) 377-386
4. Mosheiov G. The travelling salesman problem with pick-up and delivery. European Journal of Operational Research 79 (1994) 299-310
5. Nagy G., and Salhi S. The many-to-many location-routing problem. TOP 6 (1998) 261-275
6. 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
7. 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 (1999) 1034-1042
8. Gendreau M., Laporte G., and Vigo S. Heuristics for the traveling salesman problem with pickup and delivery. Computers & Operations Research 23 (1999) 501-508
9. Halskau Ø, Løkketangen A. Analyse an distribusjonsopplegget ved Sylte Mineralvannfabrikk A/S, Report M9812 Møreforskning, Molde, 1998.
10. Dethloff J. Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. Operations Research Spectrum 23 (2001) 79-96
11. Dethloff J. Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. Journal of the Operational Research Society 53 (2002) 115-118
12. Gribkovskaia I, Halskau Ø sr, Myklebost KNB. Models for the pick-up and deliveries from depots, NOFOMA 2001, Collaboration in Logistics: Connecting Islands using Information Technology: 2001; p. 279-93.
13. Angelelli E., and Mansini R. The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Klose A., Speranza M.G., and Van Wassenhove L.N. (Eds). Quantitative approaches to distribution logistics and supply chain management (2002), Springer, Berlin 249-267
14. Tang F.A., and Galvão R.D. Vehicle routing problems with simultaneous pick-up and delivery service. Opsearch 39 (2002) 19-33
15. Tang F.A., 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 (2006) 595-619
16. Süral H., and Bookbinder J.H. The single-vehicle routing problem with unrestricted backhauls. Networks 41 (2003) 127-136
17. Wasner M., and Zäphel G. An integrated multi-depot hub-location vehicle routing model for network planning of parcel service. Computers & Operations Research 33 (2004) 403-419
18. Gribkovskaia I, Halskau Ø sr, Laporte G, Vlček M. General solutions to the single vehicle routing problem with pickups and deliveries. European Journal of Operational Research 2007;180:568-84.
19. Hoff A, Laporte G, Løkketangen A, Gribkovskaia I. Lasso solution strategies for the vehicle routing problem with pickups and deliveries. European Journal of Operational Research 2006; submitted for publication.
20. Hoff A., and Løkketangen A. Creating lasso-solutions for the TSPPD-problem by tabu search. Central European Journal of Operations Research 14 (2005) 125-140
21. Dantzig G.B., Fulkerson D.R., and Johnson S.M. Solutions of a large-scale traveling salesman problem. Operations research 2 (1954) 393-410
22. Rosenkrantz D., Stearns R., and Lewis P. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 6 (1977) 563-581
23. Mole R.H., and Jameson S.R. A sequential route-building algorithm employing a generalized savings criterion. Operational Research Quarterly 27 (1976) 503-511
24. Cordeau J.-F., Laporte G., and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of Operational Research Society 52 (2001) 928-936
25. Glover F. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 13 (1986) 533-549
26. Cordeau J.-F., Gendreau M., and Laporte G. A tabu search algorithm for periodic and multi-depot vehicle routing problems. Networks 30 (1997) 105-119
27. Glover F. Tabu search-Part 1. ORSA. Journal on Computing 1 (1989) 190-206
28. Taillard E.D. Parallel iterative search for vehicle routing problems. Networks 23 (1993) 661-673