Authors: Dražić, Milan
Dražić, Zorica
Mladenović, Nenad 
Urošević, Dragan 
Zhao, Qiu Hong
Title: Continuous variable neighbourhood search with modified Nelder-Mead for non-differentiable optimization
Journal: IMA Journal of Management Mathematics
Volume: 27
Issue: 1
First page: 75
Last page: 88
Issue Date: 1-Jan-2016
Rank: M23
ISSN: 1471-678X
DOI: 10.1093/imaman/dpu012
Several variants of variable neighbourhood search (VNS) for solving unconstrained and constrained continuous optimization problems have been proposed in the literature. In this paper, we suggest two new variants, one of which uses the recent modified Nelder-Mead (MNM) direct search method as a local search and the other an extension of the MNM method obtained by increasing the size of the simplex each time the search cannot be continued. For these new and some previous VNS variants, extensive computational experiments are performed on standard and large non-differentiable test instances. Some interesting observations regarding comparison of some VNS variants with NM based local search are made.
Keywords: global optimization | heuristics | non-differentiable optimization | simplex method | variable neighbourhood search.
Publisher: Oxford University Press

Show full item record


checked on May 23, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.