Filtreler
Filtreler
Bulunan: 1 Adet 0.001 sn
Konu Başlıkları: Function minimizatio ... ✕Yayın Dili: eng ✕Konu Başlıkları: Genetic algorithms ✕Yayın Dili: eng ✕Yayın Türü: Article ✕Konu Başlıkları: Function minimizatio ... ✕Konu Başlıkları: Local search ✕
Koleksiyon [3]
Tam Metin [1]
Yayın Türü [1]
Yazar [1]
Yayın Yılı [1]
Konu Başlıkları [4]
Yayın Dili [1]
Dergi Adı [1]
Improving genetic algorithms' performance by local search for continuous function optimization
Hamzaçebi C.
Article | 2008 | Applied Mathematics and Computation196 ( 1 ) , pp.309 - 317
The genetic algorithms (GAs) can be used as a global optimization tool for continuous and discrete functions problems. However, a simple GA may suffer from slow convergence, and instability of results. GAs' problem solution power can be increased by local searching. In this study a new local random search algorithm based on GAs is suggested in order to reach a quick and closer result to the optimum solution. © 2007 Elsevier Inc. All rights reserved.
