|Title:||General variable neighborhood search for the continuous optimization||Journal:||European Journal of Operational Research||Volume:||191||Issue:||3||First page:||753||Last page:||770||Issue Date:||16-Dec-2008||Rank:||M21||ISSN:||0377-2217||DOI:||10.1016/j.ejor.2006.12.064||Abstract:||
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are handled using exterior point penalty functions within an algorithm that combines sequential and exact penalty transformations. The extensive computer analysis that includes the comparison with genetic algorithm and some other approaches on standard test functions are given. With our approach we obtain encouraging results.
|Keywords:||Global optimization | Metaheuristics | Nonlinear programming | Variable neighborhood search||Publisher:||Elsevier|
Show full item record
checked on Aug 17, 2022
checked on Aug 18, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.