Abstract
In this paper, we consider a new combinatorial optimization problem, namely the two-dimensional loading capacitated vehicle routing problem with mixed backhauls and linehauls (2L-VRPMBL). This is a more complicated but practical extension of the well-known vehicle routing problem with two-dimensional loading constraints (2L-CVRP). Compared with capacitated vehicle routing problem (CVRP) as the routing part in the 2L-CVRP, vehicle routing problem with mixed backhauls and linehauls are considered in the 2L-VRPMBL. Besides, two-dimensional loading constraints are assumed. 2L-VRPMBL aims at finding the minimum cost route set without violating all the related constraints. To solve this problem, a combinatorial packing method utilizing two basic bin packing heuristics is designed to make a specific packing scheme. In the meanwhile, in order to further increase the possibility of finding a feasible packing scheme, the packing method is integrated into a random local search process and is repeatedly called. Furthermore, an evolutionary algorithm with enhanced local search ability and broader search space is presented for routing. Finally, the packing heuristic method and evolutionary algorithm are integrated into a large evolutionary neighbourhood search framework. The effectiveness of the proposed algorithm is verified by conducting experiments on the new 2L-VRPMBL benchmark instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Burke, E.K., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. 52(4), 655–671 (2004)
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)
Dominguez, O., Guimarans, D., Juan, A.A., de la Nuez, I.: A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls. Eur. J. Oper. Res. 255(2), 442–462 (2016)
Dominguez, O., Juan, A.A., Barrios, B., Faulin, J., Agustin, A.: Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet. Ann. Oper. Res. 236(2), 383–404 (2016)
Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Netw. Int. J. 51(1), 4–18 (2008)
Iori, M., Salazar-González, J.J., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp. Sci. 41(2), 253–264 (2007)
Koç, Ç., Laporte, G.: Vehicle routing with backhauls: Review and research perspectives. Comput. Oper. Res. 91, 79–91 (2018)
Leung, S.C., Zhang, Z., Zhang, D., Hua, X., Lim, M.K.: A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. Eur. J. Oper. Res. 225(2), 199–210 (2013)
Leung, S.C., Zheng, J., Zhang, D., Zhou, X.: Simulated annealing for the vehicle routing problem with two-dimensional loading constraints. Flex. Serv. Manuf. J. 22(1–2), 61–82 (2010)
Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11(4), 345–357 (1999)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)
Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, Pennsylvania (2002)
Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611–624 (2012)
Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: 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 (2013)
Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658–673 (2014)
Wei, L., Zhang, Z., Zhang, D., Leung, S.C.: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 265(3), 843–859 (2018)
Wei, L., Zhang, Z., Zhang, D., Lim, A.: A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 243(3), 798–814 (2015)
Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T.: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 195(3), 729–743 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, Y., Liu, C., Chen, H. (2021). An Enhanced Evolutionary Algorithm for the Two-Dimensional Loading Capacitated Vehicle Routing Problem with Mixed Backhauls and Linehauls. In: Meng, H., Lei, T., Li, M., Li, K., Xiong, N., Wang, L. (eds) Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery. ICNC-FSKD 2020. Lecture Notes on Data Engineering and Communications Technologies, vol 88. Springer, Cham. https://doi.org/10.1007/978-3-030-70665-4_83
Download citation
DOI: https://doi.org/10.1007/978-3-030-70665-4_83
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-70664-7
Online ISBN: 978-3-030-70665-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)