Abstract
The work is devoted to the problems of improving the search for rational sets of parameters of a complex technical system. Setting the parameter sets is carried out by specifying the boundaries of the parameter values and the variation step, and the sets of specific values form the solution. An approach with the possibility of a directed search for a solution that satisfies the decision maker is considered. If such a solution is not found, the algorithm will provide a complete search of all possible solutions. A multi-threaded socket connection is used to control the process of stopping and interacting with the calculator. Suggested: modification of the ant colony method using a hash table; new formula for probabilistic choice of vertices. The study was conducted on single-criteria tasks and benchmarks. The resulting modifications make it possible to find all solutions without using a multistart, leaving the advantages of the ant colony method: a quick search for rational solutions.
Publisher
Keldysh Institute of Applied Mathematics
Subject
General Materials Science
Reference20 articles.
1. Colorni A., Dorigo M., Maniezzo V. Distributed Optimization by Ant Colonies. // Proc. First Eur. Conf. on Artific. Life, Paris, France, F.Varela and P.Bourgine (Eds.), Elsevier Publishing. pp. 134-142, 1992
2. Dorigo M., Stützle, T.: Ant Colony Optimization //MIT Press, p. 321, 2004
3. Joseph M. Pasia, Richard F. Hartl, Karl F. Doerner. Solving a Bi-objective Flowshop Scheduling Problem by Pareto-Ant Colony Optimization M. Dorigo et al. (Eds.) // ANTS 2006, LNCS 4150, pp. 294–305, 2006
4. Torry Tufteland, Guro Ødesneltvedt, and Morten Goodwin Optimizing PolyACO Training with GPU-Based Parallelization M. Dorigo et al. (Eds.) // ANTS 2016, LNCS 9882, pp. 233–240, 2016. DOI: 10.1007/978-3-319-44427-7 20
5. Parpinelli R., Lopes H., Freitas A.: Data mining with an ant colony optimization algorithm // IEEE Trans. Evol. Comput. 6(4), pp. 321–332, 2002