Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem
The bounded diameter minimum spanning tree (BD-MST) problem seeks a spanning tree ( T ) of minimum weight on a given connected, undirected and edge-weighted graph subject to the diameter of T does not exceed D ≥ 2 , where D is a given positive integer. The BD-MST problem is N P -hard problem and fin...
Saved in:
| Published in | Soft computing (Berlin, Germany) Vol. 25; no. 16; pp. 11289 - 11305 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.08.2021
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1432-7643 1433-7479 |
| DOI | 10.1007/s00500-021-05913-z |
Cover
| Abstract | The bounded diameter minimum spanning tree (BD-MST) problem seeks a spanning tree (
T
) of minimum weight on a given connected, undirected and edge-weighted graph subject to the diameter of
T
does not exceed
D
≥
2
, where
D
is a given positive integer. The BD-MST problem is
N
P
-hard problem and finds many real-world applications. In this paper, we propose an artificial bee colony (ABC) algorithm for the BD-MST problem. ABC algorithm is a swarm-based metaheuristic technique based on the intelligent foraging behavior of honeybees. The proposed ABC algorithm employs permutation encoding. To exploit this encoding structure, two neighborhood strategies that help ABC algorithm in faster convergence towards finding high quality solutions are applied. On a set of Euclidean and non-Euclidean benchmark instances for various diameter bounds, the proposed approach has been compared with state-of-the-art approaches. Computational results demonstrate the effectiveness of the proposed approach to the other extant approaches in the literature. |
|---|---|
| AbstractList | The bounded diameter minimum spanning tree (BD-MST) problem seeks a spanning tree (
T
) of minimum weight on a given connected, undirected and edge-weighted graph subject to the diameter of
T
does not exceed
D
≥
2
, where
D
is a given positive integer. The BD-MST problem is
N
P
-hard problem and finds many real-world applications. In this paper, we propose an artificial bee colony (ABC) algorithm for the BD-MST problem. ABC algorithm is a swarm-based metaheuristic technique based on the intelligent foraging behavior of honeybees. The proposed ABC algorithm employs permutation encoding. To exploit this encoding structure, two neighborhood strategies that help ABC algorithm in faster convergence towards finding high quality solutions are applied. On a set of Euclidean and non-Euclidean benchmark instances for various diameter bounds, the proposed approach has been compared with state-of-the-art approaches. Computational results demonstrate the effectiveness of the proposed approach to the other extant approaches in the literature. |
| Author | Singh, Kavita Sundar, Shyam |
| Author_xml | – sequence: 1 givenname: Kavita surname: Singh fullname: Singh, Kavita organization: Department of Computer Applications, National Institute of Technology Raipur – sequence: 2 givenname: Shyam orcidid: 0000-0001-9679-0892 surname: Sundar fullname: Sundar, Shyam email: ssundar.mca@nitrr.ac.in organization: Department of Computer Applications, National Institute of Technology Raipur |
| BookMark | eNp9kM1OwzAQhC1UJNrCC3DyCwTs2GmSY1XxJ1XiAmfLP5vWVWIH2zm0T0_acOLQ065W881qZoFmzjtA6JGSJ0pI-RwJKQjJSE4zUtSUZacbNKecsazkZT277HlWrji7Q4sYD2RUlgWbo591SLax2soWKwCsfevdEct254NN-w4P0bod7iF0Q5LJeofBaW_Ox8YHnPaAlR-cAYONlR0kCLizznZDh2MvnTsrUxit--BVC909um1kG-Hhby7R9-vL1-Y9236-fWzW20znOU0Z46WmNW-MAW2MIlWjC1OsAGqTswY0oaWkSpKcK10pwoySjNecSMWrpq5LtkT55KuDjzFAI_pgOxmOghJxLk1MpYmxCnEpTZxGqPoHaTvFTkHa9jrKJjSOf9wOgjj4Ibgx4jXqF3YtiAw |
| CitedBy_id | crossref_primary_10_1007_s10586_024_04895_5 crossref_primary_10_1108_K_01_2024_0096 crossref_primary_10_1016_j_asoc_2023_110205 crossref_primary_10_1371_journal_pone_0274625 |
| Cites_doi | 10.1007/s10732-008-9080-4 10.1016/j.engappai.2019.103237 10.1007/s10898-009-9430-2 10.1007/s10898-007-9149-x 10.1007/s10462-012-9328-0 10.1002/j.1538-7305.1957.tb01515.x 10.1007/s11263-013-0661-9 10.1145/58564.59295 10.1111/exsy.12610 10.1007/s00500-006-0142-y 10.1002/net.10069 10.1007/s10107-009-0297-2 10.1287/ijoc.2014.0617 10.1016/j.asoc.2008.09.001 10.1016/j.ins.2010.05.001 10.1016/j.swevo.2011.12.002 10.1145/1498698.1498699 10.1016/j.ins.2009.12.025 10.1007/s00500-012-0869-6 10.1109/INDICON.2014.7030575 10.1145/1143997.1144185 10.1109/INFCOM.1993.253399 10.1007/978-981-10-8657-1_44 10.1007/978-3-540-24854-5_122 10.1007/978-3-642-11164-8_12 10.1109/ICPADS.1994.590400 10.1109/SAINT.2008.68 10.1145/1569901.1569939 10.1145/1947940.1948036 10.1007/3-540-46521-9_2 10.1145/952532.952678 10.1007/978-3-642-14834-7_22 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
| Copyright_xml | – notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s00500-021-05913-z |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1433-7479 |
| EndPage | 11305 |
| ExternalDocumentID | 10_1007_s00500_021_05913_z |
| GrantInformation_xml | – fundername: Science and Engineering Research Board grantid: YSS/2015/000276 funderid: http://dx.doi.org/10.13039/501100001843 |
| GroupedDBID | -5B -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 1N0 1SB 203 29~ 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV LAS LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9P PF0 PT4 PT5 QOS R89 R9I RIG RNI ROL RPX RSV RZK S16 S1Z S27 S3B SAP SDH SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Y Z7Z Z81 Z83 Z88 ZMTXR AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO |
| ID | FETCH-LOGICAL-c221t-347c194fddecddb08fc5d56ee9d23fec017a1ba024bc8b03dba34940ab48f9973 |
| IEDL.DBID | U2A |
| ISSN | 1432-7643 |
| IngestDate | Wed Oct 01 03:00:15 EDT 2025 Thu Apr 24 23:08:31 EDT 2025 Fri Feb 21 02:44:05 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 16 |
| Keywords | Neighborhood strategies Artificial bee colony algorithm Swarm intelligence Permutation encoding Bounded-diameter Spanning tree |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c221t-347c194fddecddb08fc5d56ee9d23fec017a1ba024bc8b03dba34940ab48f9973 |
| ORCID | 0000-0001-9679-0892 |
| PageCount | 17 |
| ParticipantIDs | crossref_primary_10_1007_s00500_021_05913_z crossref_citationtrail_10_1007_s00500_021_05913_z springer_journals_10_1007_s00500_021_05913_z |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20210800 2021-08-00 |
| PublicationDateYYYYMMDD | 2021-08-01 |
| PublicationDate_xml | – month: 8 year: 2021 text: 20210800 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationSubtitle | A Fusion of Foundations, Methodologies and Applications |
| PublicationTitle | Soft computing (Berlin, Germany) |
| PublicationTitleAbbrev | Soft Comput |
| PublicationYear | 2021 |
| Publisher | Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin Heidelberg |
| References | Vuppuluri, Patvardhan (CR41) 2021 Anderson, Stenger, Cipolla (CR3) 2014; 110 Patvardhan, Prakash, Srivastav (CR26) 2015; 39 Abdalla, Deo, Gupta (CR1) 2000; 144 CR19 CR17 CR16 CR15 CR14 CR13 Prim (CR29) 1957; 36 CR12 CR33 CR32 Bookstein, Klein (CR6) 1996; 16 CR30 Steitz (CR37) 2015; 27 Julstrom (CR18) 2009 Karaboga, Basturk (CR20) 2007; 39 García, Molina, Lozano, Herrera (CR8) 2009; 15 CR4 Saxena, Singh (CR34) 2009; 2009 CR5 Prakash, Patvardhan, Srivastav (CR28) 2020 Raymond (CR31) 1989; 7 Torkestani (CR40) 2012; 16 CR7 Gouveia, Simonetti, Uchoa (CR11) 2011; 128 CR27 Achuthan, Caccetta, Caccetta, Geelen (CR2) 1994; 10 CR25 Singh (CR35) 2009; 9 Pan, Tasgetiren, Suganthan, Chua (CR23) 2011; 181 CR24 Gouveia, Magnanti (CR10) 2003; 41 Garey, Johnson (CR9) 1979 CR42 Sundar, Singh (CR39) 2012; 4 Karaboga, Gorkemli, Ozturk, Karaboga (CR21) 2014; 42 Sundar, Singh (CR38) 2010; 180 Lucena, Ribeiro, Santos (CR22) 2010; 46 Singh, Gupta (CR36) 2007; 11 A Singh (5913_CR35) 2009; 9 R Anderson (5913_CR3) 2014; 110 R Prim (5913_CR29) 1957; 36 A Bookstein (5913_CR6) 1996; 16 5913_CR42 5913_CR24 5913_CR25 JA Torkestani (5913_CR40) 2012; 16 5913_CR27 K Raymond (5913_CR31) 1989; 7 BA Julstrom (5913_CR18) 2009 QK Pan (5913_CR23) 2011; 181 A Abdalla (5913_CR1) 2000; 144 5913_CR5 A Singh (5913_CR36) 2007; 11 5913_CR4 5913_CR7 D Karaboga (5913_CR20) 2007; 39 MR Garey (5913_CR9) 1979 C Patvardhan (5913_CR26) 2015; 39 PP Vuppuluri (5913_CR41) 2021 VP Prakash (5913_CR28) 2020 NR Achuthan (5913_CR2) 1994; 10 5913_CR30 D Karaboga (5913_CR21) 2014; 42 5913_CR32 S Sundar (5913_CR38) 2010; 180 S García (5913_CR8) 2009; 15 5913_CR33 5913_CR12 5913_CR13 5913_CR14 5913_CR15 A Lucena (5913_CR22) 2010; 46 5913_CR16 L Gouveia (5913_CR11) 2011; 128 5913_CR17 W Steitz (5913_CR37) 2015; 27 5913_CR19 L Gouveia (5913_CR10) 2003; 41 R Saxena (5913_CR34) 2009; 2009 S Sundar (5913_CR39) 2012; 4 |
| References_xml | – volume: 15 start-page: 617 issue: 6 year: 2009 end-page: 644 ident: CR8 article-title: A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cec 2005 special session on real parameter optimization publication-title: J Heuristics doi: 10.1007/s10732-008-9080-4 – volume: 16 start-page: 110 year: 1996 end-page: 118 ident: CR6 article-title: Compression of correlated bit-vectors publication-title: Inf Syst – volume: 2009 start-page: 90 year: 2009 end-page: 95 ident: CR34 article-title: Solving bounded diameter minimum spanning tree problem with improved heuristics publication-title: ADCOM – year: 1979 ident: CR9 publication-title: Computers and intractability: a guide to the theory of NP-completeness – year: 2020 ident: CR28 article-title: A novel hybrid multi-objective evolutionary algorithm for the bi-objective minimum diameter-cost spanning tree (bi-mdcst) problem publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2019.103237 – ident: CR4 – ident: CR14 – ident: CR16 – volume: 46 start-page: 363 issue: 3 year: 2010 end-page: 381 ident: CR22 article-title: A hybrid heuristic for the diameter constrained minimum spanning tree problem publication-title: J Global Optim doi: 10.1007/s10898-009-9430-2 – volume: 39 start-page: 459 year: 2007 end-page: 471 ident: CR20 article-title: A powerful and efficient algorithm for numeric function optimization: artificial bee colony (ABC) algorithm publication-title: J Global Optim doi: 10.1007/s10898-007-9149-x – ident: CR12 – ident: CR30 – volume: 42 start-page: 21 issue: 1 year: 2014 end-page: 57 ident: CR21 article-title: A comprehensive survey: artificial bee colony (ABC) algorithm and applications publication-title: Artif Intell Rev doi: 10.1007/s10462-012-9328-0 – volume: 36 start-page: 1389 year: 1957 end-page: 1401 ident: CR29 article-title: Shortest connection networks and some generalizations publication-title: Bell Syst Tech J doi: 10.1002/j.1538-7305.1957.tb01515.x – ident: CR33 – volume: 144 start-page: 161 year: 2000 end-page: 182 ident: CR1 article-title: Random-tree diameter and the diameter constrained mst publication-title: Cong Numer – volume: 110 start-page: 48 issue: 1 year: 2014 end-page: 57 ident: CR3 article-title: Using bounded diameter minimum spanning trees to build dense active appearance models publication-title: Int J Comput Vis doi: 10.1007/s11263-013-0661-9 – ident: CR25 – ident: CR27 – volume: 7 start-page: 61 year: 1989 end-page: 77 ident: CR31 article-title: A tree-based algorithm for distributed mutual exclusion publication-title: ACM Trans Comput Syst doi: 10.1145/58564.59295 – ident: CR42 – year: 2021 ident: CR41 article-title: Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem publication-title: Expert Syst J Knowl Eng doi: 10.1111/exsy.12610 – ident: CR19 – volume: 11 start-page: 911 issue: 10 year: 2007 end-page: 921 ident: CR36 article-title: Improved heuristics for the bounded-diameter minimum spanning tree problem publication-title: Soft Comput doi: 10.1007/s00500-006-0142-y – volume: 41 start-page: 159 issue: 3 year: 2003 end-page: 173 ident: CR10 article-title: Network flow models for designing diameter-constrained minimum-spanning and steiner trees publication-title: Networks doi: 10.1002/net.10069 – volume: 128 start-page: 123 issue: 1–2 year: 2011 end-page: 148 ident: CR11 article-title: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as steiner tree problems over layered graphs publication-title: Math Program doi: 10.1007/s10107-009-0297-2 – volume: 27 start-page: 151 issue: 1 year: 2015 end-page: 163 ident: CR37 article-title: New heuristic approaches for the bounded-diameter minimum spanning tree problem publication-title: INFORMS J Comput doi: 10.1287/ijoc.2014.0617 – ident: CR15 – ident: CR17 – volume: 9 start-page: 625 issue: 2 year: 2009 end-page: 631 ident: CR35 article-title: An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2008.09.001 – ident: CR13 – volume: 180 start-page: 3182 issue: 17 year: 2010 end-page: 3191 ident: CR38 article-title: A swarm intelligence approach to the quadratic minimum spanning tree problem publication-title: Inf Sci doi: 10.1016/j.ins.2010.05.001 – volume: 4 start-page: 25 year: 2012 end-page: 32 ident: CR39 article-title: A swarm intelligence approach to the early/tardy scheduling problem publication-title: Swarm Evolut Comput doi: 10.1016/j.swevo.2011.12.002 – year: 2009 ident: CR18 article-title: Greedy heuristics for the bounded diameter minimum spanning tree problem publication-title: ACM J Exp Algorithmics. doi doi: 10.1145/1498698.1498699 – ident: CR32 – volume: 39 start-page: 281 issue: 3 year: 2015 end-page: 292 ident: CR26 article-title: Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem publication-title: Inform (Slovenia) – ident: CR5 – volume: 181 start-page: 2455 year: 2011 end-page: 2468 ident: CR23 article-title: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem publication-title: Inf Sci doi: 10.1016/j.ins.2009.12.025 – volume: 10 start-page: 51 year: 1994 end-page: 72 ident: CR2 article-title: Computational methods for the diameter restricted minimum weight spanning tree problem publication-title: Aust J Comb – ident: CR7 – volume: 16 start-page: 1977 issue: 11 year: 2012 end-page: 1988 ident: CR40 article-title: An adaptive heuristic to the bounded-diameter minimum spanning tree problem publication-title: Soft Comput doi: 10.1007/s00500-012-0869-6 – ident: CR24 – volume: 16 start-page: 110 year: 1996 ident: 5913_CR6 publication-title: Inf Syst – ident: 5913_CR25 doi: 10.1109/INDICON.2014.7030575 – volume: 110 start-page: 48 issue: 1 year: 2014 ident: 5913_CR3 publication-title: Int J Comput Vis doi: 10.1007/s11263-013-0661-9 – ident: 5913_CR15 doi: 10.1145/1143997.1144185 – ident: 5913_CR4 doi: 10.1109/INFCOM.1993.253399 – ident: 5913_CR27 doi: 10.1007/978-981-10-8657-1_44 – volume: 41 start-page: 159 issue: 3 year: 2003 ident: 5913_CR10 publication-title: Networks doi: 10.1002/net.10069 – volume: 144 start-page: 161 year: 2000 ident: 5913_CR1 publication-title: Cong Numer – volume: 39 start-page: 459 year: 2007 ident: 5913_CR20 publication-title: J Global Optim doi: 10.1007/s10898-007-9149-x – ident: 5913_CR17 doi: 10.1007/978-3-540-24854-5_122 – ident: 5913_CR16 – ident: 5913_CR24 doi: 10.1007/978-3-642-11164-8_12 – ident: 5913_CR12 – volume: 7 start-page: 61 year: 1989 ident: 5913_CR31 publication-title: ACM Trans Comput Syst doi: 10.1145/58564.59295 – ident: 5913_CR42 doi: 10.1109/ICPADS.1994.590400 – volume: 11 start-page: 911 issue: 10 year: 2007 ident: 5913_CR36 publication-title: Soft Comput doi: 10.1007/s00500-006-0142-y – volume: 2009 start-page: 90 year: 2009 ident: 5913_CR34 publication-title: ADCOM – volume: 16 start-page: 1977 issue: 11 year: 2012 ident: 5913_CR40 publication-title: Soft Comput doi: 10.1007/s00500-012-0869-6 – ident: 5913_CR13 doi: 10.1109/SAINT.2008.68 – year: 2020 ident: 5913_CR28 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2019.103237 – volume: 4 start-page: 25 year: 2012 ident: 5913_CR39 publication-title: Swarm Evolut Comput doi: 10.1016/j.swevo.2011.12.002 – volume: 180 start-page: 3182 issue: 17 year: 2010 ident: 5913_CR38 publication-title: Inf Sci doi: 10.1016/j.ins.2010.05.001 – volume: 46 start-page: 363 issue: 3 year: 2010 ident: 5913_CR22 publication-title: J Global Optim doi: 10.1007/s10898-009-9430-2 – year: 2021 ident: 5913_CR41 publication-title: Expert Syst J Knowl Eng doi: 10.1111/exsy.12610 – ident: 5913_CR14 doi: 10.1145/1569901.1569939 – ident: 5913_CR32 doi: 10.1145/1947940.1948036 – volume: 15 start-page: 617 issue: 6 year: 2009 ident: 5913_CR8 publication-title: J Heuristics doi: 10.1007/s10732-008-9080-4 – volume: 128 start-page: 123 issue: 1–2 year: 2011 ident: 5913_CR11 publication-title: Math Program doi: 10.1007/s10107-009-0297-2 – volume: 181 start-page: 2455 year: 2011 ident: 5913_CR23 publication-title: Inf Sci doi: 10.1016/j.ins.2009.12.025 – ident: 5913_CR19 – volume: 39 start-page: 281 issue: 3 year: 2015 ident: 5913_CR26 publication-title: Inform (Slovenia) – volume: 9 start-page: 625 issue: 2 year: 2009 ident: 5913_CR35 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2008.09.001 – volume: 10 start-page: 51 year: 1994 ident: 5913_CR2 publication-title: Aust J Comb – ident: 5913_CR5 – year: 2009 ident: 5913_CR18 publication-title: ACM J Exp Algorithmics. doi doi: 10.1145/1498698.1498699 – volume: 36 start-page: 1389 year: 1957 ident: 5913_CR29 publication-title: Bell Syst Tech J doi: 10.1002/j.1538-7305.1957.tb01515.x – volume-title: Computers and intractability: a guide to the theory of NP-completeness year: 1979 ident: 5913_CR9 – ident: 5913_CR7 doi: 10.1007/3-540-46521-9_2 – ident: 5913_CR30 doi: 10.1145/952532.952678 – volume: 42 start-page: 21 issue: 1 year: 2014 ident: 5913_CR21 publication-title: Artif Intell Rev doi: 10.1007/s10462-012-9328-0 – ident: 5913_CR33 doi: 10.1007/978-3-642-14834-7_22 – volume: 27 start-page: 151 issue: 1 year: 2015 ident: 5913_CR37 publication-title: INFORMS J Comput doi: 10.1287/ijoc.2014.0617 |
| SSID | ssj0021753 |
| Score | 2.3174648 |
| Snippet | The bounded diameter minimum spanning tree (BD-MST) problem seeks a spanning tree (
T
) of minimum weight on a given connected, undirected and edge-weighted... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 11289 |
| SubjectTerms | Application of Soft Computing Artificial Intelligence Computational Intelligence Control Engineering Mathematical Logic and Foundations Mechatronics Robotics |
| Title | Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem |
| URI | https://link.springer.com/article/10.1007/s00500-021-05913-z |
| Volume | 25 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1433-7479 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: AFBBN dateStart: 19970401 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1433-7479 dateEnd: 20241103 omitProxy: true ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1433-7479 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1433-7479 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: U2A dateStart: 19970404 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05TwJREH5RaLTwQI14kCns9CV7HyUYkGikkgSrzb5jsYAFBQr59c7sviWSGBKrbWZfsXN9b2fmG8buBBqF9izNXUc4HPF_yIWINHdkGAuEz3Go6Yf-6yDoD73nkT8yQ2GLqtu9KkkWkXoz7EZUJRanlgI8wnb5ep_VfaLzQiseOu3NNctwTyIQQOyICdeMyvx9xnY62q6FFimmd8KODDaEdqnMU7an8wY7rvYugHHDBjv8RSJ4xj5JvuSBAKE1EA11_g3pZDzDi__HFKi1fQxzDMGrsu4ORF5JOQsQsQIiQBC0XEkrQGOZUn8MEOPIdDUFjDfFTiOg4jWY7TPnbNjrvj32uVmkwKXj2EvueqG0Yy_DUCaVElaUSV_5gdaxctxMS_TK1BYppmshI2G5SqTEWmOlqMksjkP3gtXyWa4vGeggconCPlA69TIpolBmiAl9hTHfVspuMrv6nok0LOO07GKSbPiRCx0kqIOk0EGybrL7zTvzkmNjp_RDpabE-Ntih_jV_8Sv2YFTmAe1-N2w2vJrpW8RdixFi9XbvU5nQM-n95duq7C6HyBF1J8 |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LT8JAEMc3igf14AM14nMO3nSTdltoeyRGggqcIOHWdB_FAy0ocJBP70zZEkkMifdtD53Zmf92Zn_D2INEpzC-Y7gnpOCo_wMuZWi4UEEkUT5HgaEf-t1eoz3w34b1ob0UNiu73cuSZBGp15fdCFXicGopwFe4Hl_usj0CWBExfyCa62OWZU-iEEDtiAnXXpX5-x2b6WizFlqkmNYJO7LaEJorY56yHZNX2XE5dwHsNqyyw18QwTP2SetXHAiQxgBhqPNvSMajCR78PzKg1vYRTDEEL1Z1dyB4JeUsQMUKqABB0nAlowGdJaP-GCDiSLbIAONNMdMIqHgNdvrMORu0XvrPbW4HKXAlhDvnnh8oN_JTDGVKa-mEqarresOYSAsvNQp3ZeLKBNO1VKF0PC0TotY4CVoyjaLAu2CVfJKbSwamEXqEsG9ok_ipkmGgUtSEdY0x39XarTG3_J6xspRxGnYxjtd85MIGMdogLmwQL2vscf3MdMXY2Lr6qTRTbPfbbMvyq_8tv2f77X63E3dee-_X7EAUrkLtfjesMv9amFuUIHN5V3jcD-aI1Hs |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JT8JQEH5RTIweXFAjrnPwpi90o8uRqAQ34kESbk3fUjSBglgO8uud6RZIjIn36Tt05s187cx8H2NXAoNCO4bmtiUsjvjf40L4mlvSCwTC58DT9EP_ped2-87joDVY2uLPpt3LlmS-00AsTUnanKq4WS2-EW2JwWm8AI8zbb5YZxsOESVgRPetdvXJVfBQIihAHInFt1ib-f2M1dK02hfNyk1nj-0UOBHauWP32ZpO6my31GCA4krW2fYSoeAB-yT7nBMChNZAlNTJN0Sj4WT2kb6PgcbchzDFdDzPe_BARJZUvwDRKyAaBEFCS1oBBs6YZmWA2EfG8zFg7sn0jYAa2VAo0Ryyfuf-7bbLC1EFLi3LTLnteNIMnBjTmlRKGH4sW6rlah0oy461xBsamSLC0i2kLwxbiYgYbIwIvRoHgWcfsVoySfQxA-36NtHZu0pHTiyF78kY8WFLYf43lTIbzCzfZygLxnESvhiFFVdy5oMQfRBmPggXDXZdPTPN-Tb-tL4p3RQWd-_rD_OT_5lfss3Xu074_NB7OmVbVhYpNPl3xmrpbK7PEY2k4iILuB8mjdi3 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Artificial+bee+colony+algorithm+using+permutation+encoding+for+the+bounded+diameter+minimum+spanning+tree+problem&rft.jtitle=Soft+computing+%28Berlin%2C+Germany%29&rft.au=Singh%2C+Kavita&rft.au=Sundar%2C+Shyam&rft.date=2021-08-01&rft.issn=1432-7643&rft.eissn=1433-7479&rft.volume=25&rft.issue=16&rft.spage=11289&rft.epage=11305&rft_id=info:doi/10.1007%2Fs00500-021-05913-z&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00500_021_05913_z |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-7643&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-7643&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-7643&client=summon |