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...
Saved in:
| Format: | Online |
|---|---|
| Language: | English |
| Published: |
IntechOpen
2021
|
| Subjects: | |
| Online Access: | ONIX_20210420_9789537619107_32 |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1869520338308562944 |
|---|---|
| collection | Directory of Open Access Books |
| description | 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. |
| format | Online |
| id | doab-20.500.12854ir-64676 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2021 |
| publishDateRange | 2021 |
| publishDateSort | 2021 |
| publisher | IntechOpen |
| publisherStr | IntechOpen |
| record_format | ojs |
| spelling | doab-20.500.12854ir-646762024-04-14T10:28:12Z Traveling Salesman Problem Greco, Federico Computer modelling & simulation thema EDItEUR::U Computing and Information Technology::UY Computer science::UYM Computer modelling and simulation 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. 2021-04-20T14:53:10Z 2021-04-20T14:53:10Z 2008 book ONIX_20210420_9789537619107_32 9789537619107 9789535157502 https://directory.doabooks.org/handle/20.500.12854/64676 eng image/jpeg n/a https://www.intechopen.com/books https://mts.intechopen.com/storage/books/3769/authors_book/authors_book.pdf IntechOpen IntechOpen 10.5772/66 10.5772/66 78a36484-2c0c-47cb-ad67-2b9f5cd4a8f6 9789537619107 9789535157502 IntechOpen 212 open access |
| spellingShingle | Computer modelling & simulation thema EDItEUR::U Computing and Information Technology::UY Computer science::UYM Computer modelling and simulation Traveling Salesman Problem |
| title | Traveling Salesman Problem |
| title_full | Traveling Salesman Problem |
| title_fullStr | Traveling Salesman Problem |
| title_full_unstemmed | Traveling Salesman Problem |
| title_short | Traveling Salesman Problem |
| title_sort | traveling salesman problem |
| topic | Computer modelling & simulation thema EDItEUR::U Computing and Information Technology::UY Computer science::UYM Computer modelling and simulation |
| topic_facet | Computer modelling & simulation thema EDItEUR::U Computing and Information Technology::UY Computer science::UYM Computer modelling and simulation |
| url | ONIX_20210420_9789537619107_32 |