An improved NSGA-II with dimension perturbation and density estimation for multi-objective DV-Hop localisation algorithm
by Yang Cao; Li Zhou; Fei Xue
International Journal of Bio-Inspired Computation (IJBIC), Vol. 17, No. 2, 2021

Abstract: NSGA-II is a well-known multi-objective optimisation algorithm, which has shown excellent performance on many multi-objective optimisation problems. However, the classical NSGA-II suffers from uneven distribution of convergence, and poor global search ability. To address these issues, this paper proposes an improved NSGA-II (INSGA-II) by employing two strategies: a crossover operation based on dimension perturbation and a novel updating operation based on average individual density estimation. Then the INSGA-II is applied to optimise the multi-objective DV-Hop localisation algorithm. To verify the effectiveness of proposed INSGA-II, we compare it with four other multi-objective evolutionary algorithms on six benchmark functions. Simulation results show that our approach outperforms other compared algorithms. What's more, the performance of the DV-Hop algorithm based on INSGA-II is tested by the simulation experiments. The simulation results show that the DV-Hop localisation with INSGA-II achieves better localisation accuracy than that with CS, WOCS, MODE and NSGA-II.

Online publication date: Thu, 08-Apr-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com