Genetic algorithm based method to solve route under constraint of specific points

A genetic algorithm and designated point technology, applied in the direction of genetic rules, calculations, genetic models, etc., can solve the problems of long search time and low precision, reduce the solution space, improve real-time and accuracy

Pending Publication Date: 2017-06-20
XIDIAN UNIV
View PDF0 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] In order to overcome the deficiencies of the above-mentioned prior art, the purpose of the present invention is to provide a routing method based on a genetic algorithm to find a point constraint, which ca

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
  • Genetic algorithm based method to solve route under constraint of specific points
  • Genetic algorithm based method to solve route under constraint of specific points
  • Genetic algorithm based method to solve route under constraint of specific points

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] The present invention is further described below in conjunction with accompanying drawing.

[0045] Such as figure 1 Shown, the concrete implementation process of the present invention comprises the following steps:

[0046] Step 1. Read the network map information,

[0047] The network graph is a weighted directed graph G=(V,E), where V is a set of vertices, E is a set of directed edges, and each directed edge has a weight. Such as image 3 Shown is a schematic topology diagram of the network diagram. The network diagram provides the information with the problem in the form of two files, one is the data (G) of the diagram, and the other is the path information that needs to be calculated. In the data of the network diagram, each row contains the following information: LinkID, SouID, DestID , Cost; Among them, LinkID is the index of the directed edge, SouID is the index of the starting vertex of the directed edge, DestID is the index of the ending vertex of the dire...

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

A genetic algorithm-based routing method under the constraints of designated points is used to solve the technical problems of long search time and heavy path weight in routing selection in communication. The implementation steps are: 1) Read the original network graph information to obtain the adjacency matrix of the network graph and the set of specified points; 2) Preprocess the preprocessing of the network graph to find the starting point, end point and the relationship between the specified points 3) Encoding according to the starting point and specified point information of the network graph, thus transforming the problem into a TSP-like problem; 4) Solving the TSP-like problem by using the improved genetic algorithm to obtain a starting point, an end point and a specified point 5) judging the legitimacy of the path, performing correction processing, and finally obtaining a complete routing path. The invention can effectively reduce the solution space of routing path search, and obtain a better routing path in limited time and resources.

Description

technical field [0001] The invention belongs to the technical field of network graph path search, and in particular relates to a method for searching an optimal path by using an improved genetic algorithm under the constraints of specified points. Background technique [0002] The path planning problem is a traditional combinatorial optimization problem, which has a wide range of practical applications. The more classic path planning problem is to solve the most paths between each point in the network graph. However, with the increase in the scale of the network graph and the demand for high efficiency, in some specific application scenarios, we need to solve the network graph. Shortest path under specified point constraints. [0003] At present, the methods for the shortest path under the constraints of specified points in the network graph mainly include: exhaustive search algorithm, heuristic search method and intelligent search algorithm. [0004] Exhaustive search 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): G06Q10/04G06N3/12
CPCG06Q10/047G06N3/126
Inventor 杨刚姚洪涛姜福义
Owner XIDIAN UNIV
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