Research on Logistics Vehicle Routing Problem Based on Firework Algorithm

Abstract

Aiming at the shortcomings of long time consumption and high transportation cost caused by the lack of reasonable route planning in the distribution of logistics vehicles, a strategy for optimizing logistics vehicle paths using the Improved FireWorks Algorithm (IWFA) is proposed. First, the logistics distribution vehicle model based on time windows is described. Second, On the basis of the firework algorithm, the population initialization based on Bernouilli Shift chaos is used, and the non-core firework radius is optimized by the threshold to prevent individuals from falling into the local optimum. After each iteration, the locust algorithm is used to screen individuals to improve the quality of the solution. In the simulation experiment, compared with the FWA, PSO, and ACO algorithms, the algorithm in this paper has a better advantage in the performance comparison of the benchmark test function. In the comparison of the simulation logistics vehicle routing problem, the algorithm in this paper is in the unit completion time and unit transportation cost. The above has a good advantage.