Novel Trends in the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is widely considered one of the most intensively studied problems in computational mathematics and operations research. Since its inception, it has become the poster child for computational complexity research. A number of problems have been transformed to a TSP...
Сохранить в:
| Формат: | Online |
|---|---|
| Язык: | английский |
| Опубликовано: |
IntechOpen
2021
|
| Предметы: | |
| Online-ссылка: | ONIX_20210420_9781839624544_3141 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|
| _version_ | 1869525584687661056 |
|---|---|
| collection | Directory of Open Access Books |
| description | The Traveling Salesman Problem (TSP) is widely considered one of the most intensively studied problems in computational mathematics and operations research. Since its inception, it has become the poster child for computational complexity research. A number of problems have been transformed to a TSP problem and its application base now extends into scheduling, manufacturing, routing, and logistics. With the advent of high-performance computing and advanced meta-heuristics such as GPU programming and swarm-based algorithms, the TSP problem is positioned firmly as the go-to problem for the development of the next generation of high-performance intelligent heuristics. This book looks to leverage some of these new paradigms for both students and researchers in this field. |
| format | Online |
| id | doab-20.500.12854ir-67781 |
| 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-677812024-04-04T14:41:06Z Novel Trends in the Traveling Salesman Problem Davendra, Donald Bialic-Davendra, Magdalena Discrete mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBD Discrete mathematics The Traveling Salesman Problem (TSP) is widely considered one of the most intensively studied problems in computational mathematics and operations research. Since its inception, it has become the poster child for computational complexity research. A number of problems have been transformed to a TSP problem and its application base now extends into scheduling, manufacturing, routing, and logistics. With the advent of high-performance computing and advanced meta-heuristics such as GPU programming and swarm-based algorithms, the TSP problem is positioned firmly as the go-to problem for the development of the next generation of high-performance intelligent heuristics. This book looks to leverage some of these new paradigms for both students and researchers in this field. 2021-04-20T16:25:37Z 2021-04-20T16:25:37Z 2020 book ONIX_20210420_9781839624544_3141 9781839624544 9781839624537 9781839624551 https://directory.doabooks.org/handle/20.500.12854/67781 eng image/jpeg n/a https://www.intechopen.com/books https://mts.intechopen.com/storage/books/8241/authors_book/authors_book.pdf IntechOpen IntechOpen 10.5772/intechopen.78197 10.5772/intechopen.78197 78a36484-2c0c-47cb-ad67-2b9f5cd4a8f6 9781839624544 9781839624537 9781839624551 IntechOpen 100 open access |
| spellingShingle | Discrete mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBD Discrete mathematics Novel Trends in the Traveling Salesman Problem |
| title | Novel Trends in the Traveling Salesman Problem |
| title_full | Novel Trends in the Traveling Salesman Problem |
| title_fullStr | Novel Trends in the Traveling Salesman Problem |
| title_full_unstemmed | Novel Trends in the Traveling Salesman Problem |
| title_short | Novel Trends in the Traveling Salesman Problem |
| title_sort | novel trends in the traveling salesman problem |
| topic | Discrete mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBD Discrete mathematics |
| topic_facet | Discrete mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBD Discrete mathematics |
| url | ONIX_20210420_9781839624544_3141 |