Using Group Theory to Generate Initial Population for a Genetic Algorithm for Solving Traveling Salesman
In this chapter, we propose a novel algorithm that uses Genetic algorithm with group theory for initial population generation and also propose a novel crossover for solving Traveling Salesman Problem. In the group tour construction method, each individual/initial tour has distinct start city provide...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2023
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/85520 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: Using Group Theory to Generate Initial Population for a Genetic Algorithm for Solving Traveling Salesman
- Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem
- The Method of Solving for Traveling Salesman Problem Using Genetic Algorithm with Immune Adjustment Mechanism
- Immune-Genetic Algorithm for Traveling Salesman Problem
- Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem
- New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem
- Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selection Scheme