{"id":"https://openalex.org/W2094765464","doi":"https://doi.org/10.1145/2739480.2754674","title":"Obtaining Optimal Pareto Front Approximations using Scalarized Preference Information","display_name":"Obtaining Optimal Pareto Front Approximations using Scalarized Preference Information","publication_year":2015,"publication_date":"2015-07-07","ids":{"openalex":"https://openalex.org/W2094765464","doi":"https://doi.org/10.1145/2739480.2754674","mag":"2094765464"},"language":"en","primary_location":{"id":"doi:10.1145/2739480.2754674","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739480.2754674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089092948","display_name":"Marlon Braun","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marlon Alexander Braun","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany","Karlsruhe Institute of Technology, Karlsruhe,#N#Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe,#N#Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059513179","display_name":"Pradyumn Kumar Shukla","orcid":"https://orcid.org/0000-0001-9128-5408"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pradyumn Kumar Shukla","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany","Karlsruhe Institute of Technology, Karlsruhe,#N#Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe,#N#Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082605480","display_name":"Hartmut Schmeck","orcid":"https://orcid.org/0000-0002-4295-7631"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hartmut Schmeck","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany","Karlsruhe Institute of Technology, Karlsruhe,#N#Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe,#N#Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089092948"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":1.4892,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.83092101,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"631","last_page":"638"},"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9940999746322632,"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/benchmark","display_name":"Benchmark (surveying)","score":0.6983141899108887},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6489483714103699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6124449968338013},{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.5932910442352295},{"id":"https://openalex.org/keywords/equidistant","display_name":"Equidistant","score":0.5385658740997314},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4966161847114563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48730480670928955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4170287251472473},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3848191499710083},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35874831676483154},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06911087036132812}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6983141899108887},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6489483714103699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6124449968338013},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.5932910442352295},{"id":"https://openalex.org/C158245278","wikidata":"https://www.wikidata.org/wiki/Q4386982","display_name":"Equidistant","level":2,"score":0.5385658740997314},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4966161847114563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48730480670928955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4170287251472473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3848191499710083},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35874831676483154},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06911087036132812},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2739480.2754674","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739480.2754674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/26a8b6f3-bc6b-4657-ad18-efdbd0dc808f","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/26a8b6f3-bc6b-4657-ad18-efdbd0dc808f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Braun, M, Shukla, P K & Schmeck, H 2015, 'Obtaining optimal Pareto front approximations using scalarized preference information', Paper presented at 16th Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, 11/07/15 - 15/07/15 pp. 631-638. https://doi.org/10.1145/2739480.2754674","raw_type":"conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/26a8b6f3-bc6b-4657-ad18-efdbd0dc808f","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84963664991&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Braun, M, Shukla, P K & Schmeck, H 2015, 'Obtaining optimal Pareto front approximations using scalarized preference information', Paper presented at 16th Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, 11/07/15 - 15/07/15 pp. 631-638. https://doi.org/10.1145/2739480.2754674","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W7833159","https://openalex.org/W51462483","https://openalex.org/W142183211","https://openalex.org/W225560312","https://openalex.org/W421673726","https://openalex.org/W1506010655","https://openalex.org/W1521972037","https://openalex.org/W1522538275","https://openalex.org/W1595498733","https://openalex.org/W1775964850","https://openalex.org/W1947771597","https://openalex.org/W1966445187","https://openalex.org/W1994749702","https://openalex.org/W2000825106","https://openalex.org/W2017990047","https://openalex.org/W2022485595","https://openalex.org/W2036005773","https://openalex.org/W2038420231","https://openalex.org/W2072116998","https://openalex.org/W2075356520","https://openalex.org/W2102365077","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2133469585","https://openalex.org/W2150046657","https://openalex.org/W2153015072","https://openalex.org/W2156194072","https://openalex.org/W2172219128","https://openalex.org/W3089276580","https://openalex.org/W3146507833"],"related_works":["https://openalex.org/W2996366161","https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2001591765","https://openalex.org/W2073147994","https://openalex.org/W1588199609","https://openalex.org/W2384474142","https://openalex.org/W1550055091","https://openalex.org/W2744462909","https://openalex.org/W3083133203"],"abstract_inverted_index":{"Scalarization":[0],"techniques":[1],"are":[2],"a":[3,26,41,55,115],"popular":[4,151],"method":[5],"for":[6,67],"articulating":[7],"preferences":[8],"in":[9,24,35,92],"solving":[10],"multi-objective":[11],"optimization":[12],"problems.":[13,153],"These":[14],"techniques,":[15],"however,":[16],"have":[17],"so":[18],"far":[19],"proven":[20,61],"to":[21,128,144],"be":[22],"ill-suited":[23],"finding":[25],"preference-driven":[27],"approximation":[28,65,96],"that":[29,44,62,87,118,139],"still":[30],"captures":[31],"the":[32,52,73,76,98,112,120,130],"Pareto":[33,99],"front":[34,53,78,100],"its":[36],"entirety.":[37],"Therefore,":[38],"we":[39],"propose":[40],"new":[42,116],"concept":[43],"defines":[45],"an":[46,64,94],"optimal":[47],"distribution":[48],"of":[49,72,75,97,114,132],"points":[50],"on":[51,149],"given":[54],"specific":[56,103],"scalarization":[57],"function.":[58],"It":[59],"is":[60,105,109,142],"such":[63],"exists":[66],"every":[68],"real-valued":[69],"problem":[70],"irrespective":[71],"shape":[74],"corresponding":[77],"under":[79],"some":[80],"very":[81],"mild":[82],"conditions.":[83],"We":[84,123],"also":[85,137],"show":[86],"our":[88,133,140],"approach":[89],"works":[90],"well":[91],"obtaining":[93],"equidistant":[95],"if":[101],"no":[102],"preference":[104],"articulated.":[106],"Our":[107],"analysis":[108,136],"complemented":[110],"by":[111],"presentation":[113],"algorithm":[117,141],"implements":[119],"aforementioned":[121],"concept.":[122],"provide":[124],"in-depth":[125],"simulation":[126],"results":[127],"demonstrate":[129],"performance":[131],"algorithm.":[134],"The":[135],"reveals":[138],"able":[143],"outperform":[145],"current":[146],"state-of-the-art":[147],"algorithms":[148],"many":[150],"benchmark":[152]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}