Advanced Phasmatodea Population Evolution Algorithm for Capacitated Vehicle Routing Problem

被引:3
作者
Zhuang, Jiawen [1 ]
Chu, Shu-Chuan [2 ]
Hu, Chia-Cheng [3 ]
Liao, Lyuchao [1 ]
Pan, Jeng-Shyang [1 ,2 ,4 ]
机构
[1] Fujian Univ Technol, Sch Comp Sci & Math, Fuzhou 350118, Peoples R China
[2] Shandong Univ Sci & Technol, Coll Comp Sci & Engn, Qingdao 266590, Peoples R China
[3] Yango Univ, Coll Artificial Intelligence, Fuzhou 350015, Peoples R China
[4] Chaoyang Univ Technol, Dept Informat Management, Taichung 413310, Taiwan
基金
中国国家自然科学基金;
关键词
FLOWER POLLINATION ALGORITHM; PARTICLE SWARM OPTIMIZATION;
D O I
10.1155/2022/9241112
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Capacitated Vehicle Routing Problem (CVRP) is difficult to solve by the traditional precise methods in the transportation area. The metaheuristic algorithm is often used to solve CVRP and can obtain approximate optimal solutions. Phasmatodea population evolution algorithm (PPE) is a recently proposed metaheuristic algorithm. Given the shortcomings of PPE, such as its low convergence precision, its nature to fall into local optima easily, and it being time-consuming, we propose an advanced Phasmatodea population evolution algorithm (APPE). In APPE, we delete competition, delete conditional acceptance and correspondingevolutionary trend update, and add jump mechanism, history-based searching, and population closing moving. Deleting competition and conditional acceptance and correspondingevolutionary trend update can shorten PPE running time. Adding a jump mechanism makes PPE more likely to jump out of the local optimum. Adding history-based searching and population closing moving improves PPE's convergence accuracy. Then, we test APPE by CEC2013. We compare the proposed APPE with differential evolution (DE), sparrow search algorithm (SSA), Harris Hawk optimization (HHO), and PPE. Experiment results show that APPE has higher convergence accuracy and shorter running time. Finally, APPE also is applied to solve CVRP. From the test results of the instances, APPE is more suitable to solve CVRP.
引用
收藏
页数:20
相关论文
共 50 条
[1]  
Abdel-Raouf Osama, 2014, International Journal of Modern Education and Computer Science, V6, P38, DOI 10.5815/ijmecs.2014.03.05
[2]   Short-Term Traffic Forecasting: An LSTM Network for Spatial-Temporal Speed Prediction [J].
Abduljabbar, Rusul L. ;
Dia, Hussein ;
Tsai, Pei-Wei ;
Liyanage, Sohani .
FUTURE TRANSPORTATION, 2021, 1 (01) :21-37
[3]   Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem [J].
Ai, The Jin ;
Kachitvichyanukul, Voratas .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (01) :380-387
[4]   An improved hybrid firefly algorithm for capacitated vehicle routing problem [J].
Altabeeb, Asma M. ;
Mohsen, Abdulqader M. ;
Ghallab, Abdullatif .
APPLIED SOFT COMPUTING, 2019, 84
[5]  
Atashpaz-Gargari E, 2007, IEEE C EVOL COMPUTAT, P4661, DOI 10.1109/cec.2007.4425083
[6]  
Augerat P, 1995, Tech. Rep. 949-M
[7]  
Beheshti Z., 2013, Int. J. Adv. Soft Comput. Appl., V5, P1
[8]   Transport energy modeling with meta-heuristic harmony search algorithm, an application to Turkey [J].
Ceylan, Huseyin ;
Ceylan, Halim ;
HaIdenbilen, Soner ;
Baskan, Ozgur .
ENERGY POLICY, 2008, 36 (07) :2527-2535
[9]  
Chang JF, 2005, J INF SCI ENG, V21, P809
[10]   Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem [J].
Chen A.-L. ;
Yang G.-K. ;
Wu Z.-M. .
Journal of Zhejiang University-SCIENCE A, 2006, 7 (4) :607-614