Traveling Salesman Problem
About this book
The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Traveling Salesman Problem
- Contents
- Preface
- 1. Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem
- 2. Bio-inspired Algorithms for TSP and Generalized TSP
- 3. Approaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms
- 4. Particle Swarm Optimization Algorithm for the Traveling Salesman Problem
- 5. A Modified Discrete Particle Swarm Optimization Algorithm for the Generalized Traveling Salesman Problem
- 6. Solving TSP by Transiently Chaotic Neural Networks
- 7. A Recurrent Neural Network to Traveling Salesman Problem
- 8. Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selection Scheme
- 9. Niche Pseudo-Parallel Genetic Algorithms for Path Optimization of Autonomous Mobile Robot - A Specific Application of TSP
- 10. The Symmetric Circulant Traveling Salesman Problem