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

Kód výsledku v 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>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Application of Self-Organizing Migrating Algorithm on the Shortest Path Problem
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Application of Self-Organizing Migrating Algorithm on the Shortest Path Problem
Popis výsledku anglicky
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.

Rok uplatnění
2012
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)