Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: An adaptive data structure for evolutionary multi-objective algorithms with unbounded archives
Author: Yuen, J.
Gao, S.
Wagner, M.
Neumann, F.
Citation: Proceedings of the 2012 IEEE Congress on Evolutionary Computation, held in Brisbane, 10-15 June, 2012: pp.1-8
Publisher: IEEE
Publisher Place: USA
Issue Date: 2012
Series/Report no.: IEEE Congress on Evolutionary Computation
ISBN: 9781467315081
Conference Name: IEEE Congress on Evolutionary Computation (2012 : Brisbane, Qld.)
Statement of
J. Yuen, S. Gao, M. Wagner and F. Neumann
Abstract: Archives have been widely used in evolutionary multi-objective optimization in order to store the optimal points found so far during the optimization process. Usually the size of an archive is bounded which means that the number of points it can store is limited. This implies that knowledge about the set of non-dominated solutions that has been obtained during the optimization process gets lost. Working with unbounded archives allows to keep this knowledge which can be useful for the progress of an evolutionary multi-objective algorithm. In this paper, we propose an adaptive data structure for dealing with unbounded archives. This data structure allows to traverse the archive efficiently and can also be used for sampling solutions from the archive which can be used for reproduction.
Rights: © Copyright 2012 IEEE - All rights reserved.
DOI: 10.1109/CEC.2012.6256468
Published version:
Appears in Collections:Aurora harvest 4
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.