ARTICLE
TITLE

OPTIMIZATION METHOD BASED ON THE SYNTHESIS OF CLONAL SELECTION AND ANNEALING SIMULATION ALGORITHMS

SUMMARY

Context. The problem of increasing the efficiency of optimization methods by synthesizing metaheuristics is considered. The objectof the research is the process of finding a solution to optimization problems.Objective. The goal of the work is to increase the efficiency of searching for a quasi-optimal solution at the expense of a metaheuristicmethod based on the synthesis of clonal selection and annealing simulation algorithms.Method. The proposed optimization method improves the clonal selection algorithm by dynamically changing based on the annealingsimulation algorithm of the mutation step, the mutation probability, the number of potential solutions to be replaced. Thisreduces the risk of hitting the local optimum through extensive exploration of the search space at the initial iterations and guaranteesconvergence due to the focus of the search at the final iterations. The proposed optimization method makes it possible to find a conditionalminimum through a dynamic penalty function, the value of which increases with increasing iteration number. The proposedoptimization method admits non-binary potential solutions in the mutation operator by using the standard normal distribution insteadof the uniform distribution.Results. The proposed optimization method was programmatically implemented using the CUDA parallel processing technologyand studied for the problem of finding the conditional minimum of a function, the optimal separation problem of a discrete set, thetraveling salesman problem, the backpack problem on their corresponding problem-oriented databases. The results obtained allowedto investigate the dependence of the parameter values on the probability of mutation.Conclusions. The conducted experiments have confirmed the performance of the proposed method and allow us to recommend itfor use in practice in solving optimization problems. Prospects for further research are to create intelligent parallel and distributedcomputer systems for general and special purposes, which use the proposed method for problems of numerical and combinatorialoptimization, machine learning and pattern recognition, forecast.

 Articles related

N. D. Koshevoy,?. ?. Kostenko,V. V. Muratov,?. ?. Kriukov,A. I. Bilenko,?. ?. Morozov    

Relevance. It is proposed to use methods to search for fish schools, monkey searches, jumping frogs for constructing optimal cost (time) experiment plans in the study of technological processes and systems that allow the implementation of an active exper... see more


N. D. Koshevoy,E. M. Kostenko,A. A. Beliaieva    

Context. For the first time, the use of taboo-search methods, random search, a swarm of particles for the construction of costeffectiveexperiment plans for the study of a weighing system and a temperature regulator was proposed.Objective – to carry out a... see more


V. I. Levin    

The existing approaches to the optimization (optimal design) of systems under uncertainty are considered. An exact formulation ofproblem of constrained optimization under interval uncertainty of the parameters of the objective function and constraints is... see more


I. Lutsenko,E. Fomovskaya,I. Oksanych,O. Serdiuk    

Context. The urgent verification problem of criterion for optimization of operational processes with the distributed parameters is solved.Objective is creation of a verification method for estimated criteria which have high selectivity and allow excludin... see more


Christian Thaddeus Hendratama, Setyawan Wibisono    

In determining the choice of the right study program and college to continue education for the community and high school or vocational high school students it is very important. There are factors that influence the selection process, namely interests, ta... see more