Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Refine search results

Journals help

  1. 1 Przegląd Statystyczny

Years help

  1. 1 2006

Authors help

  1. 1 Drabik E.

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  TWO TRAVELING SALESMEN PROBLEM
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1

A TRAVELING SALESMAN PROBLEM AS A COMPETITIVE GAME

100%
Drabik E.
Przegląd Statystyczny
|
2006
|
vol. 53
|
issue 1
5-32
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
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.