Open access peer-reviewed Edited Volume

Novel Trends in the Traveling Salesman Problem

Edited by Donald Davendra

Central Washington University

Co-editor:

Magdalena Bialic-Davendra

Central Washington University

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.

Read more >Order hardcopy
IntechOpen
Novel Trends in the Traveling Salesman ProblemEdited by Donald Davendra

Published: December 9th 2020

DOI: 10.5772/intechopen.78197

ISBN: 978-1-83962-454-4

Print ISBN: 978-1-83962-453-7

eBook (PDF) ISBN: 978-1-83962-455-1

Copyright year: 2020

Books open for chapter submissions

646 Total Chapter Downloads

chaptersDownloads

Open access peer-reviewed

1. Introductory Chapter: Traveling Salesman Problem - An Overview

By Donald Davendra and Magdalena Bialic-Davendra

56

Open access peer-reviewed

2. CUDA Accelerated 2-OPT Local Search for the Traveling Salesman Problem

By Donald Davendra, Magdalena Metlicka and Magdalena Bialic-Davendra

113

Open access peer-reviewed

3. Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman Problem

By Weiqi Li

127

Open access peer-reviewed

4. Accelerating DNA Computing via PLP-qPCR Answer Read out to Solve Traveling Salesman Problems

By Fusheng Xiong, Michael Kuby and Wayne D. Frasch

208

Open access peer-reviewed

5. Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem

By Fernando Francisco Sandoya Sánchez, Carmen Andrea Letamendi Lazo and Fanny Yamel Sanabria Quiñónez

142

Edited Volume and chapters are indexed in

  • Worldcat
  • OpenAIRE
  • Google Scholar
  • AZ ebsco
  • Base
  • CNKI

Order a hardcopy of the Edited Volume

Free shipping with DHL Express

Hardcover (ex. VAT)£100

Order now

Residents of European Union countries need to add a Book Value-Added Tax of 5%. Institutions and companies, registered as VAT taxable entities in their own EU member state, will not pay VAT by providing IntechOpen with their VAT registration number. This is made possible by the EU reverse charge method.

Special discount for IntechOpen contributors

All IntechOpen contributors are offered special discounts starting at 40% OFF available through your personal dashboard

Login and purchase