An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
Variable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on a systematic change of neighborhoods. In recent years, a large variety of VNS strategies have been proposed. However, we have only found limited experimental comparisons among different VNS variants. Thi...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2012 |
| País: | España |
| Institución: | Universidad Rey Juan Carlos |
| Repositorio: | BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos |
| OAI Identifier: | oai:burjcdigital.urjc.es:10115/12380 |
| Acceso en línea: | http://hdl.handle.net/10115/12380 |
| Access Level: | acceso abierto |
| Palabra clave: | Informática Ciencias de la Computación VNS Profile Vertex Separation metaheuristic 3304.06 Arquitectura de Ordenadores 1203.17 Informática |
| Sumario: | Variable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on a systematic change of neighborhoods. In recent years, a large variety of VNS strategies have been proposed. However, we have only found limited experimental comparisons among different VNS variants. This paper reviews three VNS strategies for finding near-optimal solutions for vertex-cut minimization problems. Specifically, we consider the min-max variant (Vertex Separation Problem) and the min-sum variant (SumCut Minimization Problem). We also present an preliminary computational comparison of the methods on previously reported instances. |
|---|