A heuristic approach for finding the global minimum: Adaptive random search technique


HAMZAÇEBİ C. , Kutay F.

APPLIED MATHEMATICS AND COMPUTATION, cilt.173, no.173, ss.1323-1333, 2006 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 173 Konu: 2
  • Basım Tarihi: 2006
  • Doi Numarası: 10.1016/j.amc.2005.05.002
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Sayfa Sayıları: ss.1323-1333

Özet

In this paper, a new random search technique which facilitates the determination of the global minimum, is presented. This method, called Adaptive Random Search Technique (ARSET), is experimented on test problems, and successful results are obtained. ARSET algorithm, outcome of which is observed to be relatively better, is also compared with other methods. In addition, applicability of the algorithm on artificial neural network training is tested with XOR problem. (c) 2005 Elsevier Inc. All rights reserved.