An Algebraic Differential Evolution for the Linear Ordering Problem
Open Access
- 11 July 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1479-1480
Abstract
In this paper we propose a discrete algebraic-based Differential Evolution for the Linear Ordering Problem (LOP). The search space of LOP is composed by permutations of objects, thus it is possible to use some group theoretical concepts and methods. Indeed, the proposed algorithm is a fully discrete Differential Evolution scheme and has been designed by exploiting the group structure of LOP solutions in order to mimic the classical Differential Evolution behavior observed in continuous numerical spaces. The performances have been evaluated over widely known LOP benchmark suites and have been compared to the state-of-the-art results.Keywords
Funding Information
- University of Perugia - DMI Laboratory "Knowledge and Information Technology Laboratory" (KITLab)
- University of Perugia - DMI Project "Mobile Knowledge Agents in Evolutionary Environments"
This publication has 5 references indexed in Scilit:
- The linear ordering problem revisitedEuropean Journal of Operational Research, 2015
- A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion2014
- The Linear Ordering Problem2011
- Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark ProblemsIEEE Transactions on Evolutionary Computation, 2006
- The linear ordering problem: Instances, search space analysis and algorithmsJournal of Mathematical Modelling and Algorithms, 2005