Adaptive path relinking for vehicle routing and scheduling problems with product returns

Transportation Science

Volumn 47, Issue 3, 2013, Pages 356-379

  Tarantilis, Christos D ^a   Anagnostopoulou, Afroditi K ^a   Repoussis, Panagiotis P ^b  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Path relinking; Reverse logistics; Vehicle routing; Vehicle scheduling

Indexed keywords

LOGISTICS; PICKUPS; SALES; SCHEDULING; VEHICLE ROUTING;

COMPUTATIONAL RESULTS; PARTICULAR SOLUTION; PATH RELINKING; PROBLEM INSTANCES; REFERENCE SOLUTION; REVERSE LOGISTICS; VEHICLE ROUTING AND SCHEDULING; VEHICLE SCHEDULING;

VEHICLES;

EID: 84882378497     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1120.0439     Document Type: Article

References (40)

1. Anily S (1996) The vehicle routing problem with delivery and backhaul options. Naval Res. Logist. 43(3):415-434.
2. Bent R, van Hentenryck P (2004) A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Sci. 38(4):515-530.
3. Bräysy O, Dullaert W, Hasle G, Mester D, Gendreau M (2008) An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows. Transportation Sci. 42(3):371-386.
4. Clarke G, Wright JV (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568-581.
5. Dart RC (1983) Success of food backhaul programs could pave way for major expansion. Traffic World 8:19-22.
6. Derigs U, Metz A (1992) A matching-based approach for solving a delivery/pickup vehicle routing problem with time constraints. Oper. Res. Spektrum 14(2):91-106.
7. Duhamel C, Potvin J-Y, Rousseau JM (1997) A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transportation Sci. 31(1):49-59.
8. Ganesh K, Narendran TT (2007) Cloves: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pickup. Eur. J. Oper. Res. 178(3):699-717.
9. Gehring H, Homberger J (1999) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. Proc. EUROGEN 99, University of Jyvaskyla, Finland, 57-64.
10. Gelinas S, Desrochers M, Desrosiers J, Solomon MM (1995) A new branching strategy for time constrained routing problems with application to backhauling. Ann. Oper. Res. 61(1):91-100.
11. Gendreau M, Tarantilis CD (2010) Solving large-scale vehicle routing problems with time windows: The state-of-the-art. Technical report, Université de Motréal.
12. Glover F (1999) Scatter search and path relinking. Corne D, Dorigo M, Glover F, eds. New Ideas in Optimisation (McGraw-Hill, Maidenhead, UK), 297-316.
13. Hasama T, Kokubugata H, Kawashima H (1998) A heuristic approach based on the string model to solve vehicle routing problem with backhauls. 5th World Congress on Intelligent Transport Systems (ITS), Seoul.
14. Hashimoto H, Yagiura M (2008) A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows. van Hemert J, Cotta C, eds. Evolutionary Computation in Combinatorial Optimization, Lecture Notes Computer Science, Vol. 4972 (Springer, Berlin, Heidelberg), 254-265.
15. Ho S, Gendreau M (2006) Path relinking for the vehicle routing problem. J. Heuristics 12(1-2):55-72.
16. Ibaraki T, Imahori S, Nonobe K, Sobue K, Uno T, Yagiura M (2008) Iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Appl. Math. 156(11):2050-2069.
17. Kindervater GAP, Savelsbergh MWP (1998) Vehicle routing: Handling edge exchanges. Aarts E, Lenstra JK, eds. Local Search in Combinatorial Optimization (Wiley, London, UK), 337-360.
18. Kontoravdis G, Bard J (1995) A GRASP for the vehicle routing problem with time windows. ORSA J. Comput. 7(1):10-23.
19. Lim A, Zhang X (2007) A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS J. Comput. 19(3):443-457.
20. Mester D, Braysy O (2005) Active guided evolution strategies for large scale vehicle routing problems with time windows. Comput. Oper. Res. 32(6):1593-1614.
21. Mingozzi A, Giorgi S, Baldacci R (1999) An exact method for the vehicle routing problem with backhauls. Transportation Sci. 33(3):315-329.
22. Nagata Y, Braysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37(4):724-737.
23. Parragh S, Doerner KF, Hartl RF (2008a) A survey on pickup and delivery problems part I: Transportation between customers and depot. J. Betriebswirtschaft 58(1):21-51.
24. Parragh S, Doerner KF, Hartl RF (2008b) A survey on pickup and delivery problems, part II: Transportation between pickup and delivery locations. J. Betriebswirtschaft 58(2):81-117.
25. Pisinger D, Ropke S (2006) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403-2435.
26. Potvin J-Y, Duhamel C, Guertin F (1996) A genetic algorithm for vehicle routing with backhauling. Appl. Intelligence 6(4): 345-355.
27. Prescott-Gagnon E, Desaulniers G, Rousseau L-M (2009) A branchand-price large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4):190-204.
28. Reimann M, Ulrich H (2006) Comparing backhauling strategies in vehiicle routing using ant colony optimization. Central Eur. J. Oper. Res. 14(2):105-123.
29. Reimann M, Doerner K, Hartl RF (2002) Insertion based ants for vehicle routing problems with backhauls and time windows. Ant Algorithms, Lecture Notes Computer Science, Vol. 2463 (Springer, Berlin, Heidelberg), 135-148.
30. Repoussis PP, Tarantilis CD, Ioannou G (2009) Arc-guided evolutionary algorithm for the vehicle routing problem with time windows. IEEE T Evolut. Comput. 13(3):624-647.
31. Repoussis PP, Tarantilis CD, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput. Oper. Res. 37(3):443-455.
32. Ropke S, Pisinger D (2006) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3):750-775.
33. Sbihi A, Eglese RW (2007) Combinatorial optimization and green logistics. 4OR: Quart. J. Oper. Res. 5(2):99-116.
34. Solomon MM (1987) Algorithms for the vehicle routing problem with time window constraints. Oper. Res. 35(2):254-265.
35. Tarantilis CD (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Comput. Oper. Res. 32(9):2309-2327.
36. Thangiah S, Potvin J-Y, Sun T (1996) Heuristic approaches to vehicle routing with backhauls and time windows. Comput. Oper. Res. 23(11):1043-1057.
37. Toth P, Vigo D (1997) An exact algorithm for the vehicle routing problem with backhauls. Transportation Sci. 31(4):372-385.
38. Vidal T, Crainic TG, Gendreau M, Prins C (2011) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Comput. Oper. Res. 40(1):475-489.
39. Yano C, Chan T, Richter L, Cutler T, Murty K, Mcgettigan D (1987) Vehicle routing at Quality Stores. Interfaces 17(2):52-63.
40. Zhong Y, Cole M (2005) A vehicle routing problem with backhauls and time windows: A guided local search solution. Transportation Res. E 41(2):131-144.