Method of using reuse strategy-based intelligent swarm algorithm to optimize dynamic traveling salesman problem (TSP)

A traveling salesman problem and technology of traveling salesman, applied in computing, data processing applications, forecasting, etc., can solve problems such as NP-hard combinatorial optimization, algorithms that are difficult to solve, and cannot be solved

Active Publication Date: 2018-05-18
SOUTH CHINA UNIV OF TECH
View PDF3 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Most of these problems are NP-hard combinatorial optimization problems, some traditional algorithms are difficult or impossible to solve, and the ant colony algorithm provides an effective means for solving these problems

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 of using reuse strategy-based intelligent swarm algorithm to optimize dynamic traveling salesman problem (TSP)
  • Method of using reuse strategy-based intelligent swarm algorithm to optimize dynamic traveling salesman problem (TSP)
  • Method of using reuse strategy-based intelligent swarm algorithm to optimize dynamic traveling salesman problem (TSP)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0054] In this embodiment, the set-based particle swarm algorithm and ant colony algorithm are combined with the reuse strategy and applied to the optimization of the dynamic traveling salesman. The content of the invention can be mainly divided into the modeling of dynamic traveling salesman and the reuse strategy of historical search information.

[0055] 1) Modeling of dynamic traveling salesman:

[0056] exist figure 1 In the partial map shown, there are a total of 12 access nodes (a-l), assuming two situations:

[0057] i) When an unexpected event (traffic accident, road failure) occurs on the original shortest path (red dotted line) from h to a, the red solid line will become the current shortest path from h to a;

[0058] ii) In some cases, since point l does not need to be visited, the visit order of the original three nodes f, i, l changes from f→l→i to f→i, thus directly skipping node l. Based on these two real situations, this embodiment models them respectively ...

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 discloses a method of using a reuse strategy-based intelligent swarm algorithm to optimize a dynamic traveling salesman problem (TSP). A traditional traveling salesman problem needs finding of a Hamiltonian circuit with a least cost in a static searching space, but actually, certain application which is in a real world and can use the traveling salesman problem as models is not all static, and city sets and weight matrices in the problem models thereof dynamically change. In dynamic environments, a searching result in a last environment can be reused by a swarm under a new environment and is thus learned, thus a searching space of the problem can be reduced, and thus the algorithm is enabled to obtain a better path by searching in shorter time. The invention provides a dynamic travel-salesman modeling method with more realistic meaning and a strategy of reusing historical searching results. In experiment, dynamic performance of the optimization method is tested through setting different-degree changes of environments, and it is proved that the optimization method is reasonable and effective under all the different dynamic environments.

Description

technical field [0001] The invention relates to the technical field of dynamic traveling salesman modeling and intelligent computing, in particular to a method for optimizing a dynamic traveling salesman problem by using an intelligent group algorithm based on a reuse strategy. Background technique [0002] The Traveling Salesman Problem (TSP) has been considered as a classic combinatorial optimization problem since it was proposed. The salesperson needs to find a route from a certain city node in a fixed undirected graph G={V,A,W} Start from the point and traverse all other city nodes once, and finally return to the shortest Hamiltonian circuit at the starting point, where V represents a set of given nodes (in different problem models, the representative objects of the nodes are different), and A represents the graph The set of all undirected edges in , W is the weight matrix about the undirected graph G. The value of each element in the matrix represents the distance from...

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/04
CPCG06Q10/047
Inventor 张军陈伟能詹志辉
Owner SOUTH CHINA UNIV OF 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