{"id":"https://openalex.org/W2104493335","doi":null,"title":"Efficient symbolic multi-objective design space exploration","display_name":"Efficient symbolic multi-objective design space exploration","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2104493335","mag":"2104493335"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.582.2189","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.582.2189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cecs.uci.edu/~papers/aspdac08/pdf/p691_8B-4.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5043887536","display_name":"Martin Lukasiewycz","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Lukasiewycz","raw_affiliation_strings":["Univ. of Erlangen-Nuremberg, Nuremberg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of Erlangen-Nuremberg, Nuremberg","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Michael Gla\u00df","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Gla\u00df","raw_affiliation_strings":["Univ. of Erlangen-Nuremberg, Nuremberg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of Erlangen-Nuremberg, Nuremberg","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063619304","display_name":"Christian D. Haubelt","orcid":"https://orcid.org/0000-0002-1568-5423","observed_orcids":["https://orcid.org/0000-0002-1568-5423"]},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Haubelt","raw_affiliation_strings":["Univ. of Erlangen-Nuremberg, Nuremberg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of Erlangen-Nuremberg, Nuremberg","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":null,"apc_paid":null,"fwci":8.3349,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.97677103,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9556000232696533,"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":0.9556000232696533,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.006599999964237213,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.004999999888241291,"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/design-space-exploration","display_name":"design space exploration","score":0.9819999933242798},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.9100000262260437},{"id":"https://openalex.org/keywords/backtracking","display_name":"backtracking","score":0.875},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"premature convergence","score":0.8600000143051147},{"id":"https://openalex.org/keywords/multi-objective-evolutionary-algorithms","display_name":"multi-objective evolutionary algorithms","score":0.7639999985694885},{"id":"https://openalex.org/keywords/automotive-design","display_name":"automotive design","score":0.5899999737739563}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7060643434524536},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6869564652442932},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.643830418586731},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6350728273391724},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5272868275642395},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5053384900093079},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4953385889530182},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3321946859359741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2797383666038513},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.582.2189","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.582.2189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cecs.uci.edu/~papers/aspdac08/pdf/p691_8B-4.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W107611607","https://openalex.org/W225560312","https://openalex.org/W1513656191","https://openalex.org/W1518705996","https://openalex.org/W1537811433","https://openalex.org/W1582823543","https://openalex.org/W1584430992","https://openalex.org/W1601703487","https://openalex.org/W1967411799","https://openalex.org/W2048051309","https://openalex.org/W2057361103","https://openalex.org/W2074558871","https://openalex.org/W2095821893","https://openalex.org/W2098907614","https://openalex.org/W2116758077","https://openalex.org/W2125047455","https://openalex.org/W2129710305","https://openalex.org/W2142785340","https://openalex.org/W2144491345","https://openalex.org/W2147442986","https://openalex.org/W2151676061","https://openalex.org/W2994964425"],"related_works":["https://openalex.org/W7101021775","https://openalex.org/W2132336619","https://openalex.org/W7095303241","https://openalex.org/W2355229262","https://openalex.org/W2111307259","https://openalex.org/W2830459990","https://openalex.org/W2755565486","https://openalex.org/W291201951","https://openalex.org/W2789716266","https://openalex.org/W7164320281"],"abstract_inverted_index":{"Nowadays":[0],"many":[1],"design":[2,28,48,71,92,156,163],"space":[3,93],"exploration":[4,94],"tools":[5],"are":[6,39,50,73],"based":[7,106,117],"on":[8,107,118],"Multi-Objective":[9],"Evolutionary":[10],"Algorithms":[11],"(MOEAs).":[12],"Beside":[13],"the":[14,46,89,124,176,191,196,199],"advantages":[15],"of":[16,91,198],"MOEAs,":[17],"there":[18,75],"is":[19,76,131,180],"one":[20],"important":[21],"drawback":[22],"as":[23,37,69,95,158,160],"MOEAs":[24],"might":[25],"fail":[26],"in":[27,153,161],"spaces":[29,72,157,164],"containing":[30,166],"only":[31,165],"a":[32,66,77,103,112,119,167,186],"few":[33,168],"feasible":[34,169],"solutions":[35],"or":[36],"they":[38],"often":[40],"afflicted":[41],"with":[42],"premature":[43],"convergence,":[44],"i.e.,":[45],"same":[47],"points":[49],"revisited":[51],"again":[52],"and":[53,110,130,173],"again.":[54],"Exact":[55],"methods,":[56],"especially":[57],"Pseudo":[58],"Boolean":[59],"solvers":[60,109],"(PB":[61],"solvers)":[62],"seem":[63],"to":[64,133,146],"be":[65],"solution.":[67],"However,":[68],"typical":[70],"multi-objective,":[74],"need":[78],"for":[79],"multi-objective":[80,96,114,128,143],"PB":[81,108,115,144],"solvers.":[82],"In":[83],"this":[84],"paper,":[85],"we":[86],"will":[87,100,149,194],"formalize":[88],"problem":[90],"0--1":[97],"ILP.":[98],"We":[99],"propose":[101],"(1)":[102],"heuristic":[104,178],"approach":[105,179],"(2)":[111],"complete":[113],"solver":[116,145],"backtracking":[120],"algorithm":[121],"that":[122],"incorporates":[123],"non-dominance":[125],"relation":[126],"from":[127,139,190],"optimization":[129],"restricted":[132],"linear":[134],"objective":[135],"functions.":[136],"First":[137],"results":[138],"applying":[140],"our":[141],"novel":[142],"synthetic":[147],"problems":[148],"show":[150],"its":[151],"effectiveness":[152],"small":[154],"sized":[155],"well":[159],"large":[162,174],"solutions.":[170],"For":[171],"non-linear":[172],"problems,":[175],"proposed":[177,200],"outperforming":[181],"common":[182],"MOEA":[183],"approaches.":[184],"Finally,":[185],"real":[187],"world":[188],"example":[189],"automotive":[192],"area":[193],"emphasize":[195],"efficiency":[197],"algorithms.":[201]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2016-06-24T00:00:00"}