Unlock instant, AI-driven research and patent intelligence for your innovation.

Discrete cuckoo algorithm-based traveling salesman problem solving method

A technology of traveling salesman problem and discrete cuckoo, which is applied in the field of solving traveling salesman problem, can solve problems such as slow convergence speed and difficulty in obtaining the global optimal solution, and achieve the effect of improving the retrieval range and improving the optimization efficiency

Inactive Publication Date: 2018-05-08
GUILIN UNIV OF ELECTRONIC TECH
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] What the present invention aims to solve is the problem that the common cuckoo algorithm is difficult to obtain the global optimal solution and the convergence speed is slow when solving the traveling salesman problem, and a method for solving the traveling salesman problem based on the discrete cuckoo algorithm is provided

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
  • Discrete cuckoo algorithm-based traveling salesman problem solving method
  • Discrete cuckoo algorithm-based traveling salesman problem solving method
  • Discrete cuckoo algorithm-based traveling salesman problem solving method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0047] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in combination with specific examples and with reference to the accompanying drawings.

[0048] A method for solving the traveling salesman problem based on the discrete cuckoo algorithm, such as figure 1 As shown, its specific steps are as follows:

[0049] Step 1. Set the parameters of the algorithm, including the number of bird's nests, the number of solutions in the candidate set, the probability of the bird's nest being found and the total number of iterations.

[0050] In the present embodiment, the number of bird's nests is set to be 20; the number of solutions in the candidate set is 20; the probability that the bird's nest is found is 20%; the total number of iterations, that is, the maximum number of iterations, is 500, and the iteration is defined in the early stage 0-50 times, 50-350 times in the mi...

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 discrete cuckoo algorithm-based traveling salesman problem solving method. Based on a discrete cuckoo algorithm, a tabu search algorithm is added; the tabu search is used forcontrolling the step length in a cuckoo search process; an expected cuckoo-tabu search algorithm can eliminate a few deficiencies existent in the cuckoo and tabu search algorithms, so that the process of falling into a local optimal solution can be avoided and the repeated search of the algorithm is reduced; and in addition, the quality of tabu search and cuckoo search solutions depends on an neighborhood structure to a very great extent, and due to the randomness of a k-opt algorithm, the algorithm is very difficult to quickly converge again in a later period, so that the neighborhood limitation structure is arranged in the later period of iteration, and the structure can eliminate a certain amount of randomness, namely, low-quality edge selection is avoided; and by using an adaptive dynamic neighborhood, the cut edge selection of the k-opt algorithm is adjusted, so that the local search capability of the algorithm is improved.

Description

technical field [0001] The invention relates to the technical field of solving the traveling salesman problem, in particular to a method for solving the traveling salesman problem based on the discrete cuckoo algorithm. Background technique [0002] The traveling salesman problem is a classic combinatorial optimization problem proposed by Dantzig in 1959. The concept can be illustrated by the following example: a traveling salesman starts from a city, visits all the cities in the list, and visits each city only once, and finally returns to the city where he first started. Minimum distance. The traveling salesman problem can be assimilated into other combinatorial optimization problems, such as vehicle routing problem, loading and unloading problem, logistics distribution problem, circuit board drilling problem and so on. [0003] The cuckoo search algorithm is a heuristic bionic swarm intelligent optimization algorithm realized by simulating the biological behavior of cuck...

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/00
CPCG06Q10/047G06N3/006
Inventor 张红梅陈雷张向利
Owner GUILIN UNIV OF ELECTRONIC TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com