Hyper-volume evolutionary algorithm

Le, Khoi Nguyen and Landa-Silva, Dario (2016) Hyper-volume evolutionary algorithm. VNU journal of science: computer science and communication engineering, 32 (1). pp. 10-32. ISSN 0866-8612

Full text not available from this repository.


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.

Item Type: Article
RIS ID: https://nottingham-repository.worktribe.com/output/774454
Keywords: Multi-objective evolutionary alogorithm, Pareto optimization, Hyper-volume, Knapsack problem
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Related URLs:
Depositing User: Landa-Silva, Dario
Date Deposited: 01 Aug 2016 09:49
Last Modified: 04 May 2020 17:34
URI: https://eprints.nottingham.ac.uk/id/eprint/35586

Actions (Archive Staff Only)

Edit View Edit View