{"id":"https://openalex.org/W2115333213","doi":"https://doi.org/10.1109/cec.2006.1688471","title":"A Knowledge-Based Evolution Strategy for the Multi-Objective Minimum Spanning Tree Problem","display_name":"A Knowledge-Based Evolution Strategy for the Multi-Objective Minimum Spanning Tree Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2115333213","doi":"https://doi.org/10.1109/cec.2006.1688471","mag":"2115333213"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2006.1688471","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference 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/A5023544842","display_name":"M.D. Moradkhan","orcid":null},"institutions":[{"id":"https://openalex.org/I71052956","display_name":"University of Reading","ror":"https://ror.org/05v62cm79","country_code":"GB","type":"education","lineage":["https://openalex.org/I71052956"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M.D. Moradkhan","raw_affiliation_strings":["Department of Cybernetics, University of Reading, UK","University of Reading, Reading,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, University of Reading, UK","institution_ids":["https://openalex.org/I71052956"]},{"raw_affiliation_string":"University of Reading, Reading,","institution_ids":["https://openalex.org/I71052956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065533636","display_name":"Will N. Browne","orcid":"https://orcid.org/0000-0001-8979-2224"},"institutions":[{"id":"https://openalex.org/I71052956","display_name":"University of Reading","ror":"https://ror.org/05v62cm79","country_code":"GB","type":"education","lineage":["https://openalex.org/I71052956"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"W.N. Browne","raw_affiliation_strings":["Department of Cybernetics, University of Reading, UK","University of Reading, Reading,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, University of Reading, UK","institution_ids":["https://openalex.org/I71052956"]},{"raw_affiliation_string":"University of Reading, Reading,","institution_ids":["https://openalex.org/I71052956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I71052956"],"apc_list":null,"apc_paid":null,"fwci":0.5888,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.60844655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1391","last_page":"1398"},"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.9998000264167786,"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.9998000264167786,"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.9987000226974487,"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.9912999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7205537557601929},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6910538673400879},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6257599592208862},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6236323118209839},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.581440269947052},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.563578724861145},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5175496935844421},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5169252753257751},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5069196820259094},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4353148937225342},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4307040572166443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3700729012489319},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.366794615983963},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11722773313522339}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7205537557601929},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6910538673400879},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6257599592208862},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6236323118209839},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.581440269947052},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.563578724861145},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5175496935844421},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5169252753257751},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5069196820259094},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4353148937225342},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4307040572166443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3700729012489319},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.366794615983963},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11722773313522339},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2006.1688471","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:centaur.reading.ac.uk:14436","is_oa":false,"landing_page_url":"https://centaur.reading.ac.uk/14436/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402273","display_name":"CentAUR (University of Reading)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I71052956","host_organization_name":"University of Reading","host_organization_lineage":["https://openalex.org/I71052956"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book or Report Section"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W90390084","https://openalex.org/W168584899","https://openalex.org/W1665846492","https://openalex.org/W1784778693","https://openalex.org/W1948148225","https://openalex.org/W1965680834","https://openalex.org/W1966658892","https://openalex.org/W1985130949","https://openalex.org/W1995375333","https://openalex.org/W2008581797","https://openalex.org/W2009938762","https://openalex.org/W2017927472","https://openalex.org/W2046984978","https://openalex.org/W2057104486","https://openalex.org/W2077823485","https://openalex.org/W2091507391","https://openalex.org/W2098090548","https://openalex.org/W2098907614","https://openalex.org/W2111526171","https://openalex.org/W2126105956","https://openalex.org/W2127366419","https://openalex.org/W2142146559","https://openalex.org/W2142183404","https://openalex.org/W2158280690","https://openalex.org/W2161880126","https://openalex.org/W2162974503","https://openalex.org/W2166775052","https://openalex.org/W2167159964","https://openalex.org/W2279353332","https://openalex.org/W2753176400","https://openalex.org/W4237981999","https://openalex.org/W4249958171","https://openalex.org/W4255306344","https://openalex.org/W4285719527","https://openalex.org/W4302399279","https://openalex.org/W6603705176","https://openalex.org/W6606938772","https://openalex.org/W6683679523"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2381121915","https://openalex.org/W4380840098","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W2099915933","https://openalex.org/W1703428550","https://openalex.org/W2360026231","https://openalex.org/W2353822696","https://openalex.org/W2355225748"],"abstract_inverted_index":{"A":[0],"fast":[1,111],"Knowledge-based":[2],"Evolution":[3],"Strategy,":[4],"KES,":[5],"for":[6,19,27,41,62,74],"the":[7,20,58,66,82],"multi-objective":[8,108],"minimum":[9],"spanning":[10],"tree,":[11],"is":[12,17,79,102],"presented.":[13],"The":[14],"proposed":[15],"algorithm":[16],"validated,":[18],"bi-objective":[21],"case,":[22],"with":[23,34],"an":[24],"exhaustive":[25],"search":[26],"small":[28,63,115],"problems":[29,43,109],"(4-10":[30],"nodes),":[31],"and":[32,39,68,92,110],"compared":[33],"a":[35],"deterministic":[36],"algorithm,":[37],"EPDA":[38],"NSGA-II":[40,90],"larger":[42,75],"(up":[44],"to":[45,89,104,107,113],"100":[46],"nodes)":[47],"using":[48],"benchmark":[49],"hard":[50],"instances.":[51],"Experimental":[52],"results":[53],"show":[54],"that":[55,81],"KES":[56,86,101],"finds":[57],"true":[59],"Pareto":[60,72],"fronts":[61,83,91],"instances":[64,76],"of":[65],"problem":[67],"calculates":[69],"good":[70,95],"approximation":[71],"sets":[73],"tested.":[77],"It":[78],"shown":[80],"calculated":[84],"by":[85,99],"are":[87],"superior":[88],"almost":[93],"as":[94,96],"those":[97],"established":[98],"EPDA.":[100],"designed":[103],"be":[105],"scalable":[106],"due":[112],"its":[114],"complexity.":[116]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}