Abstract
The problem reported in this paper is a variant of the classical vehicle routing problem, where customer requests for a transportation company can be served either by its private fleet of vehicles or assigned to an external common carrier. The latter case occurs if the demand exceeds the total capacity of the private fleet or if it is more economical to do so. Accordingly, the objective is to minimize the variable and fixed costs of the private fleet plus the costs charged by the common carrier. A tabu search heuristic with a neighbourhood structure based on ejection chains is proposed to solve this problem. It is empirically demonstrated that this algorithm outperforms the best approaches reported in the literature on a set of benchmark instances with both homogeneous and heterogeneous fleets.
This is a preview of subscription content, log in via an institution to check access.
References
Ahuja RK, Magnanti TL and Orlin JB (1993). Network Flows: Theory, Algorithms, and Applications. Prentice-Hall: Englewood Cliffs, NJ.
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.
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.
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.
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.
Chu C-W (2005). A heuristic algorithm for the truckload and less-than-truckload problem. Eur J Opl Res 165: 657–667.
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.
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.
Diabi M and Ramesh R (1995). The distribution problem with carrier service: A dual based penalty approach. ORSA J Comput 7: 24–35.
Glover F (1966). Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl Math 65: 223–253.
Glover F and Laguna M (1997). Tabu Search. Kluwer: Boston.
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.
Lin S (1965). Computer solutions of the traveling salesman problem. Bell Syst Tech J 44: 2245–2269.
Noon CE and Bean JC (1991). A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Opl Res 39: 623–632.
Renaud J, Boctor FF and Laporte G (1996). A fast composite heuristic for the symmetric traveling salesman problem. ORSA J Comput 8: 134–143.
Taillard ÉD (1993). Parallel iterative search methods for vehicle routing problems. Networks 23: 661–673.
Thompson PM and Psaraftis HN (1993). Cyclic transfer algorithm for multivehicle routing and scheduling problems. Opl Res 41: 935–946.
Volgenant T and Jonker R (1987). On some generalizations of the travelling-salesman problem. J Opl Res Soc 38: 1073–1079.
Acknowledgements
Financial support for this work was provided by the Canadian Natural Sciences and Engineering Research Council. This support is gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Potvin, JY., Naud, MA. Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier. J Oper Res Soc 62, 326–336 (2011). https://doi.org/10.1057/jors.2010.102
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2010.102