PL EN


2006 | 53 | 1 | 5-32
Article title

A TRAVELING SALESMAN PROBLEM AS A COMPETITIVE GAME

Authors
Title variants
Languages of publication
PL
Abstracts
EN
The classical traveling salesman problem might be described as follows: a salesman starting from a given city, visiting each of the cities, and returning to the original point of departure should find the shortest way. More generally, he could consider in what order he should visit the cities to minimize the total distance traveled. For 'distance' we can substitute time, costs, or other measures of effectiveness as desired. Distance or costs between all city pair are presumed to be known. The authoress' version of this problem concerns two traveling salesmen SI and S2 who want to sell certain goods (commodities) in 'n' cities. The player SI starts from a city 'i' and S2 -from a city 'j' ('i' and 'j' are different and 'n' is greater than 1). Both players should visit each of (n-1) cities once and only once, and return to the starting point. The mathematical 'proposal' to minimize the travel costs is given
Year
Volume
53
Issue
1
Pages
5-32
Physical description
Document type
ARTICLE
Contributors
author
  • E. Drabik, Szkola Glówna Gospodarstwa Wiejskiego, ul. Nowoursynowska 166, 02-787 Warszawa, Poland
References
Document Type
Publication order reference
Identifiers
CEJSH db identifier
06PLAAAA01162687
YADDA identifier
bwmeta1.element.5bf2fb5c-ea9a-3f8e-b12c-ba4162786b77
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.