VARIANTS OF THE TRAVELING SALESMAN PROBLEM

Mike Patterson and Daniel Friesen
Additional contact information
Mike Patterson: Dillard College of Business, Midwestern State University, USA
Daniel Friesen: University of North Texas, Dallas Campus, USA

Studies in Business and Economics, 2019, vol. 14, issue 1, 208-220

Abstract: 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.

Keywords: Optimization; Spreadsheet; Traveling Salesman; Combinatorial (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://eccsf.ulbsibiu.ro/RePEc/blg/journl/14116patterson.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:blg:journl:v:14:y:2019:i:1:p:208-220

Access Statistics for this article

More articles in Studies in Business and Economics from Lucian Blaga University of Sibiu, Faculty of Economic Sciences Lucian Blaga University of Sibiu, Faculty of Economic Sciences Dumbravii Avenue, No 17, postal code 550324, Sibiu, Romania. Contact information at EDIRC.
Bibliographic data for series maintained by Mihaela Herciu ().