Abstract
This work concerns the two-dimensional loading capacitated vehicle routing problem with time windows (2L-CVRPTW). A Memetic Algorithm (MA) is proposed to solve this new problem which combines two NP-hard problems : the two-dimensional packing problem and the vehicle routing problem with time windows. The MA presented in this paper considers the unrestricted case for the packing problem. The quality and the efficiency of the proposed metaheuristic is evaluated using test problems derived from the ones designed by Iori et al. for the case without time windows.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.