Genetic algorithms for the linear ordering problem
Pavel Krömer, Václav Snåšel, Jan Platoš, Dušan Húsek · DSpace VŠB-TUO (VŠB-TUO) · 2009
inear ordering problem is a well-known optimization problem attractive for its complexity (it is an NP-hard problem), rich library of test data and variety of real world applications. In this paper, we investigate the use and performance of two variants of genetic algorithms, mutation only genetic algorithms and higher level chromosome genetic algorithm, on the linear ordering problem. Both methods are tested and evaluated on a library of real world and artificial linear ordering problem instances.