Traveling Salesman Problem
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...
Сохранить в:
| Другие авторы: | |
|---|---|
| Формат: | Электронный ресурс Глава книги |
| Язык: | английский |
| Опубликовано: |
IntechOpen
2008
|
| Предметы: | |
| Online-ссылка: | DOAB: download the publication DOAB: description of the publication |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
| Итог: | 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. |
|---|---|
| Объем: | 1 electronic resource (212 p.) |
| ISBN: | 66 9789537619107 9789535157502 |
| Доступ: | Open Access |