Application of Self-Organizing Migrating Algorithm on the Shortest Path Problem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F12%3A00196927" target="_blank" >RIV/68407700:21260/12:00196927 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Application of Self-Organizing Migrating Algorithm on the Shortest Path Problem

Original language description

Traditionally, the shortest path in a weighted graph problem is solved by well-known algorithms such as Dijkstra's, Floyd-Warshall, Bellman-Ford algorithms or the A-star algorithm. This paper employs an evolutionary algorithm called Self-Organizing Migrating Algorithm (SOMA) for the task and shows benefits as well as drawbacks of such approach. For this purpose, a sample weighted graph was defined and the shortest path problem was solved by asynchronously parallel distribution of SOMA. Obtained resultsof the experiment were compared with the traditional algorithms for reference.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2012

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Carpathian Logistics Congress Proceedings

ISBN

978-80-87294-33-8

ISSN

—

e-ISSN

—

Number of pages

1

Pages from-to

—

Publisher name

TANGER

Place of publication

Ostrava

Event location

Jeseník

Event date

Nov 7, 2012

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—