Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Traveling salesman problem.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful. This is the first book on approximation algorithms for the TSP, featuring a comprehensive collection of all major results and an overview of the most intriguing open problems. Many of the presented results have been discovered only recently, and some are published here for the first time, including better approximation algorithms for the asymmetric TSP and its path version. This book constitutes and advances the state of the art and makes it accessible to a wider audience. Featuring detailed proofs, over 170 exercises, and 100 color figures, this book is an excellent resource for teaching, self-study, and further research.

Traveling salesman problem. --- Approximation algorithms.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering.

Traveling-salesman problem. --- TSP (Traveling salesman problem) --- Combinatorial optimization --- Graph theory --- Vehicle routing problem --- Algorithms & data structures --- Traveling salesman problem.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Nowadays, the resolutions of the Traveling Salesman Problem are extremely numerous and diverse and will likely continue to spread until the famous question "P versus NP" is answered. This thesis was realized in partnership with Usitoo, a Belgian object borrowing platform based in Brussels, and thus proposes a solution in a real case application. The goal of this work is to plan deliveries and retrievals of objects in the event that certain constraints have been relaxed.
The most delicate constraint that was removed is the day of the journey, which considerably increases the number of possibilities to evaluate compared to a conventional Traveling Salesman Problem. The cost representing a journey was thought so that this metric best meets the environmental issue that we are trying to address with this thesis.
The suggested solution involves both exhaustive search and genetic algorithms in order to respond to the request correctly but also quickly. The final proposed algorithm was implemented in Python. In this way, we hope to respond to the request of Usitoo through a Django website presenting the obtained results. With it, they will likely be able to continue to follow their eco-responsible vocation while remaining efficient.

traveling salesman --- exhaustive --- genetic algorithm --- Ingénierie, informatique & technologie > Sciences informatiques

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. Cook examines the origins and history of the salesman problem and explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. He looks at how computers stack up against the traveling salesman problem on a grand scale, and discusses how humans, unaided by computers, go about trying to solve the puzzle. Cook traces the salesman problem to the realms of neuroscience, psychology, and art, and he also challenges readers to tackle the problem themselves. The traveling salesman problem is--literally--a $1 million question. That's the prize the Clay Mathematics Institute is offering to anyone who can solve the problem or prove that it can't be done. In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem"--

Traveling salesman problem. --- Computational complexity. --- Complexity, Computational --- Electronic data processing --- Machine theory --- TSP (Traveling salesman problem) --- Combinatorial optimization --- Graph theory --- Vehicle routing problem