Incorporating distance domination in multiobjective evolutionary algorithm

Authors:
Praveen K. Tripathi;Sanghamitra Bandyopadhyay;Sankar K. Pal
Affiliations:
Machine Intelligence Unit, Indian Statistical Institute, Kolkata;Machine Intelligence Unit, Indian Statistical Institute, Kolkata;Machine Intelligence Unit, Indian Statistical Institute, Kolkata
Venue:
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Year:
2005

Citing 5
Cited 0

A Variant of Evolution Strategies for Vector Optimization

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition)

Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition)
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
An overview of evolutionary algorithms in multiobjective optimization

Evolutionary Computation
Multiobjective GAs, quantitative indices, and pattern classification

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we propose a novel distance domination parameter and describe a multiobjective evolutionary concept called distance domination based multiobjective evolutionary algorithm (DBMEA). The distance parameter drives the algorithm faster in approximating the Pareto optimal front. To ensure proper diversity in the solutions of the non-dominating set, a new method for incorporating diversity is explained. The DBMEA has been compared with the NSGA-II algorithm on different test functions using different performance measures.