{"id":"https://openalex.org/W2068399200","doi":"https://doi.org/10.1109/cec.2007.4424884","title":"A new particle swarm optimization based algorithm for solving shortest-paths tree problem","display_name":"A new particle swarm optimization based algorithm for solving shortest-paths tree problem","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W2068399200","doi":"https://doi.org/10.1109/cec.2007.4424884","mag":"2068399200"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2007.4424884","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2007.4424884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Congress 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/A5078175363","display_name":"Ammar W. Mohemmed","orcid":null},"institutions":[{"id":"https://openalex.org/I173029219","display_name":"Multimedia University","ror":"https://ror.org/04zrbnc33","country_code":"MY","type":"education","lineage":["https://openalex.org/I173029219"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Ammar W. Mohemmed","raw_affiliation_strings":["Faculty of Engineering and Technology, Multimedia University, Malacca, Malaysia","Multimedia Univ., Melaka#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering and Technology, Multimedia University, Malacca, Malaysia","institution_ids":["https://openalex.org/I173029219"]},{"raw_affiliation_string":"Multimedia Univ., Melaka#TAB#","institution_ids":["https://openalex.org/I173029219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101980869","display_name":"N. C. Sahoo","orcid":"https://orcid.org/0000-0001-7626-9821"},"institutions":[{"id":"https://openalex.org/I173029219","display_name":"Multimedia University","ror":"https://ror.org/04zrbnc33","country_code":"MY","type":"education","lineage":["https://openalex.org/I173029219"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Nirod Chandra Sahoo","raw_affiliation_strings":["Faculty of Engineering and Technology, Multimedia University, Malacca, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering and Technology, Multimedia University, Malacca, Malaysia","institution_ids":["https://openalex.org/I173029219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040173610","display_name":"Tan Kim Geok","orcid":"https://orcid.org/0000-0001-6881-4535"},"institutions":[{"id":"https://openalex.org/I173029219","display_name":"Multimedia University","ror":"https://ror.org/04zrbnc33","country_code":"MY","type":"education","lineage":["https://openalex.org/I173029219"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Tan Kim Geok","raw_affiliation_strings":["Faculty of Engineering and Technology, Multimedia University, Malacca, Malaysia","Multimedia Univ., Melaka#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering and Technology, Multimedia University, Malacca, Malaysia","institution_ids":["https://openalex.org/I173029219"]},{"raw_affiliation_string":"Multimedia Univ., Melaka#TAB#","institution_ids":["https://openalex.org/I173029219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173029219"],"apc_list":null,"apc_paid":null,"fwci":1.4973,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79318876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"108","issue":null,"first_page":"3221","last_page":"3225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9807000160217285,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9807000160217285,"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/T11106","display_name":"Data Management and Algorithms","score":0.9783999919891357,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9639999866485596,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7028264999389648},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6924490928649902},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5544440746307373},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5332096815109253},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5269637703895569},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5124624371528625},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5085912942886353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49606046080589294},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.479314923286438},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.4754980504512787},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4441983997821808},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.43837544322013855},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.42729124426841736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3721078634262085},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32750362157821655},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26914548873901367},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2584972381591797},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1074059009552002},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08354240655899048}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7028264999389648},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6924490928649902},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5544440746307373},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5332096815109253},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5269637703895569},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5124624371528625},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5085912942886353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49606046080589294},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.479314923286438},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.4754980504512787},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4441983997821808},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.43837544322013855},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.42729124426841736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3721078634262085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32750362157821655},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26914548873901367},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2584972381591797},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1074059009552002},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08354240655899048},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2007.4424884","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2007.4424884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:shdl.mmu.edu.my:3179","is_oa":false,"landing_page_url":"http://shdl.mmu.edu.my/3179/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196753","display_name":"Siti Hasmah Digital Library-MMU Institutiona Repository (Multimedia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173029219","host_organization_name":"Multimedia University","host_organization_lineage":["https://openalex.org/I173029219"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1889956542","https://openalex.org/W2011039300","https://openalex.org/W2063317962","https://openalex.org/W2071193060","https://openalex.org/W2076857141","https://openalex.org/W2105808107","https://openalex.org/W2117473144","https://openalex.org/W2119926658","https://openalex.org/W2152195021"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2375775343","https://openalex.org/W2562562750","https://openalex.org/W4293054712","https://openalex.org/W2368964068","https://openalex.org/W2198982833","https://openalex.org/W2377950158","https://openalex.org/W1617152041","https://openalex.org/W2366342492","https://openalex.org/W2161960576"],"abstract_inverted_index":{"This":[0,49],"paper":[1],"presents":[2],"an":[3],"efficient":[4],"particle":[5,37],"swarm":[6,86],"optimization":[7],"(PSO)":[8],"based":[9],"search":[10],"algorithm":[11],"for":[12,43,105],"solving":[13],"the":[14,25,46,52,56,60,63,65,78,84,98,101],"single":[15],"source":[16],"all":[17],"destination":[18],"shortest":[19,26,57,66,108],"paths":[20,27,109],"or":[21],"what":[22],"is":[23,69,77,81],"called":[24],"tree":[28],"(SPT),":[29],"commonly":[30],"encountered":[31],"in":[32,110],"graph":[33],"theory.":[34],"A":[35],"new":[36],"encoding/decoding":[38,50],"scheme":[39],"has":[40],"been":[41],"devised":[42],"particle-representation":[44],"of":[45,55,100,107],"SPT":[47],"parameters.":[48],"exploits":[51],"sub-optimality":[53],"feature":[54],"path.":[58],"In":[59],"proposed":[61,102],"algorithm,":[62],"solution,":[64],"path":[67],"tree,":[68],"not":[70],"represented":[71],"by":[72,83],"one":[73],"particle,":[74],"but":[75],"it":[76],"solution":[79],"that":[80],"contributed":[82],"complete":[85],"population.":[87],"Numerical":[88],"computation":[89,106],"results":[90],"on":[91],"several":[92],"networks":[93],"with":[94],"random":[95],"topologies":[96],"illustrate":[97],"efficiency":[99],"PSO":[103],"method":[104],"networks.":[111]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}