EUVIMEDEUVIMED entdecken
Crossref

Investigation of Convergence Properties of Ant Colony Based Algorithms

Anita Agárdi, László Kovács, Tamás Bányai

Advanced Logistic Systems - Theory and Practice · 2019

DOI: 10.32971/als.2020.001 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advanced Logistic Systems - Theory and Practice, 2019. Verfasst von Anita Agárdi und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 discrete optimization problem. The paper presents a literature review in connection with ACO algorithms, and Vehicle Routing Problem (VRP). After that, the mathematical model is written. The paper also presents the implemented algorithms, and the test results based on benchmark data.

Zitieren

APA

Agárdi, A., Kovács, L., & Bányai, T. (2019). Investigation of Convergence Properties of Ant Colony Based Algorithms. Advanced Logistic Systems - Theory and Practice. https://doi.org/10.32971/als.2020.001

Vancouver

Agárdi A, Kovács L, Bányai T. Investigation of Convergence Properties of Ant Colony Based Algorithms. Advanced Logistic Systems - Theory and Practice. 2019. doi:10.32971/als.2020.001

BibTeX
@article{Agrdi2019,
  author = {Agárdi, Anita and Kovács, László and Bányai, Tamás},
  title = {Investigation of Convergence Properties of Ant Colony Based Algorithms},
  journal = {Advanced Logistic Systems - Theory and Practice},
  year = {2019},
  doi = {10.32971/als.2020.001}
}
Kostenlos starten →