Journal of Global Optimization
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Advances in Differential Evolution
Advances in Differential Evolution
DEMO: differential evolution for multiobjective optimization
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Opposition-Based Differential Evolution
IEEE Transactions on Evolutionary Computation
Accelerating Differential Evolution Using an Adaptive Local Search
IEEE Transactions on Evolutionary Computation
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
QoS-based service optimization using differential evolution
Proceedings of the 13th annual conference on Genetic and evolutionary computation
HEMH2: an improved hybrid evolutionary metaheuristics for 0/1 multiobjective knapsack problems
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Hi-index | 0.00 |
In this paper, a multi-objective evolutionary algorithm based on adaptive discrete Differential Evolution is proposed for multi-objective optimization problems, especially in discrete domain. By introducing Differential Evolution to multi-objective optimization field, a novel adaptive discrete Differential Evolution strategy is presented firstly to enhance the ability of global exploration, so that the proposed multi-objective evolutionary algorithm can achieve the better approximate Pareto-optimal solutions. Furthermore, the proposed multi-objective evolutionary algorithm integrates the adaptive discrete Differential Evolution strategy with a fast Pareto ranking strategy and a truncating operation based on crowding density and Pareto rank to maintain the good diversity of evolutionary population. The simulations are conducted for a set of standard Multi-objective 0/1 knapsack problems which are the typical NP-hard problems. The performance of the proposed multi-objective evolutionary algorithm is compared with that of SPEA and NSGA-II which are state-of-the-art. Experimental results indicate that the proposed multi-objective evolutionary algorithm is more effective and efficient.