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 条
[1]   A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].
Ai, The Jin ;
Kachitvichyanukul, Voratas .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1693-1702
[2]   A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows [J].
Alvarenga, G. B. ;
Mateus, G. R. ;
de Tomi, G. .
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (06) :1561-1584
[3]   Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls [J].
Anbuudayasankar, S. P. ;
Ganesh, K. ;
Koh, S. C. Lenny ;
Ducq, Yves .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (03) :2296-2305
[4]  
[Anonymous], 2009, INT J OPER RES
[5]  
[Anonymous], INT C SUST POW GEN S
[6]   Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows [J].
Archetti, C. ;
Bouchard, M. ;
Desaulniers, G. .
TRANSPORTATION SCIENCE, 2011, 45 (03) :285-298
[7]  
Asl V. M., 2012, ADV INTELLIGENT TRAN, V1, P19
[8]   An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles [J].
Azi, Nabila ;
Gendreau, Michel ;
Potvin, Jean-Yves .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :756-763
[9]   An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows [J].
Balseiro, S. R. ;
Loiseau, I. ;
Ramonet, J. .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (06) :954-966
[10]   A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows [J].
Banos, Raul ;
Ortega, Julio ;
Gil, Consolacion ;
Marquez, Antonio L. ;
de Toro, Francisco .
COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 65 (02) :286-296