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

A shortest path and acquisition method technology, applied in genetic rules, instruments, calculation models, etc., can solve problems such as the complexity of the process of obtaining the shortest path, achieve the effect of improving the superiority of results, reducing matrix dimensions, and avoiding repeated calculations

Inactive Publication Date: 2017-06-13
NAT UNIV OF DEFENSE TECH
View PDF0 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and device for acquiring shortest path in disordered passing of designated point
  • Method and device for acquiring shortest path in disordered passing of designated point
  • Method and device for acquiring shortest path in disordered passing of designated point

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0050] Specific embodiments of the present invention will be further described in detail below. The above and other objects, features and advantages of the present invention will be apparent to those skilled in the art from the detailed description of the present invention.

[0051] figure 1 Shown is a flow chart of a method for obtaining the shortest path passing through the necessary points in an unordered manner according to an embodiment of the present invention. The method for obtaining the shortest path is used to obtain N shortest paths passing through K necessary points, where K and N are both Integers greater than 1 are convenient for use in fields such as intelligent traffic guidance systems. The method for obtaining the shortest path in this embodiment includes at least step S1 to step S5.

[0052] figure 2 Shown is a schematic diagram of the network matrix of an embodiment of the present invention, and the method for obtaining the shortest path of the present i...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06N3/00G06N3/12
CPCG06N3/006G06N3/126
Inventor 王志超
Owner NAT UNIV OF DEFENSE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap