A tabu search heuristic for the vehicle routing problem with private fleet and common carrier

European Journal of Operational Research

Volumn 198, Issue 2, 2009, Pages 464-469

  Côté, Jean François ^a   Potvin, Jean Yves ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Common carrier; Private fleet; Tabu search; Vehicle routing

Indexed keywords

COST ACCOUNTING; HEURISTIC ALGORITHMS; HEURISTIC METHODS; NETWORK ROUTING; OPERATING COSTS; ROUTING ALGORITHMS; TABU SEARCH; VEHICLE ROUTING; VEHICLES;

COMMON CARRIER; FIXED COSTS; PRIVATE FLEET; TABU SEARCH HEURISTIC; TOTAL COSTS; VEHICLE ROUTING PROBLEMS;

FLEET OPERATIONS;

EID: 63349100413     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.09.009     Document Type: Article

References (17)

1. Balas E. The prize collecting traveling salesman problem. Networks 19 (1989) 621-636
2. Bienstock D., Goemans M.X., Simchi-Levi D., and Williamson D. A note on the price collecting traveling salesman problem. Mathematical Programming 59 (1993) 413-420
3. M.C. Bolduc, J. Renaud, F. Boctor, A heuristic for the routing and carrier selection problem. Technical Report 2006-006, Faculté des Sciences de l'Administration, Université Laval, Québec, Canada, 2006.
4. Bolduc M.C., Renaud J., Boctor F., and Laporte G. A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. Journal of the Operational Research Society 59 (2008) 776-787
5. Christofides N., Mingozzi A., and Toth P. The vehicle routing problem. In: Christofides N., Mingozzi A., Toth P., and Sandi C. (Eds). Combinatorial Optimization (1979), Wiley, Chichester, UK 315-338
6. Chu C.W. A heuristic algorithm for the truckload and less-than-truckload problem. European Journal of Operational Research 165 (2005) 657-667
7. Cordeau J.F., Gendreau M., and Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30 (1997) 105-119
8. Cordeau J.F., Laporte G., and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52 (2001) 928-936
9. Diabi M., and Ramesh R. The distribution problem with carrier service: A dual based penalty approach. ORSA Journal on Computing 7 (1995) 24-35
10. Gendreau M., Hertz A., and Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40 (1994) 1086-1094
11. Glover F., and Laguna M. Tabu Search (1997), Kluwer, Boston
12. Golden B.L., Wasil E.A., Kelly J.P., and Chao I.M. The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem tests and computational results. In: Crainic T.G., and Laporte G. (Eds). Fleet Management and Logistics (1998), Kluwer, Boston 33-56
13. Klincewicz J.G., Luss H., and Pilcher M.G. Fleet size planning when outside carrier services are available. Transportation Science 24 (1990) 169-182
14. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
15. Renaud J., Boctor F., and Laporte G. A fast composite heuristic for the symmetric traveling salesman problem. ORSA Journal on Computing 8 (1996) 134-143
16. Taillard E.D. Parallel iterative search methods for vehicle routing problems. Networks 23 (1993) 661-673
17. Volgenant T., and Jonker R. On some generalizations of the travelling-salesman problem. Journal of the Operational Research Society 38 (1987) 1073-1079