Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-dominated Sorting

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddTrafodion Cynhadledd (ISBN)

10 Dyfyniadau (Scopus)

Crynodeb

We improve the worst-case time complexity of non-dominated sorting, an operation frequently used in evolutionary multiobjective algorithms, to O(n·(log n)k-2 log log n), where n is the number of solutions, k is the number of objectives, and the random-access memory computation model is assumed. This improvement was possible thanks to the van Emde Boas tree, an “advanced” data structure which stores a set of non-negative integers less than n and supports many queries in O(log log n). This is not only a theoretical improvement, as we also provide an efficient implementation of the van Emde Boas tree, which resulted in a competitive algorithm that scales better than other algorithms when n grows, at least for small numbers of objectives greater than two.
Iaith wreiddiolSaesneg
TeitlEvolutionary Multi-Criterion Optimization - 10th International Conference, EMO 2019, Proceedings
Is-deitl10th International Conference, EMO 2019, East Lansing, MI, USA, March 10-13, 2019, Proceedings
GolygyddionKathrin Klamroth, Patrick Reed, Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kaisa Miettinen, Sanaz Mostaghim
CyhoeddwrSpringer Nature
Tudalennau66-77
Nifer y tudalennau12
ISBN (Electronig)978-3-030-12598-1, 303012598X
ISBN (Argraffiad)9783030125974
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 04 Chwef 2019
Cyhoeddwyd yn allanolIe

Cyfres gyhoeddiadau

EnwLecture Notes in Computer Science
CyhoeddwrSpringer Nature
Cyfrol11411
ISSN (Argraffiad)0302-9743
ISSN (Electronig)1611-3349

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-dominated Sorting'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn