An Experimental Analysis of a New Interval-Based Mutation Operator
Abstract
In this paper, we present a novel Interval-Based Mutation (IBMU) operator. The proposed mutation operator is performing coarse-grained search at initial stage in order to speed up convergence toward more promising regions of the search landscape. Then, more fine-grained search is performed in order to guide the solutions towards the Pareto front. Computational experiments indicate that the proposed mutation operator performs better than conventional approaches for solving several well-known benchmarking problems.
Remember to check out the Most Cited Articles! |
---|
Check out these titles in artificial intelligence! |