Title :
Memetic Algorithm for two-dimensional loading capacitated vehicle routing problem with time windows
Author :
Khebbache, S. ; Prins, C. ; Yalaoui, Alice ; Reghioui, Mohamed
Author_Institution :
Univ. of Technol. of Troyes, Troyes, France
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.
Keywords :
computational complexity; traffic engineering computing; vehicles; 2D loading capacitated vehicle routing problem; 2D packing problem; NP-hard problems; memetic algorithm; metaheuristic; time windows; Containers; Costs; Genetic algorithms; Logistics; NP-hard problem; Routing; Testing; Time factors; Transportation; Vehicles; memetic algorithm; time windows; two-dimensional loading capacitated vehicle routing problem;
Conference_Titel :
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
Conference_Location :
Troyes
Print_ISBN :
978-1-4244-4135-8
Electronic_ISBN :
978-1-4244-4136-5
DOI :
10.1109/ICCIE.2009.5223786
