Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier

Journal of the Operational Research Society

Volumn 62, Issue 2, 2011, Pages 326-336

  Potvin, J Y ^a   Naud, M A ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

common carrier; ejection chains; private fleet; tabu search; vehicle routing

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; TABU SEARCH; VEHICLE ROUTING; VEHICLES;

COMMON CARRIERS; EJECTION CHAIN; HETEROGENEOUS FLEET; NEIGHBOURHOOD; PRIVATE FLEET; STRUCTURE-BASED; TABU SEARCH HEURISTIC; VEHICLE ROUTING PROBLEMS;

FLEET OPERATIONS;

EID: 78650399170     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2010.102     Document Type: Article

References (18)

1. Ahuja RK, Magnanti TL and Orlin JB (1993). Network Flows: Theory, Algorithms, and Applications. Prentice-Hall: Englewood Cliffs, NJ.
2. Bienstock D, Goemans MX, Simchi-Levi D and Williamson D (1993). A note on the prize collecting traveling salesman problem. Math Program 59: 413-420.
3. Bolduc M-C, Renaud J and Boctor F (2007). A heuristic for the routing and carrier selection problem. Eur J Opl Res 183: 926-932.
4. Bolduc M-C, Renaud J, Boctor F and Laporte G (2008). A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J Opl Res Soc 59: 776-787.
5. Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P and Sandi C (eds). Combinatorial Optimization. Wiley: Chichester, UK, pp 315-338.
6. Chu C-W (2005). A heuristic algorithm for the truckload and lessthan- truckload problem. Eur J Opl Res 165: 657-667.
7. Cordeau J-F, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30: 105-119. (Pubitemid 127360996)
8. Côté J-F and Potvin J-Y (2009). A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. Eur J Opl Res 198: 464-469.
9. Diabi M and Ramesh R (1995). The distribution problem with carrier service: A dual based penalty approach. ORSA J Comput 7: 24-35.
10. Glover F (1966). Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl Math 65: 223-253.
11. Glover F and Laguna M (1997). Tabu Search. Kluwer: Boston.
12. Golden BL, Wasil EA, Kelly JP and Chao I-M (1998). The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem tests and computational results. In: Crainic TG and Laporte G (eds). Fleet Management and Logistics. Kluwer: Boston, pp 33-56.
13. Lin S (1965). Computer solutions of the traveling salesman problem. Bell Syst Tech J 44: 2245-2269.
14. Noon CE and Bean JC (1991). A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Opl Res 39: 623-632.
15. Renaud J, Boctor FF and Laporte G (1996). A fast composite heuristic for the symmetric traveling salesman problem. ORSA J Comput 8: 134-143.
16. Taillard É D (1993). Parallel iterative search methods for vehicle routing problems. Networks 23: 661-673.
17. Thompson PM and Psaraftis HN (1993). Cyclic transfer algorithm for multivehicle routing and scheduling problems. Opl Res 41: 935-946.
18. Volgenant T and Jonker R (1987). On some generalizations of the travelling-salesman problem. J Opl Res Soc 38: 1073-1079.