Abstract
The paper considers the modification and application of the ant colony method for the problem of directed enumeration of the values of system parameters when performing calculated multiple calculations. Interaction with the user makes it possible to stop the process of exhaustive enumeration of sets of parameter values, and the application of a modification of the ant colony method will allow us to consider rational sets at early iterations. If the user does not terminate the algorithm, then the proposed modifications allow one to enumerate all solutions using the ant colony method. To modify the ant colony method, a new probabilistic formula and various algorithms of the ant colony method are proposed, allowing for each agent to find a new set of parameter values. The optimal algorithm, according to the research results, is the use of repeated endless cyclic search for a new solution. This modification allows you to consider all solutions, and at the same time, find all the optimal solutions among the first 5% of the considered solutions.
REFERENCES
Feurer, M., Hutter, F., and Vanschoren, J., Hyperparameter Optimization, in The Springer Series on Challenges in Machine Learning, Cham: Springer, 2019. https://doi.org/10.1007/978-3-030-05318-5_l
Koehrsen, W., A Conceptual Explanation of Bayesian Hyperparameter Optimization for Machine Learning, 2018. https://towardsdatascience.com/a-conceptual-explanation-of-bayesian-model-based-hyperparameter-optimization-for-machine-learning-b8172278050f
Colorni, A., Dorigo, M., and Maniezzo, V., Distributed Optimization by Ant Colonies, in Proc. First Eur. Conf. on Artific. Life, Paris: Elsevier Publishing, 1992, pp. 134–142.
Dorigo, M. and Stiitzle, T., Ant Colony Optimization, Cambridge: MIT Press, 2004.
Socha, K. and Dorigo, M., Ant Colony Optimization for Continuous Domains, Eur. J. Oper. Res., 2008, vol. 185, no. 3, pp. 1155–1173. https://doi.org/10.1016/j.ejor.2006.06.046
Mohamad, M., Tokhi, M., and Omar, O.M., Continuous Ant Colony Optimization for Active Vibration Control of Flexible Beam Structures, IEEE International Conf. on Mechatronics (ICM), 2011, no. 4, pp. 803–808.
Karpenko, A.P. and Chernobrivchenko, K.A., Efficiency of Optimization by a Continuously Interacting Ant Colony Method (CIAC), Science and education: scientific edition of Bauman Moscow State Technical University, 2011, no. 2. https://doi.org/10.7463/0211.0165551
Karpenko, A.P. and Chernobrivchenko, K.A., Multimemetic Modification of Hybrid Ant Algorithm for Continuous Optimization HCIAC, Science and education: scientific edition of Bauman Moscow State Technical University, 2012, no. 9. https://doi.org/10.7463/0912.0470529
Karpenko, A.P., Sovremennye algoritmy poiskovoi optimizatsii. Algoritmy, vdokhnovlennye prirodoi (Modern Search Engine Optimization Algorithms. Algorithms Inspired by Nature), Moscow: MGTU im. Baumana, 2017, 2nd ed.
Simon, D., Algoritmy evolyutsionnoi optimizatsii: prakticheskoe rukovodstvo (Evolutionary Optimization Algorithms: A Practical Guide), Moscow: DMK Press, 2020.
Sudakov, V.A. and Titov, Y.P., Modified Method of Ant Colonies Application in Search for Rational Assignment of Employees to Tasks, in Proceedings of 4th Computational Methods in Systems and Software 2020, vol. 2, Vsetin: Springer Nature, 2020, pp. 342–348. https://doi.org/10.1007/978-3-030-63319-6_30
Khakhulin, G.F. and Titov, Yu.P., Decision Support System for the Supply of Military Aircraft Spare Parts, Izv. of Samara scientific center of RAS, 2014, vol. 16, nos. 1–5, pp. 1619–1623.
Sinitsyn, I.N. and Titov, Yu.P., Development of Stochastic Algorithms for Ant Organization, Bionika–60 let. Itogi i perspektivy. Sbornik statei Pervoi mezhdunarodnoi nauchno-prakticheskoi konferentsii (Bionics–60 Years: Results and Prospects: Proceedings of First International Scientific and Practical Conference), Karpenko, A.P., Ed., Moscow: Assots. Tekh. Univ., 2022, pp. 210–220.
Titov, Y.P., Modifications of the Ant Colony Method for Aviation Routing, Autom. Remote Control, 2015, vol. 76, no. 3, pp. 458–471. https://doi.org/10.1134/S0005117915030091
Sudakov, V.A., Bat’kovskii, A.M., and Titov, Yu.P., Speedup Algorithms for Modifying Ant Colony Method for Finding Rational Assignment of Employees to Tasks with Uncertain Completion Times, Sovremennye informa-tsionnye tekhnologii i IT-obrazovanie, 2020, vol. 16, no. 2, pp. 338–350. https://doi.org/10.25559/SITITO.16.202002.338-350
Parpinelli, R., Lopes, H., and Freitas, A., Data Mining with an Ant Colony Optimization Algorithm, IEEE Trans. Evol. Comput., 2002, vol. 6, no. 4, pp. 321–332.
Junior, I.C., Data Mining with Ant Colony Algorithms, ICIC. LNCS, 2013, vol. 7996, pp. 30–38.
Martens, D., De Backer, M., Haesen, R., and Vanthienen, J., Classification with Ant Colony Optimization, IEEE Trans. Evol. Comput., 2007, vol. 11, no. 5, pp. 651–665.
Pasia, J.M., Hartl, R.F., and Doerner, K.F., Solving a Bi-objective Flowshop Scheduling Problem by Pareto-Ant Colony Optimization, ANTS, 2006, pp. 294–305.
Titov, Yu.P., Experience in Modeling Supply Planning Using Modifications of the Ant Colony Method in High Availability Systems, Sistemy vysokoi dostupnosti, 2018, vol. 14, no. 1, pp. 27–42.
Sinitsyn, I.N. and Titov, Yu.P., Optimization of Hyperparameter Ordering of Computational Cluster by Ant Colony Method, Sistemy vysokoi dostupnosti, 2022, vol. 18, no. 3, pp. 23–37. https://doi.org/10.18127/j20729472-202203-02
Mishra Sudhanshu, K., Some New Test Functions for Global Optimization and Performance of Repulsive Particle Swarm Method, University Library of Munich, Germany, MPRA Paper, 2006. https://doi.org/10.2139/ssrn.926132
Layeb Abdesslem, New Hard Benchmark Functions for Global Optimization, 2022. https://doi.org/10.48550/arXiv.2202.04606
Author information
Authors and Affiliations
Corresponding authors
Additional information
This paper was recommended for publication by O.P. Kuznetsov, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Sinitsyn, I.N., Titov, Y.P. Control of Set of System Parameter Values by the Ant Colony Method. Autom Remote Control 84, 893–903 (2023). https://doi.org/10.1134/S0005117923080106
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117923080106