Abstract

Reduction of computational costs of optimization of real industrial processes is crucial, because the models of these processes are often complex and demand time consuming numerical computations. Iterative optimization procedures have to run the simulations many times and therefore the computational costs of the optimization may be unacceptable high. This is why a new optimization methods and strategies which need less simulation runs are searched. The paper is focused on the problem of reduction of computational costs of optimization procedure. The main goal is the presentation of developed by the Authors new, efficient Approximation Based Optimization (ABO) and Modified Approximation Based Optimization (MABO) methods which allow finding the global minimum in smaller number of objective function calls. Detailed algorithm of the MABO method as well as the results of tests using several benchmark functions are presented. The efficiency of MABO method was compared with heuristic methods and the results show that MABO method reduces the computational costs and improve the optimization accuracy.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call