Cross entropy-based memetic algorithms: An application study over the tool switching problem

DOI

10.1080/18756891.2013.792542How to use a DOI?

Keywords

Cross-entropy method, memetic algorithms, hybridization, tool switching problem

Abstract

This paper presents a parameterized schema for building memetic algorithms based on cross-entropy (CE) methods. This novel schema is general in nature, and features multiple probability mass functions and Lamarckian learning. The applicability of the approach is assessed by considering the Tool Switching Problem, a complex combinatorial problem in the field of Flexible Manufacturing Systems. An exhaustive evaluation (including techniques ranging from local search and evolutionary algorithms to constructive methods) provides evidence of the effectiveness of CE-based memetic algorithms.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Jhon Edgar Amaya
AU  - Carlos Cotta
AU  - AntonioJ. Fernández-Leiva
PY  - 2013
DA  - 2013/05/01
TI  - Cross entropy-based memetic algorithms: An application study over the tool switching problem
JO  - International Journal of Computational Intelligence Systems
SP  - 559
EP  - 584
VL  - 6
IS  - 3
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2013.792542
DO  - 10.1080/18756891.2013.792542
ID  - Amaya2013
ER  -