A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Investigation of Convergence Properties of Ant Colony Based Algorithms
2019
Advanced Logistic Systems - Theory and Practice
The paper presents the Ant Colony Optimization (ACO) algorithms, and investigates their convergence properties. Our investigation is limited to the following ACO algorithms: Ant System, MAX-MIN Ant System, Elitist Strategy of Ant System and Rank Based Version of Ant System. In the literature can be seen, that a novel of optimization problems are solved with ACO algorithms. In our investigation, we limited the Multi-Depot Vehicle Routing Problem with Time Windows (MDVRPTW), which is an NP-hard
doi:10.32971/als.2020.001
fatcat:pb6yl2g7dbbsxh32o26u63dyny