Efficient user-oriented Pareto fronts and Pareto archives based on spatial data structures

Efficient manipulation of Pareto fronts and Pareto archives involves non-trivial data structures and algorithms. Because of this complexity, researchers and programmers might recur to naive strategies based on linear lists, where most operations require expensive pairwise comparisons between all ele...

Full description

Saved in:
Bibliographic Details
Published in:Swarm and evolutionary computation Vol. 65; p. 100915
Main Author: Freitas, Alan
Format: Journal Article
Language:English
Published: Elsevier B.V 01.08.2021
Subjects:
ISSN:2210-6502
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first