The linear ordering problem revisited
Lists
Only you see this
Abstract
Highlights•We study the linear ordering problem and we propose a method to improve the state-of-the-art algorithms.•We introduce an algorithm that identifies positions at which indexes within a solution cannot generate local optimum solutions.•We propose a modified version of the insert neighbourhood which discards the operations that lead indexes to these restricted positions.•We propose a modified version of the insert neighbourhood which discards the operations that lead indexes to these restricted positions.•Experimental study clearly confirms the advantage of using our neighbourhood in the state-of-the-art algorithms, instead of the classical neighbourhood.
BibTeX
@article{ceberio2015linear,
author = {Josu Ceberio and Alexander Mendiburu and José Antonio Lozano},
title = {{The linear ordering problem revisited}},
journal = {Eur. J. Oper. Res.},
year = {2015},
doi = {10.1016/j.ejor.2014.09.041},
}Loading related content...