Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/131162
Title: | Traveling Salesman Problem |
Authors: | Federico Greco |
Issue Date: | 2008 |
Publisher: | InTech |
Abstract: | 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. |
link: | http://www.intechopen.com/books/traveling_salesman_problem |
Keywords: | Computer and Information Science; Numerical Analysis and Scientific Computing |
ISBN: | 978-953-7619-10-7 |
Theme: | 教科書-自然科學類 |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.