A CLOSER LOOK AT THE TRAVELLING SALESMAN PROBLEM
Clasificación: | Libro Electrónico |
---|---|
Otros Autores: | |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
NEW YORK :
NOVA SCIENCE,
2020.
|
Colección: | Mathematics research developments series.
|
Temas: | |
Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Intro
- Contents
- Preface
- Chapter 1
- Travelling Salesman Problem and Its Applications
- Abstract
- Introduction
- Applications of TSP
- Genetic Algorithm Based TSP
- Chromosome -A Solution to TSP
- TSP with Dynamic Programming
- References
- Chapter 2
- The Attractor Approach to Computational Complexity of the Traveling Salesman Problem
- Abstract
- Introduction
- Reframing the TSP Definition
- The Edge Matrix E
- Solution Attractor of Local Search Systems
- Attractor-Based Search System for the TSP
- Global Optimization of the ABSS
- Computational Complexity of the ABSS for the TSP
- Conclusion
- References
- Chapter 3
- Study on Heuristic Approaches for Symmetric Traveling Salesman Problem
- Chapter 4
- Quantum Solutions of 6-City Traveling Salesman Problems
- Abstract
- Introduction
- Related Work
- Quantum Solutions for a 6-City ATSP with 24 Optimal Tours
- Quantum Solutions for a 6-City ATSP with 6 Optimal Tours
- Quantum Solutions for a 6-City ATSP with 2 Optimal Tours
- Quantum Solutions for a 6-City ATSP with 1 Optimal Tour
- Conclusion and Recommendations
- Acknowledgment
- References
- Index