Multi-link competitive optimization algorithm

Abstract

The invention relates to the field of path planning methods, in particular to a multi-link competitive optimization algorithm. The algorithm comprises the following steps: generating a plurality of relatively stable and reliable initial bottom blank schemes by utilizing a plurality of existing path planning algorithms, and simultaneously introducing a plurality of relatively independent links to optimize each bottom blank scheme respectively, and breaking through a part of routes of an original theme to perform the partial optimization; then the result is evaluated by an evaluation program, comparison competition is carried out, the scheme which cannot achieve the ideal effect is discarded, and other schemes are used as bottom blank schemes to continue to be optimized. High concurrency andhigh starting point guarantee convergence speed, and life cycle management is introduced, so that the survival time of the bottom embryo can be eliminated to help jump out of a local optimal solution.

Description

technical field [0001] The invention relates to the field of path planning methods, in particular to a multi-link competitive optimization algorithm. Background technique [0002] According to industry data, my country's urban distribution market exceeds one trillion yuan, with an annual growth rate of more than 10%, but the vast majority of enterprises still rely on manual wiring. With the increase in transportation demand, it has become normal to spend hours and days arranging cables at a time, and the timeliness is poor. Even after the manual arrangement is completed, rework is caused due to changes in demand or vehicle resources. The wiring results are unstable, the transportation cost is uncontrollable, and the cost of the solution depends heavily on the experience and luck of the wiring personnel. Poor customer experience, time window requirements, peer requirements, split times limit, driving time limit, passing point limit, loading delay limit, multi-vehicle type, m...

AI Technical Summary

Problems solved by technology

Poor customer experience, time window requirements, peer requirements, split times limit, driving time limit, passing point limit, loading delay limit, multi-vehicle type, multi-temperature zone, etc. It is difficult to meet all the needs, and it is difficult to come up with an excellent solution. Completed NP-hard problem

Even the traditional wiring algorithms with the help of computer operations, such as genetic algorithm, ant colony algorithm, etc., still have the problem of slow convergence speed and easy to fall into local optimum. big important factor

Images