Detail publikace

ACO in Task of Canadian Traveller Problem

MATOUŠEK, R. ŠOUSTEK, P. DVOŘÁK, J. BEDNÁŘ, J.

Anglický název

ACO in Task of Canadian Traveller Problem

Typ

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

Jazyk

en

Originální abstrakt

The paper presents so called Canadian Traveller Problem (CTP), which is a generalized optimization problem of finding the shortest path to graph. This problem models very well the real situation of transportation from start to goal using probabilistic constrains of graph edges. In the paper is presented genuine soft computing approach of solving it using it ACO class of algorithms. These solutions are compared with exact deterministic way based on Dijkstra algorithm.

Klíčová slova anglicky

Optimization, Graph Theory, CTP, Canadian Traveller Problem, Dijkstra, ACO, Swarm optimization

Vydáno

2012-06-27

Nakladatel

VUT

Místo

Brno

ISBN

978-80-214-4540-6

ISSN

1803-3814

Kniha

18th International Conference of Soft Computing, MENDEL 2012 (id 19255)

Ročník

2012

Číslo

1

Strany od–do

600–603

Počet stran

4

BIBTEX


@inproceedings{BUT93362,
  author="Radomil {Matoušek} and Petr {Šoustek} and Jiří {Dvořák} and Josef {Bednář}",
  title="ACO in Task of Canadian Traveller Problem",
  booktitle="18th International Conference of Soft Computing, MENDEL 2012 (id 19255)",
  year="2012",
  series="2012",
  journal="Mendel Journal series",
  volume="2012",
  number="1",
  pages="600--603",
  publisher="VUT",
  address="Brno",
  isbn="978-80-214-4540-6",
  issn="1803-3814"
}