Improved Crowding Distance for NSGA-II

11/30/2018
by   Xiangxiang Chu, et al.
0

Non-dominated sorting genetic algorithm II (NSGA-II) does well in dealing with multi-objective problems. When evaluating validity of an algorithm for multi-objective problems, two kinds of indices are often considered simultaneously, i.e. the convergence to Pareto Front and the distribution characteristic. The crowding distance in the standard NSGA-II has the property that solutions within a cubic have the same crowding distance, which has no contribution to the convergence of the algorithm. Actually the closer to the Pareto Front a solution is, the higher priority it should have. In the paper, the crowding distance is redefined while keeping almost all the advantages of the original one. Moreover, the speed of converging to the Pareto Front is faster. Finally, the improvement is proved to be effective by applying it to solve nine Benchmark problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2019

An Improved multi-objective genetic algorithm based on orthogonal design and adaptive clustering pruning strategy

Two important characteristics of multi-objective evolutionary algorithms...
research
11/23/2021

A Case Study on Optimization of Warehouses

In warehouses, order picking is known to be the most labor-intensive and...
research
12/05/2014

A Portfolio Approach to Algorithm Selection for Discrete Time-Cost Trade-off Problem

It is a known fact that the performance of optimization algorithms for N...
research
06/29/2020

Multi-objective Optimal Control of Dynamic Integrated Model of Climate and Economy: Evolution in Action

One of the widely used models for studying economics of climate change i...
research
08/28/2021

Elitist Non-dominated Sorting Harris Hawks Optimization: Framework and Developments for Multi-objective Problems

This paper proposed a novel multi-objective non-sorted Harris Hawks Opti...
research
08/18/2022

The First Mathematical Proof That Crossover Gives Super-Constant Performance Gains For the NSGA-II

Very recently, the first mathematical runtime analyses for the NSGA-II, ...
research
10/13/2021

A Review of the Deep Sea Treasure problem as a Multi-Objective Reinforcement Learning Benchmark

In this paper, the authors investigate the Deep Sea Treasure (DST) probl...

Please sign up or login with your details

Forgot password? Click here to reset