Gradient Based Stochastic Mutation Operators in Evolutionary Multi-objective Optimization

Authors:
Pradyumn Kumar Shukla
Affiliations:
Institute of Numerical Mathematics, Department of Mathematics, Dresden University of Technology, Dresden PIN 01069, Germany
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 11
Cited 3

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Stochastic method for the solution of unconstrained vector optimization problems

Journal of Optimization Theory and Applications
On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Exploiting gradient information in numerical multi--objective evolutionary optimization

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Combining gradient techniques for numerical multi-objective evolutionary optimization

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Local search for multiobjective function optimization: pareto descent method

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Hybridization of genetic algorithm and local search in multiobjective function optimization: recommendation of GA then LS

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Effective use of directional information in multi-objective evolutionary computation

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Comparing classical generating methods with an evolutionary multi-objective optimization method

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

New challenges for memetic algorithms on continuous multi-objective problems

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Using gradient information for multi-objective problems in the evolutionary context

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
A local multiobjective optimization algorithm using neighborhood field

Structural and Multidisciplinary Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Evolutionary algorithms have been adequately applied in solving single and multi-objective optimization problems. In the single-objective case various studies have shown the usefulness of combining gradient based classical search principles with evolutionary algorithms. However there seems to be a dearth of such studies for the multi-objective case. In this paper, we take two classical search operators and discuss their use as a local search operator in a state-of-the-art evolutionary algorithm. These operators require gradient information which is obtained using a stochastic perturbation technique requiring only two function evaluations. Computational studies on a number of test problems of varying complexity demonstrate the efficiency of hybrid algorithms in solving a large class of complex multi-objective optimization problems.