Search space analysis of the linear ordering problem

23Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solution have been proposed. However, few details are known about the search space characteristics of LOP instances. In this article we develop a detailed study of the LOP search space. The results indicate that, in general, LOP instances show high fitness-distance correlations and large autocorrelation length but also that there exist significant differences between real-life and randomly generated LOP instances. Because of the limited size of real-world instances, we propose new, randomly generated large real-life like LOP instances which appear to be much harder than other randomly generated instances. Additionally, we propose a rather straightforward Iterated Local Search algorithm, which shows better performance than several state-of-the-art heuristics. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Schiavinotto, T., & Stützle, T. (2003). Search space analysis of the linear ordering problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2611, 322–333. https://doi.org/10.1007/3-540-36605-9_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free