Predictive memetic algorithm (PMA) for combinatorial optimization in dynamic environments

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A prediction mechanism for Memetic Algorithm is presented in this paper. The Predictive Memetic Algorithm (PMA) uses a nonlinear regression method to estimate the parameters used by the algorithm to obtain good solutions in a dynamic and stochastic environment. The algorithm is applied to nonlinear data sets and performance is compared with genetic and simulated annealing algorithms. When compared with the existing methods, the proposed method generates a relatively small error difference after prediction thereby proving its superior performance. A dynamic stochastic environment is used for experimentation, so as to determine the efficacy of the algorithm on non-stationary problem environments.

Cite

CITATION STYLE

APA

Akandwanaho, S. M., & Viriri, S. (2018). Predictive memetic algorithm (PMA) for combinatorial optimization in dynamic environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11056 LNAI, pp. 100–110). Springer Verlag. https://doi.org/10.1007/978-3-319-98446-9_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free