2013

paper

english

EN The paper presents the means to use ShortestPathACO algorithm to find the shortest path between a pair of nodes in a directed graph. This Ant Colony Optimization metaheuristic based algorithm allows to influence the quality of generated solutions, through the application of an approach dissimilar from the one typically used to solve a single-pair shortest path problem. The operation of the algorithm is discussed in relation to the pseudocode introduced in the paper. The attention paid to the parameters that influence the results is accompanied by the motivation of usage scenarios. Experiments carried out within the custom made framework of the experiment are the source of suggestions concerning the selection of values and computation methods optimal for particular applications. The influence of the choice of number of ants and the pheromone evaporation speed is investigated. The quality of solutions generated by ShortestPathACO algorithm is also addressed. The issues of execution time and convergence achievement are considered as well.

1 - 6

10.34385/proc.16.COMM4-4

https://www.ieice.org/publications/proceedings/summary.php?expandable=10&iconf=ICTF&session_num=COMM4&number=COMM4-4&year=2013

Proceedings of the IEICE Information and Communication Technology Forum (ICTF 2013)

Conference of the IEICE Information and Communication Technology Forum (ICTF 2013), 2013, Sarajewo, Bosnia and Herzegovina