Differential Evolution and Genetic Algorithms for the Linear Ordering Problem

Authors:
Václav Snášel;Pavel Krömer;Jan Platoš
Affiliations:
Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB - Technical University of Ostrava, Poruba, Czech Republic;Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB - Technical University of Ostrava, Poruba, Czech Republic;Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB - Technical University of Ostrava, Poruba, Czech Republic
Venue:
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Year:
2009

Citing 8
Cited 1

An introduction to genetic algorithms

An introduction to genetic algorithms
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

Journal of Global Optimization
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Genetic Algorithms Searching for Turbo Code Interleaver and Solving Linear Ordering Problem

CISIM '08 Proceedings of the 2008 7th Computer Information Systems and Industrial Management Applications
Evolutionary Approaches to Linear Ordering Problem

DEXA '08 Proceedings of the 2008 19th International Conference on Database and Expert Systems Application
Designing a hybrid genetic algorithm for the linear ordering problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Search space analysis of the linear ordering problem

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Evolutionary Computation for Modeling and Optimization

Evolutionary Computation for Modeling and Optimization

Differential evolution for a constrained combinatorial optimisation problem

International Journal of Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.