Variants of the Traveling Salesman Problem

Open access


This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the best known of the classic combinatorial problems is the “Traveling Salesman Problem” (TSP). The classic Traveling Salesman Problem has the objective of minimizing some value, usually distance, while defining a sequence of locations where each is visited once. An additional requirement is that the tour ends in the same location where the tour started. Variants of the classic Traveling Salesman Problem are developed including the Bottleneck TSP and the Variation Bottleneck TSP.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • Albers D. & Reid C. The College Mathematics Journal Vol. 17 No. 4 (Sep. 1986) pp. 292-314. Downloaded on December 30 2014 from

  • Cummings N. (June 2000). A Brief History of TSP. OR Newsletter. Downloaded on April 27 2015 from

  • Frontline Systems. (n.d.) Downloaded on January 2 2015 from

  • Patterson M. & Harmel B. (2003). Solving the Traveling Salesman Problem Using Premium Solver Platform. International Journal of Management 22 (4) 532-541.

  • Robinson J. B. (1949). On the Hamiltonian Game (a traveling salesman problem). Rand Research Memorandum RM-303.

  • Tuza Z. (2001). Unsolved Combinatorial Problems Part I. Downloaded on December 30 2015 from

  • Williams H. P. (1999). Model Building in Mathematical Programming. (255-256). Chichester: John Wiley & Sons.