Traveling salesman problem: approach to optimality

Jadczak Radosław
Additional contact information
Jadczak Radosław: University of Lodz

Przedsiębiorczość i Zarządzanie (Entrepreneurship and Management), 2014, vol. 15, issue 2, 157-169

Abstract: Traveling Salesman Problem (TSP) is a basic and one of the most important transportation problems in operational logistics. It is also known in the literature as a Chinese postman problem or single vehicle routing problem. TSP can be shortly described as follows. Vehicle starting from the selected city must visit a set of another cities exactly once and return to the starting city in such a way that the total distance of the route is minimized.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.2478/eam-2014-0024 (text/html)

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:vrs:pizeam:v:15:y:2014:i:2:p:157-169:n:11

DOI: 10.2478/eam-2014-0024

Access Statistics for this article

Przedsiębiorczość i Zarządzanie (Entrepreneurship and Management) is currently edited by Bogdan Piasecki

More articles in Przedsiębiorczość i Zarządzanie (Entrepreneurship and Management) from Sciendo
Bibliographic data for series maintained by Peter Golla ().