Discrete sparrow search algorithm for symmetric traveling salesman problem
The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. This paper proposes a swarm intelligence approach using a discrete sparrow search algorithm (DSSA) with a global perturbation strategy to solve the problem. Firstly, the initial solutio...
Uloženo v:
| Vydáno v: | Applied soft computing Ročník 118; s. 108469 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.03.2022
|
| Témata: | |
| ISSN: | 1568-4946, 1872-9681 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. This paper proposes a swarm intelligence approach using a discrete sparrow search algorithm (DSSA) with a global perturbation strategy to solve the problem. Firstly, the initial solution in the population is generated by the roulette-wheel selection. Secondly, the order-based decoding method is introduced to complete the update of the sparrow position. Then, the global perturbation mechanism combined with Gaussian mutation and swap operator is adopted to balance exploration and exploitation capability. Finally, the 2-opt local search is integrated to further improve the quality of the solution. Those strategies enhance the solution’s quality and accelerate the convergence. Experiments on 34 TSP benchmark datasets are conducted to investigate the performance of the proposed DSSA. And statistical tests are used to verify the significant differences between the proposed DSSA and other state-of-the-art methods. Results show that the proposed method is more competitive and robust in solving the TSP.
•A discrete sparrow search algorithm with global disturbance is proposed for symmetric traveling salesman problem.•A novel global disturbance strategy, consisting of Gaussian mutation and swap operator.•The proposed method is compared with classical and state-of-the-art algorithms on TSPLIB.•The numerical results and statistical tests show that the proposed algorithm is more competitive and robust. |
|---|---|
| AbstractList | The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. This paper proposes a swarm intelligence approach using a discrete sparrow search algorithm (DSSA) with a global perturbation strategy to solve the problem. Firstly, the initial solution in the population is generated by the roulette-wheel selection. Secondly, the order-based decoding method is introduced to complete the update of the sparrow position. Then, the global perturbation mechanism combined with Gaussian mutation and swap operator is adopted to balance exploration and exploitation capability. Finally, the 2-opt local search is integrated to further improve the quality of the solution. Those strategies enhance the solution’s quality and accelerate the convergence. Experiments on 34 TSP benchmark datasets are conducted to investigate the performance of the proposed DSSA. And statistical tests are used to verify the significant differences between the proposed DSSA and other state-of-the-art methods. Results show that the proposed method is more competitive and robust in solving the TSP.
•A discrete sparrow search algorithm with global disturbance is proposed for symmetric traveling salesman problem.•A novel global disturbance strategy, consisting of Gaussian mutation and swap operator.•The proposed method is compared with classical and state-of-the-art algorithms on TSPLIB.•The numerical results and statistical tests show that the proposed algorithm is more competitive and robust. |
| ArticleNumber | 108469 |
| Author | Han, Yang Zhang, Zhen |
| Author_xml | – sequence: 1 givenname: Zhen orcidid: 0000-0001-6966-0208 surname: Zhang fullname: Zhang, Zhen email: zhangzhen_ta@shu.edu.cn – sequence: 2 givenname: Yang surname: Han fullname: Han, Yang |
| BookMark | eNp9kMtqwzAQRUVpoUnaH-hKP-BUkmVZgm5K-ibQTbsWsjJOFGwrjERK_r4O6aqLrGYYOMO9Z0ouhzgAIXeczTnj6n47dyn6uWBCjActlbkgE65rURil-eW4V0oX0kh1TaYpbdkIGaEn5OMpJI-QgaadQ4w_NIFDv6GuW0cMedPTNiJNh76HjMHTjG4PXRjWNLkOUu8GusPYdNDfkKvWdQlu_-aMfL88fy3eiuXn6_vicVn4krFcmMYY6WtWC9c2Wjq5alVT1rIEI4wCITgYCZVxVVt6MDU4oSvd-IaDqnxblTOiT389xpQQWutDdjnEYcwWOsuZPTqxW3t0Yo9O7MnJiIp_6A5D7_BwHno4QTCW2gdAm3yAwcMqIPhsVzGcw38BJp9-yA |
| CitedBy_id | crossref_primary_10_1016_j_swevo_2025_102013 crossref_primary_10_1038_s41598_025_86298_z crossref_primary_10_3390_math10193647 crossref_primary_10_1016_j_asej_2025_103637 crossref_primary_10_1002_jsfa_13618 crossref_primary_10_1016_j_engappai_2023_106884 crossref_primary_10_3390_math12162521 crossref_primary_10_1007_s10586_024_04620_2 crossref_primary_10_1016_j_jobe_2023_105980 crossref_primary_10_1007_s11227_023_05706_1 crossref_primary_10_1007_s12530_023_09524_x crossref_primary_10_1108_RIA_04_2024_0097 crossref_primary_10_2478_amns_2023_2_00277 crossref_primary_10_3390_app131810490 crossref_primary_10_1007_s13369_024_09369_9 crossref_primary_10_1088_1361_6501_ad56b2 crossref_primary_10_1007_s00500_023_08689_6 crossref_primary_10_1016_j_eswa_2025_126961 crossref_primary_10_1016_j_measurement_2022_112093 crossref_primary_10_1016_j_oceaneng_2024_116949 crossref_primary_10_1007_s00521_024_10475_w crossref_primary_10_1016_j_jare_2025_09_001 crossref_primary_10_1016_j_asoc_2023_110881 crossref_primary_10_3390_biomimetics9020118 crossref_primary_10_3390_a15100377 crossref_primary_10_3390_math10183249 crossref_primary_10_1007_s11831_022_09804_w crossref_primary_10_1016_j_swevo_2025_101887 crossref_primary_10_1063_5_0237486 crossref_primary_10_3390_math12091340 crossref_primary_10_3390_biomimetics10080526 crossref_primary_10_2166_wst_2023_308 crossref_primary_10_3390_ijgi12100429 crossref_primary_10_1007_s11831_023_09887_z crossref_primary_10_1007_s10586_024_04290_0 crossref_primary_10_3390_math11081880 crossref_primary_10_2478_amns_2023_2_01503 crossref_primary_10_1007_s10586_024_04348_z crossref_primary_10_1109_ACCESS_2025_3579248 crossref_primary_10_3390_aerospace10010028 crossref_primary_10_3390_math10111803 crossref_primary_10_1016_j_asoc_2025_112998 crossref_primary_10_1016_j_jksuci_2023_101608 crossref_primary_10_1016_j_measurement_2024_116277 crossref_primary_10_1007_s10836_025_06173_7 crossref_primary_10_1016_j_jksuci_2024_102255 crossref_primary_10_1016_j_compag_2023_108426 crossref_primary_10_3390_agriculture13091710 crossref_primary_10_3390_machines10100847 crossref_primary_10_3390_math11143221 crossref_primary_10_1016_j_ymssp_2024_111270 crossref_primary_10_1038_s41598_024_68315_9 crossref_primary_10_1016_j_asoc_2023_110908 crossref_primary_10_3390_atmos14111612 crossref_primary_10_1016_j_ijpe_2024_109413 crossref_primary_10_1109_ACCESS_2023_3320562 crossref_primary_10_1016_j_asoc_2023_110193 crossref_primary_10_1080_00207721_2023_2293687 crossref_primary_10_3390_app13158600 crossref_primary_10_1016_j_comnet_2023_110077 crossref_primary_10_3390_app142210407 crossref_primary_10_1007_s11356_023_28407_x crossref_primary_10_1016_j_asoc_2022_109943 crossref_primary_10_1109_ACCESS_2022_3205756 |
| Cites_doi | 10.1007/s00521-013-1402-2 10.1016/j.asoc.2018.06.047 10.1016/j.compstruc.2014.03.007 10.1016/j.ijhydene.2020.12.107 10.1016/j.ejor.2019.10.010 10.1007/s11998-016-9844-y 10.1016/j.engappai.2015.10.006 10.1016/j.asoc.2016.12.026 10.1016/j.asoc.2021.107991 10.1016/j.physa.2011.12.004 10.1016/0167-6377(87)90002-2 10.1155/2017/7430125 10.1007/s00521-015-1978-9 10.1016/j.apm.2018.07.044 10.1287/ijoc.3.4.376 10.1016/j.engappai.2014.08.002 10.1007/s11831-020-09429-x 10.1016/j.swevo.2011.02.002 10.1016/j.asoc.2021.107298 10.1016/j.disopt.2005.10.002 10.1016/j.swevo.2019.04.002 10.1016/j.asoc.2021.107085 10.1016/j.neucom.2015.08.041 10.1016/0377-2217(92)90138-Y 10.1007/s13369-017-2663-3 10.1016/j.asoc.2019.105887 10.1007/s10462-020-09869-8 10.1016/j.eswa.2017.01.053 10.1016/j.ins.2017.08.067 10.1016/j.measurement.2021.109375 10.3390/s19081837 10.1002/j.1538-7305.1965.tb04146.x 10.1057/jors.1980.188 10.1016/j.cor.2019.104850 10.2307/2582681 10.1016/j.ijpe.2019.107598 10.1023/A:1006529012972 10.1016/j.ejor.2018.02.056 10.1016/j.advengsoft.2013.12.007 10.1016/j.knosys.2021.106924 10.1016/j.asoc.2021.107275 10.3233/ICA-160536 10.1016/j.neucom.2018.05.079 10.1016/j.asoc.2011.01.039 10.1016/j.eswa.2021.114639 10.1016/j.asoc.2020.106720 10.1016/j.swevo.2018.02.017 10.1016/j.asoc.2021.107349 10.1016/j.asoc.2016.02.021 10.1016/j.asoc.2021.108024 10.1016/j.asoc.2018.03.048 10.1016/j.swevo.2019.100607 10.1016/j.swevo.2018.05.006 10.1016/j.cie.2014.01.015 10.1109/ACCESS.2019.2945570 10.1016/j.eswa.2017.06.007 10.1145/290179.290180 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier B.V. |
| Copyright_xml | – notice: 2022 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.asoc.2022.108469 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-9681 |
| ExternalDocumentID | 10_1016_j_asoc_2022_108469 S1568494622000321 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 53G 5GY 5VS 6J9 7-5 71M 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSV SSZ T5K UHS UNMZH ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-9b994c7072afb84a4df6b3743e9296e221e94e59a5f3ce97ea2858bcb1e65cf53 |
| ISICitedReferencesCount | 66 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000791538500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1568-4946 |
| IngestDate | Sat Nov 29 07:02:28 EST 2025 Tue Nov 18 20:00:29 EST 2025 Fri Feb 23 02:40:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | TSP Swarm intelligence Sparrow search algorithm Global perturbation 2-opt |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-9b994c7072afb84a4df6b3743e9296e221e94e59a5f3ce97ea2858bcb1e65cf53 |
| ORCID | 0000-0001-6966-0208 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_asoc_2022_108469 crossref_primary_10_1016_j_asoc_2022_108469 elsevier_sciencedirect_doi_10_1016_j_asoc_2022_108469 |
| PublicationCentury | 2000 |
| PublicationDate | March 2022 2022-03-00 |
| PublicationDateYYYYMMDD | 2022-03-01 |
| PublicationDate_xml | – month: 03 year: 2022 text: March 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Applied soft computing |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Padberg, Rinaldi (b10) 1987; 6 Ali, Essam, Kasmarik (b51) 2020; 52 Panwar, Deep (b58) 2021; 105 Zhou, Gao, Yang, Gui (b15) 2016; 173 Vidal, Laporte, Matl (b40) 2020; 286 Nguyen, Qiao, Pan, Chu, Chang, Xue, Dao (b26) 2020; 38 Faigl (b29) 2018; 312 Baş, Ülker (b38) 2021; 54 Larrañaga, Kuijpers, Murga, Inza, Dizdarevic (b65) 1999; 13 Yang (b22) 2010 Bellman, Dreyfus (b13) 2015 Wang, Cai, Lin, Zhong (b21) 2019; 7 Umbarkar, Sheth (b48) 2015 Şahman (b2) 2021; 106 Ammari, Belatrache, Touhami, Makhloufi (b4) 2021 Shin, Nguyen, Park, Shin, Lee (b41) 2017; 14 Abed-alguni, Alkhateeb (b31) 2017; 42 Xue, Shen (b33) 2020; 8 Akhand, Ayon, Shahriyar, Siddique, Adeli (b63) 2020; 86 Hore, Chatterjee, Dewanji (b45) 2018; 68 Laporte (b14) 1992; 59 Kora, Yadlapalli (b47) 2017; 162 Karaboga (b23) 2005 Arora (b7) 1998; 45 Saji, Riffi (b27) 2016; 27 Tripathy, Biswas, Pal (b50) 2021 Cortés, Gómez-Montoya, Muñuzuri, Correa-Espinal (b69) 2017; 53 Zhang, Ding (b34) 2021; 220 Kitjacharoenchai, Min, Lee (b39) 2020; 225 Hussain, Muhammad, Nauman Sajid, Hussain, Mohamd Shoukry, Gani (b49) 2017; 2017 Reinelt (b71) 1991; 3 Geng, Chen, Yang, Shi, Zhao (b44) 2011; 11 Mirjalili, Mirjalili, Lewis (b24) 2014; 69 Ezugwu, Adewumi, Frîncu (b32) 2017; 77 Lin (b68) 1965; 44 Eldem, Ülker (b17) 2017; 20 Derrac, García, Molina, Herrera (b73) 2011; 1 Huang, Shen, You (b60) 2021; 102 Osaba, Yang, Diaz, Lopez-Garcia, Carballedo (b28) 2016; 48 Dahan, el Hindi, Mathkour, Alsalman (b18) 2019; 19 Cinar, Korkmaz, Kiran (b62) 2020; 23 Saji, Barkatou (b8) 2021; 172 Gunduz, Aslan (b59) 2021; 105 Tuani, Keedwell, Collett (b53) 2020; 97 Ergun, Orlin (b12) 2006; 3 Osaba, del Ser, Sadollah, Bilbao, Camacho (b57) 2018; 71 Tang, Li, Luo, Liu (b19) 2015; 37 Cheng, Prayogo (b25) 2014; 139 Zhong, Lin, Wang, Zhang (b55) 2018; 42 Tuani, Keedwell, Collett (b52) 2018 Ouaarab, Ahiod, Yang (b6) 2014; 24 Wang (b20) 2014; 70 Osaba, Yang, Diaz, Lopez-Garcia, Carballedo (b56) 2016; 48 Yu, You, Liu (b54) 2021; 113 Lipowski, Lipowska (b66) 2012; 391 Patel, Raja (b3) 2021; 28 Luo, Chen, zhang, Xu, Huang, Zhao (b67) 2018; 64 Zhu, Yousefi (b35) 2021; 46 Matai, Singh, Lal (b43) 2010 Alexandridis, Paizis, Chondrodima, Stogiannos (b42) 2017; 24 Lawler, Lenstra, Kan, Shmoys (b5) 1986; 37 Zhong, Lin, Wang, Zhang (b30) 2017; 421 Zhong, Wang, Lin, Zhang (b64) 2019; 48 Li, Shao, Qian (b72) 2002; 22 Reinelt (b11) 1994 Ezugwu, Adewumi (b16) 2017; 87 Zhang, He, Yang (b36) 2021 Mostafaie, Modarres Khiyabani, Navimipour (b1) 2020; 120 Laporte, Nobert (b9) 1980; 31 Xing, Yi, Lin, Zhou (b37) 2021; 178 Khan, Maiti (b61) 2019; 44 Hintsch, Irnich (b70) 2018; 270 Wang, Ersoy, He, Wang (b46) 2016; 43 Karaboga (10.1016/j.asoc.2022.108469_b23) 2005 Tuani (10.1016/j.asoc.2022.108469_b52) 2018 Akhand (10.1016/j.asoc.2022.108469_b63) 2020; 86 Ali (10.1016/j.asoc.2022.108469_b51) 2020; 52 Cortés (10.1016/j.asoc.2022.108469_b69) 2017; 53 Abed-alguni (10.1016/j.asoc.2022.108469_b31) 2017; 42 Wang (10.1016/j.asoc.2022.108469_b20) 2014; 70 Eldem (10.1016/j.asoc.2022.108469_b17) 2017; 20 Vidal (10.1016/j.asoc.2022.108469_b40) 2020; 286 Hintsch (10.1016/j.asoc.2022.108469_b70) 2018; 270 Zhu (10.1016/j.asoc.2022.108469_b35) 2021; 46 Mirjalili (10.1016/j.asoc.2022.108469_b24) 2014; 69 Lin (10.1016/j.asoc.2022.108469_b68) 1965; 44 Gunduz (10.1016/j.asoc.2022.108469_b59) 2021; 105 Zhang (10.1016/j.asoc.2022.108469_b36) 2021 Saji (10.1016/j.asoc.2022.108469_b27) 2016; 27 Tuani (10.1016/j.asoc.2022.108469_b53) 2020; 97 Kitjacharoenchai (10.1016/j.asoc.2022.108469_b39) 2020; 225 Saji (10.1016/j.asoc.2022.108469_b8) 2021; 172 Baş (10.1016/j.asoc.2022.108469_b38) 2021; 54 Zhong (10.1016/j.asoc.2022.108469_b64) 2019; 48 Ammari (10.1016/j.asoc.2022.108469_b4) 2021 Osaba (10.1016/j.asoc.2022.108469_b56) 2016; 48 Mostafaie (10.1016/j.asoc.2022.108469_b1) 2020; 120 Shin (10.1016/j.asoc.2022.108469_b41) 2017; 14 Lipowski (10.1016/j.asoc.2022.108469_b66) 2012; 391 Derrac (10.1016/j.asoc.2022.108469_b73) 2011; 1 Geng (10.1016/j.asoc.2022.108469_b44) 2011; 11 Wang (10.1016/j.asoc.2022.108469_b21) 2019; 7 Zhong (10.1016/j.asoc.2022.108469_b55) 2018; 42 Şahman (10.1016/j.asoc.2022.108469_b2) 2021; 106 Dahan (10.1016/j.asoc.2022.108469_b18) 2019; 19 Alexandridis (10.1016/j.asoc.2022.108469_b42) 2017; 24 Yang (10.1016/j.asoc.2022.108469_b22) 2010 Khan (10.1016/j.asoc.2022.108469_b61) 2019; 44 Zhong (10.1016/j.asoc.2022.108469_b30) 2017; 421 Ergun (10.1016/j.asoc.2022.108469_b12) 2006; 3 Larrañaga (10.1016/j.asoc.2022.108469_b65) 1999; 13 Xue (10.1016/j.asoc.2022.108469_b33) 2020; 8 Yu (10.1016/j.asoc.2022.108469_b54) 2021; 113 Luo (10.1016/j.asoc.2022.108469_b67) 2018; 64 Ouaarab (10.1016/j.asoc.2022.108469_b6) 2014; 24 Reinelt (10.1016/j.asoc.2022.108469_b11) 1994 Tripathy (10.1016/j.asoc.2022.108469_b50) 2021 Hussain (10.1016/j.asoc.2022.108469_b49) 2017; 2017 Laporte (10.1016/j.asoc.2022.108469_b9) 1980; 31 Matai (10.1016/j.asoc.2022.108469_b43) 2010 Panwar (10.1016/j.asoc.2022.108469_b58) 2021; 105 Cinar (10.1016/j.asoc.2022.108469_b62) 2020; 23 Laporte (10.1016/j.asoc.2022.108469_b14) 1992; 59 Osaba (10.1016/j.asoc.2022.108469_b28) 2016; 48 Osaba (10.1016/j.asoc.2022.108469_b57) 2018; 71 Tang (10.1016/j.asoc.2022.108469_b19) 2015; 37 Zhou (10.1016/j.asoc.2022.108469_b15) 2016; 173 Patel (10.1016/j.asoc.2022.108469_b3) 2021; 28 Hore (10.1016/j.asoc.2022.108469_b45) 2018; 68 Reinelt (10.1016/j.asoc.2022.108469_b71) 1991; 3 Li (10.1016/j.asoc.2022.108469_b72) 2002; 22 Arora (10.1016/j.asoc.2022.108469_b7) 1998; 45 Zhang (10.1016/j.asoc.2022.108469_b34) 2021; 220 Wang (10.1016/j.asoc.2022.108469_b46) 2016; 43 Kora (10.1016/j.asoc.2022.108469_b47) 2017; 162 Lawler (10.1016/j.asoc.2022.108469_b5) 1986; 37 Huang (10.1016/j.asoc.2022.108469_b60) 2021; 102 Cheng (10.1016/j.asoc.2022.108469_b25) 2014; 139 Ezugwu (10.1016/j.asoc.2022.108469_b16) 2017; 87 Ezugwu (10.1016/j.asoc.2022.108469_b32) 2017; 77 Padberg (10.1016/j.asoc.2022.108469_b10) 1987; 6 Nguyen (10.1016/j.asoc.2022.108469_b26) 2020; 38 Faigl (10.1016/j.asoc.2022.108469_b29) 2018; 312 Bellman (10.1016/j.asoc.2022.108469_b13) 2015 Umbarkar (10.1016/j.asoc.2022.108469_b48) 2015 Xing (10.1016/j.asoc.2022.108469_b37) 2021; 178 |
| References_xml | – volume: 37 start-page: 9 year: 2015 end-page: 19 ident: b19 article-title: Multi-strategy adaptive particle swarm optimization for numerical optimization publication-title: Eng. Appl. Artif. Intell. – volume: 48 start-page: 134 year: 2019 end-page: 144 ident: b64 article-title: Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem publication-title: Swarm Evol. Comput. – volume: 3 start-page: 78 year: 2006 end-page: 85 ident: b12 article-title: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem publication-title: Discrete Optim. – volume: 59 start-page: 231 year: 1992 end-page: 247 ident: b14 article-title: The traveling salesman problem: An overview of exact and approximate algorithms publication-title: European J. Oper. Res. – volume: 71 start-page: 277 year: 2018 end-page: 290 ident: b57 article-title: A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem publication-title: Appl. Soft Comput. – year: 2018 ident: b52 article-title: H-ACO: A Heterogeneous Ant Colony Optimisation Approach with Application to the Travelling Salesman Problem – volume: 312 start-page: 120 year: 2018 end-page: 134 ident: b29 article-title: GSOA: Growing Self-Organizing Array - Unsupervised learning for the Close-Enough Traveling Salesman Problem and other routing problems publication-title: Neurocomputing – volume: 52 year: 2020 ident: b51 article-title: A novel design of differential evolution for solving discrete traveling salesman problems publication-title: Swarm Evol. Comput. – year: 2021 ident: b50 article-title: A multi-objective covering salesman problem with 2-coverage publication-title: Appl. Soft Comput. – year: 2010 ident: b43 article-title: Traveling salesman problem: an overview of applications, formulations, and solution approaches publication-title: Traveling Salesman Problem, Theory and Applications – volume: 173 start-page: 864 year: 2016 end-page: 874 ident: b15 article-title: Discrete state transition algorithm for unconstrained integer optimization problems publication-title: Neurocomputing – volume: 70 start-page: 124 year: 2014 end-page: 133 ident: b20 article-title: The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem publication-title: Comput. Ind. Eng. – start-page: 65 year: 2010 end-page: 74 ident: b22 article-title: A new metaheuristic bat-inspired algorithm publication-title: Nature Inspired Cooperative Strategies for Optimization (NICSO 2010) – volume: 270 start-page: 118 year: 2018 end-page: 131 ident: b70 article-title: Large multiple neighborhood search for the clustered vehicle-routing problem publication-title: European J. Oper. Res. – volume: 87 start-page: 70 year: 2017 end-page: 78 ident: b16 article-title: Discrete symbiotic organisms search algorithm for travelling salesman problem publication-title: Expert Syst. Appl. – volume: 38 start-page: 5811 year: 2020 end-page: 5820 ident: b26 article-title: A hybridized parallel bats algorithm for combinatorial problem of traveling salesman publication-title: J. Intell. Fuzzy Systems – year: 2015 ident: b13 article-title: Applied Dynamic Programming – volume: 113 year: 2021 ident: b54 article-title: A heterogeneous guided ant colony algorithm based on space explosion and long–short memory publication-title: Appl. Soft Comput. – volume: 24 start-page: 1659 year: 2014 end-page: 1669 ident: b6 article-title: Discrete cuckoo search algorithm for the travelling salesman problem publication-title: Neural Comput. Appl. – volume: 8 year: 2020 ident: b33 article-title: A novel swarm intelligence optimization approach: sparrow search algorithm publication-title: Syst. Sci. Control Eng. – volume: 68 start-page: 83 year: 2018 end-page: 91 ident: b45 article-title: Improving variable neighborhood search to solve the traveling salesman problem publication-title: Appl. Soft Comput. – volume: 11 start-page: 3680 year: 2011 end-page: 3689 ident: b44 article-title: Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search publication-title: Appl. Soft Comput. – volume: 6 start-page: 1 year: 1987 end-page: 7 ident: b10 article-title: Optimization of a 532-city symmetric traveling salesman problem by branch and cut publication-title: Oper. Res. Lett. – volume: 105 year: 2021 ident: b58 article-title: Discrete Grey Wolf Optimizer for symmetric travelling salesman problem publication-title: Appl. Soft Comput. – volume: 64 year: 2018 ident: b67 article-title: An improved grasshopper optimization algorithm with application to financial stress prediction publication-title: Appl. Math. Model. – volume: 421 start-page: 70 year: 2017 end-page: 84 ident: b30 article-title: Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem publication-title: Inform. Sci. – volume: 225 year: 2020 ident: b39 article-title: Two echelon vehicle routing problem with drones in last mile delivery publication-title: Int. J. Prod. Econ. – volume: 27 start-page: 1853 year: 2016 end-page: 1866 ident: b27 article-title: A novel discrete bat algorithm for solving the travelling salesman problem publication-title: Neural Comput. Appl. – volume: 37 start-page: 535 year: 1986 end-page: 536 ident: b5 article-title: The traveling salesman problem: A guided tour of combinatorial optimization publication-title: J. Oper. Res. Soc. – volume: 2017 year: 2017 ident: b49 article-title: Genetic algorithm for traveling salesman problem with modified cycle crossover operator publication-title: Comput. Intell. Neurosci. – volume: 19 year: 2019 ident: b18 article-title: Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem publication-title: Sensors (Switzerland) – volume: 178 year: 2021 ident: b37 article-title: Multi-component fault diagnosis of wheelset-bearing using shift-invariant impulsive dictionary matching pursuit and sparrow search algorithm publication-title: Measurement – volume: 42 start-page: 3635 year: 2017 end-page: 3654 ident: b31 article-title: Novel selection schemes for cuckoo search publication-title: Arab. J. Sci. Eng. – volume: 97 year: 2020 ident: b53 article-title: Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem publication-title: Appl. Soft Comput. – volume: 44 start-page: 428 year: 2019 end-page: 438 ident: b61 article-title: A swap sequence based Artificial Bee Colony algorithm for Traveling Salesman Problem publication-title: Swarm Evol. Comput. – volume: 172 year: 2021 ident: b8 article-title: A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem publication-title: Expert Syst. Appl. – volume: 53 start-page: 61 year: 2017 end-page: 73 ident: b69 article-title: A tabu search approach to solving the picking routing problem for large- and medium-size distribution centres considering the availability of inventory and K heterogeneous material handling equipment publication-title: Appl. Soft Comput. – volume: 220 year: 2021 ident: b34 article-title: A stochastic configuration network based on chaotic sparrow search algorithm publication-title: Knowl.-Based Syst. – volume: 120 year: 2020 ident: b1 article-title: A systematic study on meta-heuristic approaches for solving the graph coloring problem publication-title: Comput. Oper. Res. – volume: 28 start-page: 1545 year: 2021 end-page: 1559 ident: b3 article-title: Comparative performance of recent advanced optimization algorithms for minimum energy requirement solutions in water pump switching network publication-title: Arch. Comput. Methods Eng. – volume: 102 year: 2021 ident: b60 article-title: A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem publication-title: Appl. Soft Comput. – volume: 42 start-page: 77 year: 2018 end-page: 88 ident: b55 article-title: Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem publication-title: Swarm Evol. Comput. – volume: 106 year: 2021 ident: b2 article-title: A discrete spotted hyena optimizer for solving distributed job shop scheduling problems publication-title: Appl. Soft Comput. – volume: 7 start-page: 144366 year: 2019 end-page: 144380 ident: b21 article-title: Enhanced list-based simulated annealing algorithm for large-scale traveling salesman problem publication-title: IEEE Access – volume: 105 year: 2021 ident: b59 article-title: DJAYA: A discrete jaya algorithm for solving traveling salesman problem publication-title: Appl. Soft Comput. – volume: 24 year: 2017 ident: b42 article-title: A particle swarm optimization approach in printed circuit board thermal design publication-title: Integr. Comput.-Aided Eng. – volume: 48 start-page: 59 year: 2016 end-page: 71 ident: b28 article-title: An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems publication-title: Eng. Appl. Artif. Intell. – year: 2021 ident: b36 article-title: A bioinspired path planning approach for mobile robot based on improved sparrow search algorithm publication-title: Adv. Manuf. – volume: 86 year: 2020 ident: b63 article-title: Discrete spider monkey optimization for travelling salesman problem publication-title: Appl. Soft Comput. – year: 1994 ident: b11 article-title: The Traveling Salesman Computational Solutions for TSP Applications – volume: 1 start-page: 3 year: 2011 end-page: 18 ident: b73 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evol. Comput. – volume: 31 start-page: 1017 year: 1980 end-page: 1023 ident: b9 article-title: A cutting planes algorithm for the m-salesmen problem publication-title: J. Oper. Res. Soc. – year: 2021 ident: b4 article-title: Sizing, optimization, control and energy management of hybrid renewable energy system- a review publication-title: Energy Built Environ. – volume: 286 start-page: 401 year: 2020 end-page: 416 ident: b40 article-title: A concise guide to existing and emerging vehicle routing problem variants publication-title: European J. Oper. Res. – start-page: 1 year: 2015 ident: b48 article-title: Crossover operators in genetic algorithms: A review publication-title: ICTACT J. Soft Comput. – year: 2005 ident: b23 article-title: An Idea Based on Honey Bee Swarm for Numerical Optimization – volume: 3 year: 1991 ident: b71 article-title: TSPLIB. A traveling salesman problem library publication-title: ORSA J. Comput. – volume: 139 start-page: 98 year: 2014 end-page: 112 ident: b25 article-title: Symbiotic Organisms Search: A new metaheuristic optimization algorithm publication-title: Comput. Struct. – volume: 54 start-page: 1063 year: 2021 end-page: 1085 ident: b38 article-title: Dıscrete socıal spıder algorıthm for the travelıng salesman problem publication-title: Artif. Intell. Rev. – volume: 20 start-page: 1242 year: 2017 end-page: 1248 ident: b17 article-title: The application of ant colony optimization in the solution of 3D traveling salesman problem on a sphere publication-title: Eng. Sci. Technol. Int. J. – volume: 162 year: 2017 ident: b47 article-title: Crossover operators in genetic algorithms: A review publication-title: Int. J. Comput. Appl. – volume: 44 year: 1965 ident: b68 article-title: Computer solutions of the traveling salesman problem publication-title: Bell Syst. Tech. J. – volume: 23 start-page: 879 year: 2020 end-page: 890 ident: b62 article-title: A discrete tree-seed algorithm for solving symmetric traveling salesman problem publication-title: Eng. Sci. Technol. Int. J. – volume: 391 year: 2012 ident: b66 article-title: Roulette-wheel selection via stochastic acceptance publication-title: Physica A – volume: 77 start-page: 189 year: 2017 end-page: 210 ident: b32 article-title: Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem publication-title: Expert Syst. Appl. – volume: 22 year: 2002 ident: b72 article-title: Optimizing method based on autonomous animats: Fish-swarm algorithm publication-title: Xitong Gongcheng Lilun Yu Shijian/Syst. Eng. Theory Pract. – volume: 69 start-page: 46 year: 2014 end-page: 61 ident: b24 article-title: Grey wolf optimizer publication-title: Adv. Eng. Softw. – volume: 14 year: 2017 ident: b41 article-title: Roll-to-roll gravure printing of thick-film silver electrode micropatterns for flexible printed circuit board publication-title: J. Coat. Technol. Res. – volume: 45 start-page: 753 year: 1998 end-page: 782 ident: b7 article-title: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems publication-title: J. ACM – volume: 13 year: 1999 ident: b65 article-title: Genetic algorithms for the travelling salesman problem: A review of representations and operators publication-title: Artif. Intell. Rev. – volume: 48 start-page: 59 year: 2016 end-page: 71 ident: b56 article-title: An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems publication-title: Eng. Appl. Artif. Intell. – volume: 43 year: 2016 ident: b46 article-title: Multi-offspring genetic algorithm and its application to the traveling salesman problem publication-title: Appl. Soft Comput. – volume: 46 year: 2021 ident: b35 article-title: Optimal parameter identification of PEMFC stacks using Adaptive Sparrow Search Algorithm publication-title: Int. J. Hydrogen Energy – volume: 24 start-page: 1659 year: 2014 ident: 10.1016/j.asoc.2022.108469_b6 article-title: Discrete cuckoo search algorithm for the travelling salesman problem publication-title: Neural Comput. Appl. doi: 10.1007/s00521-013-1402-2 – volume: 20 start-page: 1242 year: 2017 ident: 10.1016/j.asoc.2022.108469_b17 article-title: The application of ant colony optimization in the solution of 3D traveling salesman problem on a sphere publication-title: Eng. Sci. Technol. Int. J. – volume: 71 start-page: 277 year: 2018 ident: 10.1016/j.asoc.2022.108469_b57 article-title: A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2018.06.047 – volume: 139 start-page: 98 year: 2014 ident: 10.1016/j.asoc.2022.108469_b25 article-title: Symbiotic Organisms Search: A new metaheuristic optimization algorithm publication-title: Comput. Struct. doi: 10.1016/j.compstruc.2014.03.007 – year: 2021 ident: 10.1016/j.asoc.2022.108469_b36 article-title: A bioinspired path planning approach for mobile robot based on improved sparrow search algorithm publication-title: Adv. Manuf. – volume: 46 year: 2021 ident: 10.1016/j.asoc.2022.108469_b35 article-title: Optimal parameter identification of PEMFC stacks using Adaptive Sparrow Search Algorithm publication-title: Int. J. Hydrogen Energy doi: 10.1016/j.ijhydene.2020.12.107 – volume: 286 start-page: 401 year: 2020 ident: 10.1016/j.asoc.2022.108469_b40 article-title: A concise guide to existing and emerging vehicle routing problem variants publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2019.10.010 – volume: 14 year: 2017 ident: 10.1016/j.asoc.2022.108469_b41 article-title: Roll-to-roll gravure printing of thick-film silver electrode micropatterns for flexible printed circuit board publication-title: J. Coat. Technol. Res. doi: 10.1007/s11998-016-9844-y – volume: 48 start-page: 59 year: 2016 ident: 10.1016/j.asoc.2022.108469_b28 article-title: An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2015.10.006 – volume: 53 start-page: 61 year: 2017 ident: 10.1016/j.asoc.2022.108469_b69 article-title: A tabu search approach to solving the picking routing problem for large- and medium-size distribution centres considering the availability of inventory and K heterogeneous material handling equipment publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2016.12.026 – volume: 113 year: 2021 ident: 10.1016/j.asoc.2022.108469_b54 article-title: A heterogeneous guided ant colony algorithm based on space explosion and long–short memory publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2021.107991 – volume: 391 year: 2012 ident: 10.1016/j.asoc.2022.108469_b66 article-title: Roulette-wheel selection via stochastic acceptance publication-title: Physica A doi: 10.1016/j.physa.2011.12.004 – volume: 6 start-page: 1 year: 1987 ident: 10.1016/j.asoc.2022.108469_b10 article-title: Optimization of a 532-city symmetric traveling salesman problem by branch and cut publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(87)90002-2 – year: 2018 ident: 10.1016/j.asoc.2022.108469_b52 – volume: 2017 year: 2017 ident: 10.1016/j.asoc.2022.108469_b49 article-title: Genetic algorithm for traveling salesman problem with modified cycle crossover operator publication-title: Comput. Intell. Neurosci. doi: 10.1155/2017/7430125 – volume: 27 start-page: 1853 year: 2016 ident: 10.1016/j.asoc.2022.108469_b27 article-title: A novel discrete bat algorithm for solving the travelling salesman problem publication-title: Neural Comput. Appl. doi: 10.1007/s00521-015-1978-9 – volume: 64 year: 2018 ident: 10.1016/j.asoc.2022.108469_b67 article-title: An improved grasshopper optimization algorithm with application to financial stress prediction publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2018.07.044 – volume: 38 start-page: 5811 year: 2020 ident: 10.1016/j.asoc.2022.108469_b26 article-title: A hybridized parallel bats algorithm for combinatorial problem of traveling salesman publication-title: J. Intell. Fuzzy Systems – volume: 3 year: 1991 ident: 10.1016/j.asoc.2022.108469_b71 article-title: TSPLIB. A traveling salesman problem library publication-title: ORSA J. Comput. doi: 10.1287/ijoc.3.4.376 – volume: 37 start-page: 9 year: 2015 ident: 10.1016/j.asoc.2022.108469_b19 article-title: Multi-strategy adaptive particle swarm optimization for numerical optimization publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2014.08.002 – volume: 28 start-page: 1545 year: 2021 ident: 10.1016/j.asoc.2022.108469_b3 article-title: Comparative performance of recent advanced optimization algorithms for minimum energy requirement solutions in water pump switching network publication-title: Arch. Comput. Methods Eng. doi: 10.1007/s11831-020-09429-x – volume: 1 start-page: 3 year: 2011 ident: 10.1016/j.asoc.2022.108469_b73 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2011.02.002 – start-page: 65 year: 2010 ident: 10.1016/j.asoc.2022.108469_b22 article-title: A new metaheuristic bat-inspired algorithm – volume: 105 year: 2021 ident: 10.1016/j.asoc.2022.108469_b58 article-title: Discrete Grey Wolf Optimizer for symmetric travelling salesman problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2021.107298 – volume: 3 start-page: 78 year: 2006 ident: 10.1016/j.asoc.2022.108469_b12 article-title: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem publication-title: Discrete Optim. doi: 10.1016/j.disopt.2005.10.002 – volume: 48 start-page: 134 year: 2019 ident: 10.1016/j.asoc.2022.108469_b64 article-title: Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2019.04.002 – volume: 102 year: 2021 ident: 10.1016/j.asoc.2022.108469_b60 article-title: A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2021.107085 – year: 2015 ident: 10.1016/j.asoc.2022.108469_b13 – volume: 173 start-page: 864 year: 2016 ident: 10.1016/j.asoc.2022.108469_b15 article-title: Discrete state transition algorithm for unconstrained integer optimization problems publication-title: Neurocomputing doi: 10.1016/j.neucom.2015.08.041 – volume: 59 start-page: 231 year: 1992 ident: 10.1016/j.asoc.2022.108469_b14 article-title: The traveling salesman problem: An overview of exact and approximate algorithms publication-title: European J. Oper. Res. doi: 10.1016/0377-2217(92)90138-Y – volume: 8 year: 2020 ident: 10.1016/j.asoc.2022.108469_b33 article-title: A novel swarm intelligence optimization approach: sparrow search algorithm publication-title: Syst. Sci. Control Eng. – year: 2010 ident: 10.1016/j.asoc.2022.108469_b43 article-title: Traveling salesman problem: an overview of applications, formulations, and solution approaches – volume: 42 start-page: 3635 year: 2017 ident: 10.1016/j.asoc.2022.108469_b31 article-title: Novel selection schemes for cuckoo search publication-title: Arab. J. Sci. Eng. doi: 10.1007/s13369-017-2663-3 – volume: 86 year: 2020 ident: 10.1016/j.asoc.2022.108469_b63 article-title: Discrete spider monkey optimization for travelling salesman problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2019.105887 – volume: 54 start-page: 1063 year: 2021 ident: 10.1016/j.asoc.2022.108469_b38 article-title: Dıscrete socıal spıder algorıthm for the travelıng salesman problem publication-title: Artif. Intell. Rev. doi: 10.1007/s10462-020-09869-8 – volume: 77 start-page: 189 year: 2017 ident: 10.1016/j.asoc.2022.108469_b32 article-title: Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2017.01.053 – volume: 23 start-page: 879 year: 2020 ident: 10.1016/j.asoc.2022.108469_b62 article-title: A discrete tree-seed algorithm for solving symmetric traveling salesman problem publication-title: Eng. Sci. Technol. Int. J. – volume: 421 start-page: 70 year: 2017 ident: 10.1016/j.asoc.2022.108469_b30 article-title: Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem publication-title: Inform. Sci. doi: 10.1016/j.ins.2017.08.067 – volume: 178 year: 2021 ident: 10.1016/j.asoc.2022.108469_b37 article-title: Multi-component fault diagnosis of wheelset-bearing using shift-invariant impulsive dictionary matching pursuit and sparrow search algorithm publication-title: Measurement doi: 10.1016/j.measurement.2021.109375 – volume: 19 year: 2019 ident: 10.1016/j.asoc.2022.108469_b18 article-title: Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem publication-title: Sensors (Switzerland) doi: 10.3390/s19081837 – volume: 44 year: 1965 ident: 10.1016/j.asoc.2022.108469_b68 article-title: Computer solutions of the traveling salesman problem publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1965.tb04146.x – volume: 31 start-page: 1017 year: 1980 ident: 10.1016/j.asoc.2022.108469_b9 article-title: A cutting planes algorithm for the m-salesmen problem publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1980.188 – volume: 162 year: 2017 ident: 10.1016/j.asoc.2022.108469_b47 article-title: Crossover operators in genetic algorithms: A review publication-title: Int. J. Comput. Appl. – volume: 120 year: 2020 ident: 10.1016/j.asoc.2022.108469_b1 article-title: A systematic study on meta-heuristic approaches for solving the graph coloring problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.104850 – volume: 37 start-page: 535 year: 1986 ident: 10.1016/j.asoc.2022.108469_b5 article-title: The traveling salesman problem: A guided tour of combinatorial optimization publication-title: J. Oper. Res. Soc. doi: 10.2307/2582681 – volume: 225 year: 2020 ident: 10.1016/j.asoc.2022.108469_b39 article-title: Two echelon vehicle routing problem with drones in last mile delivery publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2019.107598 – volume: 13 year: 1999 ident: 10.1016/j.asoc.2022.108469_b65 article-title: Genetic algorithms for the travelling salesman problem: A review of representations and operators publication-title: Artif. Intell. Rev. doi: 10.1023/A:1006529012972 – volume: 270 start-page: 118 year: 2018 ident: 10.1016/j.asoc.2022.108469_b70 article-title: Large multiple neighborhood search for the clustered vehicle-routing problem publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2018.02.056 – year: 1994 ident: 10.1016/j.asoc.2022.108469_b11 – volume: 69 start-page: 46 year: 2014 ident: 10.1016/j.asoc.2022.108469_b24 article-title: Grey wolf optimizer publication-title: Adv. Eng. Softw. doi: 10.1016/j.advengsoft.2013.12.007 – volume: 22 year: 2002 ident: 10.1016/j.asoc.2022.108469_b72 article-title: Optimizing method based on autonomous animats: Fish-swarm algorithm publication-title: Xitong Gongcheng Lilun Yu Shijian/Syst. Eng. Theory Pract. – year: 2021 ident: 10.1016/j.asoc.2022.108469_b4 article-title: Sizing, optimization, control and energy management of hybrid renewable energy system- a review publication-title: Energy Built Environ. – volume: 220 year: 2021 ident: 10.1016/j.asoc.2022.108469_b34 article-title: A stochastic configuration network based on chaotic sparrow search algorithm publication-title: Knowl.-Based Syst. doi: 10.1016/j.knosys.2021.106924 – volume: 105 year: 2021 ident: 10.1016/j.asoc.2022.108469_b59 article-title: DJAYA: A discrete jaya algorithm for solving traveling salesman problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2021.107275 – volume: 24 year: 2017 ident: 10.1016/j.asoc.2022.108469_b42 article-title: A particle swarm optimization approach in printed circuit board thermal design publication-title: Integr. Comput.-Aided Eng. doi: 10.3233/ICA-160536 – volume: 312 start-page: 120 year: 2018 ident: 10.1016/j.asoc.2022.108469_b29 article-title: GSOA: Growing Self-Organizing Array - Unsupervised learning for the Close-Enough Traveling Salesman Problem and other routing problems publication-title: Neurocomputing doi: 10.1016/j.neucom.2018.05.079 – volume: 11 start-page: 3680 year: 2011 ident: 10.1016/j.asoc.2022.108469_b44 article-title: Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.01.039 – year: 2005 ident: 10.1016/j.asoc.2022.108469_b23 – volume: 172 year: 2021 ident: 10.1016/j.asoc.2022.108469_b8 article-title: A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2021.114639 – volume: 97 year: 2020 ident: 10.1016/j.asoc.2022.108469_b53 article-title: Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2020.106720 – volume: 42 start-page: 77 year: 2018 ident: 10.1016/j.asoc.2022.108469_b55 article-title: Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2018.02.017 – volume: 48 start-page: 59 year: 2016 ident: 10.1016/j.asoc.2022.108469_b56 article-title: An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2015.10.006 – volume: 106 year: 2021 ident: 10.1016/j.asoc.2022.108469_b2 article-title: A discrete spotted hyena optimizer for solving distributed job shop scheduling problems publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2021.107349 – volume: 43 year: 2016 ident: 10.1016/j.asoc.2022.108469_b46 article-title: Multi-offspring genetic algorithm and its application to the traveling salesman problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2016.02.021 – year: 2021 ident: 10.1016/j.asoc.2022.108469_b50 article-title: A multi-objective covering salesman problem with 2-coverage publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2021.108024 – volume: 68 start-page: 83 year: 2018 ident: 10.1016/j.asoc.2022.108469_b45 article-title: Improving variable neighborhood search to solve the traveling salesman problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2018.03.048 – start-page: 1 year: 2015 ident: 10.1016/j.asoc.2022.108469_b48 article-title: Crossover operators in genetic algorithms: A review publication-title: ICTACT J. Soft Comput. – volume: 52 year: 2020 ident: 10.1016/j.asoc.2022.108469_b51 article-title: A novel design of differential evolution for solving discrete traveling salesman problems publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2019.100607 – volume: 44 start-page: 428 year: 2019 ident: 10.1016/j.asoc.2022.108469_b61 article-title: A swap sequence based Artificial Bee Colony algorithm for Traveling Salesman Problem publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2018.05.006 – volume: 70 start-page: 124 year: 2014 ident: 10.1016/j.asoc.2022.108469_b20 article-title: The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2014.01.015 – volume: 7 start-page: 144366 year: 2019 ident: 10.1016/j.asoc.2022.108469_b21 article-title: Enhanced list-based simulated annealing algorithm for large-scale traveling salesman problem publication-title: IEEE Access doi: 10.1109/ACCESS.2019.2945570 – volume: 87 start-page: 70 year: 2017 ident: 10.1016/j.asoc.2022.108469_b16 article-title: Discrete symbiotic organisms search algorithm for travelling salesman problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2017.06.007 – volume: 45 start-page: 753 year: 1998 ident: 10.1016/j.asoc.2022.108469_b7 article-title: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems publication-title: J. ACM doi: 10.1145/290179.290180 |
| SSID | ssj0016928 |
| Score | 2.563562 |
| Snippet | The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. This paper proposes a swarm intelligence... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 108469 |
| SubjectTerms | 2-opt Global perturbation Sparrow search algorithm Swarm intelligence TSP |
| Title | Discrete sparrow search algorithm for symmetric traveling salesman problem |
| URI | https://dx.doi.org/10.1016/j.asoc.2022.108469 |
| Volume | 118 |
| WOSCitedRecordID | wos000791538500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: AIEXJ dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NT9wwELXQ0kMv_a5KaSsfuK2Msv6I7SOiVBQhhASVtr1EieOUXbEBbbIr-PeMY8esACGK1EsUWXEczXPGL5MZP4S2WDEyiSw1gVdHEp4nCdHGVgRWW0uVKQtRdKolh_LoSI3H-jjIuzednICsa3V1pS__K9TQBmC70tl_gDveFBrgHECHI8AOxycB_30CngCo8BB8hdtgcRgCG_n534v5pD2bdZmFzfVs5sS0jBOJWPqi9AYWi8bF9IPKzCpx7dlqA267y0NftP2itxp2_nN2W1q272Orv_NwXYgtwGdpTK7yAa97RS_eR6aKcB0ih9a3KUmJTr36SnSs3rPec9I-XjDdzmH-bbthXaIj94otdza_PnGDubGoKylibseAdSqFVgO0vvNzb3wQ_xilutPRjQ8XCqR8Lt_dkR4mISvE4vQNehW-CPCOR_ItWrP1O_S6V9vAwfm-Rwc9sDgAiz2wOAKLAVgcgcURWNwDiwOwH9CvH3unu_skKGEQw5KkJbrQmhuZSJpXheI5L6u0YED-LLDb1FI6sppboXNRMWO1tDlVQhWmGNlUmEqwj2hQX9T2E8JSipLDO0i5BTLJhLIl3MUwykRpmZIbaNSbJjNhm3inVnKe9fmA08yZM3PmzLw5N9Aw9rn0m6Q8erXoLZ4FmufpWwYT5JF-n5_ZbxO9vJ3bX9CgnS_sV_TCLNtJM_8W5tENroJ4VA |
| linkProvider | Elsevier |
| 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=Discrete+sparrow+search+algorithm+for+symmetric+traveling+salesman+problem&rft.jtitle=Applied+soft+computing&rft.au=Zhang%2C+Zhen&rft.au=Han%2C+Yang&rft.date=2022-03-01&rft.pub=Elsevier+B.V&rft.issn=1568-4946&rft.eissn=1872-9681&rft.volume=118&rft_id=info:doi/10.1016%2Fj.asoc.2022.108469&rft.externalDocID=S1568494622000321 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1568-4946&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1568-4946&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1568-4946&client=summon |