Gaussian variable neighborhood search for continuous optimization
Variable Neighborhood Search (VNS) has shown to be a powerful tool for solving both discrete and box-constrained continuous optimization problems. In this note we extend the methodology by allowing also to address unconstrained continuous optimization problems. Instead of perturbing the incumbent so...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/107639 |
| Acceso en línea: | https://hdl.handle.net/11441/107639 https://doi.org/10.1016/j.cor.2011.11.003 |
| Access Level: | acceso abierto |
| Palabra clave: | Global optimization Nonlinear programming Metaheuristics Variable neighborhood search Gaussian distribution |
| Sumario: | Variable Neighborhood Search (VNS) has shown to be a powerful tool for solving both discrete and box-constrained continuous optimization problems. In this note we extend the methodology by allowing also to address unconstrained continuous optimization problems. Instead of perturbing the incumbent solution by randomly generating a trial point in a ball of a given metric, we propose to perturb the incumbent solution by adding some noise, following a Gaussian distribution. This way of generating new trial points allows one to give, in a simple and intuitive way, preference to some directions in the search space, or, contrarily, to treat uniformly all directions. Computational results show some advantages of this new approach. |
|---|