Open access peer-reviewed Edited Volume

Traveling Salesman Problem

Edited by Federico Greco

University of Perugia, Italy

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.

Read more >Order hardcopy
Traveling Salesman ProblemEdited by Federico Greco

Published: September 1st 2008

DOI: 10.5772/66

ISBN: 978-953-7619-10-7

eBook (PDF) ISBN: 978-953-51-5750-2

Copyright year: 2008

Books open for chapter submissions

41194 Total Chapter Downloads

23 Crossref Citations

25 Web of Science Citations

42 Dimensions Citations


Open access peer-reviewed

1. Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem

By Mohammad Reza Bonyadi, Mostafa Rahimi Azghadi, and Hamed Shah-Hosseini


Open access peer-reviewed

2. Bio-inspired Algorithms for TSP and Generalized TSP

By Zhifeng Hao, Han Huang and Ruichu Cai


Open access peer-reviewed

3. Approaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms

By Jyh-Da Wei


Open access peer-reviewed

4. Particle Swarm Optimization Algorithm for the Traveling Salesman Problem

By Elizabeth F. G. Goldbarg, Marco C. Goldbarg and Givanaldo R. de Souza


Open access peer-reviewed

5. A Modified Discrete Particle Swarm Optimization Algorithm for the Generalized Traveling Salesman Problem

By Mehmet Fatih Tasgetiren, Yun-Chia Liang, Quan-Ke Pan and P. N. Suganthan


Open access peer-reviewed

6. Solving TSP by Transiently Chaotic Neural Networks

By Shyan-Shiou Chen and Chih-Wen Shih


Open access peer-reviewed

7. A Recurrent Neural Network to Traveling Salesman Problem

By Paulo Henrique Siqueira, Sérgio Scheer, and Maria Teresinha Arns Steiner


Open access peer-reviewed

8. Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selection Scheme

By Yu-Hsin Liu


Open access peer-reviewed

9. Niche Pseudo-Parallel Genetic Algorithms for Path Optimization of Autonomous Mobile Robot - A Specific Application of TSP

By Zhihua Shen and Yingkai Zhao


Open access peer-reviewed

10. The Symmetric Circulant Traveling Salesman Problem

By Federico Greco and Ivan Gerace


Edited Volume and chapters are indexed in

  • Worldcat
  • OpenAIRE
  • Google Scholar
  • AZ ebsco
  • Base
  • CNKI

Order a hardcopy of the Edited Volume

Free shipping with DHL Express

Hardcover (ex. VAT)£119

Order now

Residents of European Union countries need to add a Book Value-Added Tax Rate based on their country of residence. Institutions and companies, registered as VAT taxable entities in their own EU member state, will not pay VAT by providing IntechOpen with their VAT registration number. This is made possible by the EU reverse charge method.

Special discount for IntechOpen contributors

All IntechOpen contributors are offered special discounts starting at 40% OFF available through your personal dashboard

Login and purchase