Discrete Salp Swarm Algorithm for Euclidean Travelling Salesman Problem

The Salp Swarm Algorithm (SSA) is one of the recently proposed swarm intelligence-based algorithms, which finds its motivation in the swarming behaviour of salps when navigating and foraging in the ocean. The SSA is essentially derived to solve optimization problems that have continuous search space...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied intelligence (Dordrecht, Netherlands) Ročník 53; číslo 10; s. 11420 - 11438
Hlavní autoři:	Panwar, Karuna, Deep, Kusum
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.05.2023 Springer Nature B.V
Témata:	Algorithms Artificial Intelligence Combinatorial analysis Computer Science Genetic algorithms Machines Manufacturing Mechanical Engineering Optimization Processes Searching Swarm intelligence Swarming Traveling salesman problem Salp swarm algorithm Travelling salesman problem 2-opt algorithm Metaheuristics Combinatorial optimization problem
ISSN:	0924-669X, 1573-7497
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 Salp Swarm Algorithm (SSA) is one of the recently proposed swarm intelligence-based algorithms, which finds its motivation in the swarming behaviour of salps when navigating and foraging in the ocean. The SSA is essentially derived to solve optimization problems that have continuous search space. SSA is a simple to implement and competitive algorithm that has been proven helpful in a variety of real-world applications. It has been explored over several optimization problems so far. In this study, an enhanced discrete version of SSA is proposed to solve the Travelling Salesman Problem (TSP). As TSP is a combinatorial optimization problem, the classical SSA is modified using swap, shift and symmetry operators for global exploration and local exploitation. Also, the 2-opt method has been incorporated with the proposed algorithm to improve the local search ability of the algorithm while addressing discrete problems. The proposed Discrete Salp Swarm Algorithm (DSSA) has evaluated over 45 TSP instances, and the computational results showed that it is a promising algorithm. To assess its performance, the proposed algorithm’s results are compared with well-known algorithms such as Genetic Algorithm, Artificial Bee Colony, Spider Monkey Algorithm, Jaya Algorithm, Black Hole, Symbiotic Organism Search etc. The proposed algorithm significantly outperformed these algorithms for a majority of TSP instances.
AbstractList	The Salp Swarm Algorithm (SSA) is one of the recently proposed swarm intelligence-based algorithms, which finds its motivation in the swarming behaviour of salps when navigating and foraging in the ocean. The SSA is essentially derived to solve optimization problems that have continuous search space. SSA is a simple to implement and competitive algorithm that has been proven helpful in a variety of real-world applications. It has been explored over several optimization problems so far. In this study, an enhanced discrete version of SSA is proposed to solve the Travelling Salesman Problem (TSP). As TSP is a combinatorial optimization problem, the classical SSA is modified using swap, shift and symmetry operators for global exploration and local exploitation. Also, the 2-opt method has been incorporated with the proposed algorithm to improve the local search ability of the algorithm while addressing discrete problems. The proposed Discrete Salp Swarm Algorithm (DSSA) has evaluated over 45 TSP instances, and the computational results showed that it is a promising algorithm. To assess its performance, the proposed algorithm’s results are compared with well-known algorithms such as Genetic Algorithm, Artificial Bee Colony, Spider Monkey Algorithm, Jaya Algorithm, Black Hole, Symbiotic Organism Search etc. The proposed algorithm significantly outperformed these algorithms for a majority of TSP instances.
Author	Deep, Kusum Panwar, Karuna
Author_xml	– sequence: 1 givenname: Karuna surname: Panwar fullname: Panwar, Karuna email: kpanwar@ma.iitr.ac.in organization: Department of Mathematics, Indian Institute of Technology Roorkee – sequence: 2 givenname: Kusum surname: Deep fullname: Deep, Kusum organization: Department of Mathematics, Indian Institute of Technology Roorkee
BookMark	eNp9kF1LwzAUQIMouE3_gE8Fn6P5aNL0ccw5hYHCJvgW2uRmdrTNTDrFf29nBcGHPQUu59wbzhidtr4FhK4ouaGEZLeRklTlmDCGCc8zicUJGlGRcZyleXaKRiRnKZYyfz1H4xi3hBDOCR2hxV0VTYAOklVR75LVZxGaZFpvfKi6tyZxPiTzvakrC0WbrEPxAXVdtZsDDbHpZ8_BlzU0F-jMFXWEy993gl7u5-vZA14-LR5n0yU2nOYdpkooK0uhhM1szq2yDIRzzEhIU5eVAKWzwpYWeC9Qw6gxJZGiVNI4SYBP0PWwdxf8-x5ip7d-H9r-pGaKSsY5p6qn1ECZ4GMM4LSpuqKrfNuFoqo1JfqQTQ_ZdJ9N_2TTolfZP3UXqqYIX8clPkixh9sNhL9fHbG-AVftgqE
CitedBy_id	crossref_primary_10_1007_s10489_023_04972_z crossref_primary_10_1007_s12065_024_00931_w crossref_primary_10_1016_j_est_2025_116639 crossref_primary_10_1016_j_cie_2025_111487 crossref_primary_10_1038_s41598_025_86054_3 crossref_primary_10_3390_jmse13061111
Cites_doi	10.1007/s12652-018-1031-9 10.1007/s00521-020-04832-8 10.1016/j.jestch.2019.11.005 10.1287/mnsc.40.10.1276 10.1016/j.eswa.2019.113122 10.1016/j.ejor.2006.06.060 10.1007/978-3-662-03423-1_1 10.1016/j.jestch.2018.12.015 10.1007/BF02192047 10.3390/w10060815 10.1007/s00521-019-04029-8 10.1016/j.swevo.2019.100607 10.1007/s44196-021-00052-7 10.1057/jors.1980.188 10.1016/j.asoc.2020.106534 10.1287/opre.14.2.210 10.1007/978-981-13-1592-3_41 10.1002/int.22342 10.1088/1757-899X/394/4/042101 10.1016/j.eswa.2018.12.044 10.1007/s40998-020-00315-7 10.1137/1.9780898718515 10.1007/s00500-017-2760-y 10.1016/0377-2217(92)90138-Y 10.1016/j.asoc.2015.01.068 10.1016/j.advengsoft.2017.07.002 10.1016/j.eswa.2019.113103 10.1145/321105.321111 10.1007/s00366-020-01099-4 10.3906/elk-1210-147 10.3390/en11102556 10.1287/opre.6.6.791 10.1016/j.asoc.2019.105887 10.1016/j.eswa.2017.06.007 10.1007/s00366-020-01014-x 10.1016/j.neucom.2014.01.078 10.1007/s00366-018-00696-8 10.1201/9780429422614-21 10.1016/0304-3975(77)90012-3 10.1016/j.swevo.2018.05.006 10.1016/j.ejor.2005.03.059 10.1016/j.cor.2005.03.014 10.1007/978-3-030-05481-6_8 10.1109/ICEEE2.2018.8391318 10.1007/s13369-019-04132-x 10.1186/s40294-016-0040-9 10.1016/j.knosys.2018.05.009 10.1016/j.neucom.2015.08.041 10.1016/0167-6377(87)90002-2 10.1016/j.asoc.2021.107275 10.2307/1907742 10.1007/s10586-021-03304-5 10.1109/ACCESS.2020.2997783 10.1007/s00521-017-3176-4 10.1007/s00521-018-3613-z 10.1016/j.apm.2020.08.014 10.1016/0377-2217(85)90167-5
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PSYQQ PTHSS Q9U
DOI	10.1007/s10489-022-03976-5
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest One Psychology Engineering Collection ProQuest Central Basic
DatabaseTitle	CrossRef ProQuest Business Collection (Alumni Edition) ProQuest One Psychology Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ProQuest Business Collection (Alumni Edition)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1573-7497
EndPage	11438
ExternalDocumentID	10_1007_s10489_022_03976_5
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 77K 7WY 8FE 8FG 8FL 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABIVO ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY 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 AZQEC B-. BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M0N M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PSYQQ PT4 PT5 PTHSS Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z7Z Z81 Z83 Z88 Z8M Z8N Z8R Z8T Z8U Z8W Z92 ZMTXR ZY4 ~A9 ~EX 77I AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c319t-1858d6b585d7d93d8d2e5ff2c6e44f7beebfd5dbde3c311c21ccb065b86cf60e3
IEDL.DBID	RSV
ISICitedReferencesCount	8
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000850020200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0924-669X
IngestDate	Wed Nov 05 14:43:36 EST 2025 Tue Nov 18 21:50:00 EST 2025 Sat Nov 29 05:33:33 EST 2025 Fri Feb 21 02:44:28 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	10
Keywords	Salp swarm algorithm Travelling salesman problem 2-opt algorithm Metaheuristics Combinatorial optimization problem
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c319t-1858d6b585d7d93d8d2e5ff2c6e44f7beebfd5dbde3c311c21ccb065b86cf60e3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	2816233318
PQPubID	326365
PageCount	19
ParticipantIDs	proquest_journals_2816233318 crossref_citationtrail_10_1007_s10489_022_03976_5 crossref_primary_10_1007_s10489_022_03976_5 springer_journals_10_1007_s10489_022_03976_5
PublicationCentury	2000
PublicationDate	20230500 2023-05-00 20230501
PublicationDateYYYYMMDD	2023-05-01
PublicationDate_xml	– month: 5 year: 2023 text: 20230500
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York – name: Boston
PublicationSubtitle	The International Journal of Research on Intelligent Systems for Real Life Complex Problems
PublicationTitle	Applied intelligence (Dordrecht, Netherlands)
PublicationTitleAbbrev	Appl Intell
PublicationYear	2023
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Ateya, Muthanna, Vybornova, Algarni, Abuarqoub, Koucheryavy, Koucheryavy (CR38) 2019; 22 Salgotra, Singh, Singh, Singh, Mittal (CR24) 2021; 89 Papadimitriou (CR49) 1977; 4 Wong (CR11) 1995; 87 Tarantilis, Kiranoudis (CR51) 2007; 179 Singh, Son, Chiclana, Magnot (CR40) 2020; 36 Zhou, Wang, Zhao, Luo, Metwally (CR47) 2019; 31 Rizk-Allah, Hassanien, Elhoseny, Gunasekaran (CR18) 2019; 31 CR34 CR33 Medjahed, Ouali (CR39) 2020; 95 CR32 Laporte (CR12) 1992; 59 El-Ashmawi, Ali (CR30) 2020; 94 Neggaz, Ewees, Abd Elaziz, Mafarja (CR29) 2020; 145 Bellman (CR3) 1962; 9 Panda, Majhi (CR31) 2020; 45 Akhand, Ayon, Shahriyar, Siddique, Adeli (CR60) 2020; 86 Khan, Maiti (CR59) 2019; 44 CR6 Laporte, Nobert (CR13) 1980; 31 CR5 CR7 El-Fergany, Hasanien (CR35) 2020; 32 Gündüz, Kiran, Özceylan (CR57) 2015; 23 Tolba, Rezk, Diab, Al-Dhaifallah (CR22) 2018; 11 CR43 CR42 Zhou, Luo, Chen, He, Wu (CR63) 2015; 151 Bianchessi, Righini (CR52) 2007; 34 Zhou, Gao, Yang, Gui (CR54) 2016; 173 Hatamlou (CR58) 2018; 22 Ibrahim, Mazher, Ucan, Bayat (CR21) 2017; 17 Cinar, Korkmaz, Kiran (CR53) 2020; 23 Pintea, Pop, Chira (CR41) 2017; 5 Zhang, Wang (CR27) 2020; 8 Benyamin, Farhad, Saeid (CR45) 2021; 36 CR15 CR14 Croes (CR50) 1958; 6 Boryczka, Szwarc (CR46) 2019; 122 CR56 Gavett, Plyter (CR1) 1966; 14 CR10 Li, Zhou, Shi, Jahed Armaghani, Yu, Chen, Huang (CR26) 2021; 37 Gendreau, Hertz, Laporte (CR4) 1994; 40 de Werra (CR8) 1985; 19 Ezugwu, Adewumi (CR61) 2017; 87 Ali, Essam, Kasmarik (CR44) 2020; 52 Mirjalili, Gandomi, Mirjalili, Saremi, Faris, Mirjalili (CR16) 2017; 114 Ibrahim, Ewees, Oliva, Abd Elaziz, Lu (CR36) 2019; 10 CR28 Zhang, Wang, Luo (CR19) 2018; 10 Bi, Zhou, Zhou, Luo, Deng (CR48) 2022; 15 CR25 CR23 Padberg, Rinaldi (CR2) 1987; 6 CR20 Gunduz, Aslan (CR55) 2021; 105 Tubishat, Idris, Shuib, Abushariah, Mirjalili (CR17) 2020; 145 Mahi, Baykan, Kodaz (CR62) 2015; 30 Faris, Mafarja, Heidari, Aljarah, Ala’M, Mirjalili, Fujita (CR37) 2018; 154 Allahverdi, Ng, Cheng, Kovalyov (CR9) 2008; 187 R Salgotra (3976_CR24) 2021; 89 HT Ibrahim (3976_CR21) 2017; 17 S Mirjalili (3976_CR16) 2017; 114 M Gündüz (3976_CR57) 2015; 23 3976_CR23 J Zhang (3976_CR27) 2020; 8 N Neggaz (3976_CR29) 2020; 145 J Bi (3976_CR48) 2022; 15 3976_CR28 R Bellman (3976_CR3) 1962; 9 G Laporte (3976_CR12) 1992; 59 3976_CR25 3976_CR20 A Hatamlou (3976_CR58) 2018; 22 H Faris (3976_CR37) 2018; 154 Y Zhou (3976_CR47) 2019; 31 AC Cinar (3976_CR53) 2020; 23 X Zhou (3976_CR54) 2016; 173 RM Rizk-Allah (3976_CR18) 2019; 31 N Singh (3976_CR40) 2020; 36 M Tubishat (3976_CR17) 2020; 145 M Gendreau (3976_CR4) 1994; 40 3976_CR7 J Zhang (3976_CR19) 2018; 10 3976_CR56 3976_CR5 3976_CR6 3976_CR10 M Gunduz (3976_CR55) 2021; 105 W Wong (3976_CR11) 1995; 87 Y Zhou (3976_CR63) 2015; 151 3976_CR15 3976_CR14 M Tolba (3976_CR22) 2018; 11 D de Werra (3976_CR8) 1985; 19 SA Medjahed (3976_CR39) 2020; 95 A Benyamin (3976_CR45) 2021; 36 U Boryczka (3976_CR46) 2019; 122 M Akhand (3976_CR60) 2020; 86 G Laporte (3976_CR13) 1980; 31 N Panda (3976_CR31) 2020; 45 M Padberg (3976_CR2) 1987; 6 RA Ibrahim (3976_CR36) 2019; 10 E Li (3976_CR26) 2021; 37 3976_CR43 IM Ali (3976_CR44) 2020; 52 CD Tarantilis (3976_CR51) 2007; 179 3976_CR42 AA Ateya (3976_CR38) 2019; 22 M Mahi (3976_CR62) 2015; 30 JW Gavett (3976_CR1) 1966; 14 N Bianchessi (3976_CR52) 2007; 34 GA Croes (3976_CR50) 1958; 6 I Khan (3976_CR59) 2019; 44 AE-S Ezugwu (3976_CR61) 2017; 87 CH Papadimitriou (3976_CR49) 1977; 4 AA El-Fergany (3976_CR35) 2020; 32 3976_CR34 3976_CR33 3976_CR32 A Allahverdi (3976_CR9) 2008; 187 C-M Pintea (3976_CR41) 2017; 5 WH El-Ashmawi (3976_CR30) 2020; 94
References_xml	– volume: 23 start-page: 103 issue: 1 year: 2015 end-page: 117 ident: CR57 article-title: A hierarchic approach based on swarm intelligence to solve the traveling salesman problem publication-title: Turk J Electr Eng Comput Sci – volume: 10 start-page: 815 issue: 6 year: 2018 end-page: 826 ident: CR19 article-title: Parameter estimation for soil water retention curve using the salp swarm algorithm publication-title: Water – volume: 44 start-page: 428 year: 2019 end-page: 438 ident: CR59 article-title: A swap sequence based artificial bee colony algorithm for traveling salesman problem publication-title: Swarm and Evolutionary Computation – volume: 37 start-page: 3519 issue: 4 year: 2021 end-page: 3540 ident: CR26 article-title: Developing a hybrid model of salp swarm algorithm-based support vector machine to predict the strength of fiber-reinforced cemented paste backfill publication-title: Engineering with Computers – volume: 4 start-page: 237 issue: 3 year: 1977 end-page: 244 ident: CR49 article-title: The euclidean travelling salesman problem is np-complete publication-title: Theor Comput Sci – volume: 22 start-page: 1001 issue: 4 year: 2019 end-page: 1012 ident: CR38 article-title: Chaotic salp swarm algorithm for sdn multi-controller networks publication-title: Engineering Science and Technology, an International Journal – volume: 15 start-page: 1 issue: 1 year: 2022 end-page: 24 ident: CR48 article-title: Artificial electric field algorithm with greedy state transition strategy for spherical multiple traveling salesmen problem publication-title: International Journal of Computational Intelligence Systems – volume: 179 start-page: 806 issue: 3 year: 2007 end-page: 822 ident: CR51 article-title: A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector publication-title: Eur J Oper Res – volume: 22 start-page: 8167 issue: 24 year: 2018 end-page: 8175 ident: CR58 article-title: Solving travelling salesman problem using black hole algorithm publication-title: Soft Comput – volume: 31 start-page: 2155 issue: 7 year: 2019 end-page: 2170 ident: CR47 article-title: Discrete greedy flower pollination algorithm for spherical traveling salesman problem publication-title: Neural Comput & Applic – volume: 87 start-page: 70 year: 2017 end-page: 78 ident: CR61 article-title: Discrete symbiotic organisms search algorithm for travelling salesman problem publication-title: Expert Syst Appl – volume: 145 start-page: 113 year: 2020 end-page: 122 ident: CR17 article-title: Improved salp swarm algorithm based on opposition based learning and novel local search algorithm for feature selection publication-title: Expert Syst Appl – ident: CR25 – volume: 122 start-page: 43 year: 2019 end-page: 53 ident: CR46 article-title: The harmony search algorithm with additional improvement of harmony memory for asymmetric traveling salesman problem publication-title: Expert Syst Appl – ident: CR42 – volume: 11 start-page: 25 issue: 10 year: 2018 end-page: 56 ident: CR22 article-title: A novel robust methodology based salp swarm algorithm for allocation and capacity of renewable distributed generators on distribution grids publication-title: Energies – volume: 52 start-page: 100607 year: 2020 ident: CR44 article-title: A novel design of differential evolution for solving discrete traveling salesman problems publication-title: Swarm and Evolutionary Computation – ident: CR15 – volume: 36 start-page: 1270 issue: 3 year: 2021 end-page: 1303 ident: CR45 article-title: Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems publication-title: Int J Intell Syst – volume: 17 start-page: 13 issue: 12 year: 2017 end-page: 20 ident: CR21 article-title: Feature selection using salp swarm algorithm for real biomedical datasets publication-title: IJCSNS – volume: 173 start-page: 864 year: 2016 end-page: 874 ident: CR54 article-title: Discrete state transition algorithm for unconstrained integer optimization problems publication-title: Neurocomputing – volume: 6 start-page: 1 issue: 1 year: 1987 end-page: 7 ident: CR2 article-title: Optimization of a 532-city symmetric traveling salesman problem by branch and cut publication-title: Oper Res Lett – volume: 87 start-page: 197 issue: 1 year: 1995 end-page: 220 ident: CR11 article-title: Matrix representation and gradient flows for np-hard problems publication-title: J Optim Theory Appl – volume: 30 start-page: 484 year: 2015 end-page: 490 ident: CR62 article-title: A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem publication-title: Appl Soft Comput – volume: 154 start-page: 43 year: 2018 end-page: 67 ident: CR37 article-title: An efficient binary salp swarm algorithm with crossover scheme for feature selection problems publication-title: Knowl-Based Syst – ident: CR32 – ident: CR5 – volume: 31 start-page: 1641 issue: 5 year: 2019 end-page: 1663 ident: CR18 article-title: A new binary salp swarm algorithm: development and application for optimization tasks publication-title: Neural Comput & Applic – volume: 45 start-page: 2743 issue: 4 year: 2020 end-page: 2761 ident: CR31 article-title: Improved salp swarm algorithm with space transformation search for training neural network publication-title: Arab J Sci Eng – volume: 5 start-page: 1 issue: 1 year: 2017 end-page: 9 ident: CR41 article-title: The generalized traveling salesman problem solved with ant algorithms publication-title: Complex Adaptive Systems Modeling – ident: CR43 – volume: 105 start-page: 107 year: 2021 end-page: 122 ident: CR55 article-title: Djaya: a discrete jaya algorithm for solving traveling salesman problem publication-title: Appl Soft Comput – volume: 9 start-page: 61 issue: 1 year: 1962 end-page: 63 ident: CR3 article-title: Dynamic programming treatment of the travelling salesman problem publication-title: Journal of the ACM (JACM) – ident: CR14 – volume: 40 start-page: 1276 issue: 10 year: 1994 end-page: 1290 ident: CR4 article-title: A tabu search heuristic for the vehicle routing problem publication-title: Manag Sci – volume: 86 start-page: 105 year: 2020 end-page: 121 ident: CR60 article-title: Discrete spider monkey optimization for travelling salesman problem publication-title: Appl Soft Comput – ident: CR10 – ident: CR33 – volume: 31 start-page: 1017 issue: 11 year: 1980 end-page: 1023 ident: CR13 article-title: A cutting planes algorithm for the m-salesmen problem publication-title: J Oper Res Soc – ident: CR6 – volume: 151 start-page: 1227 year: 2015 end-page: 1236 ident: CR63 article-title: A discrete invasive weed optimization algorithm for solving traveling salesman problem publication-title: Neurocomputing – ident: CR56 – volume: 23 start-page: 879 issue: 4 year: 2020 end-page: 890 ident: CR53 article-title: A discrete tree-seed algorithm for solving symmetric traveling salesman problem publication-title: Engineering Science and Technology, an International Journal – volume: 59 start-page: 231 issue: 2 year: 1992 end-page: 247 ident: CR12 article-title: The traveling salesman problem: an overview of exact and approximate algorithms publication-title: Eur J Oper Res – volume: 6 start-page: 791 issue: 6 year: 1958 end-page: 812 ident: CR50 article-title: A method for solving traveling-salesman problems publication-title: Oper Res – volume: 114 start-page: 163 year: 2017 end-page: 191 ident: CR16 article-title: Salp swarm algorithm: a bio-inspired optimizer for engineering design problems publication-title: Adv Eng Softw – ident: CR23 – volume: 32 start-page: 5267 issue: 9 year: 2020 end-page: 5283 ident: CR35 article-title: Salp swarm optimizer to solve optimal power flow comprising voltage stability analysis publication-title: Neural Comput & Applic – volume: 10 start-page: 3155 issue: 8 year: 2019 end-page: 3169 ident: CR36 article-title: Improved salp swarm algorithm based on particle swarm optimization for feature selection publication-title: Journal of Ambient Intelligence and Humanized Computing – volume: 94 start-page: 106 year: 2020 end-page: 127 ident: CR30 article-title: A modified salp swarm algorithm for task assignment problem publication-title: Appl Soft Comput – volume: 36 start-page: 185 issue: 1 year: 2020 end-page: 212 ident: CR40 article-title: A new fusion of salp swarm with sine cosine for optimization of non-linear functions publication-title: Engineering with Computers – volume: 8 start-page: 99740 year: 2020 end-page: 99771 ident: CR27 article-title: Improved salp swarm algorithm based on levy flight and sine cosine operator publication-title: IEEE Access – volume: 14 start-page: 210 issue: 2 year: 1966 end-page: 232 ident: CR1 article-title: The optimal assignment of facilities to locations by branch and bound publication-title: Oper Res – volume: 19 start-page: 151 issue: 2 year: 1985 end-page: 162 ident: CR8 article-title: An introduction to timetabling publication-title: Eur J Oper Res – volume: 89 start-page: 188 year: 2021 end-page: 207 ident: CR24 article-title: Self-adaptive salp swarm algorithm for engineering optimization problems publication-title: Appl Math Model – volume: 34 start-page: 578 issue: 2 year: 2007 end-page: 594 ident: CR52 article-title: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery publication-title: Comput Oper Res – ident: CR34 – volume: 187 start-page: 985 issue: 3 year: 2008 end-page: 1032 ident: CR9 article-title: A survey of scheduling problems with setup times or costs publication-title: Eur J Oper Res – ident: CR7 – ident: CR28 – ident: CR20 – volume: 145 start-page: 113 year: 2020 end-page: 133 ident: CR29 article-title: Boosting salp swarm algorithm by sine cosine algorithm and disrupt operator for feature selection publication-title: Expert Syst Appl – volume: 95 start-page: 106 year: 2020 end-page: 113 ident: CR39 article-title: A new hybrid ssa-ta: Salp swarm algorithm with threshold accepting for band selection in hyperspectral images publication-title: Appl Soft Comput – volume: 10 start-page: 3155 issue: 8 year: 2019 ident: 3976_CR36 publication-title: Journal of Ambient Intelligence and Humanized Computing doi: 10.1007/s12652-018-1031-9 – ident: 3976_CR15 doi: 10.1007/s00521-020-04832-8 – volume: 23 start-page: 879 issue: 4 year: 2020 ident: 3976_CR53 publication-title: Engineering Science and Technology, an International Journal doi: 10.1016/j.jestch.2019.11.005 – volume: 40 start-page: 1276 issue: 10 year: 1994 ident: 3976_CR4 publication-title: Manag Sci doi: 10.1287/mnsc.40.10.1276 – volume: 145 start-page: 113 year: 2020 ident: 3976_CR17 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2019.113122 – volume: 187 start-page: 985 issue: 3 year: 2008 ident: 3976_CR9 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2006.06.060 – ident: 3976_CR14 doi: 10.1007/978-3-662-03423-1_1 – volume: 22 start-page: 1001 issue: 4 year: 2019 ident: 3976_CR38 publication-title: Engineering Science and Technology, an International Journal doi: 10.1016/j.jestch.2018.12.015 – volume: 87 start-page: 197 issue: 1 year: 1995 ident: 3976_CR11 publication-title: J Optim Theory Appl doi: 10.1007/BF02192047 – volume: 10 start-page: 815 issue: 6 year: 2018 ident: 3976_CR19 publication-title: Water doi: 10.3390/w10060815 – volume: 32 start-page: 5267 issue: 9 year: 2020 ident: 3976_CR35 publication-title: Neural Comput & Applic doi: 10.1007/s00521-019-04029-8 – volume: 52 start-page: 100607 year: 2020 ident: 3976_CR44 publication-title: Swarm and Evolutionary Computation doi: 10.1016/j.swevo.2019.100607 – volume: 15 start-page: 1 issue: 1 year: 2022 ident: 3976_CR48 publication-title: International Journal of Computational Intelligence Systems doi: 10.1007/s44196-021-00052-7 – volume: 31 start-page: 1017 issue: 11 year: 1980 ident: 3976_CR13 publication-title: J Oper Res Soc doi: 10.1057/jors.1980.188 – volume: 95 start-page: 106 year: 2020 ident: 3976_CR39 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2020.106534 – volume: 14 start-page: 210 issue: 2 year: 1966 ident: 3976_CR1 publication-title: Oper Res doi: 10.1287/opre.14.2.210 – ident: 3976_CR33 doi: 10.1007/978-981-13-1592-3_41 – volume: 36 start-page: 1270 issue: 3 year: 2021 ident: 3976_CR45 publication-title: Int J Intell Syst doi: 10.1002/int.22342 – ident: 3976_CR42 doi: 10.1088/1757-899X/394/4/042101 – volume: 122 start-page: 43 year: 2019 ident: 3976_CR46 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2018.12.044 – ident: 3976_CR34 doi: 10.1007/s40998-020-00315-7 – ident: 3976_CR7 doi: 10.1137/1.9780898718515 – volume: 22 start-page: 8167 issue: 24 year: 2018 ident: 3976_CR58 publication-title: Soft Comput doi: 10.1007/s00500-017-2760-y – volume: 59 start-page: 231 issue: 2 year: 1992 ident: 3976_CR12 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(92)90138-Y – volume: 30 start-page: 484 year: 2015 ident: 3976_CR62 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2015.01.068 – volume: 114 start-page: 163 year: 2017 ident: 3976_CR16 publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2017.07.002 – volume: 145 start-page: 113 year: 2020 ident: 3976_CR29 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2019.113103 – ident: 3976_CR28 – volume: 9 start-page: 61 issue: 1 year: 1962 ident: 3976_CR3 publication-title: Journal of the ACM (JACM) doi: 10.1145/321105.321111 – ident: 3976_CR23 doi: 10.1007/s00366-020-01099-4 – volume: 23 start-page: 103 issue: 1 year: 2015 ident: 3976_CR57 publication-title: Turk J Electr Eng Comput Sci doi: 10.3906/elk-1210-147 – volume: 11 start-page: 25 issue: 10 year: 2018 ident: 3976_CR22 publication-title: Energies doi: 10.3390/en11102556 – volume: 6 start-page: 791 issue: 6 year: 1958 ident: 3976_CR50 publication-title: Oper Res doi: 10.1287/opre.6.6.791 – ident: 3976_CR5 – volume: 86 start-page: 105 year: 2020 ident: 3976_CR60 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2019.105887 – volume: 87 start-page: 70 year: 2017 ident: 3976_CR61 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2017.06.007 – volume: 37 start-page: 3519 issue: 4 year: 2021 ident: 3976_CR26 publication-title: Engineering with Computers doi: 10.1007/s00366-020-01014-x – volume: 151 start-page: 1227 year: 2015 ident: 3976_CR63 publication-title: Neurocomputing doi: 10.1016/j.neucom.2014.01.078 – volume: 36 start-page: 185 issue: 1 year: 2020 ident: 3976_CR40 publication-title: Engineering with Computers doi: 10.1007/s00366-018-00696-8 – ident: 3976_CR25 doi: 10.1201/9780429422614-21 – volume: 4 start-page: 237 issue: 3 year: 1977 ident: 3976_CR49 publication-title: Theor Comput Sci doi: 10.1016/0304-3975(77)90012-3 – volume: 44 start-page: 428 year: 2019 ident: 3976_CR59 publication-title: Swarm and Evolutionary Computation doi: 10.1016/j.swevo.2018.05.006 – volume: 179 start-page: 806 issue: 3 year: 2007 ident: 3976_CR51 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2005.03.059 – volume: 34 start-page: 578 issue: 2 year: 2007 ident: 3976_CR52 publication-title: Comput Oper Res doi: 10.1016/j.cor.2005.03.014 – ident: 3976_CR32 doi: 10.1007/978-3-030-05481-6_8 – ident: 3976_CR20 doi: 10.1109/ICEEE2.2018.8391318 – volume: 45 start-page: 2743 issue: 4 year: 2020 ident: 3976_CR31 publication-title: Arab J Sci Eng doi: 10.1007/s13369-019-04132-x – volume: 5 start-page: 1 issue: 1 year: 2017 ident: 3976_CR41 publication-title: Complex Adaptive Systems Modeling doi: 10.1186/s40294-016-0040-9 – volume: 154 start-page: 43 year: 2018 ident: 3976_CR37 publication-title: Knowl-Based Syst doi: 10.1016/j.knosys.2018.05.009 – volume: 173 start-page: 864 year: 2016 ident: 3976_CR54 publication-title: Neurocomputing doi: 10.1016/j.neucom.2015.08.041 – ident: 3976_CR56 – volume: 6 start-page: 1 issue: 1 year: 1987 ident: 3976_CR2 publication-title: Oper Res Lett doi: 10.1016/0167-6377(87)90002-2 – volume: 105 start-page: 107 year: 2021 ident: 3976_CR55 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2021.107275 – ident: 3976_CR6 doi: 10.2307/1907742 – ident: 3976_CR43 doi: 10.1007/s10586-021-03304-5 – volume: 8 start-page: 99740 year: 2020 ident: 3976_CR27 publication-title: IEEE Access doi: 10.1109/ACCESS.2020.2997783 – volume: 31 start-page: 2155 issue: 7 year: 2019 ident: 3976_CR47 publication-title: Neural Comput & Applic doi: 10.1007/s00521-017-3176-4 – volume: 94 start-page: 106 year: 2020 ident: 3976_CR30 publication-title: Appl Soft Comput – volume: 17 start-page: 13 issue: 12 year: 2017 ident: 3976_CR21 publication-title: IJCSNS – volume: 31 start-page: 1641 issue: 5 year: 2019 ident: 3976_CR18 publication-title: Neural Comput & Applic doi: 10.1007/s00521-018-3613-z – volume: 89 start-page: 188 year: 2021 ident: 3976_CR24 publication-title: Appl Math Model doi: 10.1016/j.apm.2020.08.014 – volume: 19 start-page: 151 issue: 2 year: 1985 ident: 3976_CR8 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(85)90167-5 – ident: 3976_CR10
SSID	ssj0003301
Score	2.3677466
Snippet	The Salp Swarm Algorithm (SSA) is one of the recently proposed swarm intelligence-based algorithms, which finds its motivation in the swarming behaviour of...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	11420
SubjectTerms	Algorithms Artificial Intelligence Combinatorial analysis Computer Science Genetic algorithms Machines Manufacturing Mechanical Engineering Optimization Processes Searching Swarm intelligence Swarming Traveling salesman problem
SummonAdditionalLinks	– databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LT8IwGG8UPXgRnxFF04M3baR772SIip4ICZhwW_pUEhjIhv77ft06Fk3k4nVrm2W_79l-_X4IXZtzQCWciAiHucTzOSOcK0UY1VR4jDtasoJsIuz3o_E4HtgNt8yWVVY2sTDUci7MHvmdE1Hw1C6I4P3igxjWKHO6aik0ttGO6ZJAi9K94doSQ65eMOZBjkGCIB7bSzP26pxnioUgFesYl0z8n46pjjZ_HZAWfqfX_O8XH6B9G3Hibikih2hLpUeoWbE5YKvcx-j5cQImBGJoPGTTBR5-seUMd6dvsGT-PsMQ3OKnlZhOpGIpHhnWoqKdtxmtshk8G5TcNCfotfc0enghlmaBCNC_nIDHjmTAIW-QoYxdGUlH-Vo7IlCep0NAjmvpSy6VCxOocKgQHCIXHgVCBx3lnqJGOk_VGcJxKD0qJXN1aLrAxJH2zZ0uHbkqdHzBWohW_zgRtge5ocKYJnX3ZINLArgkBS6J30I36zmLsgPHxtHtCozEamOW1Ei00G0FZ_3679XON692gfYM-3xZ_9hGjXy5UpdoV3zmk2x5VcjiN_SR5K4 priority: 102 providerName: ProQuest
Title	Discrete Salp Swarm Algorithm for Euclidean Travelling Salesman Problem
URI	https://link.springer.com/article/10.1007/s10489-022-03976-5 https://www.proquest.com/docview/2816233318
Volume	53
WOSCitedRecordID	wos000850020200003&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: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-7497 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003301 issn: 0924-669X databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZSwMxEB68HnzxFutR8uCbBrpnso9aq4JYivWoviw5tdBDeujfd7LdtSoq6EtgdydhmWQuJjMfwL7LAxrlc6p8EdAwkoJKaQwVnvVUKKRvtcjAJli9zlutpJEXhQ2L2-5FSjLT1B-K3UJ3vQeDp4ozojSahXk0d9wBNlw1b9_1L0boGU4eRhY0jpNWXirz_RqfzdHUx_ySFs2szeny__5zBZZy75IcTY7DKsyY3hosF8gNJBfkdTg7aaO6QH-ZNEXnmTRfxaBLjjqP_UF79NQl6MiS2lh12tqIHrl2CEVZ625HbYZdfNeY4NBswM1p7bp6TnNIBapQ1kYUrTPXscQYQTOdBJpr30TW-io2YWgZ7pK0OtJSmwAneMr3lJLopUgeKxtXTLAJc71-z2wBSZgOPa1FYJnr-JJwG7n6LcsDw_xIiRJ4BWdTlfcbd7AXnXTaKdlxKkVOpRmn0qgEB-9znifdNn6l3i02LM0lb5j63EOPLkBVVYLDYoOmn39ebftv5Duw6JDnJ3cfd2FuNBibPVhQL6P2cFCGWXZ3X4b541q9cYVPF4zieFmpupE1cWxED-Xs3L4B_DnhIg
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JTxsxFH6igFQuZWkRKZsPcCpWM_YsngNCiF2BCIkg5Tb1CpGSkCahiD_Fb-R5FiIqwY0D1xnbGs_7_Bbb730AW_4c0GomqGaS0zBSkiplLZWBC3QoFXNG5mQTSbMp2u30cgqeqlwYf62y0om5ojZ32u-R_2YiQEvNEYJ7g7_Us0b509WKQqOARcM-PmDINto9O0T5bjN2fNQ6OKUlqwDVCLcxRQMlTKzQTTaJSbkRhtnIOaZjG4YuwQ9VzkRGGcuxQ6BZoLVCQ61ErF1ctxzH_QIzIReJX1eNhL5ofs5zuuU6xjQ0jtN2maRTpuqF_nIShn517wLQ6LUhnHi3_x3I5nbueP6z_aEF-FZ61GS_WAKLMGX7SzBfsVWQUnl9h5PDDqpIjBHIlewOyNWDHPbIfvcGpzC-7RF03snRve52jJV90vKsTHm5ct_ajnr47LLg3vkB1x8ynWWY7t_17QqQNDFhYIzkLvFVblLhIp-z5gS3CYu0rEFQyTTTZY11T_XRzSbVoT0OMsRBluMgi2rw66XPoKgw8m7rtUr4WaltRtlE8jXYqeAzef32aD_fH20Tvp62Ls6z87NmYxXmGPp3xV3PNZgeD-_tOszqf-POaLiRrwMCfz4aVs_FVUUp
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JbxMxFH5qA6q4ELaK0EJ9gBNYydizHioUkaREQVGkBCniMngtkbKRpRV_jV_X51kagURuOXCdsa3x-PNb7PfeB_DW3QMaxWKqmODUD6SgUhpDhWc95QvJrBYZ2UTU78fjcTI4gt9lLowLqyxlYiao9UK5M_I6iz3U1BwhWLdFWMSg1fm4_Ekdg5S7aS3pNHKI9MyvW3Tf1pfdFq71O8Y67dGnz7RgGKAKobehqKxiHUo0mXWkE65jzUxgLVOh8X0b4UdLqwMtteHYwVPMU0qi0pZxqGzYMBzHPYYHEfqYLpxwEHy71wKcZ9TLDfRvaBgm4yJhp0jb812gErqBDWcO0OBPpbizdP-6nM10Xqf6P_-tJ_C4sLRJM98aT-HIzJ9BtWSxIIVQew5XrQmKTvQdyFBMl2R4K1Yz0pxe4xQ2P2YEjXrS3qrpRBsxJyPH1pSVMXetzXqGzwY5J88L-HqQ6ZxCZb6Ym5dAkkj7ntaC28hVv0liG7hcNhtzE7FAiRp45fqmqqi97ihApumuarTDRIqYSDNMpEEN3t_3WeaVR_a2Pi-BkBZSaJ3uUFCDDyWUdq__Pdqr_aNdwAmiKf3S7ffO4BFDsy8PAT2Hyma1Na_hobrZTNarN9mWIPD90Ki6AzfzTk0
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+Salp+Swarm+Algorithm+for+Euclidean+Travelling+Salesman+Problem&rft.jtitle=Applied+intelligence+%28Dordrecht%2C+Netherlands%29&rft.au=Panwar%2C+Karuna&rft.au=Deep%2C+Kusum&rft.date=2023-05-01&rft.pub=Springer+US&rft.issn=0924-669X&rft.eissn=1573-7497&rft.volume=53&rft.issue=10&rft.spage=11420&rft.epage=11438&rft_id=info:doi/10.1007%2Fs10489-022-03976-5&rft.externalDocID=10_1007_s10489_022_03976_5
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0924-669X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0924-669X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0924-669X&client=summon