{"id":"https://openalex.org/W2133766189","doi":"https://doi.org/10.1109/cec.2006.1688339","title":"Particle Swarm Optimization for the Bi-objective Degree constrained Minimum Spanning Tree","display_name":"Particle Swarm Optimization for the Bi-objective Degree constrained Minimum Spanning Tree","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2133766189","doi":"https://doi.org/10.1109/cec.2006.1688339","mag":"2133766189"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2006.1688339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688339","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":"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/A5023552576","display_name":"Elizabeth Ferreira Gouv\u00eaa Goldbarg","orcid":"https://orcid.org/0000-0002-2265-4692"},"institutions":[{"id":"https://openalex.org/I35046152","display_name":"Universidade Federal do Rio Grande do Norte","ror":"https://ror.org/04wn09761","country_code":"BR","type":"education","lineage":["https://openalex.org/I35046152"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"E.F.G. Goldbarg","raw_affiliation_strings":["Universidade Federal do Rio Grande do Norte, Brazil","Universidade Federal do Rio Grande do Norte, Brazil (phone: 55-84-3215-3814; fax: 55-84-3215-3815; e-mail: beth@dimap.ufrn.br)"],"affiliations":[{"raw_affiliation_string":"Universidade Federal do Rio Grande do Norte, Brazil","institution_ids":["https://openalex.org/I35046152"]},{"raw_affiliation_string":"Universidade Federal do Rio Grande do Norte, Brazil (phone: 55-84-3215-3814; fax: 55-84-3215-3815; e-mail: beth@dimap.ufrn.br)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027922823","display_name":"Givanaldo R. de Souza","orcid":null},"institutions":[{"id":"https://openalex.org/I35046152","display_name":"Universidade Federal do Rio Grande do Norte","ror":"https://ror.org/04wn09761","country_code":"BR","type":"education","lineage":["https://openalex.org/I35046152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"G.R. de Souza","raw_affiliation_strings":["Universidade Federal do Rio Grande do Norte, Brazil","fax: 55-84-3215-3815"],"affiliations":[{"raw_affiliation_string":"Universidade Federal do Rio Grande do Norte, Brazil","institution_ids":["https://openalex.org/I35046152"]},{"raw_affiliation_string":"fax: 55-84-3215-3815","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091302024","display_name":"Marco C. Goldbarg","orcid":null},"institutions":[{"id":"https://openalex.org/I35046152","display_name":"Universidade Federal do Rio Grande do Norte","ror":"https://ror.org/04wn09761","country_code":"BR","type":"education","lineage":["https://openalex.org/I35046152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"M.C. Goldbarg","raw_affiliation_strings":["Universidade Federal do Rio Grande do Norte, Brazil","e-mail: beth@dimap.ufrn.br)"],"affiliations":[{"raw_affiliation_string":"Universidade Federal do Rio Grande do Norte, Brazil","institution_ids":["https://openalex.org/I35046152"]},{"raw_affiliation_string":"e-mail: beth@dimap.ufrn.br)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023552576"],"corresponding_institution_ids":["https://openalex.org/I35046152"],"apc_list":null,"apc_paid":null,"fwci":1.9622,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86551772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":null,"first_page":"420","last_page":"427"},"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.9976999759674072,"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.9976999759674072,"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.9894999861717224,"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.9889000058174133,"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/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.8066706657409668},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7311058044433594},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6532033681869507},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6015469431877136},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5949222445487976},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5895853042602539},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5169905424118042},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4938672184944153},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49307605624198914},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.490683913230896},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.477690726518631},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.4708302319049835},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4239161014556885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34736502170562744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3383112847805023},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.061696380376815796}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.8066706657409668},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7311058044433594},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6532033681869507},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6015469431877136},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5949222445487976},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5895853042602539},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5169905424118042},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4938672184944153},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49307605624198914},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.490683913230896},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.477690726518631},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.4708302319049835},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4239161014556885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34736502170562744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3383112847805023},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.061696380376815796},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2006.1688339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688339","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W90390084","https://openalex.org/W1483353037","https://openalex.org/W1587654268","https://openalex.org/W1963770385","https://openalex.org/W1965680834","https://openalex.org/W1966253115","https://openalex.org/W1966658892","https://openalex.org/W1993123118","https://openalex.org/W2011039300","https://openalex.org/W2017927472","https://openalex.org/W2083743691","https://openalex.org/W2087216833","https://openalex.org/W2098907614","https://openalex.org/W2128337573","https://openalex.org/W2142146559","https://openalex.org/W2150312211","https://openalex.org/W2152195021","https://openalex.org/W2153446897","https://openalex.org/W2159494710","https://openalex.org/W2247485652","https://openalex.org/W2370829380","https://openalex.org/W2996256129","https://openalex.org/W4248020564","https://openalex.org/W4255306344","https://openalex.org/W6603705176","https://openalex.org/W6682763932","https://openalex.org/W6772483583"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"This":[0],"paper":[1,60],"presents":[2],"a":[3],"Particle":[4],"Swarm":[5],"Optimization":[6],"algorithm":[7,39],"for":[8,19,42,65],"the":[9,20,43,55,66],"multi-criteria":[10],"degree":[11],"constrained":[12],"minimum":[13],"spanning":[14],"tree":[15],"problem.":[16,45,67],"The":[17,31,51],"operators":[18],"particle\u2019s":[21],"velocity":[22],"are":[23],"based":[24],"upon":[25],"local":[26],"search":[27],"and":[28],"path-relinking":[29],"procedures.":[30],"proposed":[32,57],"heuristic":[33],"is":[34,49],"compared":[35],"with":[36],"other":[37],"evolutionary":[38],"presented":[40],"previously":[41],"same":[44],"A":[46],"computational":[47],"experiment":[48],"reported.":[50],"results":[52],"show":[53],"that":[54],"method":[56],"in":[58],"this":[59],"finds":[61],"high":[62],"quality":[63],"solutions":[64]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}