DocumentCode :
1781559
Title :
Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints
Author :
Abdal-Hammed, Moudher Kh ; Hifi, Mhand ; Lei Wu
Author_Institution :
EPROAD Lab., Univ. of Picardie Jules Verne, Amiens, France
fYear :
2014
fDate :
3-5 Nov. 2014
Abstract :
In this paper we investigate the use of the large neighborhood search for solving the vehicle routing problem with two-dimensional loading constraints, an NP-hard combinatorial optimization problem. Such a problem may be viewed as the combination of two complementary well-known problems: two-dimensional bin-packing and capacitated vehicle routing. The proposed method considers a two-phase solution procedure: a first phase generates a placement order and applies a bottom-left strategy to this order for packing the items in the vehicle and, a second phase is applied for reaching a feasible routing. Both phases are combined by using a diversification strategy. The proposed method has been evaluated on Gendreau´s benchmark instances. The obtained results are compared to those reached by the best methods taken from the literature. Encouraging results have been obtained.
Keywords :
computational complexity; search problems; vehicle routing; 2L-CVRP; Gendreau benchmark instances; NP-hard combinatorial optimization problem; diversification strategy; neighborhood search; vehicle routing problem with two-dimensional loading constraints; Benchmark testing; Loading; Routing; Search problems; Standards; Vehicle routing; Vehicles; Bin-packing; neighborhood; optimization; routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control, Decision and Information Technologies (CoDIT), 2014 International Conference on
Conference_Location :
Metz
Type :
conf
DOI :
10.1109/CoDIT.2014.6996867
Filename :
6996867
Link To Document :
بازگشت