Memetic Algorithm for two-dimensional loading capacitated vehicle routing problem with time windows - Université de technologie de Troyes Access content directly
Conference Papers Year : 2009

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.
No file

Dates and versions

hal-02497333 , version 1 (03-03-2020)

Identifiers

Cite

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⟩

Collections

CNRS UTT LOSI
13 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More