{"id":"https://openalex.org/W2167427819","doi":"https://doi.org/10.1145/1569901.1570186","title":"Extending evolutionary algorithms to discover tri-criterion and non-supported solutions for the minimum spanning tree problem","display_name":"Extending evolutionary algorithms to discover tri-criterion and non-supported solutions for the minimum spanning tree problem","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2167427819","doi":"https://doi.org/10.1145/1569901.1570186","mag":"2167427819"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1570186","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1570186","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","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/A5028823731","display_name":"Madeleine Davis-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":true,"raw_author_name":"Madeleine Davis-Moradkhan","raw_affiliation_strings":["University of Reading, Reading, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Reading, Reading, United Kingdom","institution_ids":["https://openalex.org/I71052956"]}]},{"author_position":"middle","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":"Will N. Browne","raw_affiliation_strings":["University of Reading, Reading, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Reading, Reading, United Kingdom","institution_ids":["https://openalex.org/I71052956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065778060","display_name":"Peter Grindrod","orcid":"https://orcid.org/0000-0003-0924-7010"},"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":"Peter Grindrod","raw_affiliation_strings":["University of Reading, Reading, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Reading, Reading, United Kingdom","institution_ids":["https://openalex.org/I71052956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028823731"],"corresponding_institution_ids":["https://openalex.org/I71052956"],"apc_list":null,"apc_paid":null,"fwci":1.0571,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78970188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1829","last_page":"1830"},"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.9801999926567078,"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.9801999926567078,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9606000185012817,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9006999731063843,"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.6220316290855408},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5951506495475769},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5731052160263062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5718581080436707},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5281239151954651},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.48356983065605164},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4674932062625885},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4424254596233368},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4406573176383972},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4345822334289551},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.41550207138061523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3597699999809265},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13197839260101318}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6220316290855408},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5951506495475769},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5731052160263062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5718581080436707},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5281239151954651},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.48356983065605164},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4674932062625885},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4424254596233368},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4406573176383972},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4345822334289551},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.41550207138061523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3597699999809265},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13197839260101318},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1569901.1570186","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1570186","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:93807ceb-ab09-4b4d-9598-aa0bc24480e4","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:93807ceb-ab09-4b4d-9598-aa0bc24480e4","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W180452353","https://openalex.org/W1965680834","https://openalex.org/W1985130949","https://openalex.org/W2098907614","https://openalex.org/W2134727907","https://openalex.org/W2142146559","https://openalex.org/W2279353332"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"The":[0],"study":[1],"of":[2,61,64,89,110,124],"multi-criterion":[3],"minimum":[4],"spanning":[5],"trees":[6],"is":[7,70,93],"important":[8],"as":[9,16,68],"many":[10],"optimization":[11],"problems":[12,63],"in":[13,44],"networks,":[14],"such":[15],"communication,":[17],"transport":[18],"and":[19,41,80],"utilities":[20],"can":[21],"be":[22],"represented":[23],"by":[24,96],"this":[25],"model.":[26],"Conventional":[27],"evolutionary":[28,52],"approaches":[29],"struggle":[30],"to":[31,36,73,83,105],"discover":[32],"near-optimal":[33],"solutions":[34,79],"due":[35],"the":[37,42,46,62,65,74,87,108,111,118,122],"combinatorial":[38],"search":[39],"space,":[40],"difficulty":[43],"discovering":[45],"non-supported":[47,78],"solutions.":[48],"Recently,":[49],"a":[50],"knowledge-based":[51],"approach,":[53],"KEA,":[54,106],"has":[55],"been":[56],"developed":[57],"that":[58],"overcomes":[59],"some":[60],"earlier":[66],"algorithms":[67,98],"it":[69],"not":[71],"restricted":[72],"bi-criterion":[75],"case,":[76],"finds":[77],"scales":[81],"well":[82],"larger":[84],"problems;":[85],"however,":[86],"mid-point":[88,119],"its":[90],"Pareto":[91],"front":[92],"often":[94],"dominated":[95],"alternative":[97],"where":[99],"they":[100],"are":[101,115],"applicable.":[102],"Novel":[103],"extensions":[104],"increasing":[107],"knowledge":[109],"mid-point,":[112],"termed":[113],"KEA-W":[114],"examined,":[116],"eliminating":[117],"deficiencies":[120],"at":[121],"cost":[123],"computational":[125],"time.":[126]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}