Abstract
In this paper we address the Swap-Body Vehicle Routing Problem (SB-VRP), a variant of the truck and trailer routing problem. It was introduced in the VeRoLog Challenge 2014. We develop a solution approach that we coin Relax-and-Repair. It consists in solving a relaxed version of the SB-VRP and deriving a feasible solution by repairing the relaxed one. We embed this approach within a population-based heuristic. During computation we store all feasible routes in order to derive better solutions by solving a set-partitioning problem. In order to take advantages of nowadays multi-core machines, our algorithm is designed as a collaborative parallel population-based heuristic. Experimental results show that our relax-and-repair algorithm is very competitive and point the impact of each phase on the quality of the obtained solutions. The advantage of our approach is that it can be adapted to solve complex industrial routing problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
EURO Working Group on Vehicle Routing and Logistics Optimization (www.verolog.eu).
PTV is a German company operating worldwide that offers software, data, content, consulting and research (www.ptvgroup.com).
References
Cattaruzza, D., Absi, N., Feillet, D., & Vidal, T. (2014). A memetic algorithm for the Multi Trip Vehicle Routing Problem. European Journal of Operational Research, 236(6), 833–848.
Chao, I.-M. (2002). A tabu search method for the truck and trailer routing problem. Computers & Operations Research, 29(1), 33–51.
Cordeau, J.-F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52, 928–936.
Drexl, M. (2012). Applications of the vehicle routing problem with trailers and transshipments. European Journal of Operational Research, 227(2), 275–283.
Duhamel, C., Gouinaud, C., Lacomme, P., & Prodhon, C. (2013). A multi-thread graspxels for the heterogeneous capacitated vehicle routing problem. In E.-G. Talbi (Ed.), Hybrid Metaheuristics - Studies in Computational Intelligence (Vol. 434, pp. 237–269). Berlin: Springer.
Gerdessen, J. C. (1996). Vehicle routing problem with trailers. European Journal of Operational Research, 93(1), 135–147.
Huber, S., & Geiger, M. J. (2014) Swap body vehicle routing problem: A heuristic solution approach. In Computational Logistics (pp. 16–30). Berlin: Springer.
Irnich, S. (2008). A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS Journal on Computing, 20(2), 270–287.
Lin, S.-W., Yu, V. F., & Chou, S.-Y. (2009). Solving the truck and trailer routing problem based on a simulated annealing heuristic. Computers & Operations Research, 36(5), 1683–1692.
Lin, S.-W., Yu, V. F., & Chou, S.-Y. (2010). A note on the truck and trailer routing problem. Expert Systems with Applications, 37(1), 899–903.
Lum, O., Chen, P., Wang, X., Golden, B., & Wasil, E. (2015) A Heuristic approach for the swap-body vehicle routing problem. In 14th INFORMS Computing Society Conference, pp. 172-187.
Mendoza, J. E., & Villegas, J. G. (2013). A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optimization Letters, 7(7), 1503–1516.
Miranda-Bront, J.-J., Curcio, B., Méndez-Díaz, I., Montero, A., Pousa, F., & Zabala, P. (2015). A cluster-first route-second approach for the Swap Body Vehicle Routing Problem.
Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31(12), 1985–2002.
Scheuerer, S. (2006). A tabu search heuristic for the truck and trailer routing problem. Computers & Operations Research, 33(4), 894–909.
Semet, F. (1995). A two-phase algorithm for the partial accessibility constrained vehicle routing problem. Annals of Operations Research, 61(1), 45–65.
Semet, F., & Taillard, E. (1993). Solving real-life vehicle routing problems efficiently using tabu search. Annals of Operations research, 41(4), 469–488.
Toth, P., & Vigo, D. (2003). The granular tabu search and its application to the vehicle routing problem. INFORMS Journal of Computing, 15(4), 333–346.
Vaz Penna, P. H., Subramanian, A., & Ochi, L. S. (2013). An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19(2), 201–232.
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012). A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Operations Research, 60(3), 611–624.
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Computers & Operations Research, 40(1), 475–489.
Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., & Velasco, N. (2010). Grasp/vnd and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Engineering Applications of Artificial Intelligence, 23(5), 780–794.
Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., & Velasco, N. (2011). A grasp with evolutionary path relinking for the truck and trailer routing problem. Computers & Operations Research, 38(9), 1319–1334.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Absi, N., Cattaruzza, D., Feillet, D. et al. A relax-and-repair heuristic for the Swap-Body Vehicle Routing Problem. Ann Oper Res 253, 957–978 (2017). https://doi.org/10.1007/s10479-015-2098-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-015-2098-8