Order crossover multi-filial-generation genetic algorithm for solving traveling salesman problem
A technique of traveling salesman problem and genetic algorithm, applied in the field of applied artificial intelligence
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Example Embodiment
[0077] The embodiments of the present invention will be described in detail below in conjunction with the drawings.
[0078] The sequential cross multi-generation genetic algorithm for solving traveling salesman problem proposed by the present invention specifically includes the following steps:
[0079] (1) The biological theory basis and mathematical ecology theory basis of sequential crossover multi-generation genetic algorithm for solving traveling salesman problem.
[0080] According to the theoretical basis of biology and mathematical ecology, the present invention proposes a sequential crossover multi-generation genetic algorithm for solving the traveling salesman problem.
[0081] (2) The evolution strategy of sequential crossover multi-generation genetic algorithm for solving traveling salesman problem.
[0082] The evolution strategy of sequential crossover multi-generation genetic algorithm for solving traveling salesman problem is as follows figure 1 Shown. According to th...
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.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap