- Title
- An efficient approach to unbounded bi-objective archives : Introducing the Mak_Tree algorithm
- Creator
- Vamplew, Peter; Berry, Adam
- Date
- 2006
- Type
- Text; Conference paper
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/33838
- Identifier
- vital:1609
- Abstract
- Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast majority of popular techniques aggressively truncate the capacity of archives and are based upon inefficient list representations. By forming better data structures and algorithms for the storage of archival members, the need for truncation is reduced and unbounded elite sets become viable. While work does exist in this vein, it is always of a general nature and significant improvements can be made in the bi-objective case. As such, this paper elucidates the unique properties of two-dimensional non-dominated sets and capitalises on these notions to develop the highly efficient and specialised bi-objective Mak_Tree algorithm. Theoretical results indicate that the specialised approach is preferable to pre-existing general techniques, while empirical analysis illustrates improved performance over both unbounded and bounded list techniques.; E1
- Publisher
- Seattle, USA : Association for Computing Machinery (ACM)
- Relation
- Paper presented at GECCO 2006, 8th Annual Genetic and Evolutionary Computation Conference, Seattle, USA : 8th July, 2006
- Rights
- Copyright ACM
- Rights
- This metadata is freely available under a CCO license
- Subject
- Bi-objective
- Reviewed
- Hits: 612
- Visitors: 558
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|