MEMETIC ALGORITHM WITH MULTI-PARENT CROSSOVER (MA-MPC) FOR MULTI-OBJECTIVE NETWORK DESIGN

  • R. O. Oladele University of Ilorin, Ilorin, Nigeria
  • O. T. Oladele Federal University of Technology, P. M. B. 704, Akure, NIGERIA.

Abstract

In many Evolutionary Algorithms (EAs), a crossover with two parents is commonly used to produce offsprings. Interestingly, we need not restrict ourselves to two-parent crossover since EA allows us to emulate natural evolution in a more flexible fashion. There are experimental results in the literature which show that multi-parent crossover operators can achieve better performance than traditional two-parent versions. However, most of these experimental results are based on common test functions. Experimental studies involving real-life, NP-hard problems such as network design problem are very rare. This paper presents Memetic Algorithm with Multi-Parent Crossover (MA-MPC) with a view to providing a case study of multi-parent crossover within the framework of MA for network topology design problem. Results show that MA-MPC does not always outperform MA. It depends on the size of the problem and the number parents (be it 3, 5, 7, or any other)

Author Biographies

R. O. Oladele, University of Ilorin, Ilorin, Nigeria

Department of Computer Science

O. T. Oladele, Federal University of Technology, P. M. B. 704, Akure, NIGERIA.

Department of Computer Science 

Published
2013-07-02
How to Cite
Oladele, R., & Oladele, O. (2013). MEMETIC ALGORITHM WITH MULTI-PARENT CROSSOVER (MA-MPC) FOR MULTI-OBJECTIVE NETWORK DESIGN. LAUTECH Journal of Engineering and Technology, 7(2), 87-92. Retrieved from http://laujet.com/index.php/laujet/article/view/143
Section
Articles