ACO in Task of Canadian Traveller Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F12%3APU99376" target="_blank" >RIV/00216305:26210/12:PU99376 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
ACO in Task of Canadian Traveller Problem
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/TA02021449" target="_blank" >TA02021449: INTELLIGENT ALARM SYSTEM FOR NUCLEAR POWER PLANT TECHNOLOGY</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
18th International Conference of Soft Computing, MENDEL 2012 (id 19255)
ISBN
978-80-214-4540-6
ISSN
1803-3814
e-ISSN
—
Number of pages
4
Pages from-to
600-603
Publisher name
VUT
Place of publication
Brno
Event location
Brno University of Technology
Event date
Jun 27, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000288144100072