RK-EDA: a novel random key based estimation of distribution algorithm.
Ayodele, Mayowa; McCall, John; Regnier-Coudert, Olivier
Peter R. Lewis
The challenges of solving problems naturally represented as permutations by Estimation of Distribution Algorithms (EDAs) have been a recent focus of interest in the evolutionary computation community. One of the most common alternative representations for permutation based problems is the Random Key (RK), which enables the use of continuous approaches for this problem domain. However, the use of RK in EDAs have not produced competitive results to date and more recent research on permutation based EDAs have focused on creating superior algorithms with specially adapted representations. In this paper, we present RK-EDA; a novel RK based EDA that uses a cooling scheme to balance the exploration and exploitation of a search space by controlling the variance in its probabilistic model. Unlike the general performance of RK based EDAs, RK-EDA is actually competitive with the best EDAs on common permutation test problems: Flow Shop Scheduling, Linear Ordering, Quadratic Assignment, and Travelling Salesman Problems.
|Start Date||Sep 17, 2016|
|Publication Date||Sep 23, 2016|
|Publisher||Springer (part of Springer Nature)|
|Series Title||Lecture notes in computer science|
|Institution Citation||AYODELE, M., MCCALL, J. and REGNIER-COUDERT, O. 2016. RK-EDA: a novel random key based estimation of distribution algorithm. In Handl, J., Hart, E., Lewis, P.R., López-Ibáñez, M., Ochoa, G. and Paechter, B. (eds.) Parallel problem solving from natuture: proceedings of the 14th International parallel problem solving from nature conference (PPSN XIV), 17-21 September 2016, Edinburgh, UK. Lecture notes in computer science, 9921. Cham: Springer [online], pages 849-858. Available from: https://doi.org/10.1007/978-3-319-45823-6_79.|
|Keywords||Estimation of distribution algorithm; Random key; Permutation problems; Cooling scheme; Univariate model|
AYODELE 2016 RK-EDA
You might also like
Ensemble selection based on classifier prediction confidence.
Introducing the dynamic customer location-allocation problem.
Simultaneous meta-data and meta-classifier selection in multiple classifier system.
Limitations of benchmark sets and landscape features for algorithm selection and performance prediction.
On the definition of dynamic permutation problems under landscape rotation.