Article ID: | iaor2013167 |
Volume: | 18 |
Issue: | 6 |
Start Page Number: | 919 |
End Page Number: | 938 |
Publication Date: | Dec 2012 |
Journal: | Journal of Heuristics |
Authors: | Mart Rafael, Duarte Abraham, Gortzar Francisco, Lozano Manuel |
Keywords: | combinatorial optimization, graphs, heuristics: tabu search |
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