Publication detail

ACO in Task of Canadian Traveller Problem

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

Original Title

ACO in Task of Canadian Traveller Problem

Type

conference paper

Language

English

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

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

Authors

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

RIV year

2012

Released

27. 6. 2012

Publisher

VUT

Location

Brno

ISBN

978-80-214-4540-6

Book

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

Edition

2012

Edition number

1

ISBN

1803-3814

Periodical

Mendel Journal series

Year of study

2012

Number

1

State

Czech Republic

Pages from

600

Pages to

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