论文信息 - Differential Evolution and Genetic Algorithms for the Linear Ordering Problem

Differential Evolution and Genetic Algorithms for the Linear Ordering Problem

Linear ordering problem (LOP) is a well know NP-hard optimization problem attractive for its complexity, rich collection of testing data and variety of real world applications. It is also a popular benchmark for novel optimization and metaheuristic algorithms. In this paper, we compare the performance of genetic algorithms and differential evolution as efficient metaheuristic solvers of the LOP.

Václav Snásel | Jan Platos | Pavel Krömer

[1] Rolf Drechsler,et al. Applications of Evolutionary Computing, EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings , 2008, EvoWorkshops.

[2] Václav Snásel,et al. Genetic Algorithms Searching for Turbo Code Interleaver and Solving Linear Ordering Problem , 2008, 2008 7th Computer Information Systems and Industrial Management Applications.

[3] Thomas Stützle,et al. Search Space Analysis of the Linear Ordering Problem , 2003, EvoWorkshops.

[4] R. Storn,et al. Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[5] Václav Snásel,et al. Evolutionary Approaches to Linear Ordering Problem , 2008, 2008 19th International Workshop on Database and Expert Systems Applications.

[6] Daniel A. Ashlock,et al. Evolutionary computation for modeling and optimization , 2005 .

[7] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .

[8] F. Campos,et al. Towards a ‘Virtual’ Rationality? , 1999 .

[9] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .

[10] Fred W. Glover,et al. An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem , 2001, J. Glob. Optim..

[11] Andrew Lim,et al. Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem , 2003, GECCO.