{"id":"https://openalex.org/W4308721630","doi":"https://doi.org/10.3390/a15110420","title":"k-Pareto Optimality-Based Sorting with Maximization of Choice and Its Application to Genetic Optimization","display_name":"k-Pareto Optimality-Based Sorting with Maximization of Choice and Its Application to Genetic Optimization","publication_year":2022,"publication_date":"2022-11-08","ids":{"openalex":"https://openalex.org/W4308721630","doi":"https://doi.org/10.3390/a15110420"},"language":"en","primary_location":{"id":"doi:10.3390/a15110420","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110420","pdf_url":"https://www.mdpi.com/1999-4893/15/11/420/pdf?version=1668680222","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/11/420/pdf?version=1668680222","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088497713","display_name":"Jean Ruppert","orcid":"https://orcid.org/0000-0002-9514-1230"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":true,"raw_author_name":"Jean Ruppert","raw_affiliation_strings":["Mathematics and Computing S.\u00e0 r.l., L-2360 Luxembourg, Luxembourg"],"raw_orcid":"https://orcid.org/0000-0002-9514-1230","affiliations":[{"raw_affiliation_string":"Mathematics and Computing S.\u00e0 r.l., L-2360 Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016595643","display_name":"Marharyta Aleksandrova","orcid":"https://orcid.org/0000-0002-1863-0129"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":true,"raw_author_name":"Marharyta Aleksandrova","raw_affiliation_strings":["Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, 2 Avenue de l\u2019Universite, L-4365 Esch-sur-Alzette, Luxembourg","Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, 2 Avenue de l'Universite, L-4365 Esch-sur-Alzette, Luxembourg"],"raw_orcid":"https://orcid.org/0000-0002-1863-0129","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, 2 Avenue de l\u2019Universite, L-4365 Esch-sur-Alzette, Luxembourg","institution_ids":["https://openalex.org/I186903577"]},{"raw_affiliation_string":"Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, 2 Avenue de l'Universite, L-4365 Esch-sur-Alzette, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009071576","display_name":"Thomas Engel","orcid":"https://orcid.org/0000-0002-7374-3927"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Thomas Engel","raw_affiliation_strings":["Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, 2 Avenue de l\u2019Universite, L-4365 Esch-sur-Alzette, Luxembourg","Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, 2 Avenue de l'Universite, L-4365 Esch-sur-Alzette, Luxembourg"],"raw_orcid":"https://orcid.org/0000-0002-7374-3927","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, 2 Avenue de l\u2019Universite, L-4365 Esch-sur-Alzette, Luxembourg","institution_ids":["https://openalex.org/I186903577"]},{"raw_affiliation_string":"Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, 2 Avenue de l'Universite, L-4365 Esch-sur-Alzette, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016595643","https://openalex.org/A5088497713"],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.398,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6290765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":"11","first_page":"420","last_page":"420"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7645725011825562},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7338016629219055},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.719017505645752},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.7039691805839539},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6974779367446899},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6158645153045654},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5247578620910645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5247271656990051},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4236946105957031},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4227287471294403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4166812300682068},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24890431761741638},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07343795895576477}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7645725011825562},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7338016629219055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.719017505645752},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.7039691805839539},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6974779367446899},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6158645153045654},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5247578620910645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5247271656990051},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4236946105957031},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4227287471294403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4166812300682068},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24890431761741638},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07343795895576477}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15110420","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110420","pdf_url":"https://www.mdpi.com/1999-4893/15/11/420/pdf?version=1668680222","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:866c755e76bc41bbbd7b0d98caf1ed69","is_oa":true,"landing_page_url":"https://doaj.org/article/866c755e76bc41bbbd7b0d98caf1ed69","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 11, p 420 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/11/420/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15110420","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 11; Pages: 420","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15110420","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110420","pdf_url":"https://www.mdpi.com/1999-4893/15/11/420/pdf?version=1668680222","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4308721630.pdf","grobid_xml":"https://content.openalex.org/works/W4308721630.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W1480428252","https://openalex.org/W1574672657","https://openalex.org/W1585939719","https://openalex.org/W1605170913","https://openalex.org/W1833634424","https://openalex.org/W1987958230","https://openalex.org/W1991061880","https://openalex.org/W2022485595","https://openalex.org/W2040622444","https://openalex.org/W2054678935","https://openalex.org/W2063375245","https://openalex.org/W2067544246","https://openalex.org/W2072661909","https://openalex.org/W2106334424","https://openalex.org/W2126105956","https://openalex.org/W2127459836","https://openalex.org/W2134152443","https://openalex.org/W2135416068","https://openalex.org/W2159249098","https://openalex.org/W2430564265","https://openalex.org/W2466060750","https://openalex.org/W2557894284","https://openalex.org/W2588807798","https://openalex.org/W2626804954","https://openalex.org/W2758271972","https://openalex.org/W2787395046","https://openalex.org/W2895971087","https://openalex.org/W2910933496","https://openalex.org/W2911813747","https://openalex.org/W2912318839","https://openalex.org/W2956222396","https://openalex.org/W2985952577","https://openalex.org/W2996288430","https://openalex.org/W2997090436","https://openalex.org/W3014226417","https://openalex.org/W3038190391","https://openalex.org/W3046910774","https://openalex.org/W3117857823","https://openalex.org/W3120608359","https://openalex.org/W4220769212","https://openalex.org/W4256661862","https://openalex.org/W4308721630","https://openalex.org/W6635097213","https://openalex.org/W6809173586"],"related_works":["https://openalex.org/W4280569079","https://openalex.org/W3103982436","https://openalex.org/W2133099979","https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2073147994","https://openalex.org/W2001591765","https://openalex.org/W2145877535"],"abstract_inverted_index":{"Deterioration":[0],"of":[1,4,46,49,62,73,99,140,174],"the":[2,27,44,60,71,90,97,100,104,112,138,143,161,164],"searchability":[3],"Pareto":[5,30,116],"dominance-based,":[6],"many-objective":[7,91,132,141],"evolutionary":[8],"optimization":[9],"algorithms":[10,32],"is":[11,108],"a":[12,152,171],"well-known":[13],"problem.":[14],"Alternative":[15],"solutions,":[16],"such":[17,76],"as":[18,67,170,184],"scalarization-based":[19],"and":[20,82,131,157],"indicator-based":[21],"approaches,":[22],"have":[23],"been":[24],"proposed":[25,101],"in":[26,79,137,151],"literature.":[28],"However,":[29],"dominance-based":[31],"are":[33,56],"still":[34],"widely":[35],"used.":[36],"In":[37,70],"this":[38],"paper,":[39],"we":[40,95],"propose":[41],"to":[42,52,59,66,146,155,186],"redefine":[43],"calculation":[45,106],"Pareto-dominance.":[47],"Instead":[48],"assigning":[50],"solutions":[51,64,149],"non-dominated":[53],"fronts,":[54],"they":[55],"ranked":[57],"according":[58],"measure":[61],"dominating":[63],"referred":[65],"k-Pareto":[68],"optimality.":[69],"case":[72,139],"probability":[74],"measures,":[75],"re-definition":[77],"results":[78,88,150],"an":[80,192],"elegant":[81],"fast":[83],"approximate":[84,105],"procedure.":[85],"Through":[86],"experimental":[87],"on":[89],"0/1":[92],"knapsack":[93],"problem,":[94],"demonstrate":[96],"advantages":[98],"approach:":[102],"(1)":[103],"procedure":[107,166],"much":[109],"faster":[110],"than":[111],"standard":[113],"sorting":[114],"by":[115],"dominance;":[117],"(2)":[118],"it":[119],"allows":[120],"for":[121,126],"achieving":[122],"higher":[123],"hypervolume":[124],"values":[125],"both":[127],"multi-objective":[128],"(two":[129],"objectives)":[130,134],"(25":[133],"optimization;":[135],"(3)":[136],"optimization,":[142],"increased":[144],"ability":[145],"differentiate":[147],"between":[148],"better":[153],"compared":[154],"NSGA-II":[156],"NSGA-III.":[158],"Apart":[159],"from":[160],"numerical":[162],"improvements,":[163],"probabilistic":[165],"can":[167],"be":[168],"considered":[169],"linear":[172,189],"extension":[173],"multidimentional":[175],"topological":[176],"sorting.":[177],"It":[178],"produces":[179],"almost":[180],"no":[181],"ties":[182],"and,":[183],"opposed":[185],"other":[187],"popular":[188],"extensions,":[190],"has":[191],"intuitive":[193],"interpretation.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2022-11-15T00:00:00"}