Geodesic
Parallelizing the ant colony algorithm
News of the Kabardin-Balkar scientific center of RAS, Tome 26 (2024) no. 5, pp. 73-83.

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper considers the ant colony algorithm and describes the process of its parallelization using Python and multiprocessing module. Using the example of the knapsack problem, it is shown that distributing tasks among a number of processes allows to improve the performance of the algorithm while maintaining its efficiency. Compared to exact methods, like dynamic programming, the use of the ant colony algorithm showed a significant reduction in execution time with an acceptable level of deviation from the optimal solution. The advantage of parallelization algorithms is the efficient utilization of the computing system, where all available processor cores are used, resulting in faster execution of more iterations in the same time. The results obtained confirm the potential of AСO for solving complex problems with limited computation time.
Keywords: ant colony algorithm, forest resource optimization, knapsack problem, heuristic algorithms 
@article{IZKAB_2024_26_5_a5,
     author = {M. R. Vagizov and S. P. Khabarov},
     title = {Parallelizing the ant colony algorithm},
     journal = {News of the Kabardin-Balkar scientific center of RAS},
     pages = {73--83},
     publisher = {mathdoc},
     volume = {26},
     number = {5},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IZKAB_2024_26_5_a5/}
}
TY  - JOUR
AU  - M. R. Vagizov
AU  - S. P. Khabarov
TI  - Parallelizing the ant colony algorithm
JO  - News of the Kabardin-Balkar scientific center of RAS
PY  - 2024
SP  - 73
EP  - 83
VL  - 26
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IZKAB_2024_26_5_a5/
LA  - ru
ID  - IZKAB_2024_26_5_a5
ER  - 
%0 Journal Article
%A M. R. Vagizov
%A S. P. Khabarov
%T Parallelizing the ant colony algorithm
%J News of the Kabardin-Balkar scientific center of RAS
%D 2024
%P 73-83
%V 26
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IZKAB_2024_26_5_a5/
%G ru
%F IZKAB_2024_26_5_a5
M. R. Vagizov; S. P. Khabarov. Parallelizing the ant colony algorithm. News of the Kabardin-Balkar scientific center of RAS, Tome 26 (2024) no. 5, pp. 73-83. http://geodesic.mathdoc.fr/item/IZKAB_2024_26_5_a5/

[1] O. V. Darintsev, A. B. Migranov, “Using the ant algorithm to search for a strategy for the behavior of a group of mobile robots on a work field with obstacles”, Multiphase systems, 17:3-4 (2022), 177–186 (In Russian) | DOI

[2] A. A. Minin, V. A. Nemtinov, “Application of the ant colony algorithm for creating technological processes of cutting”, Engineering technologies, 2023, no. 3, 31–36, LAMZQA, EDN (In Russian)

[3] K. A. Pavlovskaya, V. V. Chervinsky, “Routing in MANET networks based on ant algorithms taking into account energy saving”, Bulletin of Donetsk National University. Series G: Technical Sciences, 2023, no. 1, 4–10, SWIUGB, EDN (In Russian)

[4] M. R. Vagizov, S. P. Khabarov, “Constructing program trajectories of motion based on solving the Dubins Machine problem”, Information and Space, 2021, no. 3, 116–125, DDDWFN, EDN (In Russian)

[5] A. S. Korenev, A. S. Skrypka, S. P. Khabarov, “Autonomous navigation on operating vessels”, Marine Bulletin, 2022, no. 1 (81), 92–95, MIPIOP, EDN (In Russian)

[6] S. P. Khabarov, M. L. Shilkina, “Geometric approach to solving the problem for Dubins machines in the formation of program trajectories of motion”, Bulletin of information technologies, mechanics and optics, 21:5 (2021), 653–663 (In Russian) | DOI

[7] M. I. Dumov, “Modeling of wireless networks in the OMNeT++ environment using the INET framework”, Scientific and Technical Bulletin of Information Technologies, Mechanics and Optics, 19:6 (2019), 1151–1161 (In Russian) | DOI