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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
