A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem
•A new discrete bat algorithm based on Lévy flights is proposed.•2-opt, 2.5-opt and 3-opt define the movement of bats in the search space.•A modified uniform crossover is designed for diversification and intensification.•Bat algorithm is tested on set of symmetric instances from TSPLIB.•Statistical...
Saved in:
| Published in: | Expert systems with applications Vol. 172; p. 114639 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Elsevier Ltd
15.06.2021
Elsevier BV |
| Subjects: | |
| ISSN: | 0957-4174, 1873-6793 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | •A new discrete bat algorithm based on Lévy flights is proposed.•2-opt, 2.5-opt and 3-opt define the movement of bats in the search space.•A modified uniform crossover is designed for diversification and intensification.•Bat algorithm is tested on set of symmetric instances from TSPLIB.•Statistical tests prove the superiority of the discrete bat algorithm.
Bat algorithm is a swarm-intelligence-based metaheuristic proposed in 2010. This algorithm was inspired by echolocation behavior of bats when searching their prey in nature. Since it first introduction, it continues to be used extensively until today, owing to its simplicity, easy handling and applicability to a wide range of problems. However, sometimes the major challenge faced by this technique is can be trapped in a local optimum when facing large complex problems. In this research work, a new discrete bat algorithm is proposed to solve the famous traveling salesman problem as NP-hard combinatorial optimization problem. To enhance the searching strategy and to avoid getting stuck in local minima, random walks based on Lévy's flights are combined with bat’s movement. In addition, to improve the diversity and convergence of the swarm, a neutral crossover operator is embedded to the proposed algorithm. To evaluate the performance of our proposal, two experiments are conducted on 38 benchmark datasets and the obtained results are compared with eight different approaches. Furthermore, the student’s t-test, the Friedman’s test and the post hoc Wilcoxon's test are performed to check whether there are significant differences between the proposed optimizer and the alternative techniques. The experimental results under comparative studies have shown that, in most cases, the proposed discrete bat algorithm yields significantly better results compared with its competitors. |
|---|---|
| AbstractList | •A new discrete bat algorithm based on Lévy flights is proposed.•2-opt, 2.5-opt and 3-opt define the movement of bats in the search space.•A modified uniform crossover is designed for diversification and intensification.•Bat algorithm is tested on set of symmetric instances from TSPLIB.•Statistical tests prove the superiority of the discrete bat algorithm.
Bat algorithm is a swarm-intelligence-based metaheuristic proposed in 2010. This algorithm was inspired by echolocation behavior of bats when searching their prey in nature. Since it first introduction, it continues to be used extensively until today, owing to its simplicity, easy handling and applicability to a wide range of problems. However, sometimes the major challenge faced by this technique is can be trapped in a local optimum when facing large complex problems. In this research work, a new discrete bat algorithm is proposed to solve the famous traveling salesman problem as NP-hard combinatorial optimization problem. To enhance the searching strategy and to avoid getting stuck in local minima, random walks based on Lévy's flights are combined with bat’s movement. In addition, to improve the diversity and convergence of the swarm, a neutral crossover operator is embedded to the proposed algorithm. To evaluate the performance of our proposal, two experiments are conducted on 38 benchmark datasets and the obtained results are compared with eight different approaches. Furthermore, the student’s t-test, the Friedman’s test and the post hoc Wilcoxon's test are performed to check whether there are significant differences between the proposed optimizer and the alternative techniques. The experimental results under comparative studies have shown that, in most cases, the proposed discrete bat algorithm yields significantly better results compared with its competitors. Bat algorithm is a swarm-intelligence-based metaheuristic proposed in 2010. This algorithm was inspired by echolocation behavior of bats when searching their prey in nature. Since it first introduction, it continues to be used extensively until today, owing to its simplicity, easy handling and applicability to a wide range of problems. However, sometimes the major challenge faced by this technique is can be trapped in a local optimum when facing large complex problems. In this research work, a new discrete bat algorithm is proposed to solve the famous traveling salesman problem as NP-hard combinatorial optimization problem. To enhance the searching strategy and to avoid getting stuck in local minima, random walks based on Lévy's flights are combined with bat's movement. In addition, to improve the diversity and convergence of the swarm, a neutral crossover operator is embedded to the proposed algorithm. To evaluate the performance of our proposal, two experiments are conducted on 38 benchmark datasets and the obtained results are compared with eight different approaches. Furthermore, the student's t-test, the Friedman's test and the post hoc Wilcoxon's test are performed to check whether there are significant differences between the proposed optimizer and the alternative techniques. The experimental results under comparative studies have shown that, in most cases, the proposed discrete bat algorithm yields significantly better results compared with its competitors. |
| ArticleNumber | 114639 |
| Author | Saji, Yassine Barkatou, Mohammed |
| Author_xml | – sequence: 1 givenname: Yassine surname: Saji fullname: Saji, Yassine email: saji.y@ucd.ac.ma, yassine.saji@gmail.com organization: Department of Computer Science, Faculty of Sciences, Chouaïb Doukkali University, El Jadida, Morocco – sequence: 2 givenname: Mohammed surname: Barkatou fullname: Barkatou, Mohammed email: barkatou.m@ucd.ac.ma organization: Laboratory of Innovation in Science, Technology and Modeling, Faculty of Sciences, Chouaib Doukkali University, El Jadida, Morocco |
| BookMark | eNp9kM1KAzEUhYMoWH9ewFXA9dTczEwyATdS6g8U3Ci4C5nkTk2ZTjRJKz6Sz-GLOaWuXLi63Mv57uGcE3I4hAEJuQA2BQbiajXF9GGmnHGYAlSiVAdkAo0sCyFVeUgmTNWyqEBWx-QkpRVjIBmTE_JyQ51PNmJG2ppMTb8M0efX9bgldDQMdPH9tf2kXe-XrznRLkQ639jeOzQDzdFssffDkibTY1qPp7cY2h7XZ-SoM33C8995Sp5v50-z-2LxePcwu1kUtuRNLkBw60TLJTLbKWsBhWpbxTpZNpVpG6uAg0PmmOwEGCcEF6YxSmHNq6asylNyuf87-r5vMGW9Cps4jJaa11DLWpQgRlWzV9kYUorYaeuzyT4MYwLfa2B616Ne6V2Petej3vc4ovwP-hb92sTP_6HrPYRj9K3HqJP1OFh0PqLN2gX_H_4DwROO_Q |
| CitedBy_id | crossref_primary_10_1007_s00500_025_10638_4 crossref_primary_10_1016_j_matcom_2023_12_003 crossref_primary_10_1016_j_eswa_2021_115948 crossref_primary_10_1007_s10489_022_03314_9 crossref_primary_10_1007_s10489_022_03256_2 crossref_primary_10_1007_s10845_024_02506_z crossref_primary_10_1109_ACCESS_2021_3128433 crossref_primary_10_3390_math10152785 crossref_primary_10_1007_s42979_024_03417_9 crossref_primary_10_3390_sym15010059 crossref_primary_10_1016_j_knosys_2021_107257 crossref_primary_10_1109_TCDS_2022_3212062 crossref_primary_10_1007_s11831_024_10090_x crossref_primary_10_1016_j_jocs_2022_101934 crossref_primary_10_1111_itor_13452 crossref_primary_10_1007_s00521_024_10475_w crossref_primary_10_1080_19942060_2021_1982777 crossref_primary_10_3390_app13052878 crossref_primary_10_3390_biomimetics9020118 crossref_primary_10_1016_j_eswa_2023_120879 crossref_primary_10_3390_math10183249 crossref_primary_10_1080_01490419_2021_1993386 crossref_primary_10_1007_s13369_022_06835_0 crossref_primary_10_1155_2021_9922192 crossref_primary_10_1007_s40747_024_01716_5 crossref_primary_10_1007_s12555_021_0062_8 crossref_primary_10_1016_j_engappai_2022_104848 crossref_primary_10_1007_s10489_022_04036_8 crossref_primary_10_1007_s11227_023_05067_9 crossref_primary_10_1093_jcde_qwac014 crossref_primary_10_1016_j_eswa_2023_122940 crossref_primary_10_1007_s10836_025_06173_7 crossref_primary_10_1016_j_asoc_2022_108469 crossref_primary_10_1007_s40747_022_00716_7 crossref_primary_10_1088_1361_6501_adbf3c crossref_primary_10_3390_math11143221 crossref_primary_10_1016_j_engappai_2021_104453 crossref_primary_10_1007_s13369_021_06033_4 crossref_primary_10_1016_j_asoc_2023_110908 crossref_primary_10_1155_2022_1344667 crossref_primary_10_1080_23270012_2023_2229842 crossref_primary_10_3389_fbioe_2021_791566 crossref_primary_10_1016_j_asoc_2022_109339 crossref_primary_10_1007_s11042_023_16448_w crossref_primary_10_1109_ACCESS_2023_3320562 crossref_primary_10_3390_s23020782 crossref_primary_10_1007_s00521_023_08370_x crossref_primary_10_1016_j_asoc_2023_110193 crossref_primary_10_1016_j_scs_2021_103075 crossref_primary_10_1016_j_eswa_2022_119326 crossref_primary_10_1016_j_asoc_2022_109943 crossref_primary_10_1109_ACCESS_2022_3205756 |
| Cites_doi | 10.1016/j.energy.2015.12.096 10.1016/j.ijepes.2018.03.019 10.1007/s13042-017-0739-8 10.1080/0305215X.2015.1076402 10.1007/s10489-017-1135-5 10.1007/978-3-642-23163-6_9 10.1287/ijoc.1.3.190 10.1007/978-3-319-67669-2_4 10.1504/IJCSM.2013.057246 10.1109/CEC.2015.7256928 10.1016/j.eswa.2016.10.050 10.1051/ro/197610V100551 10.5772/547 10.1109/TMAG.2011.2176108 10.1155/2017/3235720 10.1007/BF02192047 10.1016/j.swevo.2019.04.002 10.1016/j.eswa.2018.04.024 10.1002/j.1538-7305.1965.tb04146.x 10.1016/j.asoc.2014.11.029 10.1016/j.eswa.2017.06.007 10.1007/BF02125403 10.1007/s10589-005-4798-5 10.1504/IJBIC.2009.022775 10.1016/j.ins.2010.06.032 10.1016/0377-2217(96)00007-0 10.1177/003754970107600201 10.1016/j.engappai.2015.10.006 10.1023/A:1011375326814 10.1109/ICNN.1995.488968 10.21236/ADA126957 10.1287/opre.2.4.393 10.1007/s00500-017-2760-y 10.1007/978-3-540-39930-8_8 10.1007/s00500-016-2432-3 10.1155/2014/630280 10.1109/LOGISTIQUA.2017.7962875 10.1287/ijoc.4.4.387 10.1287/opre.6.6.791 10.1016/j.swevo.2018.05.006 10.1080/08839514.2015.1038434 10.1504/IJMOR.2016.077560 10.1016/j.resourpol.2017.10.015 10.1007/978-3-319-05035-5_2 10.1007/s40747-017-0050-z 10.1016/j.physa.2006.04.052 10.1504/IJAACS.2019.098589 10.1007/978-3-642-12538-6_6 10.1023/A:1006529012972 10.1007/s12204-019-2039-9 10.1016/j.asoc.2018.06.047 10.1108/02644401211235834 10.1504/IJBIC.2013.055093 10.1007/s00500-016-2469-3 10.1016/j.eij.2017.02.003 10.1155/2013/392789 10.1287/ijoc.3.4.376 10.1016/j.asoc.2015.01.068 10.4028/www.scientific.net/AMM.148-149.134 10.1007/s10845-015-1121-x 10.1109/NABIC.2009.5393690 10.1016/j.swevo.2018.04.001 10.1103/PhysRevE.49.4677 10.1504/IJBIC.2011.042259 10.1016/S0303-2647(97)01708-5 10.1126/science.220.4598.671 10.1016/S0020-0255(99)00026-2 10.1504/IJBIC.2014.060598 10.1109/SIBGRAPI.2012.47 10.1007/s00521-013-1402-2 10.1016/j.ejor.2018.06.039 10.1007/s00521-013-1525-5 10.1016/j.ins.2014.08.050 10.1109/4235.974843 10.1109/TPWRS.2018.2812711 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Ltd Copyright Elsevier BV Jun 15, 2021 |
| Copyright_xml | – notice: 2021 Elsevier Ltd – notice: Copyright Elsevier BV Jun 15, 2021 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.eswa.2021.114639 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6793 |
| ExternalDocumentID | 10_1016_j_eswa_2021_114639 S0957417421000804 |
| GroupedDBID | --K --M .DC .~1 0R~ 13V 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABBOA ABFNM ABMAC ABMVD ABUCO ABYKQ ACDAQ ACGFS ACHRH ACNTT ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGJBL AGUBO AGUMN AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM AXJTR BJAXD BKOJK BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W JJJVA KOM LG9 LY1 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSL SST SSV SSZ T5K TN5 ~G- 29G 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABJNI ABKBG ABUFD ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB G-2 HLZ HVGLF HZ~ R2- SBC SET SEW WUQ XPP ZMT ~HD 7SC 8FD AFXIZ AGCQF AGRNS BNPGV JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c328t-162cd6b27e0cf9cc1e69bb90f7384ab8c9121de0d07f61ad6626a8a99e5248343 |
| ISICitedReferencesCount | 60 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000630933400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0957-4174 |
| IngestDate | Fri Jul 25 02:09:20 EDT 2025 Sat Nov 29 07:08:04 EST 2025 Tue Nov 18 22:10:05 EST 2025 Fri Feb 23 02:46:02 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Lévy flights Traveling salesman problem Population-based metaheuristics Bat algorithm NP-hard combinatorial optimization problem |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c328t-162cd6b27e0cf9cc1e69bb90f7384ab8c9121de0d07f61ad6626a8a99e5248343 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2515756316 |
| PQPubID | 2045477 |
| ParticipantIDs | proquest_journals_2515756316 crossref_citationtrail_10_1016_j_eswa_2021_114639 crossref_primary_10_1016_j_eswa_2021_114639 elsevier_sciencedirect_doi_10_1016_j_eswa_2021_114639 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-06-15 |
| PublicationDateYYYYMMDD | 2021-06-15 |
| PublicationDate_xml | – month: 06 year: 2021 text: 2021-06-15 day: 15 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Expert systems with applications |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd Elsevier BV |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier BV |
| References | Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks (Vol. 4, pp. 1942–1948). Khan, K., Nikov, A., & Sahai, A. (2011). A Fuzzy Bat Clustering Method for Ergonomic Screening of Office Workplaces. In D. Dicheva, Z. Markov & E. Stefanova (Eds.), Third International Conference on Software, Services and Semantic Technologies S3T 2011 (Vol. 101, pp. 59–66): Springer Berlin Heidelberg. Cai, Qi, Cai, Huang, Chen (b0050) 2019; 12 Chawla, Duhan (b0065) 2015; 29 Huang, X., Zeng, X., & Han, R. (2017). Dynamic inertia weight binary bat algorithm with neighborhood search. Computational Intelligence Neuroscience, 2017. Liang, Liu, Li, Shen (b0225) 2018; 101 Talafuse, Pohl (b0405) 2016; 48 Marinakis, Migdalas, Pardalos (b0270) 2005; 32 Yang, He (b0455) 2013; 5 Anbuudayasankar, S., Ganesh, K., & Mohapatra, S. (2014). Survey of methodologies for tsp and vrp. In: Models for Practical Routing Problems in Logistics (pp. 11–42): Springer. Cai, Wang, Cui, Cai, Xue, Wang (b0045) 2018; 9 Jayabarathi, Raghunathan, Gandomi (b0175) 2018 Osaba, Yang, Diaz, Lopez-Garcia, Carballedo (b0295) 2016; 48 Sur, Sharma, Shukla (b0385) 2013 Dehghani, Bogdanovic (b0115) 2018; 55 Khan, Maiti (b0195) 2019; 44 Wang, G.-G., Chang, B., & Zhang, Z. (2015). A multi-swarm bat algorithm for global optimization. In 2015 IEEE congress on evolutionary computation (CEC) (pp. 480–485): IEEE. Riffi, Saji, Barkatou (b0345) 2017 Lin (b0240) 1965; 44 Perez, Valdez, Castillo, Melin, Gonzalez, Martinez (b0315) 2017; 21 Lu, Jiang (b0245) 2019 Marinakis, Marinaki, Dounias (b0265) 2011; 181 Chawla, Duhan (b0070) 2015; 29 Yang, X.-S., & Deb, S. (2009). Cuckoo search via Lévy flights. In Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on (pp. 210–214): IEEE. Papadimitriou, Steiglitz (b0310) 1998 Davis (b0110) 1985; 85 Kirkpatrick, Gelatt, Vecchi (b0205) 1983; 220 Lawler (b0220) 1985 Yang (b0440) 2011; 3 Zhou, Zhao, Liu (b0475) 2018; 48 Satapathy, Raja, Rajinikanth, Ashour, Dey (b0375) 2018 Bora, Coelho, d. S., & Lebensztajn, L. (b0035) 2012; 48 Gülcü, Mahi, Baykan, Kodaz (b0150) 2018; 22 Yang, X.-S. (2010). A new metaheuristic bat-inspired algorithm. In Nature inspired cooperative strategies for optimization (NICSO 2010) (pp. 65–74): Springer. Jaddi, Abdullah, Hamdan (b0165) 2015; 294 Clerc, M. (2004). Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: New optimization techniques in engineering (pp. 219–239): Springer. Ezugwu, Adewumi (b0130) 2017; 87 Mahi, Baykan, Kodaz (b0255) 2015; 30 Yang, Pei (b0430) 2013; 4 Yılmaz, Küçüksille (b0460) 2015; 28 Osaba, Yang, Fister, Del Ser, Lopez-Garcia, Vazquez-Pardavila (b0300) 2019; 44 Saji, Riffi (b0365) 2015 Yang, Gandomi (b0450) 2012; 29 Reinelt (b0340) 1991; 3 Dao, Pan, Pan (b0100) 2018; 29 Tsai, P. W., Pan, J. S., Liao, B. Y., Tsai, M. J., & Istanda, V. (2012). Bat algorithm inspired algorithm for solving numerical optimization problems. In Applied mechanics and materials (Vol. 148, pp. 134–137): Trans Tech Publ. Al-Betar, Awadallah (b0010) 2018; 107 Larrañaga, Kuijpers, Murga, Inza, Dizdarevic (b0215) 1999; 13 Chen, Y., & Zhang, P. (2006). Optimized annealing of traveling salesman problem from the n th-nearest-neighbor distribution. Physica A: Statistical Mechanics and its Applications, 371, 627–632. Glover (b0145) 1989; 1 Croes (b0090) 1958; 6 Hatamlou (b0155) 2018; 22 Dong, Wang, Wang, Wang (b0120) 2019; 24 Christofides (b0080) 1976; 10 Cantú-Paz (b0055) 2001; 7 Osaba, E., Carballedo, R., Yang, X. -S., Fister Jr, I., Lopez-Garcia, P., & Del Ser, J. (2018). On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators. In Nature-Inspired Algorithms and Applied Optimization (pp. 69–89): Springer. Tosun, Ö., & Marichelvam, M. (2016). Hybrid bat algorithm for flow shop scheduling problems. International Journal of Mathematics in Operational Research, 9, 125-138. Komarasamy, Wahi (b0210) 2012; 84 Zhou, Y., Xie, J., & Zheng, H. (2013). A Hybrid Bat Algorithm with Path Relinking for Capacitated Vehicle Routing Problem Mathematical Problems in Engineering, 2013, 10. Sahana (b0360) 2019 Gilbert (b0140) 1989 Bentley (b0030) 1992; 4 Luo, Q., Zhou, Y., Xie, J., Ma, M., & Li, L. (2014). Discrete bat algorithm for optimal problem of permutation flow shop scheduling. The Scientific World Journal, 2014. Davendra, D. (2010). Traveling salesman problem, theory and applications. Pirlot (b0325) 1996; 92 Dorigo, Gambardella (b0125) 1997; 43 Osaba, Del Ser, Sadollah, Bilbao, Camacho (b0290) 2018; 71 Chakri, Khelif, Benouaret, Yang (b0060) 2017; 69 Balas, E., & Toth, P. (1983). Branch and bound methods for the traveling salesman problem. In: Carnegie-Mellon Univ Pittsburgh PA Management Sciences Research Group. Zhong, Wang, Lin, Zhang (b0470) 2019 Lin, Chou, Yang, Tsai (b0235) 2012; 2 Boryczka, Szwarc (b0040) 2019 Nakamura, R. Y., Pereira, L. A., Costa, K., Rodrigues, D., Papa, J. P., & Yang, X. -S. (2012). BBA: A binary bat algorithm for feature selection. In Graphics, Patterns and Images (SIBGRAPI), 2012 25th SIBGRAPI Conference on (pp. 291–297): IEEE. Rizk-Allah, Hassanien, Ella (b0350) 2018; 4 Geem, Kim, Loganathan (b0135) 2001; 76 Potvin (b0330) 1996; 63 Wong (b0425) 1995; 87 Taillard, Helsgaun (b0400) 2019; 272 Adarsh, Raghunathan, Jayabarathi, Yang (b0005) 2016; 96 Jati, Manurung (b0170) 2013 Ouaarab, Ahiod, Yang (b0305) 2014; 24 Zachariasen, Dam (b0465) 1996 Liang, Liu, Shen, Li, Man (b0230) 2018; 33 Pham, D., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., & Zaidi, M. (2005). The bees algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK. Sabba, Chikhi (b0355) 2014; 6 Dantzig, Fulkerson, Johnson (b0095) 1954; 2 Syswerda, G. (1991). Scheduling optimization using genetic algorithms. In Handbook of genetic algorithms (Van Norslrand Reinhold ed., pp. 332–349). New York: L. Davis. Saji, Riffi, Ahiod (b0370) 2014 Kavousi-Fard, Niknam, Fotuhi-Firuzabad (b0185) 2016; 7 Taha, A., Hachimi, M., & Moudden, A. (2017). A discrete Bat Algorithm for the vehicle routing problem with time windows. In 2017 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA) (pp. 65–70): IEEE. Jiang (b0180) 2016 Shah-Hosseini (b0380) 2009; 1 Mantegna (b0260) 1994; 49 Mirjalili, Mirjalili, Yang (b0275) 2014; 25 Qu, Sun (b0335) 1999; 117 Baraglia, Hidalgo, Perego (b0025) 2001; 5 Liang (10.1016/j.eswa.2021.114639_b0230) 2018; 33 Sahana (10.1016/j.eswa.2021.114639_b0360) 2019 Hatamlou (10.1016/j.eswa.2021.114639_b0155) 2018; 22 Lin (10.1016/j.eswa.2021.114639_b0240) 1965; 44 Riffi (10.1016/j.eswa.2021.114639_b0345) 2017 Pirlot (10.1016/j.eswa.2021.114639_b0325) 1996; 92 Mahi (10.1016/j.eswa.2021.114639_b0255) 2015; 30 Sur (10.1016/j.eswa.2021.114639_b0385) 2013 Saji (10.1016/j.eswa.2021.114639_b0370) 2014 10.1016/j.eswa.2021.114639_b0435 Dantzig (10.1016/j.eswa.2021.114639_b0095) 1954; 2 Ezugwu (10.1016/j.eswa.2021.114639_b0130) 2017; 87 10.1016/j.eswa.2021.114639_b0395 10.1016/j.eswa.2021.114639_b0075 Wong (10.1016/j.eswa.2021.114639_b0425) 1995; 87 Cantú-Paz (10.1016/j.eswa.2021.114639_b0055) 2001; 7 Bora (10.1016/j.eswa.2021.114639_b0035) 2012; 48 Kavousi-Fard (10.1016/j.eswa.2021.114639_b0185) 2016; 7 Larrañaga (10.1016/j.eswa.2021.114639_b0215) 1999; 13 Potvin (10.1016/j.eswa.2021.114639_b0330) 1996; 63 10.1016/j.eswa.2021.114639_b0390 Boryczka (10.1016/j.eswa.2021.114639_b0040) 2019 Perez (10.1016/j.eswa.2021.114639_b0315) 2017; 21 Osaba (10.1016/j.eswa.2021.114639_b0290) 2018; 71 Zhou (10.1016/j.eswa.2021.114639_b0475) 2018; 48 Mantegna (10.1016/j.eswa.2021.114639_b0260) 1994; 49 Ouaarab (10.1016/j.eswa.2021.114639_b0305) 2014; 24 Geem (10.1016/j.eswa.2021.114639_b0135) 2001; 76 Yang (10.1016/j.eswa.2021.114639_b0440) 2011; 3 Gilbert (10.1016/j.eswa.2021.114639_b0140) 1989 Lin (10.1016/j.eswa.2021.114639_b0235) 2012; 2 Dao (10.1016/j.eswa.2021.114639_b0100) 2018; 29 Zhong (10.1016/j.eswa.2021.114639_b0470) 2019 Chawla (10.1016/j.eswa.2021.114639_b0065) 2015; 29 Glover (10.1016/j.eswa.2021.114639_b0145) 1989; 1 Liang (10.1016/j.eswa.2021.114639_b0225) 2018; 101 10.1016/j.eswa.2021.114639_b0445 10.1016/j.eswa.2021.114639_b0200 Cai (10.1016/j.eswa.2021.114639_b0045) 2018; 9 Mirjalili (10.1016/j.eswa.2021.114639_b0275) 2014; 25 10.1016/j.eswa.2021.114639_b0320 10.1016/j.eswa.2021.114639_b0285 10.1016/j.eswa.2021.114639_b0085 10.1016/j.eswa.2021.114639_b0480 10.1016/j.eswa.2021.114639_b0160 Khan (10.1016/j.eswa.2021.114639_b0195) 2019; 44 10.1016/j.eswa.2021.114639_b0280 Jaddi (10.1016/j.eswa.2021.114639_b0165) 2015; 294 Qu (10.1016/j.eswa.2021.114639_b0335) 1999; 117 Cai (10.1016/j.eswa.2021.114639_b0050) 2019; 12 Shah-Hosseini (10.1016/j.eswa.2021.114639_b0380) 2009; 1 Rizk-Allah (10.1016/j.eswa.2021.114639_b0350) 2018; 4 Yang (10.1016/j.eswa.2021.114639_b0430) 2013; 4 Saji (10.1016/j.eswa.2021.114639_b0365) 2015 Reinelt (10.1016/j.eswa.2021.114639_b0340) 1991; 3 Jiang (10.1016/j.eswa.2021.114639_b0180) 2016 Papadimitriou (10.1016/j.eswa.2021.114639_b0310) 1998 10.1016/j.eswa.2021.114639_b0415 Jati (10.1016/j.eswa.2021.114639_b0170) 2013 10.1016/j.eswa.2021.114639_b0015 Kirkpatrick (10.1016/j.eswa.2021.114639_b0205) 1983; 220 Davis (10.1016/j.eswa.2021.114639_b0110) 1985; 85 10.1016/j.eswa.2021.114639_b0410 Satapathy (10.1016/j.eswa.2021.114639_b0375) 2018 Adarsh (10.1016/j.eswa.2021.114639_b0005) 2016; 96 10.1016/j.eswa.2021.114639_b0250 Osaba (10.1016/j.eswa.2021.114639_b0295) 2016; 48 Yang (10.1016/j.eswa.2021.114639_b0455) 2013; 5 Komarasamy (10.1016/j.eswa.2021.114639_b0210) 2012; 84 Lu (10.1016/j.eswa.2021.114639_b0245) 2019 Chakri (10.1016/j.eswa.2021.114639_b0060) 2017; 69 Marinakis (10.1016/j.eswa.2021.114639_b0270) 2005; 32 Yılmaz (10.1016/j.eswa.2021.114639_b0460) 2015; 28 Al-Betar (10.1016/j.eswa.2021.114639_b0010) 2018; 107 10.1016/j.eswa.2021.114639_b0190 Osaba (10.1016/j.eswa.2021.114639_b0300) 2019; 44 Bentley (10.1016/j.eswa.2021.114639_b0030) 1992; 4 Dehghani (10.1016/j.eswa.2021.114639_b0115) 2018; 55 Sabba (10.1016/j.eswa.2021.114639_b0355) 2014; 6 Christofides (10.1016/j.eswa.2021.114639_b0080) 1976; 10 Talafuse (10.1016/j.eswa.2021.114639_b0405) 2016; 48 Croes (10.1016/j.eswa.2021.114639_b0090) 1958; 6 Yang (10.1016/j.eswa.2021.114639_b0450) 2012; 29 Zachariasen (10.1016/j.eswa.2021.114639_b0465) 1996 Lawler (10.1016/j.eswa.2021.114639_b0220) 1985 Baraglia (10.1016/j.eswa.2021.114639_b0025) 2001; 5 10.1016/j.eswa.2021.114639_b0105 Dorigo (10.1016/j.eswa.2021.114639_b0125) 1997; 43 Chawla (10.1016/j.eswa.2021.114639_b0070) 2015; 29 Jayabarathi (10.1016/j.eswa.2021.114639_b0175) 2018 10.1016/j.eswa.2021.114639_b0420 Gülcü (10.1016/j.eswa.2021.114639_b0150) 2018; 22 10.1016/j.eswa.2021.114639_b0020 Dong (10.1016/j.eswa.2021.114639_b0120) 2019; 24 Marinakis (10.1016/j.eswa.2021.114639_b0265) 2011; 181 Taillard (10.1016/j.eswa.2021.114639_b0400) 2019; 272 |
| References_xml | – volume: 1 start-page: 71 year: 2009 end-page: 79 ident: b0380 article-title: The intelligent water drops algorithm: A nature-inspired swarm-based optimization algorithm publication-title: International Journal of Bio-Inspired Computation – volume: 44 start-page: 428 year: 2019 end-page: 438 ident: b0195 article-title: A swap sequence based artificial bee colony algorithm for traveling salesman problem publication-title: Swarm Evolutionary Computation – volume: 48 start-page: 900 year: 2016 end-page: 910 ident: b0405 article-title: A bat algorithm for the redundancy allocation problem publication-title: Engineering Optimization – volume: 85 start-page: 162 year: 1985 end-page: 164 ident: b0110 article-title: Applying adaptive algorithms to epistatic domains publication-title: IJCAI – volume: 29 start-page: 451 year: 2018 end-page: 462 ident: b0100 article-title: Parallel bat algorithm for optimizing makespan in job shop scheduling problems publication-title: Journal of Intelligent Manufacturing – volume: 21 start-page: 667 year: 2017 end-page: 685 ident: b0315 article-title: Interval type-2 fuzzy logic for dynamic parameter adaptation in the bat algorithm publication-title: Soft Computing – reference: Yang, X.-S., & Deb, S. (2009). Cuckoo search via Lévy flights. In Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on (pp. 210–214): IEEE. – volume: 5 start-page: 613 year: 2001 end-page: 622 ident: b0025 article-title: A hybrid heuristic for the traveling salesman problem publication-title: IEEE Transactions on Evolutionary Computation – volume: 32 start-page: 231 year: 2005 end-page: 257 ident: b0270 article-title: Expanding neighborhood GRASP for the traveling salesman problem publication-title: Computational Optimization and Applications – start-page: 295 year: 2013 end-page: 312 ident: b0170 publication-title: Discrete firefly algorithm for traveling salesman problem: A new movement scheme – volume: 101 start-page: 103 year: 2018 end-page: 115 ident: b0225 article-title: A multiobjective hybrid bat algorithm for combined economic/emission dispatch publication-title: International Journal of Electrical Power Energy Systems – start-page: 254 year: 2013 end-page: 267 ident: b0385 publication-title: Solving travelling salesman problem using Egyptian vulture optimization algorithm–a new approach – volume: 29 start-page: 617 year: 2015 end-page: 634 ident: b0070 article-title: Bat algorithm: a survey of the state-of-the-art publication-title: Applied Artificial Intelligence – volume: 22 start-page: 8167 year: 2018 end-page: 8175 ident: b0155 article-title: Solving travelling salesman problem using black hole algorithm publication-title: Soft Computing – start-page: 1 year: 2018 end-page: 23 ident: b0375 article-title: Multi-level image thresholding using Otsu and chaotic bat algorithm publication-title: Neural Computing Applications – volume: 4 start-page: 214 year: 2013 end-page: 221 ident: b0430 article-title: Hybrid ABC/PSO to solve travelling salesman problem publication-title: International Journal of Computing Science Mathematics – volume: 29 start-page: 617 year: 2015 end-page: 634 ident: b0065 article-title: Bat algorithm: a survey of the state-of-the-art publication-title: Applied Artificial Intelligence – volume: 10 start-page: 55 year: 1976 end-page: 70 ident: b0080 article-title: The vehicle routing problem. Revue française d'automatique, informatique, recherche opérationnelle publication-title: Recherche Opérationnelle – volume: 25 start-page: 663 year: 2014 end-page: 681 ident: b0275 article-title: Binary bat algorithm publication-title: Neural Computing and Applications – volume: 63 start-page: 337 year: 1996 end-page: 370 ident: b0330 article-title: Genetic algorithms for the traveling salesman problem publication-title: Annals of Operations Research – reference: Yang, X.-S. (2010). A new metaheuristic bat-inspired algorithm. In Nature inspired cooperative strategies for optimization (NICSO 2010) (pp. 65–74): Springer. – volume: 87 start-page: 197 year: 1995 end-page: 220 ident: b0425 article-title: Matrix representation and gradient flows for NP-hard problems publication-title: Journal of Optimization Theory and Applications – volume: 48 start-page: 3081 year: 2018 end-page: 3093 ident: b0475 article-title: A multiobjective discrete bat algorithm for community detection in dynamic networks publication-title: Applied Intelligence – year: 1985 ident: b0220 article-title: The traveling salesman problem: a guided tour of combinatorial optimization. publication-title: Wiley-Interscience Series Discrete Mathematics – volume: 71 start-page: 277 year: 2018 end-page: 290 ident: b0290 article-title: A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem publication-title: Applied Soft Computing – volume: 76 start-page: 60 year: 2001 end-page: 68 ident: b0135 article-title: A new heuristic optimization algorithm: harmony search publication-title: Simulation – volume: 44 start-page: 2245 year: 1965 end-page: 2269 ident: b0240 article-title: Computer solutions of the traveling salesman problem publication-title: Bell System Technical Journal – volume: 6 start-page: 791 year: 1958 end-page: 812 ident: b0090 article-title: A method for solving traveling-salesman problems publication-title: Operations Research – volume: 220 start-page: 671 year: 1983 end-page: 680 ident: b0205 article-title: Optimization by simulated annealing publication-title: Science – year: 2017 ident: b0345 article-title: Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem publication-title: Egyptian Informatics Journal – volume: 29 start-page: 464 year: 2012 end-page: 483 ident: b0450 article-title: Bat algorithm: a novel approach for global engineering optimization publication-title: Engineering Computations – volume: 92 start-page: 493 year: 1996 end-page: 511 ident: b0325 article-title: General local search methods publication-title: European Journal of Operational Research – volume: 2 start-page: 393 year: 1954 end-page: 410 ident: b0095 article-title: Solution of a large-scale traveling-salesman problem publication-title: Journal of the Operations Research Society of America – start-page: 343 year: 2016 end-page: 347 ident: b0180 article-title: Discrete bat algorithm for traveling salesman problem – start-page: 1 year: 2015 end-page: 14 ident: b0365 article-title: A novel discrete bat algorithm for solving the travelling salesman problem publication-title: Neural Computing and Applications – volume: 5 start-page: 141 year: 2013 end-page: 149 ident: b0455 article-title: Bat algorithm: literature review and applications publication-title: International Journal of Bio-Inspired Computation – reference: Anbuudayasankar, S., Ganesh, K., & Mohapatra, S. (2014). Survey of methodologies for tsp and vrp. In: Models for Practical Routing Problems in Logistics (pp. 11–42): Springer. – reference: Huang, X., Zeng, X., & Han, R. (2017). Dynamic inertia weight binary bat algorithm with neighborhood search. Computational Intelligence Neuroscience, 2017. – reference: Khan, K., Nikov, A., & Sahai, A. (2011). A Fuzzy Bat Clustering Method for Ergonomic Screening of Office Workplaces. In D. Dicheva, Z. Markov & E. Stefanova (Eds.), Third International Conference on Software, Services and Semantic Technologies S3T 2011 (Vol. 101, pp. 59–66): Springer Berlin Heidelberg. – volume: 48 start-page: 59 year: 2016 end-page: 71 ident: b0295 article-title: An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems publication-title: Engineering Applications of Artificial Intelligence – volume: 7 start-page: 311 year: 2001 end-page: 334 ident: b0055 article-title: Migration policies, selection pressure, and parallel evolutionary algorithms publication-title: Journal of Heuristics – volume: 294 start-page: 628 year: 2015 end-page: 644 ident: b0165 article-title: Multi-population cooperative bat algorithm-based optimization of artificial neural network model publication-title: Information Sciences – volume: 7 start-page: 740 year: 2016 end-page: 750 ident: b0185 article-title: A novel stochastic framework based on cloud theory and $\theta $-modified bat algorithm to solve the distribution feeder reconfiguration publication-title: IEEE Transactions on Smart Grid – reference: Syswerda, G. (1991). Scheduling optimization using genetic algorithms. In Handbook of genetic algorithms (Van Norslrand Reinhold ed., pp. 332–349). New York: L. Davis. – start-page: 1 year: 2019 end-page: 10 ident: b0360 article-title: Hybrid optimizer for the travelling salesman problem publication-title: Evolutionary Intelligence – volume: 3 start-page: 376 year: 1991 end-page: 384 ident: b0340 article-title: TSPLIB—A traveling salesman problem library publication-title: ORSA Journal on Computing – reference: Tosun, Ö., & Marichelvam, M. (2016). Hybrid bat algorithm for flow shop scheduling problems. International Journal of Mathematics in Operational Research, 9, 125-138. – year: 2019 ident: b0470 article-title: Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem publication-title: Swarm Evolutionary Computation – volume: 24 start-page: 41 year: 2019 end-page: 47 ident: b0120 article-title: Hybrid optimization algorithm based on wolf pack search and local search for solving traveling salesman problem publication-title: Journal of Shanghai Jiaotong University – volume: 181 start-page: 4684 year: 2011 end-page: 4698 ident: b0265 article-title: Honey bees mating optimization algorithm for the Euclidean traveling salesman problem publication-title: Information Sciences – reference: Nakamura, R. Y., Pereira, L. A., Costa, K., Rodrigues, D., Papa, J. P., & Yang, X. -S. (2012). BBA: A binary bat algorithm for feature selection. In Graphics, Patterns and Images (SIBGRAPI), 2012 25th SIBGRAPI Conference on (pp. 291–297): IEEE. – start-page: 28 year: 2014 end-page: 31 ident: b0370 article-title: Discrete bat-inspired algorithm for travelling salesman problem publication-title: Complex Systems (WCCS), 2014 Second World Conference on – reference: Davendra, D. (2010). Traveling salesman problem, theory and applications. – reference: Tsai, P. W., Pan, J. S., Liao, B. Y., Tsai, M. J., & Istanda, V. (2012). Bat algorithm inspired algorithm for solving numerical optimization problems. In Applied mechanics and materials (Vol. 148, pp. 134–137): Trans Tech Publ. – volume: 272 start-page: 420 year: 2019 end-page: 429 ident: b0400 article-title: POPMUSIC for the travelling salesman problem publication-title: European Journal of Operational Researchs – reference: Chen, Y., & Zhang, P. (2006). Optimized annealing of traveling salesman problem from the n th-nearest-neighbor distribution. Physica A: Statistical Mechanics and its Applications, 371, 627–632. – volume: 107 start-page: 126 year: 2018 end-page: 145 ident: b0010 article-title: Island bat algorithm for optimization publication-title: Expert Systems with Applications – volume: 13 start-page: 129 year: 1999 end-page: 170 ident: b0215 article-title: Genetic algorithms for the travelling salesman problem: A review of representations and operators publication-title: Artificial Intelligence Review – volume: 48 start-page: 947 year: 2012 end-page: 950 ident: b0035 article-title: Bat-inspired optimization approach for the brushless DC wheel motor problem publication-title: IEEE Transactions on Magnetics – reference: Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks (Vol. 4, pp. 1942–1948). – volume: 117 start-page: 267 year: 1999 end-page: 283 ident: b0335 article-title: A synergetic approach to genetic algorithms for solving traveling salesman problem publication-title: Information Sciences – start-page: 571 year: 1996 end-page: 587 ident: b0465 article-title: Tabu search on the geometric traveling salesman problem publication-title: Meta-Heuristics – volume: 84 start-page: 263 year: 2012 end-page: 273 ident: b0210 article-title: An optimized K-means clustering technique using bat algorithm publication-title: European Journal of Scientific Research – volume: 44 start-page: 273 year: 2019 end-page: 286 ident: b0300 article-title: A discrete and improved bat algorithm for solving a medical goods distribution problem with pharmacological waste collection publication-title: Swarm Evolutionary Computation – start-page: 313 year: 2018 end-page: 330 ident: b0175 article-title: The bat algorithm, variants and some practical engineering applications: A review publication-title: Nature-inspired algorithms and applied optimization – volume: 24 start-page: 1659 year: 2014 end-page: 1669 ident: b0305 article-title: Discrete cuckoo search algorithm for the travelling salesman problem publication-title: Neural Computing and Applications – reference: Wang, G.-G., Chang, B., & Zhang, Z. (2015). A multi-swarm bat algorithm for global optimization. In 2015 IEEE congress on evolutionary computation (CEC) (pp. 480–485): IEEE. – volume: 69 start-page: 159 year: 2017 end-page: 175 ident: b0060 article-title: New directional bat algorithm for continuous optimization problems publication-title: Expert Systems with Applications – volume: 49 start-page: 4677 year: 1994 ident: b0260 article-title: Fast, accurate algorithm for numerical simulation of Levy stable stochastic processes publication-title: Physical Review E – year: 1998 ident: b0310 article-title: Combinatorial optimization: algorithms and complexity – start-page: 1 year: 2019 end-page: 17 ident: b0040 article-title: An effective hybrid harmony search for the asymmetric travelling salesman problem publication-title: Engineering Optimization – reference: Luo, Q., Zhou, Y., Xie, J., Ma, M., & Li, L. (2014). Discrete bat algorithm for optimal problem of permutation flow shop scheduling. The Scientific World Journal, 2014. – reference: Taha, A., Hachimi, M., & Moudden, A. (2017). A discrete Bat Algorithm for the vehicle routing problem with time windows. In 2017 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA) (pp. 65–70): IEEE. – volume: 96 start-page: 666 year: 2016 end-page: 675 ident: b0005 article-title: Economic dispatch using chaotic bat algorithm publication-title: Energy – volume: 9 start-page: 199 year: 2018 end-page: 215 ident: b0045 article-title: Bat algorithm with triangle-flipping strategy for numerical optimization publication-title: International Journal of Machine Learning Cybernetics – volume: 22 start-page: 1669 year: 2018 end-page: 1685 ident: b0150 article-title: A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem publication-title: Soft Computing – reference: Osaba, E., Carballedo, R., Yang, X. -S., Fister Jr, I., Lopez-Garcia, P., & Del Ser, J. (2018). On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators. In Nature-Inspired Algorithms and Applied Optimization (pp. 69–89): Springer. – volume: 4 start-page: 31 year: 2018 end-page: 53 ident: b0350 article-title: New binary bat algorithm for solving 0–1 knapsack problem publication-title: Complex Intelligent Systems – volume: 1 start-page: 190 year: 1989 end-page: 206 ident: b0145 article-title: Tabu search—part I publication-title: ORSA Journal on Computing – start-page: 2 year: 1989 end-page: 9 ident: b0140 publication-title: Uniform Crossover in Genetic Algorithms – reference: Balas, E., & Toth, P. (1983). Branch and bound methods for the traveling salesman problem. In: Carnegie-Mellon Univ Pittsburgh PA Management Sciences Research Group. – volume: 43 start-page: 73 year: 1997 end-page: 81 ident: b0125 article-title: Ant colonies for the travelling salesman problem publication-title: BioSystems – volume: 87 start-page: 70 year: 2017 end-page: 78 ident: b0130 article-title: Discrete symbiotic organisms search algorithm for travelling salesman problem publication-title: Expert Systems with Applications – reference: Zhou, Y., Xie, J., & Zheng, H. (2013). A Hybrid Bat Algorithm with Path Relinking for Capacitated Vehicle Routing Problem Mathematical Problems in Engineering, 2013, 10. – volume: 12 start-page: 91 year: 2019 end-page: 108 ident: b0050 article-title: Chaotic discrete bat algorithm for capacitated vehicle routing problem publication-title: International Journal of Autonomous Adaptive Communications Systems – reference: Clerc, M. (2004). Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: New optimization techniques in engineering (pp. 219–239): Springer. – year: 2019 ident: b0245 article-title: Bi-population Based discrete bat algorithm for the low-carbon job shop scheduling problem publication-title: IEEE Access – volume: 33 start-page: 5052 year: 2018 end-page: 5061 ident: b0230 article-title: A hybrid bat algorithm for economic dispatch with random wind power publication-title: IEEE Transactions on Power Systems – volume: 2 start-page: 56 year: 2012 end-page: 63 ident: b0235 article-title: A chaotic Levy flight bat algorithm for parameter estimation in nonlinear dynamic biological systems publication-title: Journal of Computer and Information Technology – volume: 30 start-page: 484 year: 2015 end-page: 490 ident: b0255 article-title: A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem publication-title: Applied Soft Computing – volume: 28 start-page: 259 year: 2015 end-page: 275 ident: b0460 article-title: A new modification approach on bat algorithm for solving optimization problems publication-title: Applied Soft Computing – volume: 4 start-page: 387 year: 1992 end-page: 411 ident: b0030 article-title: Fast algorithms for geometric traveling salesman problems publication-title: ORSA Journal on Computing – volume: 3 start-page: 267 year: 2011 end-page: 274 ident: b0440 article-title: Bat algorithm for multi-objective optimisation publication-title: International Journal of Bio-Inspired Computation – reference: Pham, D., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., & Zaidi, M. (2005). The bees algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK. – volume: 55 start-page: 55 year: 2018 end-page: 61 ident: b0115 article-title: Copper price estimation using bat algorithm publication-title: Resources Policy – volume: 6 start-page: 140 year: 2014 end-page: 152 ident: b0355 article-title: A discrete binary version of bat algorithm for multidimensional knapsack problem publication-title: International Journal of Bio-Inspired Computation – volume: 96 start-page: 666 year: 2016 ident: 10.1016/j.eswa.2021.114639_b0005 article-title: Economic dispatch using chaotic bat algorithm publication-title: Energy doi: 10.1016/j.energy.2015.12.096 – start-page: 313 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0175 article-title: The bat algorithm, variants and some practical engineering applications: A review – volume: 101 start-page: 103 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0225 article-title: A multiobjective hybrid bat algorithm for combined economic/emission dispatch publication-title: International Journal of Electrical Power Energy Systems doi: 10.1016/j.ijepes.2018.03.019 – volume: 9 start-page: 199 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0045 article-title: Bat algorithm with triangle-flipping strategy for numerical optimization publication-title: International Journal of Machine Learning Cybernetics doi: 10.1007/s13042-017-0739-8 – volume: 48 start-page: 900 year: 2016 ident: 10.1016/j.eswa.2021.114639_b0405 article-title: A bat algorithm for the redundancy allocation problem publication-title: Engineering Optimization doi: 10.1080/0305215X.2015.1076402 – volume: 48 start-page: 3081 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0475 article-title: A multiobjective discrete bat algorithm for community detection in dynamic networks publication-title: Applied Intelligence doi: 10.1007/s10489-017-1135-5 – ident: 10.1016/j.eswa.2021.114639_b0200 doi: 10.1007/978-3-642-23163-6_9 – year: 2019 ident: 10.1016/j.eswa.2021.114639_b0245 article-title: Bi-population Based discrete bat algorithm for the low-carbon job shop scheduling problem publication-title: IEEE Access – volume: 1 start-page: 190 year: 1989 ident: 10.1016/j.eswa.2021.114639_b0145 article-title: Tabu search—part I publication-title: ORSA Journal on Computing doi: 10.1287/ijoc.1.3.190 – volume: 2 start-page: 56 year: 2012 ident: 10.1016/j.eswa.2021.114639_b0235 article-title: A chaotic Levy flight bat algorithm for parameter estimation in nonlinear dynamic biological systems publication-title: Journal of Computer and Information Technology – year: 1985 ident: 10.1016/j.eswa.2021.114639_b0220 article-title: The traveling salesman problem: a guided tour of combinatorial optimization. publication-title: Wiley-Interscience Series Discrete Mathematics – ident: 10.1016/j.eswa.2021.114639_b0285 doi: 10.1007/978-3-319-67669-2_4 – volume: 4 start-page: 214 year: 2013 ident: 10.1016/j.eswa.2021.114639_b0430 article-title: Hybrid ABC/PSO to solve travelling salesman problem publication-title: International Journal of Computing Science Mathematics doi: 10.1504/IJCSM.2013.057246 – ident: 10.1016/j.eswa.2021.114639_b0420 doi: 10.1109/CEC.2015.7256928 – volume: 69 start-page: 159 year: 2017 ident: 10.1016/j.eswa.2021.114639_b0060 article-title: New directional bat algorithm for continuous optimization problems publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2016.10.050 – volume: 10 start-page: 55 year: 1976 ident: 10.1016/j.eswa.2021.114639_b0080 article-title: The vehicle routing problem. Revue française d'automatique, informatique, recherche opérationnelle publication-title: Recherche Opérationnelle doi: 10.1051/ro/197610V100551 – ident: 10.1016/j.eswa.2021.114639_b0105 doi: 10.5772/547 – volume: 48 start-page: 947 year: 2012 ident: 10.1016/j.eswa.2021.114639_b0035 article-title: Bat-inspired optimization approach for the brushless DC wheel motor problem publication-title: IEEE Transactions on Magnetics doi: 10.1109/TMAG.2011.2176108 – ident: 10.1016/j.eswa.2021.114639_b0160 doi: 10.1155/2017/3235720 – start-page: 295 year: 2013 ident: 10.1016/j.eswa.2021.114639_b0170 – volume: 87 start-page: 197 year: 1995 ident: 10.1016/j.eswa.2021.114639_b0425 article-title: Matrix representation and gradient flows for NP-hard problems publication-title: Journal of Optimization Theory and Applications doi: 10.1007/BF02192047 – year: 2019 ident: 10.1016/j.eswa.2021.114639_b0470 article-title: Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem publication-title: Swarm Evolutionary Computation doi: 10.1016/j.swevo.2019.04.002 – volume: 107 start-page: 126 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0010 article-title: Island bat algorithm for optimization publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2018.04.024 – start-page: 1 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0375 article-title: Multi-level image thresholding using Otsu and chaotic bat algorithm publication-title: Neural Computing Applications – volume: 44 start-page: 2245 year: 1965 ident: 10.1016/j.eswa.2021.114639_b0240 article-title: Computer solutions of the traveling salesman problem publication-title: Bell System Technical Journal doi: 10.1002/j.1538-7305.1965.tb04146.x – year: 1998 ident: 10.1016/j.eswa.2021.114639_b0310 – volume: 28 start-page: 259 year: 2015 ident: 10.1016/j.eswa.2021.114639_b0460 article-title: A new modification approach on bat algorithm for solving optimization problems publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2014.11.029 – volume: 87 start-page: 70 year: 2017 ident: 10.1016/j.eswa.2021.114639_b0130 article-title: Discrete symbiotic organisms search algorithm for travelling salesman problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2017.06.007 – start-page: 1 year: 2019 ident: 10.1016/j.eswa.2021.114639_b0040 article-title: An effective hybrid harmony search for the asymmetric travelling salesman problem publication-title: Engineering Optimization – start-page: 343 year: 2016 ident: 10.1016/j.eswa.2021.114639_b0180 – volume: 63 start-page: 337 year: 1996 ident: 10.1016/j.eswa.2021.114639_b0330 article-title: Genetic algorithms for the traveling salesman problem publication-title: Annals of Operations Research doi: 10.1007/BF02125403 – volume: 7 start-page: 740 year: 2016 ident: 10.1016/j.eswa.2021.114639_b0185 article-title: A novel stochastic framework based on cloud theory and $\theta $-modified bat algorithm to solve the distribution feeder reconfiguration publication-title: IEEE Transactions on Smart Grid – volume: 85 start-page: 162 year: 1985 ident: 10.1016/j.eswa.2021.114639_b0110 article-title: Applying adaptive algorithms to epistatic domains publication-title: IJCAI – volume: 84 start-page: 263 year: 2012 ident: 10.1016/j.eswa.2021.114639_b0210 article-title: An optimized K-means clustering technique using bat algorithm publication-title: European Journal of Scientific Research – volume: 32 start-page: 231 year: 2005 ident: 10.1016/j.eswa.2021.114639_b0270 article-title: Expanding neighborhood GRASP for the traveling salesman problem publication-title: Computational Optimization and Applications doi: 10.1007/s10589-005-4798-5 – volume: 1 start-page: 71 year: 2009 ident: 10.1016/j.eswa.2021.114639_b0380 article-title: The intelligent water drops algorithm: A nature-inspired swarm-based optimization algorithm publication-title: International Journal of Bio-Inspired Computation doi: 10.1504/IJBIC.2009.022775 – volume: 181 start-page: 4684 year: 2011 ident: 10.1016/j.eswa.2021.114639_b0265 article-title: Honey bees mating optimization algorithm for the Euclidean traveling salesman problem publication-title: Information Sciences doi: 10.1016/j.ins.2010.06.032 – volume: 92 start-page: 493 year: 1996 ident: 10.1016/j.eswa.2021.114639_b0325 article-title: General local search methods publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(96)00007-0 – volume: 76 start-page: 60 year: 2001 ident: 10.1016/j.eswa.2021.114639_b0135 article-title: A new heuristic optimization algorithm: harmony search publication-title: Simulation doi: 10.1177/003754970107600201 – volume: 48 start-page: 59 year: 2016 ident: 10.1016/j.eswa.2021.114639_b0295 article-title: An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2015.10.006 – ident: 10.1016/j.eswa.2021.114639_b0320 – volume: 7 start-page: 311 year: 2001 ident: 10.1016/j.eswa.2021.114639_b0055 article-title: Migration policies, selection pressure, and parallel evolutionary algorithms publication-title: Journal of Heuristics doi: 10.1023/A:1011375326814 – ident: 10.1016/j.eswa.2021.114639_b0190 doi: 10.1109/ICNN.1995.488968 – ident: 10.1016/j.eswa.2021.114639_b0020 doi: 10.21236/ADA126957 – volume: 2 start-page: 393 year: 1954 ident: 10.1016/j.eswa.2021.114639_b0095 article-title: Solution of a large-scale traveling-salesman problem publication-title: Journal of the Operations Research Society of America doi: 10.1287/opre.2.4.393 – volume: 22 start-page: 8167 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0155 article-title: Solving travelling salesman problem using black hole algorithm publication-title: Soft Computing doi: 10.1007/s00500-017-2760-y – ident: 10.1016/j.eswa.2021.114639_b0085 doi: 10.1007/978-3-540-39930-8_8 – volume: 22 start-page: 1669 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0150 article-title: A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem publication-title: Soft Computing doi: 10.1007/s00500-016-2432-3 – ident: 10.1016/j.eswa.2021.114639_b0250 doi: 10.1155/2014/630280 – ident: 10.1016/j.eswa.2021.114639_b0395 doi: 10.1109/LOGISTIQUA.2017.7962875 – start-page: 1 year: 2015 ident: 10.1016/j.eswa.2021.114639_b0365 article-title: A novel discrete bat algorithm for solving the travelling salesman problem publication-title: Neural Computing and Applications – volume: 4 start-page: 387 year: 1992 ident: 10.1016/j.eswa.2021.114639_b0030 article-title: Fast algorithms for geometric traveling salesman problems publication-title: ORSA Journal on Computing doi: 10.1287/ijoc.4.4.387 – volume: 6 start-page: 791 year: 1958 ident: 10.1016/j.eswa.2021.114639_b0090 article-title: A method for solving traveling-salesman problems publication-title: Operations Research doi: 10.1287/opre.6.6.791 – volume: 44 start-page: 428 year: 2019 ident: 10.1016/j.eswa.2021.114639_b0195 article-title: A swap sequence based artificial bee colony algorithm for traveling salesman problem publication-title: Swarm Evolutionary Computation doi: 10.1016/j.swevo.2018.05.006 – volume: 29 start-page: 617 year: 2015 ident: 10.1016/j.eswa.2021.114639_b0070 article-title: Bat algorithm: a survey of the state-of-the-art publication-title: Applied Artificial Intelligence doi: 10.1080/08839514.2015.1038434 – ident: 10.1016/j.eswa.2021.114639_b0410 doi: 10.1504/IJMOR.2016.077560 – volume: 55 start-page: 55 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0115 article-title: Copper price estimation using bat algorithm publication-title: Resources Policy doi: 10.1016/j.resourpol.2017.10.015 – ident: 10.1016/j.eswa.2021.114639_b0015 doi: 10.1007/978-3-319-05035-5_2 – volume: 4 start-page: 31 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0350 article-title: New binary bat algorithm for solving 0–1 knapsack problem publication-title: Complex Intelligent Systems doi: 10.1007/s40747-017-0050-z – ident: 10.1016/j.eswa.2021.114639_b0075 doi: 10.1016/j.physa.2006.04.052 – volume: 12 start-page: 91 year: 2019 ident: 10.1016/j.eswa.2021.114639_b0050 article-title: Chaotic discrete bat algorithm for capacitated vehicle routing problem publication-title: International Journal of Autonomous Adaptive Communications Systems doi: 10.1504/IJAACS.2019.098589 – volume: 29 start-page: 617 year: 2015 ident: 10.1016/j.eswa.2021.114639_b0065 article-title: Bat algorithm: a survey of the state-of-the-art publication-title: Applied Artificial Intelligence doi: 10.1080/08839514.2015.1038434 – ident: 10.1016/j.eswa.2021.114639_b0435 doi: 10.1007/978-3-642-12538-6_6 – volume: 13 start-page: 129 year: 1999 ident: 10.1016/j.eswa.2021.114639_b0215 article-title: Genetic algorithms for the travelling salesman problem: A review of representations and operators publication-title: Artificial Intelligence Review doi: 10.1023/A:1006529012972 – volume: 24 start-page: 41 year: 2019 ident: 10.1016/j.eswa.2021.114639_b0120 article-title: Hybrid optimization algorithm based on wolf pack search and local search for solving traveling salesman problem publication-title: Journal of Shanghai Jiaotong University doi: 10.1007/s12204-019-2039-9 – volume: 71 start-page: 277 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0290 article-title: A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2018.06.047 – ident: 10.1016/j.eswa.2021.114639_b0390 – volume: 29 start-page: 464 year: 2012 ident: 10.1016/j.eswa.2021.114639_b0450 article-title: Bat algorithm: a novel approach for global engineering optimization publication-title: Engineering Computations doi: 10.1108/02644401211235834 – volume: 5 start-page: 141 year: 2013 ident: 10.1016/j.eswa.2021.114639_b0455 article-title: Bat algorithm: literature review and applications publication-title: International Journal of Bio-Inspired Computation doi: 10.1504/IJBIC.2013.055093 – start-page: 28 year: 2014 ident: 10.1016/j.eswa.2021.114639_b0370 article-title: Discrete bat-inspired algorithm for travelling salesman problem – volume: 21 start-page: 667 year: 2017 ident: 10.1016/j.eswa.2021.114639_b0315 article-title: Interval type-2 fuzzy logic for dynamic parameter adaptation in the bat algorithm publication-title: Soft Computing doi: 10.1007/s00500-016-2469-3 – year: 2017 ident: 10.1016/j.eswa.2021.114639_b0345 article-title: Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem publication-title: Egyptian Informatics Journal doi: 10.1016/j.eij.2017.02.003 – ident: 10.1016/j.eswa.2021.114639_b0480 doi: 10.1155/2013/392789 – volume: 3 start-page: 376 year: 1991 ident: 10.1016/j.eswa.2021.114639_b0340 article-title: TSPLIB—A traveling salesman problem library publication-title: ORSA Journal on Computing doi: 10.1287/ijoc.3.4.376 – volume: 30 start-page: 484 year: 2015 ident: 10.1016/j.eswa.2021.114639_b0255 article-title: A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2015.01.068 – start-page: 1 year: 2019 ident: 10.1016/j.eswa.2021.114639_b0360 article-title: Hybrid optimizer for the travelling salesman problem publication-title: Evolutionary Intelligence – ident: 10.1016/j.eswa.2021.114639_b0415 doi: 10.4028/www.scientific.net/AMM.148-149.134 – start-page: 254 year: 2013 ident: 10.1016/j.eswa.2021.114639_b0385 – volume: 29 start-page: 451 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0100 article-title: Parallel bat algorithm for optimizing makespan in job shop scheduling problems publication-title: Journal of Intelligent Manufacturing doi: 10.1007/s10845-015-1121-x – ident: 10.1016/j.eswa.2021.114639_b0445 doi: 10.1109/NABIC.2009.5393690 – volume: 44 start-page: 273 year: 2019 ident: 10.1016/j.eswa.2021.114639_b0300 article-title: A discrete and improved bat algorithm for solving a medical goods distribution problem with pharmacological waste collection publication-title: Swarm Evolutionary Computation doi: 10.1016/j.swevo.2018.04.001 – volume: 49 start-page: 4677 year: 1994 ident: 10.1016/j.eswa.2021.114639_b0260 article-title: Fast, accurate algorithm for numerical simulation of Levy stable stochastic processes publication-title: Physical Review E doi: 10.1103/PhysRevE.49.4677 – volume: 3 start-page: 267 year: 2011 ident: 10.1016/j.eswa.2021.114639_b0440 article-title: Bat algorithm for multi-objective optimisation publication-title: International Journal of Bio-Inspired Computation doi: 10.1504/IJBIC.2011.042259 – volume: 43 start-page: 73 year: 1997 ident: 10.1016/j.eswa.2021.114639_b0125 article-title: Ant colonies for the travelling salesman problem publication-title: BioSystems doi: 10.1016/S0303-2647(97)01708-5 – volume: 220 start-page: 671 year: 1983 ident: 10.1016/j.eswa.2021.114639_b0205 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – start-page: 571 year: 1996 ident: 10.1016/j.eswa.2021.114639_b0465 article-title: Tabu search on the geometric traveling salesman problem – volume: 117 start-page: 267 year: 1999 ident: 10.1016/j.eswa.2021.114639_b0335 article-title: A synergetic approach to genetic algorithms for solving traveling salesman problem publication-title: Information Sciences doi: 10.1016/S0020-0255(99)00026-2 – volume: 6 start-page: 140 year: 2014 ident: 10.1016/j.eswa.2021.114639_b0355 article-title: A discrete binary version of bat algorithm for multidimensional knapsack problem publication-title: International Journal of Bio-Inspired Computation doi: 10.1504/IJBIC.2014.060598 – ident: 10.1016/j.eswa.2021.114639_b0280 doi: 10.1109/SIBGRAPI.2012.47 – volume: 24 start-page: 1659 year: 2014 ident: 10.1016/j.eswa.2021.114639_b0305 article-title: Discrete cuckoo search algorithm for the travelling salesman problem publication-title: Neural Computing and Applications doi: 10.1007/s00521-013-1402-2 – volume: 272 start-page: 420 year: 2019 ident: 10.1016/j.eswa.2021.114639_b0400 article-title: POPMUSIC for the travelling salesman problem publication-title: European Journal of Operational Researchs doi: 10.1016/j.ejor.2018.06.039 – volume: 25 start-page: 663 year: 2014 ident: 10.1016/j.eswa.2021.114639_b0275 article-title: Binary bat algorithm publication-title: Neural Computing and Applications doi: 10.1007/s00521-013-1525-5 – volume: 294 start-page: 628 year: 2015 ident: 10.1016/j.eswa.2021.114639_b0165 article-title: Multi-population cooperative bat algorithm-based optimization of artificial neural network model publication-title: Information Sciences doi: 10.1016/j.ins.2014.08.050 – volume: 5 start-page: 613 year: 2001 ident: 10.1016/j.eswa.2021.114639_b0025 article-title: A hybrid heuristic for the traveling salesman problem publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.974843 – volume: 33 start-page: 5052 year: 2018 ident: 10.1016/j.eswa.2021.114639_b0230 article-title: A hybrid bat algorithm for economic dispatch with random wind power publication-title: IEEE Transactions on Power Systems doi: 10.1109/TPWRS.2018.2812711 – start-page: 2 year: 1989 ident: 10.1016/j.eswa.2021.114639_b0140 |
| SSID | ssj0017007 |
| Score | 2.556492 |
| Snippet | •A new discrete bat algorithm based on Lévy flights is proposed.•2-opt, 2.5-opt and 3-opt define the movement of bats in the search space.•A modified uniform... Bat algorithm is a swarm-intelligence-based metaheuristic proposed in 2010. This algorithm was inspired by echolocation behavior of bats when searching their... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 114639 |
| SubjectTerms | Algorithms Bat algorithm Combinatorial analysis Comparative studies Heuristic methods Lévy flights NP-hard combinatorial optimization problem Optimization Population-based metaheuristics Random walk Search methods Traveling salesman problem |
| Title | A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem |
| URI | https://dx.doi.org/10.1016/j.eswa.2021.114639 https://www.proquest.com/docview/2515756316 |
| Volume | 172 |
| WOSCitedRecordID | wos000630933400001&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: 1873-6793 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017007 issn: 0957-4174 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELZglwMX3oiFBfnArcoqzsvxsUJFgFYrJBapnCLHdthWJV01adn9SfwO_hgzfmRLEStA4hJVUZ1Ens_2-BvPfIS81BnXsS5ZBKuPibIsayKpAcsGVlMllNK5F5vgJyfldCree1XUzsoJ8LYtLy7E-X81NdwDY2Pq7F-Ye3go3IDfYHS4gtnh-keGH2PQBXzB3oxqiYTu5-Vq1p99GeGCpTE4cOyi45vLUbPAvbktyTCarNVippGY71GSyKapd7B8dMjye92Zn3h8LJLc-1LQIUluKxw-cDdybk8MfAI3fTuIL1eYu7S2jOzyDAl0vU1BJPaolEvCdLxYyI25OojkCEYeZcxp8BwZN72WPI0K7jQRh_nXaff8Mpc7WmF-ZLqvWCAqYbausSt9tFMj-wO-DN-VMOsDZzfJfsJzAdPc_vjtZPpuCCzx2GXQh4_zeVTuyN_um37nq-ys2tYVOb1H7vg9BB07298nN0z7gNwN-hzUT9cPyXRMAxQoQIEOUKAWCnTZ0uPv3zaX1MOAAgzoAAM6wIAGGFAPg0fk4-vJ6as3kVfSiFSalH3EikTpok64iVUDI5CZQtS1iBuelpmsSyVYwrSJdcybgkldwDZXllIIkyfINqePyV67bM0TQtNYSp0o6GUtsrqAlk2OEgFK5uDai_KAsNBnlfJl5lHtZFGF84TzCvu5wn6uXD8fkNHQ5twVWbn233kwReXdROf-VYCca9sdBrtVfrx2Fbj38PlFyoqn__jYZ-T21Zg4JHv9am2ek1tq08-61QuPvx8uXJea |
| 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=A+discrete+bat+algorithm+based+on+L%C3%A9vy+flights+for+Euclidean+traveling+salesman+problem&rft.jtitle=Expert+systems+with+applications&rft.au=Saji%2C+Yassine&rft.au=Barkatou%2C+Mohammed&rft.date=2021-06-15&rft.pub=Elsevier+Ltd&rft.issn=0957-4174&rft.eissn=1873-6793&rft.volume=172&rft_id=info:doi/10.1016%2Fj.eswa.2021.114639&rft.externalDocID=S0957417421000804 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0957-4174&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0957-4174&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0957-4174&client=summon |