{"id":"https://openalex.org/W4379929132","doi":"https://doi.org/10.1162/evco_a_00335","title":"On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem","display_name":"On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem","publication_year":2023,"publication_date":"2023-06-08","ids":{"openalex":"https://openalex.org/W4379929132","doi":"https://doi.org/10.1162/evco_a_00335","pmid":"https://pubmed.ncbi.nlm.nih.gov/37290030"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00335","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00335","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":["crossref","pubmed"],"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/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jakob Bossek","raw_affiliation_strings":["AI Methodology, Department of Computer Science, RWTH Aachen University, Germany bossek@aim.rwth-aachen.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AI Methodology, Department of Computer Science, RWTH Aachen University, Germany bossek@aim.rwth-aachen.de","institution_ids":["https://openalex.org/I887968799"]}]},{"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":true,"raw_author_name":"Christian Grimme","raw_affiliation_strings":["Statistics and Optimization, Department of Information Systems, University of M\u00fcnster, Germany christian.grimme@wi.uni-muenster.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Statistics and Optimization, Department of Information Systems, University of M\u00fcnster, Germany christian.grimme@wi.uni-muenster.de","institution_ids":["https://openalex.org/I22465464"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003026076","https://openalex.org/A5083504710"],"corresponding_institution_ids":["https://openalex.org/I22465464","https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.5749,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72233494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"32","issue":"2","first_page":"143","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9979000091552734,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9905999898910522,"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/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"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/spanning-tree","display_name":"Spanning tree","score":0.7712256908416748},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7512227296829224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5497586727142334},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5323284864425659},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.493717759847641},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48640087246894836},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.45605605840682983},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4514540433883667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43682733178138733},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4270886778831482},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3926372230052948},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.12309244275093079},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.08075925707817078}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7712256908416748},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7512227296829224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5497586727142334},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5323284864425659},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.493717759847641},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48640087246894836},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.45605605840682983},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4514540433883667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43682733178138733},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4270886778831482},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3926372230052948},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.12309244275093079},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.08075925707817078},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"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":"D009154","descriptor_name":"Mutation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D009154","descriptor_name":"Mutation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D009154","descriptor_name":"Mutation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false}],"locations_count":2,"locations":[{"id":"doi:10.1162/evco_a_00335","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00335","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:37290030","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/37290030","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}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W145413376","https://openalex.org/W243424403","https://openalex.org/W1483353037","https://openalex.org/W1494649436","https://openalex.org/W1498178627","https://openalex.org/W1553373771","https://openalex.org/W1567525874","https://openalex.org/W1653469883","https://openalex.org/W1965680834","https://openalex.org/W1967957610","https://openalex.org/W1976093834","https://openalex.org/W1976159118","https://openalex.org/W1986022261","https://openalex.org/W1988114663","https://openalex.org/W2008499862","https://openalex.org/W2008581797","https://openalex.org/W2017927472","https://openalex.org/W2023658462","https://openalex.org/W2038420231","https://openalex.org/W2047517090","https://openalex.org/W2067273697","https://openalex.org/W2077823485","https://openalex.org/W2091360576","https://openalex.org/W2098907614","https://openalex.org/W2109343068","https://openalex.org/W2111933629","https://openalex.org/W2116661285","https://openalex.org/W2117226423","https://openalex.org/W2120016402","https://openalex.org/W2126105956","https://openalex.org/W2154596660","https://openalex.org/W2482040973","https://openalex.org/W2582743722","https://openalex.org/W2589615383","https://openalex.org/W2670904616","https://openalex.org/W2752573522","https://openalex.org/W2755353241","https://openalex.org/W2776773535","https://openalex.org/W2791627608","https://openalex.org/W2807218612","https://openalex.org/W2952579308","https://openalex.org/W2962217072","https://openalex.org/W2978798956","https://openalex.org/W4302557773","https://openalex.org/W6628835785","https://openalex.org/W6634512254","https://openalex.org/W6698666975","https://openalex.org/W6738002306","https://openalex.org/W6747109364","https://openalex.org/W6765981385"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W2943635264","https://openalex.org/W2387385213","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W2138987445","https://openalex.org/W4308416203","https://openalex.org/W1842018596"],"abstract_inverted_index":{"We":[0,86],"contribute":[1],"to":[2,78,120],"the":[3,7,10,31,48,92,97,122,130,137,161],"efficient":[4],"approximation":[5],"of":[6,34,59,83,147,154,160],"Pareto-set":[8],"for":[9,91],"classical":[11],"NP-hard":[12],"multiobjective":[13],"minimum":[14],"spanning":[15,36],"tree":[16],"problem":[17],"(moMST)":[18],"adopting":[19],"evolutionary":[20],"computation.":[21],"More":[22],"precisely,":[23],"by":[24,72,109],"building":[25],"upon":[26],"preliminary":[27],"work,":[28],"we":[29,113],"analyze":[30],"neighborhood":[32],"structure":[33],"Pareto-optimal":[35],"trees":[37],"and":[38,95],"design":[39],"several":[40],"highly":[41],"biased":[42],"sub-graph-based":[43,131],"mutation":[44],"operators":[45,55,94,132],"founded":[46],"on":[47,150],"gained":[49],"insights.":[50],"In":[51],"a":[52,79,84],"nutshell,":[53],"these":[54],"replace":[56],"(un)connected":[57],"sub-trees":[58],"candidate":[60],"solutions":[61],"with":[62,140,157],"locally":[63],"optimal":[64],"sub-trees.":[65],"The":[66],"latter":[67],"(biased)":[68],"step":[69],"is":[70],"realized":[71],"applying":[73],"Kruskal's":[74],"single-objective":[75],"MST":[76],"algorithm":[77],"weighted":[80],"sum":[81],"scalarization":[82],"sub-graph.":[85],"prove":[87],"runtime":[88],"complexity":[89],"results":[90,127],"introduced":[93],"investigate":[96],"desirable":[98],"Pareto-beneficial":[99],"property.":[100],"This":[101],"property":[102],"states":[103],"that":[104,129],"mutants":[105],"cannot":[106],"be":[107],"dominated":[108],"their":[110],"parent.":[111],"Moreover,":[112],"perform":[114],"an":[115],"extensive":[116],"experimental":[117],"benchmark":[118],"study":[119],"showcase":[121],"operator's":[123],"practical":[124],"suitability.":[125],"Our":[126],"confirm":[128],"beat":[133],"baseline":[134],"algorithms":[135],"from":[136],"literature":[138],"even":[139],"severely":[141],"restricted":[142],"computational":[143],"budget":[144],"in":[145],"terms":[146],"function":[148],"evaluations":[149],"four":[151],"different":[152,158],"classes":[153],"complete":[155],"graphs":[156],"shapes":[159],"Pareto-front.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}