Method and device for acquiring shortest path in disordered passing of designated point

Abstract

The present invention proposes a method and device for acquiring the shortest path through the necessary points without order. The method includes the following steps: calculating the starting point to any necessary point, any necessary point to the end point and pairwise The shortest path length and path between the necessary points; initialize UN population individuals, the individual length is K, and fill it with the serial number of each necessary point; calculate the path and path length of each individual in the population, and carry out the population according to the path length Sort and take N best paths; take a certain proportion of individuals from the population, generate them according to the cross mutation rules, and generate a new generation of feasible solutions as a new population; when the number of iterations reaches the preset number, output N optimal solutions . The present invention generates a new generation of feasible solutions as a new population, which can effectively ensure the possibility that the new generation of populations is better than the previous generation of populations, and can stop and use the current optimal solution at any time.

Description

technical field [0001] The present invention mainly relates to the field of obtaining the shortest path, and in particular, relates to a method and device for obtaining the shortest path passing through necessary points in disorder. Background technique [0002] The shortest path problem is a kind of network optimization problem that is widely valued and studied. It is widely used in computer science, traffic engineering, communication engineering, operations research, information theory, control theory, military and many other fields. It provides the basis for studying more complex network flow problems and is one of the subproblems to solve many other complex network optimization problems. [0003] The traditional shortest path problem is a simple model with fixed start and end points. The algorithm used to solve the shortest path problem is called the shortest path algorithm. The most commonly used shortest path algorithms are: Dijkstra algorithm, A* algorithm, SPFA alg...

AI Technical Summary

Problems solved by technology

[0005] In view of this, the object of the present invention is to provide a method for acquiring the shortest path through the necessary points in an disordered manner, so as to solve the defect that the process of obtaining the shortest path is complicated in the prior art

Images