{"id":"https://openalex.org/W2105511939","doi":"https://doi.org/10.1162/106365605774666895","title":"Evaluating the \u03b5-Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions","display_name":"Evaluating the \u03b5-Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions","publication_year":2005,"publication_date":"2005-11-05","ids":{"openalex":"https://openalex.org/W2105511939","doi":"https://doi.org/10.1162/106365605774666895","mag":"2105511939","pmid":"https://pubmed.ncbi.nlm.nih.gov/16297281"},"language":"en","primary_location":{"id":"doi:10.1162/106365605774666895","is_oa":false,"landing_page_url":"https://doi.org/10.1162/106365605774666895","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5088394271","display_name":"Kalyanmoy Deb","orcid":"https://orcid.org/0000-0001-7402-9939"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kalyanmoy Deb","raw_affiliation_strings":["Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology Kanpur, Kanpur, PIN 208016, INDIA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology Kanpur, Kanpur, PIN 208016, INDIA,","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060488004","display_name":"Manikanth Mohan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manikanth Mohan","raw_affiliation_strings":["Manikanth Mohan, Palappallil House, Nalkalickal P.O., (via) Aranmula, Pathnamthitta (Dist), Kerala, PIN 689533, INDIA,","Manikanth Mohan, Palappallil House, Nalkalickal P.O., (via) Aranmula, Pathnamthitta (Dist), Kerala, PIN 689533, INDIA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Manikanth Mohan, Palappallil House, Nalkalickal P.O., (via) Aranmula, Pathnamthitta (Dist), Kerala, PIN 689533, INDIA,","institution_ids":[]},{"raw_affiliation_string":"Manikanth Mohan, Palappallil House, Nalkalickal P.O., (via) Aranmula, Pathnamthitta (Dist), Kerala, PIN 689533, INDIA#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103932880","display_name":"Shikhar Mishra","orcid":null},"institutions":[{"id":"https://openalex.org/I208333798","display_name":"University of Missouri\u2013St. Louis","ror":"https://ror.org/037cnag11","country_code":"US","type":"education","lineage":["https://openalex.org/I208333798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shikhar Mishra","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Missouri, St. Louis, MO 63121, USA,","Department of Mathematics and Computer Science, University of Missouri, St. Louis, MO 63121, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Missouri, St. Louis, MO 63121, USA,","institution_ids":["https://openalex.org/I208333798"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Missouri, St. Louis, MO 63121, USA#TAB#","institution_ids":["https://openalex.org/I208333798"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.3096,"has_fulltext":false,"cited_by_count":626,"citation_normalized_percentile":{"value":0.98875471,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"13","issue":"4","first_page":"501","last_page":"525"},"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.9954000115394592,"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.9907000064849854,"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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.734811544418335},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6986066102981567},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6833014488220215},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.63629549741745},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.610122561454773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6054232120513916},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5779451131820679},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4885581433773041},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4709646999835968},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46961575746536255},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4109608232975006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3556444048881531},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35089564323425293}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.734811544418335},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6986066102981567},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6833014488220215},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.63629549741745},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.610122561454773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6054232120513916},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5779451131820679},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4885581433773041},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4709646999835968},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46961575746536255},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4109608232975006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3556444048881531},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35089564323425293},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":2,"locations":[{"id":"doi:10.1162/106365605774666895","is_oa":false,"landing_page_url":"https://doi.org/10.1162/106365605774666895","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:16297281","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/16297281","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W99001025","https://openalex.org/W225560312","https://openalex.org/W1491237923","https://openalex.org/W1519778441","https://openalex.org/W1521316934","https://openalex.org/W1522538275","https://openalex.org/W1553373771","https://openalex.org/W1568834902","https://openalex.org/W1595498733","https://openalex.org/W1660131149","https://openalex.org/W1846834309","https://openalex.org/W1993530334","https://openalex.org/W2053900989","https://openalex.org/W2063375245","https://openalex.org/W2098907614","https://openalex.org/W2106334424","https://openalex.org/W2116661285","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2152551290","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2073298047","https://openalex.org/W1963790170","https://openalex.org/W2090178682","https://openalex.org/W2586328217","https://openalex.org/W2033790662","https://openalex.org/W2049264236","https://openalex.org/W4241467429","https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2906115061"],"abstract_inverted_index":{"Since":[0],"the":[1,16,23,52,64,75,87,105,116,144,196,209,219,235,239],"suggestion":[2],"of":[3,7,36,43,66,77,82,167,184,205,213],"a":[4,27,38,60,67,79,99,131,162,182,200,222,231],"computing":[5],"procedure":[6,28],"multiple":[8],"Pareto-optimal":[9,210,241],"solutions":[10,62,168],"in":[11,15,51,203,238],"multi-objective":[12,46],"optimization":[13],"problems":[14],"early":[17],"Nineties,":[18],"researchers":[19],"have":[20],"been":[21],"on":[22,143,171,181],"look":[24],"out":[25],"for":[26,58,160],"which":[29,139],"is":[30,123,193,199,221],"computationally":[31,72],"fast":[32,73],"and":[33,40,95,152,156,164,187,215],"simultaneously":[34],"capable":[35],"finding":[37],"well-converged":[39,165],"well-distributed":[41,61,163],"set":[42,166],"solutions.":[44,83,242],"Most":[45],"evolutionary":[47],"algorithms":[48],"(MOEAs)":[49],"developed":[50,141],"past":[53],"decade":[54],"are":[55],"either":[56],"good":[57,201],"achieving":[59,78,161],"at":[63,74],"expense":[65,76],"large":[68],"computational":[69,117,216],"effort":[70],"or":[71,92,110],"not-so-good":[80],"distribution":[81,102],"For":[84],"example,":[85],"although":[86],"Strength":[88],"Pareto":[89],"Evolutionary":[90],"Algorithm":[91],"SPEA":[93,122],"(Zitzler":[94],"Thiele,":[96],"1999)":[97],"produces":[98],"much":[100,124],"better":[101],"compared":[103],"to":[104,120,208,233],"elitist":[106],"non-dominated":[107],"sorting":[108],"GA":[109],"NSGA-II":[111],"(Deb":[112,135],"et":[113,136,149],"al.,":[114,137,150],"2002a),":[115],"time":[118],"needed":[119],"run":[121],"greater.":[125],"In":[126],"this":[127],"paper,":[128],"we":[129],"evaluate":[130],"recently-proposed":[132],"steady-state":[133,197],"MOEA":[134,198],"2003)":[138],"was":[140],"based":[142],"epsilon-dominance":[145],"concept":[146],"introduced":[147],"earlier(Laumanns":[148],"2002)":[151],"using":[153],"efficient":[154],"parent":[155],"archive":[157],"update":[158],"strategies":[159],"quickly.":[169],"Based":[170],"an":[172],"extensive":[173],"comparative":[174],"study":[175],"with":[176],"four":[177,188],"other":[178],"state-of-the-art":[179],"MOEAs":[180,227],"number":[183],"two,":[185],"three,":[186],"objective":[189],"test":[190],"problems,":[191],"it":[192],"observed":[194],"that":[195],"compromise":[202],"terms":[204],"convergence":[206],"near":[207],"front,":[211],"diversity":[212],"solutions,":[214],"time.":[217],"Moreover,":[218],"epsilon-MOEA":[220],"step":[223],"closer":[224],"towards":[225],"making":[226],"pragmatic,":[228],"particularly":[229],"allowing":[230],"decision-maker":[232],"control":[234],"achievable":[236],"accuracy":[237],"obtained":[240]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":20},{"year":2024,"cited_by_count":30},{"year":2023,"cited_by_count":35},{"year":2022,"cited_by_count":46},{"year":2021,"cited_by_count":33},{"year":2020,"cited_by_count":37},{"year":2019,"cited_by_count":40},{"year":2018,"cited_by_count":51},{"year":2017,"cited_by_count":55},{"year":2016,"cited_by_count":30},{"year":2015,"cited_by_count":42},{"year":2014,"cited_by_count":41},{"year":2013,"cited_by_count":29},{"year":2012,"cited_by_count":25}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2016-06-24T00:00:00"}