Product Design, Manufacturing & Innovation Resources
Home » Featured » The Traveling Salesman Problem, for Industry & Innovation

The Traveling Salesman Problem, for Industry & Innovation

Traveling salesman problem

Imagine a busy distribution center where machines and workers move optimally between each working and storage locations. Routes need to be planned well to meet strict time limits and keep costs and other factors low. This challenge is at the heart of the historically so-called traveling salesman problem (TSP). It’s not only in the logistic applications. This piece explores how the traveling salesman problem can be used in real life and manufacturing. It looks at how one can improve their route planning in all the industry.

While this problem is a classic in pure math and algorithmic studies, also studied in logistics with a more practical approach, it is almost unknown in other industries and manufacturing domains.

This post in a special focus on one algorithm of our post “the 10 main algorithms and methodologies to know in engineering”.

Key Takeaways

  • The traveling salesman problem (TSP) is to find the most optimized route between several points.
  • This problem started to gain interest in the 1930-1940
  • It helps organizations enhance efficiency and reduce costs in their operations, limit resources and improve service delivery.
  • The problem is widely applicable across different sectors and industries, not just in logistics and transports.
  • As soon as there is more than a 12-20 points, the problem becomes too complex for calculating a perfect solution
  • Several algorithms have been invented to find good approximations, thus not the perfect one

What is the Traveling Salesman Problem ?

The traveling salesman problem: finding the most efficient way for a salesperson to visit various cities and return to start. He must hit each city only once, aiming to cut the total distance to the shortest possible.

To understand the TSP definition, know that the number of routes grows as more cities are added. For example, four cities mean there are 24 possible paths. Adding more cities increases the challenge, leading to too many potential routes to consider.

Many businesses, like those in logistics, telecommunications, and manufacturing, face this issue often. A good solution to the traveling salesman problem could save money and boost efficiency. It shows how theoretical math-related research helps solve real-life problems.

Why is it a though problem?

 

If there are n cities, there are (n-1)!/2 unique tours (the /2 comes if the tour is a cycle and directions don’t matter).

  • For small n (say n < 20), exact algorithms (brute force, dynamic programming) work.
  • Approximate/Heuristic techniques: nearest neighbor, Christofides’ algorithm, genetic algorithms are often used for larger instances.
  • But, in general, there is no fast method guaranteed to give the exact best answer for all instances.

Additionally, slight changes in input (e.g., distances or new cities) alter completely the optimal route, making the problem highly sensitive and complex to solve.

Cities visitedPossible routes / combinations
36
424
5120
6720
75040
206 × 1016 (almost 2 millennia if each route calculation would require a microsecond)
25more than the age of our univers if each route calculation would require a microsecond

History of the Traveling Salesman Problem

A vast expanse of historical knowledge, the journey of the traveling salesman problem unfolds before us. In the foreground, a sprawling map adorned with lines and routes, tracing the evolution of this iconic optimization challenge. In the middle ground, a collection of analytical diagrams and mathematical equations, the tools that have shaped our understanding of this problem over time. In the background, a collage of significant milestones and key figures, each contributing to the rich tapestry of the traveling salesman problem's history. Illuminated by a warm, vintage-inspired lighting, this scene captures the depth and complexity of a problem that continues to captivate and inspire researchers, logisticians, and problem-solvers alike.
A vast expanse of historical knowledge the journey of the traveling salesman problem unfolds. The traveling salesman problem real applications in the industry and logistics. Delivery planning

The Traveling Salesman Problem started in the early 1900s, thanks to some smart mathematicians. William Rowan Hamilton and Karl Menger were big names who helped us understand how to navigate complex paths. They really focused on making it easier to find the best route.

By the 1930s, people began to define the TSP more clearly. Scholars from Vienna and Harvard worked together on this. They started to see how it could solve real problems, like making school bus routes better. This made more people interested in solving the TSP.

The TSP became super useful for businesses, especially those in shipping and transportation. In the 1950s and 1960s, the RAND Corporation stepped up. They came up with smart ways to tackle the TSP that became a key part of making logistics run smoother.

🔒

The rest of this article is reserved for members

To limit scraping bots (currently 40,000 hits per day!),
we had to restrict access to full articles and tools to registered members only.

Log in →  or  Register (100% free) →

to access all the rest.

FAQ

What is the Traveling Salesman Problem (TSP)?

The Traveling Salesman Problem (TSP) is an important puzzle. It’s about finding the shortest path that visits each location only once and returns to the start. This is key for businesses that need to plan routes efficiently. The major challenge is the enormous number of possible routes, which grows with every new location. Also, real-world issues like traffic and deadlines make planning even harder.

Why is the TSP considered an NP-hard problem?

The TSP is tough because the number of potential routes increases exponentially with each additional city. This makes it very hard to find the best route quickly, especially as more than 20 locations are added.

What are some common applications of TSP?

TSP is used in many areas, like making delivery routes more efficient and managing supply chains. It’s also helpful in healthcare for scheduling visits and in robotics for guiding movements or in manufacturing electronics positioning or testing small components and copper routes.

How does graph theory and heuristic algorithms relate to the TSP?

Graph theory is the math behind the TSP. It uses dots (vertices) to represent cities and lines (edges) for the paths between them. This helps develop methods to solve TSP problems effectively. Heuristic algorithms are smart shortcuts for solving TSP. They help find good enough routes quickly, even if they’re not perfect. Methods like the Nearest Neighbor and Greedy algorithms are common examples. Techniques like simulated annealing and genetic algorithms are also particularly helpful for big problems.

How does TSP impact supply chain efficiency?

TSP boosts supply chain efficiency by refining transportation routes. This leads to costs going down, better use of resources, and improved coordination among everyone involved. In healthcare, TSP optimizes how home care and emergency services are provided. It ensures that medical supplies are delivered promptly, enhancing overall patient care and satisfaction.

Glossary of Terms Used

Deoxyribonucleic Acid (DNA): a molecule composed of two strands forming a double helix, consisting of nucleotides that encode genetic information through sequences of four bases: adenine, thymine, cytosine, and guanine. It serves as the hereditary material in most living organisms.

Printed Circuit Board (PCB): a flat board made of insulating material that supports and connects electronic components through conductive pathways, typically etched from copper sheets. It serves as a foundation for circuit assembly and facilitates electrical connections between components.

Unmanned Aerial Vehicle (UAV): a remotely piloted or autonomous aircraft designed for various applications, including surveillance, reconnaissance, and delivery, without a human pilot onboard. Operates via ground control stations or onboard automation systems, often equipped with sensors and cameras for data collection.

Very-large-scale Integration (VLSI): a technology for creating integrated circuits by combining thousands to millions of transistors on a single chip, enabling complex electronic systems to be miniaturized and enhancing performance, power efficiency, and functionality in devices such as computers and smartphones.

Topics covered: Traveling Salesman Problem, optimization, route planning, logistics, algorithm, efficiency, cost reduction, heuristic methods, dynamic programming, NP-hard, combinatorial optimization, approximation algorithms, ISO 9001, ISO 14001, ISO/IEC 27001, ISO 31000, and ISO 50001..

Historical Context

1829
1850
1854
1854
1895
1899
1900
1828
1848
1850
1854
1884
1896
1900
1903

(if date is unknown or not relevant, e.g. "fluid mechanics", a rounded estimation of its notable emergence is provided)

Full size images and downloads are only available, 100% free, for registered members.

> Login <