{"id":"https://openalex.org/W2776773535","doi":"https://doi.org/10.1109/ssci.2017.8285183","title":"A pareto-beneficial sub-tree mutation for the multi-criteria minimum spanning tree problem","display_name":"A pareto-beneficial sub-tree mutation for the multi-criteria minimum spanning tree problem","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2776773535","doi":"https://doi.org/10.1109/ssci.2017.8285183","mag":"2776773535"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2017.8285183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285183","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5083504710","display_name":"Jakob Bossek","orcid":"https://orcid.org/0000-0002-4121-4668"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jakob Bossek","raw_affiliation_strings":["Department of Information Systems, University of Munster, Munster, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems, University of Munster, Munster, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003026076","display_name":"Christian Grimme","orcid":"https://orcid.org/0000-0002-8608-8773"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Grimme","raw_affiliation_strings":["Department of Information Systems, University of Munster, Munster, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems, University of Munster, Munster, Germany","institution_ids":["https://openalex.org/I22465464"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4356,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84400766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":null,"first_page":"1","last_page":"8"},"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.998199999332428,"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.998199999332428,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.9800000190734863,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6931689381599426},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6084995269775391},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5616214871406555},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5478734970092773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5367440581321716},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.502335786819458},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.488104909658432},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4712522327899933},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.41988441348075867},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36044418811798096},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3255561590194702},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20168361067771912},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1916220486164093},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.07040449976921082},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.05560925602912903}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6931689381599426},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6084995269775391},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5616214871406555},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5478734970092773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5367440581321716},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.502335786819458},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.488104909658432},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4712522327899933},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.41988441348075867},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36044418811798096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3255561590194702},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20168361067771912},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1916220486164093},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.07040449976921082},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.05560925602912903},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci.2017.8285183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285183","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","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":24,"referenced_works":["https://openalex.org/W1483353037","https://openalex.org/W1498178627","https://openalex.org/W1525375343","https://openalex.org/W1574390288","https://openalex.org/W1606416127","https://openalex.org/W1653469883","https://openalex.org/W1965680834","https://openalex.org/W1967957610","https://openalex.org/W1976093834","https://openalex.org/W2017927472","https://openalex.org/W2018275644","https://openalex.org/W2019347980","https://openalex.org/W2053900989","https://openalex.org/W2077823485","https://openalex.org/W2098907614","https://openalex.org/W2116661285","https://openalex.org/W2126105956","https://openalex.org/W2245038373","https://openalex.org/W2616697817","https://openalex.org/W2755353241","https://openalex.org/W4255306344","https://openalex.org/W6634512254","https://openalex.org/W6690742089","https://openalex.org/W6738002306"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W4242086819","https://openalex.org/W2899787781","https://openalex.org/W2381121915","https://openalex.org/W2074214908","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2390742649"],"abstract_inverted_index":{"While":[0],"finding":[1],"minimum-cost":[2],"spanning":[3,17],"trees":[4],"(MST)":[5],"in":[6,11,30,158],"undirected":[7],"graphs":[8],"is":[9,21,49,140],"solvable":[10],"polynomial":[12],"time,":[13,41],"the":[14,24,85,90,135,159],"multi-criteria":[15,149],"minimum":[16],"tree":[18],"problem":[19,26],"(mcMST)":[20],"NP-hard.":[22],"Interestingly,":[23],"mcMST":[25,86],"has":[27],"not":[28],"been":[29],"focus":[31,88],"of":[32,40,96,114,161],"evolutionary":[33,97,146],"computation":[34],"research":[35],"for":[36,45,148],"a":[37,119],"long":[38],"period":[39],"although,":[42],"its":[43],"relevance":[44],"real":[46],"world":[47],"problems":[48],"easy":[50],"to":[51,107,153],"see.":[52],"The":[53,138],"available":[54],"and":[55,61,68,74,87,117,132,151],"most":[56],"notable":[57],"approaches":[58],"by":[59,66],"Zhou":[60],"Gen":[62],"as":[63,65,93],"well":[64],"Knowles":[67],"Corne":[69],"concentrate":[70],"on":[71,75,89],"solution":[72,105],"encoding":[73],"fairly":[76],"dated":[77],"selection":[78],"mechanisms.":[79],"In":[80],"this":[81],"work,":[82],"we":[83,126],"revisit":[84],"mutation":[91,110,156],"operators":[92,157],"exploratory":[94],"components":[95],"algorithms":[98],"neglected":[99],"so":[100],"far.":[101],"We":[102],"investigate":[103],"optimal":[104],"characteristics":[106],"discuss":[108],"current":[109],"strategies,":[111],"identify":[112],"shortcomings":[113],"these":[115],"operators,":[116],"propose":[118],"sub-tree":[120],"based":[121],"operator":[122,139],"which":[123],"offers":[124],"what":[125],"term":[127],"Pareto-beneficial":[128],"behavior:":[129],"ensuring":[130],"convergence":[131],"diversity":[133],"at":[134],"same":[136],"time.":[137],"empirically":[141],"evaluated":[142],"inside":[143],"modern":[144],"standard":[145],"meta-heuristics":[147],"optimization":[150],"compared":[152],"hitherto":[154],"applied":[155],"context":[160],"mcMST.":[162]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}