{"id":"https://openalex.org/W2105942197","doi":"https://doi.org/10.1162/evco_a_00026","title":"A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem","display_name":"A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem","publication_year":2010,"publication_date":"2010-09-24","ids":{"openalex":"https://openalex.org/W2105942197","doi":"https://doi.org/10.1162/evco_a_00026","mag":"2105942197","pmid":"https://pubmed.ncbi.nlm.nih.gov/20868263"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00026","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00026","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":["arxiv","crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1003.4314","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Daniel Karapetyan","orcid":null},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniel Karapetyan","raw_affiliation_strings":["Department of Computer Science, Royal Holloway London University, Egham, Surrey, TW20 0EX, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway London University, Egham, Surrey, TW20 0EX, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","author":{"id":null,"display_name":"Gregory Gutin","orcid":null},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gregory Gutin","raw_affiliation_strings":["Department of Computer Science, Royal Holloway London University, Egham, Surrey, TW20 0EX, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway London University, Egham, Surrey, TW20 0EX, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4661,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.74765683,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"19","issue":"3","first_page":"345","last_page":"371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.4366999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.4366999864578247,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.34279999136924744,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.041600000113248825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.8720999956130981},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6848999857902527},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.6743999719619751},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6129999756813049},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5209000110626221},{"id":"https://openalex.org/keywords/sizing","display_name":"Sizing","score":0.5088000297546387},{"id":"https://openalex.org/keywords/population-size","display_name":"Population size","score":0.4968999922275543},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4300999939441681},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.424699991941452}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8720999956130981},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6848999857902527},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.677299976348877},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6743999719619751},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6129999756813049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5228000283241272},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5209000110626221},{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.5088000297546387},{"id":"https://openalex.org/C169733012","wikidata":"https://www.wikidata.org/wiki/Q1613416","display_name":"Population size","level":3,"score":0.4968999922275543},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4300999939441681},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.424699991941452},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.41429999470710754},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39169999957084656},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.375900000333786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36500000953674316},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.35690000653266907},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.32850000262260437},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.25130000710487366}],"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":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"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":"D057386","descriptor_name":"Search Engine","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false}],"locations_count":4,"locations":[{"id":"doi:10.1162/evco_a_00026","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00026","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:20868263","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/20868263","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:repository.essex.ac.uk:22072","is_oa":false,"landing_page_url":"https://doi.org/10.1162/EVCO_a_00026","pdf_url":null,"source":{"id":"https://openalex.org/S4306401236","display_name":"Open Access at Essex (University of Essex)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I110002522","host_organization_name":"University of Essex","host_organization_lineage":["https://openalex.org/I110002522"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:arXiv.org:1003.4314","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1003.4314","pdf_url":"https://arxiv.org/pdf/1003.4314","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1003.4314","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1003.4314","pdf_url":"https://arxiv.org/pdf/1003.4314","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1565234356","https://openalex.org/W1587009118","https://openalex.org/W1965426466","https://openalex.org/W1969186119","https://openalex.org/W1974577932","https://openalex.org/W2004107793","https://openalex.org/W2006608876","https://openalex.org/W2006743657","https://openalex.org/W2012738417","https://openalex.org/W2014700268","https://openalex.org/W2016682153","https://openalex.org/W2016984568","https://openalex.org/W2023947722","https://openalex.org/W2028569720","https://openalex.org/W2028823751","https://openalex.org/W2029744427","https://openalex.org/W2029952127","https://openalex.org/W2038806264","https://openalex.org/W2050028957","https://openalex.org/W2051390209","https://openalex.org/W2065841482","https://openalex.org/W2076564017","https://openalex.org/W2086942674","https://openalex.org/W2088653780","https://openalex.org/W2096497693","https://openalex.org/W2105016507","https://openalex.org/W2138135326","https://openalex.org/W2146879413","https://openalex.org/W2170186790","https://openalex.org/W2222512263","https://openalex.org/W2574541533"],"related_works":[],"abstract_inverted_index":{"Memetic":[0],"algorithms":[1,42],"are":[2,150,159],"known":[3],"to":[4,21,50,160,171,180,202],"be":[5,119,161],"a":[6,16,23,51,87,116,128,169,182,206],"powerful":[7],"technique":[8],"in":[9,43,110],"solving":[10],"hard":[11],"optimization":[12],"problems.":[13],"To":[14],"design":[15,165],"memetic":[17,183],"algorithm,":[18],"one":[19,32],"needs":[20],"make":[22],"host":[24],"of":[25,33,40,89,92,100,115,130,136,152,209,223],"decisions.":[26],"Selecting":[27],"the":[28,34,41,44,47,57,61,90,93,97,101,105,113,131,137,144,153,156,164,186,199,224],"population":[29,48,63,81,196],"size":[30,49,64,197],"is":[31,84,141],"most":[35],"important":[36],"among":[37],"them.":[38],"Most":[39],"literature":[45],"fix":[46],"certain":[52],"constant":[53],"value.":[54],"This":[55],"reduces":[56],"algorithm's":[58,145],"quality":[59],"since":[60],"optimal":[62],"varies":[65],"for":[66,104,185,205],"different":[67],"instances,":[68],"local":[69,102,138,157,213],"search":[70,103,139,158],"procedures,":[71],"and":[72,96,155,212,215],"runtimes.":[73],"In":[74],"this":[75,125,216],"paper":[76],"we":[77,123,167],"propose":[78],"an":[79],"adjustable":[80,195],"size.":[82],"It":[83],"calculated":[85],"as":[86,127],"function":[88],"runtime":[91,99,114,135],"whole":[94],"algorithm":[95,184,200],"average":[98,134],"given":[106],"instance.":[107],"Note":[108],"that":[109,193],"many":[111],"applications":[112],"heuristic":[117],"should":[118],"limited":[120],"and,":[121],"therefore,":[122],"use":[124],"bound":[126],"parameter":[129],"algorithm.":[132,225],"The":[133,175],"procedure":[140,170],"measured":[142],"during":[143],"run.":[146],"Some":[147],"coefficients":[148],"which":[149],"independent":[151],"instance":[154],"tuned":[162],"at":[163],"time;":[166],"provide":[168],"find":[172],"these":[173],"coefficients.":[174],"proposed":[176],"approach":[177],"was":[178],"used":[179],"develop":[181],"multidimensional":[187],"assignment":[188],"problem":[189],"(MAP).":[190],"We":[191],"show":[192],"our":[194],"makes":[198],"flexible":[201],"perform":[203],"efficiently":[204],"wide":[207],"range":[208],"running":[210],"times":[211],"searches":[214],"does":[217],"not":[218],"require":[219],"any":[220],"additional":[221],"tuning":[222]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}