New global optimization method based on simulated annealing algorithm

T. Gunel*, B. Yazgan

*Bu çalışma için yazışmadan sorumlu yazar

Araştırma sonucu: ???type-name???Yazıbilirkişi

Özet

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.

Orijinal dilİngilizce
Sayfalar199-202
Sayfa sayısı4
Yayın durumuYayınlandı - 1992
EtkinlikProceedings of the 1992 Engineering Systems Design and Analysis Conference - Istanbul, Turk
Süre: 29 Haz 19923 Tem 1992

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???Proceedings of the 1992 Engineering Systems Design and Analysis Conference
ŞehirIstanbul, Turk
Periyot29/06/923/07/92

Parmak izi

New global optimization method based on simulated annealing algorithm' araştırma başlıklarına git. Birlikte benzersiz bir parmak izi oluştururlar.

Alıntı Yap