· 2019
The Traveling Salesman Problem
- 1,631citations
- 2019year
Short summary
This chapter introduces the Traveling Salesman Problem (TSP), a well-known combinatorial optimization challenge focused on finding the shortest route visiting multiple locations.
AI-generated from the title and abstract; the full text is not read.
Key points
- The Traveling Salesman Problem (TSP) is a core combinatorial optimization problem.
- It involves finding the shortest possible route that visits a set of locations and returns to the origin.
- The chapter discusses exact algorithms, construction heuristics, and improvement heuristics for TSP.
- The branch-and-bound algorithm, a key development in TSP solutions, was first proposed in this context.
AI-generated from the title and abstract; the full text is not read.
Abstract
This chapter covers one important aspect of the transportation-related decisions a firm must make, namely, routing vehicles among the locations they must visit. It discusses the famous traveling salesman problem (TSP). The TSP is perhaps the best-known combinatorial optimization problem and has been intensely studied by researchers in supply chain management, operations research, computer science, and other fields. The chapter also discusses exact algorithms for the TSP, and construction heuristics for the TSP. The chapter considers improvement heuristics for the TSP that begin with a complete tour and perform operations on it to try to make it shorter. The first branching algorithm for the TSP was the branch-and-bound algorithm proposed by Little et al.; in fact, their paper was the first to introduce the term branch-and-bound. The heuristic finds an Eulerian tour and converts it to a TSP tour by shortcutting, exactly as in the minimum spanning tree heuristic.
The authors' abstract, as published at the source., 2019 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Industrial and Manufacturing Engineering
Industrial and Manufacturing EngineeringEngineering