A TSP problem path planning method

A path planning and problem-solving technology, applied in the field of TSP problem path planning, can solve problems such as path difference, multi-segment path intersection, and premature convergence

Pending Publication Date: 2019-06-28
DONGHUA UNIV
View PDF0 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the traditional genetic algorithm has disadvantages such as slow convergence speed, easy premature convergence, and easy to fall into local optimum. When solving the TSP problem, the path obtained is relatively poor, or there are unreasonable situations such as multi-segment path intersection.

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
  • A TSP problem path planning method
  • A TSP problem path planning method
  • A TSP problem path planning method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] Below in conjunction with specific embodiment, further illustrate the present invention. It should be understood that these examples are only used to illustrate the present invention and are not intended to limit the scope of the present invention. In addition, it should be understood that after reading the teachings of the present invention, those skilled in the art can make various changes or modifications to the present invention, and these equivalent forms also fall within the scope defined by the appended claims of the present application.

[0037] Embodiments of the present invention relate to a TSP problem path planning method, and the algorithm flow is as follows figure 1 As shown, it includes the following steps: initialize the parameters required by the algorithm, and initialize the number of iterations as gn1, the maximum number of iterations GN max ; Read the location information of the cities, and calculate the distance between the cities; use the greedy a...

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 invention relates to a TSP problem path planning method. The method comprises the following steps: initializing; reading the position and calculating the distance; initializing a population through a greedy algorithm; replacing the worst individuals with randomly generated individuals; calculating the fitness; selecting; crossing; performing variation; randomly performing simulated annealing on the plurality of individuals; calculating the fitness; giving the contemporary optimal solution and the variant solution thereof to the first individual and the second individual respectively; and iterating until the termination condition is met. The population generated by the greedy algorithm has randomness and high quality, and optimization can be accelerated. A plurality of worst individualsare replaced by randomly generated individuals, so that the influence of differential solutions is reduced, and precocity is avoided. Some better solutions can be found through simulated annealing, and precocity and local optimization are avoided. The storage of the optimal solution and the variant solution of the optimal solution retains excellent information and increases population diversity.According to the invention, a shortest access path can be effectively and quickly planned, so that the method is an effective method capable of providing path planning for the TSP problem.

Description

technical field [0001] The invention relates to a path planning method for a TSP problem, belonging to the technical fields of combination optimization and path planning. Background technique [0002] The traveling salesman problem, or TSP problem (Traveling Salesman Problem), is a well-known NP-hard problem in the field of combinatorial optimization, that is, its time complexity in the worst case increases exponentially with the increase of the problem size, so far An efficient algorithm in polynomial time has not yet been found. The TSP problem is generally described as: a traveling salesman wants to visit a given n cities, starting from the starting point, each city must be visited and can only be visited once, and finally returning to the starting point, it is necessary to plan a shortest visiting path that includes all n cities. The TSP problem is not just a traveling salesman problem, many other problems in real life, such as printed circuit drilling, optimization of ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/04G06N3/12
Inventor 徐鑫沈波
Owner DONGHUA 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