Variable neighborhood search with ejection chains for the antibandwidth problem

  • Authors:

  • Manuel Lozano;Abraham Duarte;Francisco Gortázar;Rafael Martí

  • Affiliations:

  • Departamento de Ciencias de la Computación e Inteligencia Artificial, Universidad de Granada, Granada, Spain;Departamento de Ciencias de la Computación, Universidad Rey Juan Carlos, Madrid, Spain;Departamento de Ciencias de la Computación, Universidad Rey Juan Carlos, Madrid, Spain;Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Valencia, Spain

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we address the optimization problem arising in some practical applications in which we want to maximize the minimum difference between the labels of adjacent elements. For example, in the context of location models, the elements can represent sensitive facilities or chemicals and their labels locations, and the objective is to locate (label) them in a way that avoids placing some of them too close together (since it can be risky). This optimization problem is referred to as the antibandwidth maximization problem (AMP) and, modeled in terms of graphs, consists of labeling the vertices with different integers or labels such that the minimum difference between the labels of adjacent vertices is maximized. This optimization problem is the dual of the well-known bandwidth problem and it is also known as the separation problem or directly as the dual bandwidth problem. In this paper, we first review the previous methods for the AMP and then propose a heuristic algorithm based on the variable neighborhood search methodology to obtain high quality solutions. One of our neighborhoods implements ejection chains which have been successfully applied in the context of tabu search. Our extensive experimentation with 236 previously reported instances shows that the proposed procedure outperforms existing methods in terms of solution quality.