CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Identification of multi-resolution network structures with multi-objective immune algorithm
Applied Soft Computing
Comprehensive Survey of the Hybrid Evolutionary Algorithms
International Journal of Applied Evolutionary Computation
| Hi-index | 0.00 |
In this paper, we examine the use of biased neighborhood structures for local search in multiobjective memetic algorithms. Under a biased neighborhood structure, each neighbor of the current solution has a different probability to be sampled in local search. In standard local search, all neighbors of the current solution usually have the same probability because they are randomly sampled. On the other hand, we assign larger probabilities to more promising neighbors in order to improve the search ability of multiobjective memetic algorithms. In this paper, we first explain our multiobjective memetic algorithm, which is a simple hybrid algorithm of NSGA-II and local search. Then we explain its variants with biased neighborhood structures for multiobjective 0/1 knapsack and flowshop scheduling problems. Finally we examine the performance of each variant through computational experiments. Experimental results show that the use of biased neighborhood structures clearly improves the performance of our multiobjective memetic algorithm.