Back to Search
Start Over
Solving the unconstrained optimization problem by a variable neighborhood search
- Source :
-
Journal of Mathematical Analysis & Applications . Apr2007, Vol. 328 Issue 2, p1178-1187. 10p. - Publication Year :
- 2007
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
- Subjects :
- *CONVEX functions
*REAL variables
*ALGORITHMS
*STANDARD deviations
Subjects
Details
- Language :
- English
- ISSN :
- 0022247X
- Volume :
- 328
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Journal of Mathematical Analysis & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 23615456
- Full Text :
- https://doi.org/10.1016/j.jmaa.2006.06.025