A hybrid self-adjusted memetic algorithm for multi-objective optimization

Authors:
Xiuping Guo;Genke Yang;Zhiming Wu
Affiliations:
Department of Automation, Shanghai Jiaotong University, Shanghai, Shanghai, P.R. China;Department of Automation, Shanghai Jiaotong University, Shanghai, Shanghai, P.R. China;Department of Automation, Shanghai Jiaotong University, Shanghai, Shanghai, P.R. China
Venue:
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Year:
2005

Citing 9
Cited 0

Muiltiobjective optimization using nondominated sorting in genetic algorithms

Evolutionary Computation
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
Evolutionary algorithms with dynamic population size and localexploration for multiobjective optimization

IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
The balance between proximity and diversity in multiobjective evolutionary algorithms

IEEE Transactions on Evolutionary Computation
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation
Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation

IEEE Transactions on Evolutionary Computation
Using unconstrained elite archives for multiobjective optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel memetic algorithm for multi-objective optimization problems is proposed in this paper. The uniqueness of the method is that it hybridizes scalarizing selection with Pareto selection for exploitation and exploration. For extending the spread of solutions as quickly and fully as possible, the scalarizing functions defined by a wide diversified set of weights are used to go through all regions in objective space in the first phase at each generation. In the second phase, for intensifying search ability and achieving global exploration, a grid-based method is used to discover the gaps on existing tradeoff surface, and a fuzzy local perturbation is employed to reproduce additional ”good” individuals in the missing areas. Both the exploitation and exploration are made dynamic and adaptive to online optimization conditions based on a function of progress ratio, ensuring better stability of the algorithm. Compared with several state-of-the-art approaches using the same set of multi-objective 0/1 knapsack problem instances, experiment results show that the proposed method perform better to some extent in terms of finding a near-Pareto front and well-extended nondominated set.