The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities. Owing to the computational complexity of the problem, researchers have developed several heuristics to...

In this work we present a local search algorithm for the single row facility location problem. In contrast to other local search algorithms for the problem, our algorithm uses an exponential neighborhood structure. Our computations indicate that our local search algorithm generates solutions to...