{"id":"https://openalex.org/W2018736897","doi":"https://doi.org/10.1109/cec.2012.6256531","title":"Targeted EDA adapted for a routing problem with variable length chromosomes","display_name":"Targeted EDA adapted for a routing problem with variable length chromosomes","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2018736897","doi":"https://doi.org/10.1109/cec.2012.6256531","mag":"2018736897"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6256531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5052638499","display_name":"Geoffrey Neumann","orcid":null},"institutions":[{"id":"https://openalex.org/I12093191","display_name":"University of Stirling","ror":"https://ror.org/045wgfr59","country_code":"GB","type":"education","lineage":["https://openalex.org/I12093191"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Geoffrey Neumann","raw_affiliation_strings":["Computing Science and Mathematics, University of Stirling, Stirling, UK","Computing Science and Mathematics, University of Stirling, FK9 4LA, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Science and Mathematics, University of Stirling, Stirling, UK","institution_ids":["https://openalex.org/I12093191"]},{"raw_affiliation_string":"Computing Science and Mathematics, University of Stirling, FK9 4LA, United Kingdom","institution_ids":["https://openalex.org/I12093191"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103057839","display_name":"David Cairns","orcid":"https://orcid.org/0000-0002-0246-3821"},"institutions":[{"id":"https://openalex.org/I12093191","display_name":"University of Stirling","ror":"https://ror.org/045wgfr59","country_code":"GB","type":"education","lineage":["https://openalex.org/I12093191"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David Cairns","raw_affiliation_strings":["Computing Science and Mathematics, University of Stirling, Stirling, UK","Computing Science and Mathematics, University of Stirling, FK9 4LA, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Science and Mathematics, University of Stirling, Stirling, UK","institution_ids":["https://openalex.org/I12093191"]},{"raw_affiliation_string":"Computing Science and Mathematics, University of Stirling, FK9 4LA, United Kingdom","institution_ids":["https://openalex.org/I12093191"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12093191"],"apc_list":null,"apc_paid":null,"fwci":0.2602,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.47473871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"98","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9957000017166138,"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.9957000017166138,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9671000242233276,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9198267459869385},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6077789068222046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6040433645248413},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5735939741134644},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5562682151794434},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5512064099311829},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.5435322523117065},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5353702902793884},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5235390663146973},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.46931979060173035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36012595891952515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2940561771392822},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23065295815467834},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13213983178138733},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0715591311454773}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9198267459869385},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6077789068222046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6040433645248413},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5735939741134644},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5562682151794434},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5512064099311829},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.5435322523117065},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5353702902793884},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5235390663146973},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46931979060173035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36012595891952515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2940561771392822},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23065295815467834},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13213983178138733},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0715591311454773},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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":1,"locations":[{"id":"doi:10.1109/cec.2012.6256531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W191705817","https://openalex.org/W1479911746","https://openalex.org/W1529520349","https://openalex.org/W1540706608","https://openalex.org/W1553675980","https://openalex.org/W1557784766","https://openalex.org/W1592130821","https://openalex.org/W1630205871","https://openalex.org/W1692958259","https://openalex.org/W2009900325","https://openalex.org/W2032310729","https://openalex.org/W2045268063","https://openalex.org/W2078324766","https://openalex.org/W2096446001","https://openalex.org/W2117473144","https://openalex.org/W2168967818","https://openalex.org/W3023540311","https://openalex.org/W3144372880","https://openalex.org/W6631629569","https://openalex.org/W6633233455"],"related_works":["https://openalex.org/W1966449253","https://openalex.org/W2090855774","https://openalex.org/W21080393","https://openalex.org/W1985939653","https://openalex.org/W1606499289","https://openalex.org/W2741252017","https://openalex.org/W2911578165","https://openalex.org/W2626282817","https://openalex.org/W1571925721","https://openalex.org/W2387767111"],"abstract_inverted_index":{"Targeted":[0],"EDA":[1],"(TEDA),":[2],"an":[3,31],"evolutionary":[4],"algorithm":[5],"that":[6,59,89],"combines":[7],"a":[8,41],"targeted":[9],"intervention":[10],"principle":[11],"with":[12],"Estimation":[13],"of":[14,28,33,87],"Distribution":[15],"Algorithms":[16],"(EDA),":[17],"is":[18,30,91],"designed":[19],"to":[20,40,51],"solve":[21],"optimal":[22],"control":[23],"problems":[24,52,88],"where":[25],"the":[26,85],"number":[27],"interventions":[29],"element":[32],"solution":[34],"fitness.":[35],"This":[36],"paper":[37],"applies":[38],"it":[39,50],"network":[42],"routing":[43],"problem":[44,78],"and":[45,71,79],"in":[46,80],"doing":[47,81],"so":[48,82],"adapts":[49],"involving":[53],"variable":[54],"length":[55],"chromosomes.":[56],"We":[57],"show":[58],"TEDA":[60,90],"can":[61],"outperform":[62],"algorithms":[63],"using":[64],"standard":[65],"crossover":[66,74],"techniques":[67],"such":[68],"as":[69],"one":[70],"two":[72],"point":[73],"on":[75],"this":[76],"new":[77],"we":[83],"extend":[84],"range":[86],"effective":[92],"at":[93],"solving.":[94]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}