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 paper we propose a local search based improvement heuristic called diversified local search for the traveling salesman problem. We show through computational experiements that this algorithm outperforms tabu search with similar neighborhood structures on large sized traveling salesman...