Detail publikace

ACO in Task of Canadian Traveller Problem

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

Originální název

ACO in Task of Canadian Traveller Problem

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

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

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

Autoři

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

Rok RIV

2012

Vydáno

27. 6. 2012

Nakladatel

VUT

Místo

Brno

ISBN

978-80-214-4540-6

Kniha

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

Edice

2012

Číslo edice

1

ISSN

1803-3814

Periodikum

Mendel Journal series

Ročník

2012

Číslo

1

Stát

Česká republika

Strany od

600

Strany do

603

Strany počet

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"
}