Abstract
Simulated annealing (SA) is a technique for combinatorial optimization problems, such as minimizing functions of many variables. The SA algorithm has the advantage of asymtotically producing the global optimal solution. In this work we developed a new global optimization method based on simulated annealing and Hooke-Jeeves optimization methods. This method is able to find the global minimum of test functions with an extremely high number of local minima. This new method has allowed us to reduce the amount of the computational effort. By this new method we have obtained good results and less function evaluations then simulated annealing algorithm.
| Original language | English |
|---|---|
| Pages | 199-202 |
| Number of pages | 4 |
| Publication status | Published - 1992 |
| Event | Proceedings of the 1992 Engineering Systems Design and Analysis Conference - Istanbul, Turk Duration: 29 Jun 1992 → 3 Jul 1992 |
Conference
| Conference | Proceedings of the 1992 Engineering Systems Design and Analysis Conference |
|---|---|
| City | Istanbul, Turk |
| Period | 29/06/92 → 3/07/92 |