A Vehicle Routing Problem Planning Method with Hard Time Window Based on Fireworks Algorithm

Abstract

The invention relates to a vehicle route problem planning method with a hard time window based on the fireworks algorithm. Two initial populations are respectively constructed according to different rules, so that the search space after the explosion of the fireworks is larger, and more can be searched in the solution space. The feasible solution of the initial stage has a fast convergence speed; secondly, the construction of the initial solution is divided into four stages, that is, the minimum number of vehicles is partitioned according to different rules, the initial path is generated, and the constraint test is performed on the generated path. The client points are adjusted to generate an initial feasible solution. Effectively reduce the generation of redundant paths. Increase the cross operation between sparks of different populations in the parallel optimization process of dual populations. In each generation of fireworks, the fireworks to be exploded in one population and the optimal fireworks of another population are randomly selected to perform the explosion operation, which makes full use of other fireworks with better fitness values ​​in each generation and increases the diversity of the population.

Description

technical field [0001] The invention relates to the field of vehicle route planning, in particular to a vehicle route optimization method based on fireworks algorithm. Background technique [0002] Vehicle routing problem is one of the most important and widely studied combinatorial optimization problems, which belongs to NP-hard problem. Research at the present stage pays more and more attention to the complexity of the delivery process, and develops a large number of multi-constraint vehicle routing problems. Among them, the vehicle routing problem with a hard time window needs to consider the number of vehicles delivered, the timeliness of service, and the driving distance of the vehicle at the same time. In particular, it is required that each task must be completed within a specified time window. Therefore, how to design an algorithm to obtain a better path becomes difficult. [0003] The development of swarm intelligence provides ideas for solving path planning probl...

AI Technical Summary

Problems solved by technology

[0004] A vehicle routing problem planning method with a hard time window based on the fireworks algorithm of the present invention aims at the above-mentioned problems in solving the vehicle routing problem with a hard time window by the fireworks algorithm, that is, redundant paths are easily generated during the initial path generation process As well as the problem of insufficient utilization of other fireworks with better fitness values ​​in the population, an improved fireworks algorithm is proposed

Images