{"id":"https://openalex.org/W3177843672","doi":"https://doi.org/10.1007/s00500-021-05913-z","title":"Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem","display_name":"Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem","publication_year":2021,"publication_date":"2021-07-08","ids":{"openalex":"https://openalex.org/W3177843672","doi":"https://doi.org/10.1007/s00500-021-05913-z","mag":"3177843672"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-021-05913-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-021-05913-z","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-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/A5079993297","display_name":"Kavita Singh","orcid":"https://orcid.org/0000-0003-4012-6786"},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Kavita Singh","raw_affiliation_strings":["Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India","institution_ids":["https://openalex.org/I38335241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042284939","display_name":"Shyam Sundar","orcid":"https://orcid.org/0000-0001-9679-0892"},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shyam Sundar","raw_affiliation_strings":["Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India","institution_ids":["https://openalex.org/I38335241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079993297"],"corresponding_institution_ids":["https://openalex.org/I38335241"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.699,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.75971926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"25","issue":"16","first_page":"11289","last_page":"11305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9955999851226807,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9955999851226807,"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.9939000010490417,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9336000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6529927253723145},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6401882767677307},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5672608613967896},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5338462591171265},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5268467664718628},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5209554433822632},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5100098848342896},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.49730756878852844},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.47830134630203247},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45183759927749634},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43476009368896484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36804118752479553},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2533941864967346},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.11560708284378052}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6529927253723145},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6401882767677307},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5672608613967896},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5338462591171265},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5268467664718628},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5209554433822632},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5100098848342896},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.49730756878852844},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.47830134630203247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45183759927749634},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43476009368896484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36804118752479553},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2533941864967346},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.11560708284378052},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00500-021-05913-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-021-05913-z","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5400000214576721}],"awards":[{"id":"https://openalex.org/G7867575742","display_name":null,"funder_award_id":"YSS/2015/000276","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"}],"funders":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W194519168","https://openalex.org/W1480547862","https://openalex.org/W1507484587","https://openalex.org/W1510935138","https://openalex.org/W1511845892","https://openalex.org/W1963583020","https://openalex.org/W1965810411","https://openalex.org/W1970545913","https://openalex.org/W1981011640","https://openalex.org/W1983511657","https://openalex.org/W2003584395","https://openalex.org/W2006938809","https://openalex.org/W2011039300","https://openalex.org/W2015718828","https://openalex.org/W2017927472","https://openalex.org/W2020381385","https://openalex.org/W2024315858","https://openalex.org/W2026551358","https://openalex.org/W2059690430","https://openalex.org/W2072878203","https://openalex.org/W2078614936","https://openalex.org/W2094076493","https://openalex.org/W2100344930","https://openalex.org/W2101775461","https://openalex.org/W2104254980","https://openalex.org/W2114652055","https://openalex.org/W2115831664","https://openalex.org/W2126397829","https://openalex.org/W2140470303","https://openalex.org/W2140606557","https://openalex.org/W2143560894","https://openalex.org/W2148250509","https://openalex.org/W2155882050","https://openalex.org/W2156773695","https://openalex.org/W2159991628","https://openalex.org/W2166775052","https://openalex.org/W2176143254","https://openalex.org/W2287814884","https://openalex.org/W2805528529","https://openalex.org/W2976170045","https://openalex.org/W3046886974","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W3081212354","https://openalex.org/W2109692093","https://openalex.org/W1576317141","https://openalex.org/W3010374802","https://openalex.org/W2020381385","https://openalex.org/W2589768050","https://openalex.org/W2281826919","https://openalex.org/W4239736023"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}