How to Solve the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is believed to be an intractable problem and have no practically efficient algorithm to solve it. The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. When a TSP instance is large, the nu...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2021
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/75156 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: How to Solve the Traveling Salesman Problem
- Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem
- The Symmetric Circulant Traveling Salesman Problem
- Introductory Chapter: Traveling Salesman Problem - An Overview
- Immune-Genetic Algorithm for Traveling Salesman Problem
- The Method of Solving for Traveling Salesman Problem Using Genetic Algorithm with Immune Adjustment Mechanism
- Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selection Scheme