Open AccessLogistics Route Optimization Based on Improved Particle Swarm Optimization
Author(s) -
Zunhai Gao,
Hongxia Lu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1995/1/012044
Subject(s) - particle swarm optimization , mathematical optimization , inertia , piecewise linear function , convergence (economics) , multi swarm optimization , computer science , optimization problem , rate of convergence , algorithm , mathematics , computer network , channel (broadcasting) , physics , geometry , classical mechanics , economics , economic growth
An improved particle swarm optimization (PSO) algorithm is presented by dynamically adjusting the inertia weight in the iterative process of PSO, and it is used to solve the problem of logistics route optimization. This algorithm can not only improve the convergence speed, but also avoid falling into local optimum. In the process of improving the standard algorithm, two methods are proposed to adjust the inertia weight value according to the number of iterations. One is piecewise linear decreasing, another is linear decreasing. The results show that linear decline is better than piecewise linear decline to achieve the purpose of optimization, which is more conducive to accelerate the convergence rate and enhance the ability of optimization. Through the simulation experiment of the specific vehicle routing optimization problem, the results show that after the improvement, the optimization performance is enhanced, the optimization speed is accelerated, and the complexity is not increased, which greatly improves the performance of the original algorithm.