Open AccessThe shortest route search with ant algorithms
Author(s) -
Zbigniew Świątnicki
Publication year - 2018
Publication title -
autobusy
Language(s) - English
Resource type - Journals
eISSN - 2450-7725
pISSN - 1509-5878
DOI - 10.24136/atest.2018.539
Subject(s) - mathematical optimization , ant colony optimization algorithms , computer science , ant , algorithm , term (time) , shortest path problem , mathematics , theoretical computer science , computer network , graph , physics , quantum mechanics
The presented research results indicate the usefulness of ant algorithms in the optimization of the road length. Admittedly, ant algorithms do not guarantee an optimal solution, but they provide a suboptimal (rational) solution. In a situation where we have limited time to solve the optimization problem, the guarantee of terminating the algorithm and obtaining a rational, acceptable solution is an attractive alternative for conducting long-term calculations and finding a little better solution.