Skip to Main content Skip to Navigation
Conference papers

Memetic Algorithm for two-dimensional loading capacitated vehicle routing problem with time windows

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.
Document type :
Conference papers
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-02497333
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Tuesday, March 3, 2020 - 3:45:46 PM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM

Identifiers

Collections

UTT | CNRS

Citation

Selma Khebbache, Christian Prins, Alice Yalaoui, Mohamed Reghioui. Memetic Algorithm for two-dimensional loading capacitated vehicle routing problem with time windows. Industrial Engineering (CIE39), Jul 2009, Troyes, France. pp.1110-1113, ⟨10.1109/ICCIE.2009.5223786⟩. ⟨hal-02497333⟩

Share

Metrics

Record views

46