{"id":"https://openalex.org/W4322623857","doi":"https://doi.org/10.1162/evco_a_00320","title":"Evolutionary and Estimation of Distribution Algorithms for Unconstrained, Constrained, and Multiobjective Noisy Combinatorial Optimisation Problems","display_name":"Evolutionary and Estimation of Distribution Algorithms for Unconstrained, Constrained, and Multiobjective Noisy Combinatorial Optimisation Problems","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4322623857","doi":"https://doi.org/10.1162/evco_a_00320","pmid":"https://pubmed.ncbi.nlm.nih.gov/36854020"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00320","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00320","pdf_url":"https://direct.mit.edu/evco/article-pdf/doi/10.1162/evco_a_00320/2125231/evco_a_00320.pdf","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":true,"oa_status":"bronze","oa_url":"https://direct.mit.edu/evco/article-pdf/doi/10.1162/evco_a_00320/2125231/evco_a_00320.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056530008","display_name":"N.A. Aishwaryaprajna","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Aishwaryaprajna","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, United Kingdom aishwaryaprajna@gmail.com"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, United Kingdom aishwaryaprajna@gmail.com","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112196936","display_name":"Jonathan E. Rowe","orcid":null},"institutions":[{"id":"https://openalex.org/I4210128584","display_name":"The Alan Turing Institute","ror":"https://ror.org/035dkdb55","country_code":"GB","type":"facility","lineage":["https://openalex.org/I4210128584"]},{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jonathan E. Rowe","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, United Kingdom","The Alan Turing Institute, London, United Kingdom J.E.Rowe@cs.bham.ac.uk"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"The Alan Turing Institute, London, United Kingdom J.E.Rowe@cs.bham.ac.uk","institution_ids":["https://openalex.org/I4210128584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056530008","https://openalex.org/A5112196936"],"corresponding_institution_ids":["https://openalex.org/I4210128584","https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":0.6055,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69578674,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"3","first_page":"259","last_page":"285"},"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.9997000098228455,"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.995199978351593,"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/knapsack-problem","display_name":"Knapsack problem","score":0.800714373588562},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7811638712882996},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7208684086799622},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5774422883987427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5524305105209351},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.5176066160202026},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4761604964733124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42705297470092773},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.4209466278553009},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3918415307998657},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25650814175605774}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.800714373588562},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7811638712882996},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7208684086799622},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5774422883987427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5524305105209351},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.5176066160202026},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4761604964733124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42705297470092773},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.4209466278553009},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3918415307998657},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25650814175605774},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000064","descriptor_name":"Acclimatization","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000064","descriptor_name":"Acclimatization","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000064","descriptor_name":"Acclimatization","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"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":"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":"D036262","descriptor_name":"Empirical Research","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D036262","descriptor_name":"Empirical Research","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D036262","descriptor_name":"Empirical Research","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":4,"locations":[{"id":"doi:10.1162/evco_a_00320","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00320","pdf_url":"https://direct.mit.edu/evco/article-pdf/doi/10.1162/evco_a_00320/2125231/evco_a_00320.pdf","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:36854020","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/36854020","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},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/b1cf8d6c-c983-49e3-addb-4959a3f33b63","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/b1cf8d6c-c983-49e3-addb-4959a3f33b63","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/191099988/EvolutionaryComputation_Multiobjective_CameraReady_NoCopyright.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aishwaryaprajna, A & Rowe, J 2023, 'Evolutionary and Estimation of Distribution Algorithms for Unconstrained, Constrained and Multi-objective Noisy Combinatorial Optimisation Problems', Evolutionary Computation. https://doi.org/10.1162/evco_a_00320","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/b1cf8d6c-c983-49e3-addb-4959a3f33b63","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1162/evco_a_00320","is_oa":true,"landing_page_url":"https://doi.org/10.1162/evco_a_00320","pdf_url":"https://direct.mit.edu/evco/article-pdf/doi/10.1162/evco_a_00320/2125231/evco_a_00320.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4322623857.pdf"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W1479911746","https://openalex.org/W1546937057","https://openalex.org/W1558919105","https://openalex.org/W1569002781","https://openalex.org/W1719846953","https://openalex.org/W1976376425","https://openalex.org/W1989244967","https://openalex.org/W2000315765","https://openalex.org/W2012493317","https://openalex.org/W2013304545","https://openalex.org/W2036826174","https://openalex.org/W2037684294","https://openalex.org/W2046609661","https://openalex.org/W2071821028","https://openalex.org/W2085733505","https://openalex.org/W2100830227","https://openalex.org/W2109336437","https://openalex.org/W2115728730","https://openalex.org/W2118114365","https://openalex.org/W2126105956","https://openalex.org/W2127172809","https://openalex.org/W2139015486","https://openalex.org/W2144246951","https://openalex.org/W2148379945","https://openalex.org/W2152688255","https://openalex.org/W2154342596","https://openalex.org/W2197473496","https://openalex.org/W2278052651","https://openalex.org/W2290719151","https://openalex.org/W2296129337","https://openalex.org/W2527291902","https://openalex.org/W2567212392","https://openalex.org/W2589005638","https://openalex.org/W2727744916","https://openalex.org/W2786011542","https://openalex.org/W2886398927","https://openalex.org/W2955835291","https://openalex.org/W2961125409","https://openalex.org/W2967587352","https://openalex.org/W3011855308","https://openalex.org/W3089478229","https://openalex.org/W3194858733","https://openalex.org/W6632329427","https://openalex.org/W6633513437","https://openalex.org/W6634034875","https://openalex.org/W6677658117","https://openalex.org/W6694866340","https://openalex.org/W6727909882","https://openalex.org/W6748470950","https://openalex.org/W6800422574"],"related_works":["https://openalex.org/W1606499289","https://openalex.org/W1985939653","https://openalex.org/W4280569079","https://openalex.org/W3103982436","https://openalex.org/W2351904352","https://openalex.org/W2133099979","https://openalex.org/W2741252017","https://openalex.org/W2911578165","https://openalex.org/W2626282817","https://openalex.org/W2387767111"],"abstract_inverted_index":{"We":[0,38,116,134],"present":[1],"an":[2],"empirical":[3],"study":[4],"of":[5,8,22,89,96,114,120,148],"a":[6,59,111,146],"range":[7],"evolutionary":[9,155],"algorithms":[10],"applied":[11],"to":[12,53],"various":[13],"noisy":[14,77,106,149],"combinatorial":[15,150],"optimisation":[16],"problems.":[17,37],"There":[18],"are":[19,48,71],"three":[20],"sets":[21],"experiments.":[23],"The":[24],"first":[25],"looks":[26],"at":[27],"several":[28,118],"toy":[29],"problems,":[30],"such":[31],"as":[32],"OneMax":[33],"and":[34,42,69,81,110,132,138],"other":[35,154],"linear":[36],"find":[39],"that":[40,136],"UMDA":[41,68,92,121],"the":[43,49,65,94,97,100,126],"Paired-Crossover":[44],"Evolutionary":[45,128],"Algorithm":[46],"(PCEA)":[47],"only":[50],"ones":[51],"able":[52],"cope":[54],"robustly":[55],"with":[56,91,125],"noise,":[57,90],"within":[58],"reasonable":[60],"fixed":[61],"time":[62],"budget.":[63],"In":[64,99],"second":[66],"stage,":[67,102],"PCEA":[70],"then":[72],"tested":[73],"on":[74,145],"more":[75],"complex":[76],"problems:":[78],"SubsetSum,":[79],"Knapsack,":[80],"SetCover.":[82],"Both":[83],"perform":[84],"well":[85],"under":[86],"increasing":[87],"levels":[88],"being":[93],"better":[95],"two.":[98],"third":[101],"we":[103],"consider":[104],"two":[105],"multiobjective":[107,112,123],"problems":[108,124],"(CountingOnesCountingZeros":[109],"formulation":[113],"SetCover).":[115],"compare":[117],"adaptations":[119],"for":[122],"Simple":[127],"Multiobjective":[129],"Optimiser":[130],"(SEMO)":[131],"NSGA-II.":[133],"conclude":[135],"UMDA,":[137],"its":[139],"variants,":[140],"can":[141],"be":[142],"highly":[143],"effective":[144],"variety":[147],"optimisation,":[151],"outperforming":[152],"many":[153],"algorithms.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2023-03-01T00:00:00"}