Hyper-volume Evolutionary Algorithm
p. 10–32
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
ĐHQGHN
2017
|
Subjects: | |
Online Access: | http://repository.vnu.edu.vn/handle/VNU_123/56763 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Vietnam National University, Hanoi |
Language: | English |
id |
oai:112.137.131.14:VNU_123-56763 |
---|---|
record_format |
dspace |
spelling |
oai:112.137.131.14:VNU_123-567632017-09-30T16:29:24Z Hyper-volume Evolutionary Algorithm Le, Khoi Nguyen Dario, Landa-Silva Multi-objective Evolutionary Algorithm Pareto Optimisation Hyper-volume Knapsack Problem p. 10–32 We propose a multi-objective evolutionary algorithm (MOEA), named the Hyper-volume Evolutionary Algorithm (HVEA). The algorithm is characterised by three components. First, individual fitness evaluation depends on the current Pareto front, specifically on the ratio of its dominated hyper-volume to the current Pareto front hyper-volume, hence giving an indication of how close the individual is to the current Pareto front. Second, a ranking strategy classifies individuals based on their fitness instead of Pareto dominance, individuals within the same rank are non guaranteed to be mutually non-dominated. Third, a crowding assignment mechanism that adapts according to the individual’s neighbouring area, controlled by the neighbouring area radius parameter, and the archive of non-dominated solutions. We perform extensive experiments on the multiple 0/1 knapsack problem using different greedy repair methods to compare the performance of HVEA to other MOEAs including NSGA2, SEAMO2, SPEA2, IBEA and MOEA/D. This paper shows that by tuning the neighbouring area radius parameter, the performance of the proposed HVEA can be pushed towards better convergence, diversity or coverage and this could be beneficial to different types of problems. 2017-08-14T07:28:07Z 2017-08-14T07:28:07Z 2016 Article 0866-8612 http://repository.vnu.edu.vn/handle/VNU_123/56763 en Vol. 32, No. 1 (2016); application/pdf ĐHQGHN |
institution |
Vietnam National University, Hanoi |
building |
VNU Library & Information Center |
country |
Vietnam |
collection |
VNU Digital Repository |
language |
English |
topic |
Multi-objective Evolutionary Algorithm Pareto Optimisation Hyper-volume Knapsack Problem |
spellingShingle |
Multi-objective Evolutionary Algorithm Pareto Optimisation Hyper-volume Knapsack Problem Le, Khoi Nguyen Dario, Landa-Silva Hyper-volume Evolutionary Algorithm |
description |
p. 10–32 |
format |
Article |
author |
Le, Khoi Nguyen Dario, Landa-Silva |
author_facet |
Le, Khoi Nguyen Dario, Landa-Silva |
author_sort |
Le, Khoi Nguyen |
title |
Hyper-volume Evolutionary Algorithm |
title_short |
Hyper-volume Evolutionary Algorithm |
title_full |
Hyper-volume Evolutionary Algorithm |
title_fullStr |
Hyper-volume Evolutionary Algorithm |
title_full_unstemmed |
Hyper-volume Evolutionary Algorithm |
title_sort |
hyper-volume evolutionary algorithm |
publisher |
ĐHQGHN |
publishDate |
2017 |
url |
http://repository.vnu.edu.vn/handle/VNU_123/56763 |
_version_ |
1680966841054265344 |