A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows

被引:43
作者
Xu, Sheng-Hua [1 ]
Liu, Ji-Ping [1 ]
Zhang, Fu-Hao [1 ]
Wang, Liang [1 ]
Sun, Li-Jian [1 ]
机构
[1] Chinese Acad Surveying & Mapping, Res Ctr Govt GIS, Beijing 100830, Peoples R China
基金
国家高技术研究发展计划(863计划);
关键词
vehicle routing problem; VRPTW; particle swarm optimization; genetic; VARIABLE NEIGHBORHOOD SEARCH; ITERATED LOCAL SEARCH; INERTIA; BRANCH; MODEL; PRICE; CUT;
D O I
10.3390/s150921033
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following.
引用
收藏
页码:21033 / 21053
页数:21
相关论文
共 70 条
[31]   A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application [J].
Ghannadpour, Syed Farid ;
Noori, Simak ;
Tavakkoli-Moghaddam, Reza ;
Ghoseiri, Keivan .
APPLIED SOFT COMPUTING, 2014, 14 :504-527
[32]  
Hao ZF, 2007, PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, P1036
[33]   An iterated local search algorithm for the time-dependent vehicle routing problem with time windows [J].
Hashimoto, Hideki ;
Yagiura, Mutsunori ;
Ibaraki, Toshihide .
DISCRETE OPTIMIZATION, 2008, 5 (02) :434-456
[34]   A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window [J].
Hu, Wenbin ;
Liang, Huanle ;
Peng, Chao ;
Du, Bo ;
Hu, Qi .
ENTROPY, 2013, 15 (04) :1247-1270
[35]   Combinatorial particle swarm optimization (CPSO) for partitional clustering problem [J].
Jarboui, B. ;
Cheikh, M. ;
Siarry, P. ;
Rebai, A. .
APPLIED MATHEMATICS AND COMPUTATION, 2007, 192 (02) :337-345
[36]   A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems [J].
Jarboui, B. ;
Damak, N. ;
Siarry, P. ;
Rebai, A. .
APPLIED MATHEMATICS AND COMPUTATION, 2008, 195 (01) :299-308
[37]   A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem [J].
Jepsen, Mads ;
Spoorendonk, Simon ;
Ropke, Stefan .
TRANSPORTATION SCIENCE, 2013, 47 (01) :23-37
[38]   A dynamic inertia weight particle swarm optimization algorithm [J].
Jiao, Bin ;
Lian, Zhigang ;
Gu, Xingsheng .
CHAOS SOLITONS & FRACTALS, 2008, 37 (03) :698-705
[39]   A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests [J].
Khouadjia, Mostepha R. ;
Sarasola, Briseida ;
Alba, Enrique ;
Jourdan, Laetitia ;
Talbi, El-Ghazali .
APPLIED SOFT COMPUTING, 2012, 12 (04) :1426-1439
[40]   A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation [J].
Kok, A. L. ;
Meyer, C. M. ;
Kopfer, H. ;
Schutten, J. M. J. .
TRANSPORTATION SCIENCE, 2010, 44 (04) :442-454