Using pairwise precedences for solving the linear ordering problem

Valentino Santucci, Josu Ceberio

Abstract: Highlights•This article presents a new meta-heuristic for the Linear Ordering Problem.•The CDRVNS meta-heuristic has been built by analyzing and exploiting information from the structure of the problem instances.•The proposed meta-heuristic has three main components: a constructive heuristic, a destruction procedure and a variable neighborhood search scheme based on restricted neighborhoods.•Experimental analysis and comparison with the state-of-the-art algorithms have been performed. Our algorithm clearly outperforms the previous state-of-the-art.•A theoretical and computational analysis of the contributions of the single algorithmic components is provided.