Solving the unconstrained optimization problem by a variable neighborhood search


TOKSARI M. D. , Güner E.

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, cilt.328, ss.1178-1187, 2007 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 328 Konu: 2
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1016/j.jmaa.2006.06.025
  • Dergi Adı: JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
  • Sayfa Sayıları: ss.1178-1187

Özet

This paper presents variable neighborhood search (VNS) for the problem of finding the global minimum of a nonconvex function. The variable neighborhood search, which changes systematically neighborhood structures in the search for finding a better solution, is used to guide a set of standard improvement heuristics. This algorithm was tested on some standard test functions, and successful results were obtained. Its performance was compared with the other algorithms, and observed to be better. (c) 2006 Elsevier Inc. All rights reserved.