"A hybrid heuristic parallel method of global optimization"
Pushkaryov K.V. and Koshur V.D.

The problem of finding the global minimum of a continuous objective function of multiple variables in a multidimensional parallelepiped is considered. A hybrid heuristic parallel method for solving of complicated global optimization problems is proposed. The method is based on combining various methods and on the multi-agent technology. It consists of new methods (for example, the method of neural network approximation of inverse coordinate mappings that uses Generalized Regression Neural Networks (GRNN) to map the values of an objective function to coordinates) and modified classical methods (for example, the modified Hooke-Jeeves method). An implementation of the proposed method as a cross-platform (on the source code level) library written in the C++ language is briefly discussed. This implementation uses the message passing via MPI (Message Passing Interface). The method is compared with 21 modern methods of global optimization and with a genetic algorithm using 28 test objective functions of 50 variables.

Keywords: global optimization, heuristic methods, neural networks, parallel computing, C++, MPI.

  • Pushkaryov K.V. – Siberian Federal University, Institute of Space and Information Technologies; ulitsa Kirenskogo 26, Krasnoyarsk, 660074, Russia; Senior Lecturer, e-mail: cyril.pushkaryov@yandex.ru
  • Koshur V.D. – Siberian Federal University, Institute of Space and Information Technologies; ulitsa Kirenskogo 26, Krasnoyarsk, 660074, Russia; Dr. Sci., Professor, e-mail: VKoshur@sfu-kras.ru