Variable neighborhood search with ejection chains for the antibandwidth problem
- 339 Downloads
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.
KeywordsMetaheuristics VNS Layout problems
This research has been partially supported by the Ministerio de Ciencia e Innovación of Spain within the OPTSICOM project (http://www.optsicom.es/) with grant codes TIN2008-05854, TIN2009-07516, TIN2012-35632, and P08-TIC-4173.
- Cappanera, P.: A survey on obnoxious facility location problems. Technical Report TR-99-11, Dipartimento di Informatica, Università di Pisa (1999)Google Scholar
- Hansen, P., Mladenovic, N., Brimberg, J., Moreno-Pérez, J.A.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd edn, pp. 61–86. Springer, Heidelberg (2010)Google Scholar
- Harwell-Boeing: http://math.nist.gov/MatrixMarket/data/Harwell-Boeing/ (2011)
- Pantrigo, J.J., Martí, R., Duarte, A., Pardo, E.G.: Scatter search for the cutwidth minimization problem. Ann. Oper. Res. 199(1), 285–304 (2012)Google Scholar