Detail publikace

Solving the Travelling Salesman Problem Using GAMS

NETUŠIL, Z.

Anglický název

Solving the Travelling Salesman Problem Using GAMS

Typ

Stať ve sborníku v databázi WoS či Scopus

Jazyk

en

Originální abstrakt

The Travelling Salesman Problem (TSP) is well known problem consisting of designing the optimal route for a salesman originating and terminating at the depot. The salesman has to visit each customer exactly once and the total distance travelled has to be minimized. TSP is supposed to be NP-hard which roughly means that the computation time needed by an exact algorithm rises exponentially with the length of input (i.e. --- in the case of TSP --- the number of customers). This paper discusses how this NP-hard problem can be solved is optimization tool GAMS and purposes results.

Klíčová slova anglicky

travelling salesman problem, NP-hard, GAMS, optimization

Vydáno

2007-02-06

Nakladatel

VŠB – TECHNICKÁ UNIVERZITA OSTRAVA

Místo

Ostrava, ČR

ISBN

978-80-248-1649-4

Kniha

Sborník z 16. semináře Moderní matematické metody v inženýrství

Strany od–do

216–220

Počet stran

5

BIBTEX


@inproceedings{BUT27893,
  author="Zdeněk {Netušil}",
  title="Solving the Travelling Salesman Problem Using GAMS",
  booktitle="Sborník z 16. semináře Moderní matematické metody v inženýrství",
  year="2007",
  series="1",
  number="1",
  pages="216--220",
  publisher="VŠB - TECHNICKÁ UNIVERZITA OSTRAVA",
  address="Ostrava, ČR",
  isbn="978-80-248-1649-4"
}