Publication detail

ACO in Task of Canadian Traveller Problem

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

English title

ACO in Task of Canadian Traveller Problem

Type

Paper in proceedings (conference paper)

Language

en

Original abstract

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.

Keywords in English

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

Released

2012-06-27

Publisher

VUT

Location

Brno

ISBN

978-80-214-4540-6

ISSN

1803-3814

Book

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

Volume

2012

Number

1

Pages from–to

600–603

Pages count

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