Memetic Algorithm with Multi-parent Crossover (MA-MPC) for Multi-objective Network Design.
| dc.contributor.author | Oladele, R.O. | |
| dc.contributor.author | Oladele, O.T. | |
| dc.date.accessioned | 2019-05-03T08:57:43Z | |
| dc.date.available | 2019-05-03T08:57:43Z | |
| dc.date.issued | 2014 | |
| dc.description.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). | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/1794 | |
| dc.language.iso | en | en_US |
| dc.publisher | The Nigerian Association of Mathematical Physics, Nigeria. | en_US |
| dc.subject | Evolutionary Algorithms | en_US |
| dc.subject | Multi-Parent Crossover | en_US |
| dc.subject | NP-hard problems | en_US |
| dc.subject | Memetic Algorithm | en_US |
| dc.subject | Network design | en_US |
| dc.title | Memetic Algorithm with Multi-parent Crossover (MA-MPC) for Multi-objective Network Design. | en_US |
| dc.type | Article | en_US |