Application of self-organizing migrating algorithm on the shortest path problem

Abstract

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 results of the experiment were compared with the traditional algorithms for reference.