TY  - CHAP
AU  - Elizabeth F. G. Goldbarg
AU  - Marco C. Goldbarg
AU  - Givanaldo R. de Souza
ED  - Federico Greco
Y1  - 2008-09-01
PY  - 2008
T1  - Particle Swarm Optimization Algorithm for the Traveling Salesman Problem
N2  - 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.
BT  - Traveling Salesman Problem
SP  - Ch. 4
UR  - https://doi.org/10.5772/5580
DO  - 10.5772/5580
SN  - 
PB  - IntechOpen
CY  - Rijeka
Y2  - 2024-04-19
ER  -