Improved genetic algorithm-based traveling salesman problem solving method
A technique for improving genetic algorithm and traveling salesman problem, which is applied in the field of genetic algorithm to achieve high efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0037] Such as figure 1 As shown, the present invention provides a method for solving the traveling salesman problem based on the improved genetic algorithm, and its main steps are as follows.
[0038] 1) Coding; 2) Setting of initial population; 3) Setting of fitness function and calculation of population fitness; 4) Genetic operation (selection, crossover, mutation); Parameters to stop at time, including population size, crossover probability, mutation probability, maximum number of iterations, etc.). The text description of the algorithm flow is as follows:
[0039] Step 1: For a given problem, determine the coding form of the problem and code the problem; the present invention is aimed at the TSP problem, and the path is coded using a decimal number string, and on its search space U, the fitness function f(x) is defined, And define the population size N, crossover probability P c , the mutation probability P m , and the number of iterations T;
[0040] Step 2: In U, r...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com