The DOI matches its Crossref record.
The Traveling Salesman Problem
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
A graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090
The Hyper-Cube Framework for Ant Colony Optimization
Blum, C., & Dorigo, M. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2003.821450 · Cited by 432
Lu, C., Gao, L., Li, X., Pan, Q., & Wang, Q. (2017) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2017.01.011 · Cited by 292
Metadata
- Venue
- Fundamentals of Supply Chain Theory
- Publisher
- Wiley
- Published
- 2019-06-28
- Pages
- 403-461
- OpenAlex
- W307896644
- Cited by
- 1,614
- References
- 0
- Type
- other
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Traveling Salesman Problem. https://app.cochat.ai/papers/10.1002/9781119584445.ch10
- The paper
- The Traveling Salesman Problem. (2019). Fundamentals of Supply Chain Theory. https://doi.org/10.1002/9781119584445.ch10
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
