@ARTICLE{26583204_269674611_2019, author = {Andranik Akopov and Armen Beklaryan and Manoj Thakur and Bhisham Verma}, keywords = {, real-coded genetic algorithms, multi-object optimization, Pareto front, simulation modelingAnyLogic}, title = {

Developing parallel real-coded genetic algorithms for decision-making systems of socio-ecological and economic planning

}, journal = {}, year = {2019}, number = {1 Vol.13}, pages = {33-44}, url = {https://bijournal.hse.ru/en/2019--1 Vol.13/269674611.html}, publisher = {}, abstract = {      This article presents a new approach to designing decision-making systems for socio-economic and ecological planning using parallel real-coded genetic algorithms (RCGAs), aggregated with simulation models by objective functions. A feature of this approach is the use of special agent-processes, which are autonomous genetic algorithms (GAs) acting synchronously in parallel streams and exchanging periodically by the best potential decisions. This allows us to overcome the premature convergence problem in local extremums. In addition, it was shown that the combined use of different crossover and mutation operators significantly improves the time efficiency of RCGAs, as well as the quality of the decisions obtained (proximity to optimum), providing a more diverse population of potential decisions (individuals).      In this paper, several suggested crossover and mutation operators are used, in particular, a modified simulated binary crossover (MSBX) and scalable uniform mutation operator (SUM), which is based on quantization of the feasible region of the search space (dividing the feasible region on small subranges with equal lengths) while taking into account the common amount of interacting agent-processes and the maximum number of internal iterations of GAs forming potential decisions through selection, crossover and mutation. Such a functional dependence of the parameters of heuristic operators on the corresponding process characteristics, aggregated with the combined probabilistic use of various crossover and mutation operators, makes it possible to get maximum effect from the multi-processes architecture. As a result, thecomputational possibilities of RCGAs for solving large-scale optimization problems (hundreds and thousands of decision variables, multiple objective functions) become dependent only on the physical characteristics of the existingcomputing clusters. This makes it possible to efficiently use supercomputer technologies.      An important advantage of the proposed system is the implemented integration between the developed parallel RCGA (implemented in C++ and MPI) and the simulation modelling system AnyLogic (Java) using JNI technology. Such an approach allows one to synthesize real world optimization problems in decision-making systems of socio-economic and ecological planning, using simulation methods supported by AnyLogic. The result is an effective solution to single-objective and multi-objective optimization tasks of large dimension, in which the objective functionals are the result of simulation modeling and cannot be obtained analytically.}, annote = {      This article presents a new approach to designing decision-making systems for socio-economic and ecological planning using parallel real-coded genetic algorithms (RCGAs), aggregated with simulation models by objective functions. A feature of this approach is the use of special agent-processes, which are autonomous genetic algorithms (GAs) acting synchronously in parallel streams and exchanging periodically by the best potential decisions. This allows us to overcome the premature convergence problem in local extremums. In addition, it was shown that the combined use of different crossover and mutation operators significantly improves the time efficiency of RCGAs, as well as the quality of the decisions obtained (proximity to optimum), providing a more diverse population of potential decisions (individuals).      In this paper, several suggested crossover and mutation operators are used, in particular, a modified simulated binary crossover (MSBX) and scalable uniform mutation operator (SUM), which is based on quantization of the feasible region of the search space (dividing the feasible region on small subranges with equal lengths) while taking into account the common amount of interacting agent-processes and the maximum number of internal iterations of GAs forming potential decisions through selection, crossover and mutation. Such a functional dependence of the parameters of heuristic operators on the corresponding process characteristics, aggregated with the combined probabilistic use of various crossover and mutation operators, makes it possible to get maximum effect from the multi-processes architecture. As a result, thecomputational possibilities of RCGAs for solving large-scale optimization problems (hundreds and thousands of decision variables, multiple objective functions) become dependent only on the physical characteristics of the existingcomputing clusters. This makes it possible to efficiently use supercomputer technologies.      An important advantage of the proposed system is the implemented integration between the developed parallel RCGA (implemented in C++ and MPI) and the simulation modelling system AnyLogic (Java) using JNI technology. Such an approach allows one to synthesize real world optimization problems in decision-making systems of socio-economic and ecological planning, using simulation methods supported by AnyLogic. The result is an effective solution to single-objective and multi-objective optimization tasks of large dimension, in which the objective functionals are the result of simulation modeling and cannot be obtained analytically.} }