Solving the Linear Ordering Problem Using a Genetic Algorithm with Local Search

The linear ordering problem (LOP) is an NP-hard problem in combinatorial optimization. The problem has been investigated in many research areas such as mathematics, logistics, economics, computer science, etc. The complexity motivates researchers to find effective solution methods to the problem. The aim of this study is to develop an efficient algorithm to solve LOP. In this study, a genetic algorithm based approach is proposed for LOP. An additional local search component is embedded in the algorithm to intensify the search. Proposed algorithm is applied to a number of LOP instances taken from the LOLIB. At the end of the computational study, competitive and effective results are found