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...
Saved in:
| Published in: | Swarm and evolutionary computation Vol. 65; p. 100915 |
|---|---|
| Main Author: | |
| 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!
|
| Abstract | 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 elements. The lack of a functional container type for Pareto fronts and archives reduces their usefulness in multi-objective optimization, simulations in economics, decision making, data analysis, or any application that caches objects based on multiple criteria. Despite the existence of some frameworks for multi-objective optimization, there is no user-oriented solution focused exclusively on efficient implementations of dynamic fronts and archives as abstract data types with their fundamental operations for insertion, removal, searching, reference points, hyperbox queries, nearest points, and indicators. This paper describes such a library based on spatial data structures for Pareto fronts and archives with specialized algorithms to perform all of these operations with low asymptotic complexity. At a negligible integration cost, the results confirm this implementation achieves notable performance gains over naive methods for fronts of all sizes and dimensions. |
|---|---|
| AbstractList | 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 elements. The lack of a functional container type for Pareto fronts and archives reduces their usefulness in multi-objective optimization, simulations in economics, decision making, data analysis, or any application that caches objects based on multiple criteria. Despite the existence of some frameworks for multi-objective optimization, there is no user-oriented solution focused exclusively on efficient implementations of dynamic fronts and archives as abstract data types with their fundamental operations for insertion, removal, searching, reference points, hyperbox queries, nearest points, and indicators. This paper describes such a library based on spatial data structures for Pareto fronts and archives with specialized algorithms to perform all of these operations with low asymptotic complexity. At a negligible integration cost, the results confirm this implementation achieves notable performance gains over naive methods for fronts of all sizes and dimensions. |
| ArticleNumber | 100915 |
| Author | Freitas, Alan |
| Author_xml | – sequence: 1 givenname: Alan orcidid: 0000-0002-1266-0204 surname: Freitas fullname: Freitas, Alan email: alandefreitas@ufop.edu.br organization: Computer Science, Universidade Federal de Ouro Preto, Brazil |
| BookMark | eNp9kL1OAzEQhF0EiRDyBDR-gQv-OV-cggJF4UeKBAU0NJZjr4WjcI68ThBvj48gSrbZ1WhmNfouyKhPPRByxdmMM95db2f4Ccc0E0zwqrAFVyMyFoKzplNMnJMp4pbV6ZhQajEmb6sQoovQF3pAyE3Kww2ePtsMJdGQU1-Q2v5Psdm9xyMg3VisvtRT3NsS7Y56WyzFkg-uHDLgJTkLdocw_d0T8nq3elk-NOun-8fl7bpxXMvSWKEE44ugpG-d4l56oTZKyrl2XnZa62rTGjj33Vzq0FkQrVBz3loILVRtQuTpr8sJMUMw-xw_bP4ynJmBitmaHypmoGJOVGrq5pSCWu0YIRscMDjwMYMrxqf4b_4bFUpwTw |
| Cites_doi | 10.1016/j.artint.2013.08.001 10.1145/322092.322095 10.1016/j.ins.2014.11.044 10.1016/j.asoc.2009.08.018 10.1162/EVCO_a_00041 10.1109/TEVC.2009.2015575 10.1007/BF01188711 10.1016/S0377-2217(03)00405-3 10.1016/j.ins.2019.07.011 10.1109/TEVC.2014.2366498 10.1109/TEVC.2014.2308305 10.1007/BF00288933 10.1109/MCSE.2007.55 10.1109/TEVC.2003.810733 10.1145/320248.320255 10.1287/inte.9.4.94 10.1162/evco.1994.2.3.221 10.1109/4235.996017 10.1016/j.ins.2009.06.035 10.1007/BF02712874 10.1007/s00778-006-0029-7 10.1016/0377-2217(94)00228-2 10.1145/321906.321910 10.1287/ijoc.8.4.367 10.1109/TEVC.2018.2799684 10.1162/evco.2008.16.3.355 10.1109/TEVC.2003.817234 10.1007/s11390-012-1296-y 10.1016/0020-0190(96)00116-0 10.1109/ACCESS.2020.3005970 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier B.V. |
| Copyright_xml | – notice: 2021 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.swevo.2021.100915 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_swevo_2021_100915 S2210650221000766 |
| GroupedDBID | --K --M .~1 0R~ 1~. 1~5 4.4 457 4G. 5VS 7-5 8P~ AAAKF AABVA AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AATLK AAXUO AAYFN ABAOU ABBOA ABGRD ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD ADQTV ADTZH AEBSH AECPX AEKER AENEX AEQOU AFKWA AFTJW AFXIZ AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BJAXD BKOJK BLXMC CBWCG EBS EFJIC EFLBG EJD FDB FEDTE FIRID FNPLU FYGXN GBLVA GBOLZ HAMUX HVGLF HZ~ J1W JJJVA KOM M41 MHUIS MO0 N9A O-L O9- OAUVE P-8 P-9 PC. Q38 RIG ROL SDF SES SPC SPCBC SSA SSB SSD SST SSV SSW SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c183t-a252019f53d4c51d3d25b53378cd36888c1888e11d6738f6ae2425714aef4e673 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000680430000007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2210-6502 |
| IngestDate | Wed Nov 05 20:42:52 EST 2025 Fri Feb 23 02:47:29 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Pareto archives Spatial data structures Multi-Objective optimization Pareto fronts Multi-Criteria decision making |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c183t-a252019f53d4c51d3d25b53378cd36888c1888e11d6738f6ae2425714aef4e673 |
| ORCID | 0000-0002-1266-0204 |
| ParticipantIDs | crossref_primary_10_1016_j_swevo_2021_100915 elsevier_sciencedirect_doi_10_1016_j_swevo_2021_100915 |
| PublicationCentury | 2000 |
| PublicationDate | August 2021 2021-08-00 |
| PublicationDateYYYYMMDD | 2021-08-01 |
| PublicationDate_xml | – month: 08 year: 2021 text: August 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Swarm and evolutionary computation |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Zionts (bib0002) 1979; 9 Srinivas, Deb (bib0016) 1994; 2 Godfrey, Shipley, Gryz (bib0013) 2007; 16 Raymond (bib0046) 2003 Chuan Shi, Yan Li, Li-shan Kang (bib0036) 2003; 3 Shi, Li, Zhang, Shi (bib0037) 2006 A. Freitas, Pareto (Git Repository), 2020 (accessed December 21, 2020). T. Glasmachers, A fast incremental BSP tree archive for non-dominated points (????). Bringmann, Friedrich, Igel, Voß (bib0054) 2013; 204 Chomicki, Godfrey, Gryz, Liang (bib0012) 2005 Finkel, Bentley (bib0050) 1974; 4 Jensen (bib0014) 2003; 7 Zhang, Tian, Cheng, Jin (bib0020) 2014; 19 Sun, Steuer (bib0028) 1996; 89 Mostaghim, Teich, Tyagi (bib0030) 2002; 1 Drozdik, Akimoto, Aguirre, Tanaka (bib0033) 2015; 19 Torlone, Ciaccia, Romatre (bib0009) 2002 Sun, Steuer (bib0029) 1996; 8 Torlone, Ciaccia (bib0010) 2002 Chomicki, Godfrey, Gryz, Liang (bib0011) 2003; 3 Sinnott-Armstrong (bib0003) 2019 A. Freitas, Matplot++, 2020. Chen (bib0026) 2001 Lacerda, Batista (bib0032) 2019; 503 Nielsen (bib0015) 1996; 59 Audet, Bigeon, Cartier, Le Digabel, Salomon (bib0004) 2018 Borzsony, Kossmann, Stocker (bib0005) 2001 Mostaghim, Teich (bib0031) 2005 Fonseca, Paquete, López-Ibánez (bib0052) 2006 List (bib0001) 2013 Shi, Yan, Lü, Shi, Wang (bib0039) 2009; 179 Fieldsend, Everson, Singh (bib0041) 2003; 7 Kung, Luccio, Preparata (bib0006) 1975; 22 Jaszkiewicz, Lust (bib0043) 2018; 22 Hjaltason, Samet (bib0051) 1999; 24 Glasmachers (bib0035) 2017 Bentley, Clarkson, Levine (bib0008) 1993; 9 Schütze (bib0025) 2003 Chan (bib0024) 1996; 16 Fortin, Grenier, Parizeau (bib0018) 2013 Everson, Fieldsend, Singh (bib0040) 2002 Bentley, Kung, Schkolnick, Thompson (bib0007) 1978; 25 Nan, Shang, Ishibuchi, He (bib0044) 2020; 8 Beume, Fonseca, López-Ibáñez, Paquete, Vahrenhold (bib0053) 2009; 13 de Freitas, Fleming, Guimarães (bib0055) 2015; 298 Everett, Robert, van Kreveld (bib0023) 1993 Alberto, Mateo (bib0045) 2004; 159 Fang, Wang, Tu, Horstemeyer (bib0019) 2008; 16 Shi, Yan, Shi, Zhang (bib0038) 2010; 10 Berry, Vamplew (bib0042) 2006 Deb, Pratap, Agarwal, Meyarivan (bib0017) 2002; 6 Tang, Cai, Zheng (bib0021) 2008; 1 McClymont, Keedwell (bib0022) 2012; 20 Hunter (bib0048) 2007; 9 Altwaijry, Menai (bib0027) 2012; 27 Sun (10.1016/j.swevo.2021.100915_bib0029) 1996; 8 Torlone (10.1016/j.swevo.2021.100915_bib0009) 2002 Fieldsend (10.1016/j.swevo.2021.100915_bib0041) 2003; 7 Deb (10.1016/j.swevo.2021.100915_bib0017) 2002; 6 Chomicki (10.1016/j.swevo.2021.100915_bib0011) 2003; 3 Berry (10.1016/j.swevo.2021.100915_bib0042) 2006 Srinivas (10.1016/j.swevo.2021.100915_bib0016) 1994; 2 Godfrey (10.1016/j.swevo.2021.100915_bib0013) 2007; 16 10.1016/j.swevo.2021.100915_bib0034 Nielsen (10.1016/j.swevo.2021.100915_bib0015) 1996; 59 Schütze (10.1016/j.swevo.2021.100915_bib0025) 2003 Everett (10.1016/j.swevo.2021.100915_bib0023) 1993 Finkel (10.1016/j.swevo.2021.100915_bib0050) 1974; 4 Sun (10.1016/j.swevo.2021.100915_bib0028) 1996; 89 Beume (10.1016/j.swevo.2021.100915_bib0053) 2009; 13 Sinnott-Armstrong (10.1016/j.swevo.2021.100915_bib0003) 2019 Fortin (10.1016/j.swevo.2021.100915_sbref0018) 2013 Jaszkiewicz (10.1016/j.swevo.2021.100915_bib0043) 2018; 22 Fonseca (10.1016/j.swevo.2021.100915_bib0052) 2006 Shi (10.1016/j.swevo.2021.100915_bib0039) 2009; 179 McClymont (10.1016/j.swevo.2021.100915_bib0022) 2012; 20 Shi (10.1016/j.swevo.2021.100915_bib0038) 2010; 10 Lacerda (10.1016/j.swevo.2021.100915_sbref0032) 2019; 503 Shi (10.1016/j.swevo.2021.100915_sbref0037) 2006 10.1016/j.swevo.2021.100915_bib0047 10.1016/j.swevo.2021.100915_bib0049 Bentley (10.1016/j.swevo.2021.100915_bib0008) 1993; 9 Chan (10.1016/j.swevo.2021.100915_bib0024) 1996; 16 Chen (10.1016/j.swevo.2021.100915_sbref0026) 2001 Fang (10.1016/j.swevo.2021.100915_bib0019) 2008; 16 Zhang (10.1016/j.swevo.2021.100915_bib0020) 2014; 19 Alberto (10.1016/j.swevo.2021.100915_bib0045) 2004; 159 Bringmann (10.1016/j.swevo.2021.100915_bib0054) 2013; 204 Borzsony (10.1016/j.swevo.2021.100915_bib0005) 2001 Altwaijry (10.1016/j.swevo.2021.100915_bib0027) 2012; 27 Chuan Shi (10.1016/j.swevo.2021.100915_sbref0036) 2003; 3 Everson (10.1016/j.swevo.2021.100915_bib0040) 2002 Mostaghim (10.1016/j.swevo.2021.100915_bib0030) 2002; 1 List (10.1016/j.swevo.2021.100915_bib0001) 2013 Audet (10.1016/j.swevo.2021.100915_bib0004) 2018 Jensen (10.1016/j.swevo.2021.100915_bib0014) 2003; 7 Raymond (10.1016/j.swevo.2021.100915_bib0046) 2003 Drozdik (10.1016/j.swevo.2021.100915_sbref0033) 2015; 19 Chomicki (10.1016/j.swevo.2021.100915_bib0012) 2005 Hjaltason (10.1016/j.swevo.2021.100915_bib0051) 1999; 24 Kung (10.1016/j.swevo.2021.100915_bib0006) 1975; 22 Nan (10.1016/j.swevo.2021.100915_sbref0044) 2020; 8 Glasmachers (10.1016/j.swevo.2021.100915_bib0035) 2017 Torlone (10.1016/j.swevo.2021.100915_bib0010) 2002 Tang (10.1016/j.swevo.2021.100915_bib0021) 2008; 1 Hunter (10.1016/j.swevo.2021.100915_bib0048) 2007; 9 Zionts (10.1016/j.swevo.2021.100915_bib0002) 1979; 9 de Freitas (10.1016/j.swevo.2021.100915_bib0055) 2015; 298 Bentley (10.1016/j.swevo.2021.100915_bib0007) 1978; 25 Mostaghim (10.1016/j.swevo.2021.100915_bib0031) 2005 |
| References_xml | – volume: 9 start-page: 94 year: 1979 end-page: 101 ident: bib0002 article-title: Mcdmif not a roman numeral, then what? publication-title: Interfaces (Providence) – volume: 16 start-page: 369 year: 1996 end-page: 387 ident: bib0024 article-title: Output-sensitive results on convex hulls, extreme points, and related problems publication-title: Discrete & Computational Geometry – volume: 4 start-page: 1 year: 1974 end-page: 9 ident: bib0050 article-title: Quad trees a data structure for retrieval on composite keys publication-title: Acta informatica – volume: 8 start-page: 367 year: 1996 end-page: 375 ident: bib0029 article-title: Quad-trees and linear lists for identifying nondominated criterion vectors publication-title: INFORMS J Comput – volume: 10 start-page: 468 year: 2010 end-page: 480 ident: bib0038 article-title: A fast multi-objective evolutionary algorithm based on a tree structure publication-title: Appl Soft Comput – volume: 159 start-page: 52 year: 2004 end-page: 65 ident: bib0045 article-title: Representation and management of moea populations based on graphs publication-title: Eur J Oper Res – volume: 3 start-page: 1536 year: 2003 end-page: 1542 ident: bib0036 article-title: A new simple and highly efficient multi-objective optimal evolutionary algorithm publication-title: The 2003 Congress on Evolutionary Computation, 2003. CEC ’03. – volume: 19 start-page: 201 year: 2014 end-page: 213 ident: bib0020 article-title: An efficient approach to nondominated sorting for evolutionary multiobjective optimization publication-title: IEEE Trans. Evol. Comput. – volume: 20 start-page: 1 year: 2012 end-page: 26 ident: bib0022 article-title: Deductive sort and climbing sort: new methods for non-dominated sorting publication-title: Evol Comput – volume: 9 start-page: 168 year: 1993 end-page: 183 ident: bib0008 article-title: Fast linear expected-time algorithms for computing maxima and convex hulls publication-title: Algorithmica – reference: A. Freitas, Matplot++, 2020. – year: 2003 ident: bib0046 article-title: The art of Unix programming – start-page: 421 year: 2001 end-page: 430 ident: bib0005 article-title: The skyline operator publication-title: Proceedings 17th international conference on data engineering – volume: 2 start-page: 221 year: 1994 end-page: 248 ident: bib0016 article-title: Multiobjective optimization using nondominated sorting in genetic algorithms publication-title: Evol Comput – volume: 27 start-page: 1197 year: 2012 end-page: 1210 ident: bib0027 article-title: Data structures in multi-objective evolutionary algorithms publication-title: J Comput Sci Technol – reference: T. Glasmachers, A fast incremental BSP tree archive for non-dominated points (????). – start-page: 347 year: 2002 end-page: 360 ident: bib0010 article-title: Finding the best when it’s a matter of preference. publication-title: SEBD – volume: 298 start-page: 288 year: 2015 end-page: 314 ident: bib0055 article-title: Aggregation trees for visualization and dimension reduction in many-objective optimization publication-title: Inf Sci (Ny) – year: 2018 ident: bib0004 article-title: Performance indicators in multiobjective optimization publication-title: Optimization Online – volume: 1 start-page: 391 year: 2008 end-page: 395 ident: bib0021 article-title: A fast method of constructing the non-dominated set: Arena’s principle publication-title: 2008 Fourth International Conference on Natural Computation – volume: 16 start-page: 355 year: 2008 end-page: 384 ident: bib0019 article-title: An efficient non-dominated sorting method for evolutionary algorithms publication-title: Evol Comput – start-page: 252 year: 2017 end-page: 266 ident: bib0035 article-title: A fast incremental bsp tree archive for non-dominated points publication-title: International Conference on Evolutionary Multi-Criterion Optimization – start-page: 509 year: 2003 end-page: 518 ident: bib0025 article-title: A new data structure for the nondominance problem in multi-objective optimization publication-title: International Conference on Evolutionary Multi-Criterion Optimization – volume: 24 start-page: 265 year: 1999 end-page: 318 ident: bib0051 article-title: Distance browsing in spatial databases publication-title: ACM Transactions on Database Systems (TODS) – volume: 7 start-page: 503 year: 2003 end-page: 515 ident: bib0014 article-title: Reducing the run-time complexity of multiobjective EAs: the nsga-ii and other algorithms publication-title: IEEE Trans. Evol. Comput. – volume: 204 start-page: 22 year: 2013 end-page: 29 ident: bib0054 article-title: Speeding up many-objective optimization by monte carlo approximations publication-title: Artif Intell – volume: 503 start-page: 200 year: 2019 end-page: 218 ident: bib0032 article-title: KDT-MOEA: A multiobjective optimization framework based on k-d trees publication-title: Inf Sci (Ny) – volume: 59 start-page: 255 year: 1996 end-page: 259 ident: bib0015 article-title: Output-sensitive peeling of convex and maximal layers publication-title: Inf Process Lett – start-page: 38 year: 1993 end-page: 46 ident: bib0023 article-title: An optimal algorithm for the ( publication-title: Proceedings of the ninth annual symposium on Computational geometry – volume: 9 start-page: 90 year: 2007 end-page: 95 ident: bib0048 article-title: Matplotlib: a 2D graphics environment publication-title: Computing in Science & Engineering – volume: 1 start-page: 843 year: 2002 end-page: 848 ident: bib0030 article-title: Comparison of data structures for storing pareto-sets in moeas publication-title: Proceedings of the 2002 Congress on Evolutionary Computation. CEC’02 (Cat. No. 02TH8600) – start-page: 1157 year: 2006 end-page: 1163 ident: bib0052 article-title: An improved dimension-sweep algorithm for the hypervolume indicator publication-title: 2006 IEEE international conference on evolutionary computation – volume: 16 start-page: 5 year: 2007 end-page: 28 ident: bib0013 article-title: Algorithms and analyses for maximal vector computation publication-title: The VLDB Journal – start-page: 343 year: 2002 end-page: 354 ident: bib0040 article-title: Full elite sets for multi-objective optimisation publication-title: Adaptive Computing in Design and Manufacture V – volume: 7 start-page: 305 year: 2003 end-page: 323 ident: bib0041 article-title: Using unconstrained elite archives for multiobjective optimization publication-title: IEEE Trans. Evol. Comput. – volume: 22 start-page: 469 year: 1975 end-page: 476 ident: bib0006 article-title: On finding the maxima of a set of vectors publication-title: Journal of the ACM (JACM) – volume: 89 start-page: 462 year: 1996 end-page: 472 ident: bib0028 article-title: Interquad: an interactive quad tree based procedure for solving the discrete alternative multiple criteria problem publication-title: Eur J Oper Res – volume: 6 start-page: 182 year: 2002 end-page: 197 ident: bib0017 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Trans. Evol. Comput. – year: 2019 ident: bib0003 article-title: Consequentialism publication-title: The Stanford Encyclopedia of Philosophy – volume: 3 start-page: 717 year: 2003 end-page: 719 ident: bib0011 article-title: Skyline with presorting publication-title: ICDE – start-page: 595 year: 2005 end-page: 604 ident: bib0012 article-title: Skyline with presorting: theory and optimizations publication-title: Intelligent Information Processing and Web Mining – start-page: 615 year: 2013 ident: bib0018 article-title: Generalizing the improved run-time complexity algorithm for non-dominated sorting publication-title: Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference - GECCO ’13 – volume: 22 start-page: 778 year: 2018 end-page: 791 ident: bib0043 article-title: Nd-tree-based update: a fast algorithm for the dynamic nondominance problem publication-title: IEEE Trans. Evol. Comput. – start-page: 619 year: 2006 end-page: 626 ident: bib0042 article-title: An efficient approach to unbounded bi-objective archives- introducing the mak_tree algorithm publication-title: Proceedings of the 8th annual conference on Genetic and evolutionary computation – volume: 179 start-page: 3540 year: 2009 end-page: 3560 ident: bib0039 article-title: A dominance tree and its application in evolutionary multi-objective optimization publication-title: Inf Sci (Ny) – volume: 13 start-page: 1075 year: 2009 end-page: 1082 ident: bib0053 article-title: On the complexity of computing the hypervolume indicator publication-title: IEEE Trans. Evol. Comput. – reference: A. Freitas, Pareto (Git Repository), 2020 (accessed December 21, 2020). – start-page: 10 year: 2001 ident: bib0026 article-title: Pareto Tree Searching Genetic Algorithm – volume: 19 start-page: 659 year: 2015 end-page: 678 ident: bib0033 article-title: Computational cost reduction of nondominated sorting using the m-front publication-title: IEEE Transactions on Evolutionary Computation, 10/f7s5x7 – volume: 25 start-page: 536 year: 1978 end-page: 543 ident: bib0007 article-title: On the average number of maxima in a set of vectors and applications publication-title: Journal of the ACM (JACM) – year: 2002 ident: bib0009 article-title: Which are my preferred items publication-title: Workshop on Recommendation and Personalization in E-Commerce – start-page: 81 year: 2005 end-page: 104 ident: bib0031 article-title: Quad-trees: a data structure for storing Pareto sets in multiobjective evolutionary algorithms with elitism publication-title: Evolutionary multiobjective optimization – start-page: 691 year: 2006 end-page: 700 ident: bib0037 article-title: An improved multiobjective evolutionary algorithm based on dominating tree publication-title: Pacific Rim International Conference on Artificial Intelligence – year: 2013 ident: bib0001 article-title: Social choice theory publication-title: The Stanford Encyclopedia of Philosophy – volume: 8 start-page: 119458 year: 2020 end-page: 119469 ident: bib0044 article-title: Reverse strategy for non-dominated archiving publication-title: IEEE Access – volume: 204 start-page: 22 year: 2013 ident: 10.1016/j.swevo.2021.100915_bib0054 article-title: Speeding up many-objective optimization by monte carlo approximations publication-title: Artif Intell doi: 10.1016/j.artint.2013.08.001 – volume: 25 start-page: 536 issue: 4 year: 1978 ident: 10.1016/j.swevo.2021.100915_bib0007 article-title: On the average number of maxima in a set of vectors and applications publication-title: Journal of the ACM (JACM) doi: 10.1145/322092.322095 – volume: 298 start-page: 288 year: 2015 ident: 10.1016/j.swevo.2021.100915_bib0055 article-title: Aggregation trees for visualization and dimension reduction in many-objective optimization publication-title: Inf Sci (Ny) doi: 10.1016/j.ins.2014.11.044 – start-page: 10 year: 2001 ident: 10.1016/j.swevo.2021.100915_sbref0026 – volume: 10 start-page: 468 issue: 2 year: 2010 ident: 10.1016/j.swevo.2021.100915_bib0038 article-title: A fast multi-objective evolutionary algorithm based on a tree structure publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2009.08.018 – start-page: 347 year: 2002 ident: 10.1016/j.swevo.2021.100915_bib0010 article-title: Finding the best when it’s a matter of preference. – volume: 3 start-page: 717 year: 2003 ident: 10.1016/j.swevo.2021.100915_bib0011 article-title: Skyline with presorting – year: 2002 ident: 10.1016/j.swevo.2021.100915_bib0009 article-title: Which are my preferred items – year: 2003 ident: 10.1016/j.swevo.2021.100915_bib0046 – ident: 10.1016/j.swevo.2021.100915_bib0049 – start-page: 252 year: 2017 ident: 10.1016/j.swevo.2021.100915_bib0035 article-title: A fast incremental bsp tree archive for non-dominated points – volume: 20 start-page: 1 issue: 1 year: 2012 ident: 10.1016/j.swevo.2021.100915_bib0022 article-title: Deductive sort and climbing sort: new methods for non-dominated sorting publication-title: Evol Comput doi: 10.1162/EVCO_a_00041 – volume: 13 start-page: 1075 issue: 5 year: 2009 ident: 10.1016/j.swevo.2021.100915_bib0053 article-title: On the complexity of computing the hypervolume indicator publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2009.2015575 – start-page: 509 year: 2003 ident: 10.1016/j.swevo.2021.100915_bib0025 article-title: A new data structure for the nondominance problem in multi-objective optimization – volume: 9 start-page: 168 issue: 2 year: 1993 ident: 10.1016/j.swevo.2021.100915_bib0008 article-title: Fast linear expected-time algorithms for computing maxima and convex hulls publication-title: Algorithmica doi: 10.1007/BF01188711 – start-page: 619 year: 2006 ident: 10.1016/j.swevo.2021.100915_bib0042 article-title: An efficient approach to unbounded bi-objective archives- introducing the mak_tree algorithm – volume: 159 start-page: 52 issue: 1 year: 2004 ident: 10.1016/j.swevo.2021.100915_bib0045 article-title: Representation and management of moea populations based on graphs publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(03)00405-3 – year: 2019 ident: 10.1016/j.swevo.2021.100915_bib0003 article-title: Consequentialism – volume: 503 start-page: 200 year: 2019 ident: 10.1016/j.swevo.2021.100915_sbref0032 article-title: KDT-MOEA: A multiobjective optimization framework based on k-d trees publication-title: Inf Sci (Ny) doi: 10.1016/j.ins.2019.07.011 – volume: 19 start-page: 659 issue: 5 year: 2015 ident: 10.1016/j.swevo.2021.100915_sbref0033 article-title: Computational cost reduction of nondominated sorting using the m-front publication-title: IEEE Transactions on Evolutionary Computation, 10/f7s5x7 doi: 10.1109/TEVC.2014.2366498 – volume: 19 start-page: 201 issue: 2 year: 2014 ident: 10.1016/j.swevo.2021.100915_bib0020 article-title: An efficient approach to nondominated sorting for evolutionary multiobjective optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2014.2308305 – start-page: 691 year: 2006 ident: 10.1016/j.swevo.2021.100915_sbref0037 article-title: An improved multiobjective evolutionary algorithm based on dominating tree – volume: 1 start-page: 391 year: 2008 ident: 10.1016/j.swevo.2021.100915_bib0021 article-title: A fast method of constructing the non-dominated set: Arena’s principle – volume: 4 start-page: 1 issue: 1 year: 1974 ident: 10.1016/j.swevo.2021.100915_bib0050 article-title: Quad trees a data structure for retrieval on composite keys publication-title: Acta informatica doi: 10.1007/BF00288933 – volume: 9 start-page: 90 issue: 3 year: 2007 ident: 10.1016/j.swevo.2021.100915_bib0048 article-title: Matplotlib: a 2D graphics environment publication-title: Computing in Science & Engineering doi: 10.1109/MCSE.2007.55 – start-page: 615 year: 2013 ident: 10.1016/j.swevo.2021.100915_sbref0018 article-title: Generalizing the improved run-time complexity algorithm for non-dominated sorting – volume: 7 start-page: 305 issue: 3 year: 2003 ident: 10.1016/j.swevo.2021.100915_bib0041 article-title: Using unconstrained elite archives for multiobjective optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2003.810733 – volume: 24 start-page: 265 issue: 2 year: 1999 ident: 10.1016/j.swevo.2021.100915_bib0051 article-title: Distance browsing in spatial databases publication-title: ACM Transactions on Database Systems (TODS) doi: 10.1145/320248.320255 – start-page: 421 year: 2001 ident: 10.1016/j.swevo.2021.100915_bib0005 article-title: The skyline operator – volume: 9 start-page: 94 issue: 4 year: 1979 ident: 10.1016/j.swevo.2021.100915_bib0002 article-title: Mcdmif not a roman numeral, then what? publication-title: Interfaces (Providence) doi: 10.1287/inte.9.4.94 – volume: 2 start-page: 221 issue: 3 year: 1994 ident: 10.1016/j.swevo.2021.100915_bib0016 article-title: Multiobjective optimization using nondominated sorting in genetic algorithms publication-title: Evol Comput doi: 10.1162/evco.1994.2.3.221 – year: 2018 ident: 10.1016/j.swevo.2021.100915_bib0004 article-title: Performance indicators in multiobjective optimization publication-title: Optimization Online – volume: 6 start-page: 182 issue: 2 year: 2002 ident: 10.1016/j.swevo.2021.100915_bib0017 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.996017 – volume: 1 start-page: 843 year: 2002 ident: 10.1016/j.swevo.2021.100915_bib0030 article-title: Comparison of data structures for storing pareto-sets in moeas – start-page: 1157 year: 2006 ident: 10.1016/j.swevo.2021.100915_bib0052 article-title: An improved dimension-sweep algorithm for the hypervolume indicator – volume: 179 start-page: 3540 issue: 20 year: 2009 ident: 10.1016/j.swevo.2021.100915_bib0039 article-title: A dominance tree and its application in evolutionary multi-objective optimization publication-title: Inf Sci (Ny) doi: 10.1016/j.ins.2009.06.035 – volume: 16 start-page: 369 issue: 4 year: 1996 ident: 10.1016/j.swevo.2021.100915_bib0024 article-title: Output-sensitive results on convex hulls, extreme points, and related problems publication-title: Discrete & Computational Geometry doi: 10.1007/BF02712874 – volume: 3 start-page: 1536 year: 2003 ident: 10.1016/j.swevo.2021.100915_sbref0036 article-title: A new simple and highly efficient multi-objective optimal evolutionary algorithm – volume: 16 start-page: 5 issue: 1 year: 2007 ident: 10.1016/j.swevo.2021.100915_bib0013 article-title: Algorithms and analyses for maximal vector computation publication-title: The VLDB Journal doi: 10.1007/s00778-006-0029-7 – ident: 10.1016/j.swevo.2021.100915_bib0047 – volume: 89 start-page: 462 issue: 3 year: 1996 ident: 10.1016/j.swevo.2021.100915_bib0028 article-title: Interquad: an interactive quad tree based procedure for solving the discrete alternative multiple criteria problem publication-title: Eur J Oper Res doi: 10.1016/0377-2217(94)00228-2 – volume: 22 start-page: 469 issue: 4 year: 1975 ident: 10.1016/j.swevo.2021.100915_bib0006 article-title: On finding the maxima of a set of vectors publication-title: Journal of the ACM (JACM) doi: 10.1145/321906.321910 – volume: 8 start-page: 367 issue: 4 year: 1996 ident: 10.1016/j.swevo.2021.100915_bib0029 article-title: Quad-trees and linear lists for identifying nondominated criterion vectors publication-title: INFORMS J Comput doi: 10.1287/ijoc.8.4.367 – ident: 10.1016/j.swevo.2021.100915_bib0034 – start-page: 38 year: 1993 ident: 10.1016/j.swevo.2021.100915_bib0023 article-title: An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems – volume: 22 start-page: 778 issue: 5 year: 2018 ident: 10.1016/j.swevo.2021.100915_bib0043 article-title: Nd-tree-based update: a fast algorithm for the dynamic nondominance problem publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2018.2799684 – start-page: 595 year: 2005 ident: 10.1016/j.swevo.2021.100915_bib0012 article-title: Skyline with presorting: theory and optimizations – volume: 16 start-page: 355 issue: 3 year: 2008 ident: 10.1016/j.swevo.2021.100915_bib0019 article-title: An efficient non-dominated sorting method for evolutionary algorithms publication-title: Evol Comput doi: 10.1162/evco.2008.16.3.355 – volume: 7 start-page: 503 issue: 5 year: 2003 ident: 10.1016/j.swevo.2021.100915_bib0014 article-title: Reducing the run-time complexity of multiobjective EAs: the nsga-ii and other algorithms publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2003.817234 – year: 2013 ident: 10.1016/j.swevo.2021.100915_bib0001 article-title: Social choice theory – volume: 27 start-page: 1197 issue: 6 year: 2012 ident: 10.1016/j.swevo.2021.100915_bib0027 article-title: Data structures in multi-objective evolutionary algorithms publication-title: J Comput Sci Technol doi: 10.1007/s11390-012-1296-y – volume: 59 start-page: 255 issue: 5 year: 1996 ident: 10.1016/j.swevo.2021.100915_bib0015 article-title: Output-sensitive peeling of convex and maximal layers publication-title: Inf Process Lett doi: 10.1016/0020-0190(96)00116-0 – volume: 8 start-page: 119458 year: 2020 ident: 10.1016/j.swevo.2021.100915_sbref0044 article-title: Reverse strategy for non-dominated archiving publication-title: IEEE Access doi: 10.1109/ACCESS.2020.3005970 – start-page: 81 year: 2005 ident: 10.1016/j.swevo.2021.100915_bib0031 article-title: Quad-trees: a data structure for storing Pareto sets in multiobjective evolutionary algorithms with elitism – start-page: 343 year: 2002 ident: 10.1016/j.swevo.2021.100915_bib0040 article-title: Full elite sets for multi-objective optimisation |
| SSID | ssj0000602559 |
| Score | 2.2309895 |
| Snippet | Efficient manipulation of Pareto fronts and Pareto archives involves non-trivial data structures and algorithms. Because of this complexity, researchers and... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 100915 |
| SubjectTerms | Multi-Criteria decision making Multi-Objective optimization Pareto archives Pareto fronts Spatial data structures |
| Title | Efficient user-oriented Pareto fronts and Pareto archives based on spatial data structures |
| URI | https://dx.doi.org/10.1016/j.swevo.2021.100915 |
| Volume | 65 |
| WOSCitedRecordID | wos000680430000007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 2210-6502 databaseCode: AIEXJ dateStart: 20110301 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000602559 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JSwMxFA5qPXhxF3dy8KaRzp45FqmoBxGqULwMk0kCFplKW5ef73tZWmtFVPAylDCTmb4vvLy87SPkSGY61ykXDPZWwWKZJCzXQcRg69NRU8pmKipDNpFdX_NuN79x7G1DQyeQ1TV_e8uf_hVqGAOwsXT2F3CPJ4UB-A2gwxVgh-uPgG-bphAY4kcHBOtjI2M0K2-Qz7aP9SSY-WKKBOxI6ZvP4o4mMXowxDRrjN6Uo_LYdph9HrhkQ2fIdl7LgWXXUC_u72D-XWVIIqai--cD9TCyZWOtR7cWnZshDMZJbs73NVP_gioqhAMjAxtvSp9a7ocZ1Wy9BL3T4St81ym-AjM0clvM-anndQcnxnnDwMQK03nSCLMkB7XVaF22u1djN1ozNYcipBD03-J7S5ksvpm3fW1_fLApblfJsjsM0JYFcY3MqXqdrHiiDer07ga5H2NKpzClFkFqMaWAhh_xmFKDKe3X1GFKEVM6wXST3J23b88umCPFYBVo3xErwwRstlwnkYyrJJCRDBMBNnvGKxmlnHO4jXMVBBL5XHVaKnOoDOJS6VjB2BZZqPu12iZUaK0juLmMhYh1BYaJTpQKMpFqISvV3CEnXlTFk-19UvikwF5hJFugZAsr2R2SenEWznyzZlkBS-C7B3f_-uAeWZos1X2yALJTB2Sxehk9DAeHbqm8A1_dbjI |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+user-oriented+Pareto+fronts+and+Pareto+archives+based+on+spatial+data+structures&rft.jtitle=Swarm+and+evolutionary+computation&rft.au=Freitas%2C+Alan&rft.date=2021-08-01&rft.pub=Elsevier+B.V&rft.issn=2210-6502&rft.volume=65&rft_id=info:doi/10.1016%2Fj.swevo.2021.100915&rft.externalDocID=S2210650221000766 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2210-6502&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2210-6502&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2210-6502&client=summon |