An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to s...
Saved in:
| Published in: | Engineering applications of artificial intelligence Vol. 48; pp. 59 - 71 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.02.2016
|
| Subjects: | |
| ISSN: | 0952-1976, 1873-6769 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric Traveling Salesman Problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student׳s t-test, the Holm׳s test, and the Friedman test. We have also compared the convergence behavior shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases. |
|---|---|
| AbstractList | Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric Traveling Salesman Problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student׳s t-test, the Holm׳s test, and the Friedman test. We have also compared the convergence behavior shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases. |
| Author | Yang, Xin-She Diaz, Fernando Osaba, Eneko Carballedo, Roberto Lopez-Garcia, Pedro |
| Author_xml | – sequence: 1 givenname: Eneko orcidid: 0000-0001-7863-9910 surname: Osaba fullname: Osaba, Eneko email: e.osaba@deusto.es, Eneko1@mdx.ac.uk organization: Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain – sequence: 2 givenname: Xin-She surname: Yang fullname: Yang, Xin-She email: x.yang@mdx.ac.uk organization: School of Science and Technology, Middlesex University, Hendon Campus, London, NW4 4BT, United Kingdom – sequence: 3 givenname: Fernando surname: Diaz fullname: Diaz, Fernando email: fernando.diaz@deusto.es organization: Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain – sequence: 4 givenname: Pedro surname: Lopez-Garcia fullname: Lopez-Garcia, Pedro email: p.lopez@deusto.es organization: Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain – sequence: 5 givenname: Roberto orcidid: 0000-0001-6709-1865 surname: Carballedo fullname: Carballedo, Roberto email: roberto.carballedo@deusto.es organization: Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain |
| BookMark | eNqFkF1LwzAUhoMouE3_guQPtCbNmrbghWP4BQMF55UX5SQ5nRltWpIw2L-3Y4rgza4O54XnhfeZknPXOyTkhrOUMy5vtym6DQwD2DRjPB_DlDF5Ria8LEQiC1mdkwmr8izhVSEvyTSELWNMlHM5IZ8LR203-H6HhhobtMeIVEGk0G56b-NXR5ve07DvOozeagrOUPh71x522Fq3oe_QYujA0Tffqxa7cEUuGmgDXv_cGfl4fFgvn5PV69PLcrFKtJAsJlwAr0SuM1U1EoxohKhyYxhTWiitlClzUAY4GKkUlPM8V1KVWGTZfBzRoJgReezVvg_BY1MP3nbg9zVn9UFRva1_FdUHRYd8VDSCd_9AbSNE27vowban8fsjjuO4nUVfB23RaTTWo4616e2pim-UL4wj |
| CitedBy_id | crossref_primary_10_1007_s00366_020_00979_z crossref_primary_10_1108_WJE_10_2020_0495 crossref_primary_10_3233_JIFS_213121 crossref_primary_10_1051_matecconf_201925904003 crossref_primary_10_1007_s11633_022_1405_5 crossref_primary_10_1007_s00500_018_3488_z crossref_primary_10_1007_s10845_024_02506_z crossref_primary_10_1016_j_asoc_2018_06_047 crossref_primary_10_1007_s00500_017_2810_5 crossref_primary_10_1016_j_asoc_2018_06_048 crossref_primary_10_1016_j_eswa_2019_112945 crossref_primary_10_1088_1755_1315_300_3_032061 crossref_primary_10_1108_EC_09_2018_0402 crossref_primary_10_3390_a10020068 crossref_primary_10_1177_1729881417705969 crossref_primary_10_1016_j_eswa_2017_01_053 crossref_primary_10_3390_en11051188 crossref_primary_10_1007_s13198_018_0696_y crossref_primary_10_1109_ACCESS_2018_2846604 crossref_primary_10_1371_journal_pone_0165804 crossref_primary_10_3390_app9101973 crossref_primary_10_1007_s13042_018_0888_4 crossref_primary_10_1016_j_knosys_2018_06_013 crossref_primary_10_1007_s10489_021_02774_9 crossref_primary_10_1016_j_asoc_2017_10_039 crossref_primary_10_1016_j_neucom_2016_11_098 crossref_primary_10_1007_s00366_019_00837_7 crossref_primary_10_1016_j_swevo_2018_04_001 crossref_primary_10_1007_s00521_024_10475_w crossref_primary_10_1016_j_cie_2024_110320 crossref_primary_10_1155_2017_8404231 crossref_primary_10_3390_app11114780 crossref_primary_10_3390_math12050703 crossref_primary_10_1016_j_eswa_2023_119765 crossref_primary_10_1016_j_eswa_2019_04_023 crossref_primary_10_1016_j_engappai_2020_103649 crossref_primary_10_1016_j_eswa_2019_04_024 crossref_primary_10_1080_00207543_2019_1701207 crossref_primary_10_1016_j_asoc_2019_105484 crossref_primary_10_3233_JIFS169939 crossref_primary_10_1080_0305215X_2019_1579804 crossref_primary_10_1007_s41870_025_02507_y crossref_primary_10_1007_s00500_021_05638_z crossref_primary_10_1007_s00500_024_10340_x crossref_primary_10_3390_math12091340 crossref_primary_10_1371_journal_pone_0166064 crossref_primary_10_3390_app9020265 crossref_primary_10_1007_s11831_021_09673_9 crossref_primary_10_1080_0305215X_2019_1624738 crossref_primary_10_1177_1550147719881116 crossref_primary_10_4018_IJAMC_2020040109 crossref_primary_10_1007_s42235_017_0010_8 crossref_primary_10_1680_jmuen_15_00026 crossref_primary_10_3390_app9153008 crossref_primary_10_3233_JIFS_220396 crossref_primary_10_1007_s12065_024_00960_5 crossref_primary_10_1007_s00170_025_15010_2 crossref_primary_10_17130_ijmeb_855044 crossref_primary_10_1016_j_trd_2018_04_007 crossref_primary_10_1016_j_eswa_2022_117433 crossref_primary_10_1080_23311916_2024_2364041 crossref_primary_10_1007_s11831_022_09817_5 crossref_primary_10_1016_j_eswa_2018_12_044 crossref_primary_10_3390_s21041121 crossref_primary_10_1007_s13369_018_3617_0 crossref_primary_10_3390_app112110101 crossref_primary_10_1007_s13369_021_06033_4 crossref_primary_10_3390_app10041481 crossref_primary_10_3390_math9070786 crossref_primary_10_1016_j_swevo_2019_04_002 crossref_primary_10_1016_j_knosys_2022_109231 crossref_primary_10_1007_s10845_017_1298_2 crossref_primary_10_1177_1550147719895210 crossref_primary_10_1016_j_jocs_2021_101454 crossref_primary_10_3233_THC_202547 crossref_primary_10_1016_j_eswa_2021_115353 crossref_primary_10_1109_TII_2021_3082877 crossref_primary_10_1007_s41870_023_01454_w crossref_primary_10_1080_00207721_2023_2293687 crossref_primary_10_1109_TITS_2025_3528961 crossref_primary_10_3390_sym11070925 crossref_primary_10_7769_gesec_v14i3_1809 crossref_primary_10_1108_EC_06_2016_0207 crossref_primary_10_1145_3510034 crossref_primary_10_3390_s19081837 crossref_primary_10_1109_ACCESS_2022_3205756 crossref_primary_10_3390_math9182335 crossref_primary_10_1016_j_asoc_2020_106157 crossref_primary_10_1186_s40537_023_00782_9 crossref_primary_10_1155_2021_6625438 crossref_primary_10_1109_ACCESS_2019_2945570 crossref_primary_10_1007_s00500_020_05406_5 crossref_primary_10_1049_iet_its_2016_0047 crossref_primary_10_1007_s00500_020_04958_w crossref_primary_10_1007_s13369_019_03874_y crossref_primary_10_1007_s12597_025_01010_z crossref_primary_10_1007_s00521_016_2469_3 crossref_primary_10_1080_08839514_2017_1339983 crossref_primary_10_1016_j_omega_2017_12_003 crossref_primary_10_1016_j_eswa_2019_112867 crossref_primary_10_1109_ACCESS_2021_3128433 crossref_primary_10_1016_j_asoc_2024_112136 crossref_primary_10_1177_1077546316676734 crossref_primary_10_3233_JIFS_212464 crossref_primary_10_1007_s42979_024_03417_9 crossref_primary_10_1016_j_swevo_2021_100869 crossref_primary_10_1109_ACCESS_2020_2982988 crossref_primary_10_3390_e23070874 crossref_primary_10_3390_math9202633 crossref_primary_10_1007_s40747_022_00949_6 crossref_primary_10_1016_j_asoc_2021_107991 crossref_primary_10_1016_j_swevo_2019_100607 crossref_primary_10_1007_s13198_023_02161_2 crossref_primary_10_1007_s10489_020_01898_8 crossref_primary_10_1109_ACCESS_2019_2892826 crossref_primary_10_1007_s10489_021_02922_1 crossref_primary_10_1088_1742_6596_974_1_012025 crossref_primary_10_1007_s00500_021_05851_w crossref_primary_10_1145_3526025 crossref_primary_10_1007_s00521_018_3375_7 crossref_primary_10_1007_s42979_024_03420_0 crossref_primary_10_1111_itor_13452 crossref_primary_10_1007_s11227_022_04790_z crossref_primary_10_1007_s10489_021_02312_7 crossref_primary_10_1109_TITS_2019_2897377 crossref_primary_10_1016_j_jocs_2022_101931 crossref_primary_10_4018_JGIM_298678 crossref_primary_10_1016_j_swevo_2018_02_017 crossref_primary_10_1680_jtran_16_00113 crossref_primary_10_1080_0305215X_2018_1461853 crossref_primary_10_1007_s00366_020_01127_3 crossref_primary_10_1016_j_asoc_2021_107085 crossref_primary_10_3390_sym14030447 crossref_primary_10_1007_s00521_021_06883_x crossref_primary_10_1016_j_asoc_2020_106498 crossref_primary_10_1016_j_eswa_2021_114639 crossref_primary_10_1088_1742_6596_1950_1_012055 crossref_primary_10_1016_j_tre_2019_05_015 crossref_primary_10_1016_j_eswa_2020_113229 crossref_primary_10_1016_j_engstruct_2021_113108 crossref_primary_10_1016_j_jocs_2020_101104 crossref_primary_10_1016_j_eswa_2018_02_025 crossref_primary_10_1007_s40815_018_0533_0 crossref_primary_10_1007_s00500_021_06104_6 crossref_primary_10_1016_j_eswa_2018_10_033 crossref_primary_10_1007_s00500_018_3081_5 crossref_primary_10_1016_j_asoc_2021_107298 crossref_primary_10_1155_2018_9461861 crossref_primary_10_1007_s13369_022_07076_x crossref_primary_10_1016_j_asoc_2022_108469 crossref_primary_10_1016_j_swevo_2021_101014 crossref_primary_10_1155_acis_5324998 crossref_primary_10_1016_j_ins_2017_08_067 crossref_primary_10_1109_ACCESS_2019_2908961 crossref_primary_10_1155_2016_8932896 crossref_primary_10_1111_mice_12661 crossref_primary_10_1002_int_22342 crossref_primary_10_3390_a13060142 crossref_primary_10_1007_s00521_019_04237_2 crossref_primary_10_1016_j_engappai_2023_106398 crossref_primary_10_1109_ACCESS_2023_3320562 crossref_primary_10_2478_fcds_2022_0004 crossref_primary_10_1016_j_eswa_2019_112853 crossref_primary_10_1177_00202940231157422 crossref_primary_10_1631_FITEE_2000251 crossref_primary_10_3390_ijgi7050190 crossref_primary_10_1016_j_eswa_2018_04_024 crossref_primary_10_1007_s12065_025_01045_7 crossref_primary_10_1007_s10462_020_09869_8 crossref_primary_10_1016_j_swevo_2018_08_004 crossref_primary_10_1109_LCOMM_2018_2861766 crossref_primary_10_1016_j_future_2020_07_008 crossref_primary_10_3390_s24041098 crossref_primary_10_1007_s00500_022_07121_9 crossref_primary_10_1007_s10489_021_02839_9 |
| Cites_doi | 10.1023/A:1006529012972 10.1007/978-3-642-38667-1_8 10.1007/978-3-319-12286-1_5 10.1166/jctn.2015.3910 10.1007/978-3-642-12538-6_6 10.1016/j.swevo.2013.06.001 10.1016/j.ijepes.2014.09.008 10.1007/BF01022991 10.14257/ijhit.2015.8.1.34 10.1108/02644401211235834 10.1007/978-3-319-07773-4_5 10.1109/HPCSim.2012.6266963 10.1016/0360-8352(91)90165-3 10.1109/4235.585892 10.1016/j.asoc.2015.01.068 10.1126/science.220.4598.671 10.1007/s10898-007-9149-x 10.1016/j.asoc.2014.08.033 10.1007/978-3-319-09876-0_5 10.1007/s10489-013-0512-y 10.1007/978-3-319-10960-2_4 10.1016/j.swevo.2011.02.002 10.1016/j.ins.2010.06.032 10.1007/978-3-642-04944-6_14 10.1007/978-3-319-02141-6_17 10.1007/978-3-319-05035-5_2 10.1109/SIBGRAPI.2012.47 10.5815/ijmecs.2014.08.03 10.1016/0166-218X(92)00033-I 10.1504/IJBIC.2011.042259 10.1016/0377-2217(92)90192-C 10.1016/S0377-2217(97)00289-0 10.1016/j.cor.2014.10.012 10.1111/itor.12053 10.1002/(SICI)1099-0526(199903/04)4:4<31::AID-CPLX5>3.0.CO;2-4 10.1007/BF02022093 10.1016/0377-2217(92)90138-Y 10.1287/ijoc.1060.0202 10.1016/j.swevo.2015.02.003 10.4028/www.scientific.net/AMM.203.88 10.1504/IJBIC.2011.038700 10.1145/2666003 10.1007/s10107-002-0323-0 10.1016/j.asoc.2014.11.060 10.1016/j.eswa.2015.02.037 10.1016/j.engappai.2014.06.026 10.1016/j.engappai.2015.06.003 10.1016/B978-0-12-405163-8.00013-2 10.1016/j.ejor.2014.12.001 10.1166/jctn.2015.3868 10.1016/0305-0548(94)90016-7 10.1007/978-3-319-10762-2_50 10.1016/j.neucom.2014.07.034 10.1007/s00521-013-1402-2 10.1016/j.neucom.2015.01.028 10.1016/j.ipl.2007.03.010 10.1016/j.engappai.2014.08.002 10.1007/978-3-540-39930-8_8 10.1002/j.1538-7305.1965.tb04146.x 10.1166/jctn.2015.3886 10.1287/ijoc.3.4.376 10.1016/j.eswa.2012.02.029 10.1109/TMAG.2011.2176108 10.1016/j.tcs.2014.11.013 10.1023/A:1011375326814 10.1109/ICNN.1995.488968 10.1007/3-540-45365-2_21 10.1016/j.tcs.2005.05.020 10.1109/72.363466 10.1016/j.engappai.2014.07.012 10.1016/j.jocs.2013.10.002 10.1155/2014/630280 10.1016/j.cor.2005.03.014 10.1504/IJBIC.2013.055093 10.1016/j.eswa.2011.04.163 10.1016/j.egypro.2012.02.101 10.2307/2582681 10.1016/j.cie.2014.01.015 10.1007/978-3-662-45049-9_106 10.1109/INISTA.2011.5946125 10.1007/s00521-013-1525-5 10.1007/978-3-319-07674-4_1 10.1109/CEC.2007.4425083 10.1287/ijoc.1.3.190 10.5504/BBEQ.2013.0089 10.1109/ICoCS.2014.7060983 10.1016/j.ejor.2005.03.059 10.1080/00207160.2012.758362 10.1080/23311916.2015.1011929 10.1007/978-3-642-23163-6_9 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd |
| Copyright_xml | – notice: 2015 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.engappai.2015.10.006 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Computer Science |
| EISSN | 1873-6769 |
| EndPage | 71 |
| ExternalDocumentID | 10_1016_j_engappai_2015_10_006 S0952197615002353 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 29G 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 UHS WUQ ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c360t-13a1935c2b9f6ad3f3395dd00bc3bcbbd85abda1ad6bba8455b6b8e7224038fe3 |
| ISICitedReferencesCount | 229 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000368216900006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0952-1976 |
| IngestDate | Sat Nov 29 07:49:23 EST 2025 Tue Nov 18 20:43:05 EST 2025 Fri Feb 23 02:28:55 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Routing problems Bat algorithm Combinatorial optimization Traveling Salesman Problem Genetic algorithms |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c360t-13a1935c2b9f6ad3f3395dd00bc3bcbbd85abda1ad6bba8455b6b8e7224038fe3 |
| ORCID | 0000-0001-7863-9910 0000-0001-6709-1865 |
| PageCount | 13 |
| ParticipantIDs | crossref_primary_10_1016_j_engappai_2015_10_006 crossref_citationtrail_10_1016_j_engappai_2015_10_006 elsevier_sciencedirect_doi_10_1016_j_engappai_2015_10_006 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-02-01 |
| PublicationDateYYYYMMDD | 2016-02-01 |
| PublicationDate_xml | – month: 02 year: 2016 text: 2016-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Engineering applications of artificial intelligence |
| PublicationYear | 2016 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Davis, L., 1985. Applying adaptive algorithms to epistatic domains. In: Proceedings of the International Joint Conference on Artificial Intelligence, vol. 1, pp. 161–163. Nguyen, T.-T., Pan, J.-S., Dao, T.-K., Kuo, M.-Y., Horng, M.-F., et al., 2014. Hybrid bat algorithm with artificial bee colony. In: Intelligent Data Analysis and Its Applications. Springer, pp. 45–55. Burke, E.K., Cowling, P.I., Keuthen, R., 2001. Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem. In: Applications of Evolutionary Computing. Springer, Como, pp. 203–212. Shi, Liang, Lee, Lu, Wang (bib86) 2007; 103 Zhang, Wang (bib102) 2012; 203 Yang, X.-S., 2010. A new metaheuristic bat-inspired algorithm. In: Nature Inspired Cooperative Strategies for Optimization. Springer, pp. 65–74. Grefenstette, J., Gopal, R., Rosmaita, B., Van Gucht, D., 1985. Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications. Lawrence Erlbaum, New Jersey, pp. 160–168. Larrañaga, Kuijpers, Murga, Inza, Dizdarevic (bib52) 1999; 13 Chen, Chien (bib18) 2011; 38 İnkaya, Kayaligil, Özdemirel (bib38) 2015; 28 Fister, Rauter, Yang, Ljubič (bib28) 2015; 149 Ardalan, Karimi, Poursabzi, Naderi (bib6) 2015; 26 Knox (bib48) 1994; 21 Clerc, M., 2004. Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering. Springer, Berlin, pp. 219–239. Yao, W.-q., 2014. Genetic quantum particle swarm optimization algorithm for solving traveling salesman problems. In: Fuzzy Information & Engineering and Operations Research & Management. Springer, Babolsar, pp. 67–74. Christofides (bib19) 1976; 10 Yang, X.-S., 2009. Firefly algorithms for multimodal optimization. In: Stochastic Algorithms: Foundations and Applications. Springer, Sapporo, pp. 169–178. Misevičius, A., 2015. Using iterated tabu search for the traveling salesman problem. Inf. Technol. Control 32. Parpinelli, Lopes (bib77) 2011; 3 Karaboga, D., 2005. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department. Ralphs, Kopman, Pulleyblank, Trotter (bib79) 2003; 94 Tang, Li, Luo, Liu (bib89) 2015; 37 Alba, Troya (bib3) 1999; 4 Lawler, E.L., Lenstra, J.K., Kan, A.R., Shmoys, D.B., 1985. The traveling salesman problem: a guided tour of combinatorial optimization, vol. 3. Wiley, New York. Atashpaz-Gargari, E., Lucas, C., 2007. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on Evolutionary Computation, pp. 4661–4667. Cao, Glover, Rego (bib16) 2015 Mirjalili, Mirjalili, Yang (bib67) 2014; 25 Syswerda, G., 1991. Schedule optimization using genetic algorithms. Handbook of Genetic Algorithms, pp. 332–349. Anbuudayasankar, S., Ganesh, K., Mohapatra, S., 2014. Survey of methodologies for TSP and VRP. In: Models for Practical Routing Problems in Logistics. Springer, Switzerland, pp. 11–42. Singh, A., Thapar, S., Bhatia, A., Singh, S., Goyal, R., Chen, J., 2015. Disk scheduling using a customized discrete firefly algorithm. Cogent Eng. 2 Holland, J.H., 1975. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT Press, Boston. Wang (bib93) 2015; 42 Levin, M.S., 2015. System configuration and combinatorial optimization. In: Modular System Design and Evaluation. Springer, pp. 89–109. Yang, He (bib97) 2013; 5 Caceres-Cruz, Arias, Guimarans, Riera, Juan (bib14) 2014; 47 Jati, G.K., Manurung, R., Suyanto, 2013. Discrete firefly algorithm for traveling salesman problem: a new movement scheme. Swarm Intell. Bio-Inspired Comput.: Theory Appl., pp. 295–312. Gendreau, Laporte, Semet (bib31) 1998; 106 Luo, Q., Zhou, Y., Xie, J., Ma, M., Li, L., 2014. Discrete bat algorithm for optimal problem of permutation flow shop scheduling. Sci. World J. Derrac, García, Molina, Herrera (bib23) 2011; 1 Bortfeldt, Hahn, Männel, Mönch (bib12) 2015; 243 Ouaarab, Ahiod, Yang (bib74) 2014; 24 Mahi, Baykan, Kodaz (bib62) 2015; 30 Dorigo, Blum (bib24) 2005; 344 Bianchessi, Righini (bib10) 2007; 34 Pérez, J., Valdez, F., Castillo, O., 2015. A new bat algorithm with fuzzy logic for dynamical parameter adaptation and its applicability to fuzzy control design. In: Fuzzy Logic Augmentation of Nature-Inspired Optimization Metaheuristics. Springer, pp. 65–79. Pang, Ma, Liu (bib76) 2015; 12 Yip, Pao (bib100) 1995; 6 Zhou, L., Ding, L., Qiang, X., 2014. A multi-population discrete firefly algorithm to solve TSP. In: Bio-Inspired Computing-Theories and Applications. Springer, Wuhan, pp. 648–653. Ariyasingha, Fernando (bib7) 2015; 23 Ma, Zhao, Wu, He, Yang (bib61) 2015; 159 Wang (bib92) 2014; 70 Karaboga, D., Gorkemli, B., 2011. A combinatorial artificial bee colony algorithm for traveling salesman problem. In: International Symposium on Innovations in Intelligent Systems and Applications. IEEE, Istanbul, pp. 50–53. Yousefikhoshbakht, Sedighpour (bib101) 2013; 90 Bora, Coelho, Lebensztajn (bib11) 2012; 48 Lin (bib59) 1965; 44 Rodriguez, A., Gutierrez, A., Rivera, L., Ramirez, L., 2015. Rwa: comparison of genetic algorithms and simulated annealing in dynamic traffic. In: Advanced Computer and Communication Engineering Technology. Springer, pp. 3–14. Laporte (bib51) 1992; 59 Groba, Sartal, Vázquez (bib35) 2015; 56 Imanian, Shiri, Moradi (bib37) 2014; 36 Fister, I., Yang, X.-S., Fister, D., Fister Jr, I., 2014. Firefly algorithm: a brief review of the expanding literature. In: Cuckoo Search and Firefly Algorithm. Springer, Switzerland, pp. 347–360. Saenphon, Phimoltares, Lursinsap (bib84) 2014; 35 Larranaga, Kuijpers, Murga, Inza, Dizdarevic (bib53) 1999; 13 Urrutia, Milanés, Løkketangen (bib91) 2015; 22 Yang, Hossein Gandomi (bib98) 2012; 29 Malek, Guruswamy, Pandya, Owens (bib63) 1989; 21 Jun-man, Yi (bib40) 2012; 17 Kasperski, Zieliński (bib44) 2015; 565 Marinakis, Marinaki, Dounias (bib65) 2011; 181 Kennedy, J., Eberhart, R., et al., 1995. Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4. Perth, Australia, pp. 1942–1948. Laporte (bib50) 1992; 59 Bezerra, L.C., López-Ibáñez, M., Stützle, T., 2014. Automatic design of evolutionary algorithms for multi-objective combinatorial optimization. In: Parallel Problem Solving from Nature. Springer, Ljubljana, pp. 508–517. Fiechter (bib26) 1994; 51 Marichelvam, Prabaharan, Yang, Geetha (bib64) 2013; 5 Roeva, Fidanova (bib83) 2013; 27 Tarantilis, Kiranoudis (bib90) 2007; 179 Yang (bib96) 2011; 3 Cantú-Paz (bib15) 2001; 7 Moayedikia, Jensen, Wiil, Forsati (bib69) 2015; 44 Rocki, K., Suda, R., 2012. Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem. In: IEEE International Conference on High Performance Computing and Simulation, pp. 489–495. Fister, Fister Jr, Yang, Brest (bib27) 2013; 13 Meng, Gao, Liu (bib66) 2015; 8 Nagata, Soler (bib70) 2012; 39 Reinelt (bib80) 1991; 3 De Jong, K., 1975. Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. thesis, University of Michigan, Michigan, USA. Khan, K., Nikov, A., Sahai, A., 2011. A fuzzy bat clustering method for ergonomic screening of office workplaces. In: Third International Conference on Software, Services and Semantic Technologies. Springer, Bourgas, pp. 59–66. Dorigo, Gambardella (bib25) 1997; 1 Abdel-Raouf, Abdel-Baset, El-Henawy (bib2) 2014; 6 Li, Ma, Zhang, Zhou, Liu (bib56) 2015; 12 Osaba, E., Diaz, F., Onieva, E., 2014. Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Appl. Intell. 41, pp. 145–166. 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: Conference on Graphics, Patterns and Images. IEEE, pp. 291–297. Goldberg, D., 1989. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional, Boston. Saji, Y., Riffi, M.E., Ahiod, B., 2014. Discrete bat-inspired algorithm for travelling salesman problem. In: Second World Conference on Complex Systems. IEEE, Agadir, pp. 28–31. Lin, Chou, Yang, Tsai (bib58) 2012; 2 Pan, T.-S., Dao, T.-K., Chu, S.-C., et al., 2015. Hybrid particle swarm optimization with bat algorithm. In: Genetic and Evolutionary Computing. Springer, Nanchang, pp. 37–47. Carrabs, Cordeau, Laporte (bib17) 2007; 19 Kirkpatrick, Gellat, Vecchi (bib47) 1983; 220 Glover (bib32) 1989; 1 Zhao, Xiong, Shu (bib103) 2015; 12 Karaboga, Basturk (bib42) 2007; 39 Alfa, Heragu, Chen (bib4) 1991; 21 Gandomi, Yang (bib30) 2014; 5 Aarts, Korst, van Laarhoven (bib1) 1988; 50 Komarasamy, Wahi (bib49) 2012; 84 Liang, Wang, Chen, Tseng (bib57) 2015; 64 Alba (10.1016/j.engappai.2015.10.006_bib3) 1999; 4 Dorigo (10.1016/j.engappai.2015.10.006_bib25) 1997; 1 Yang (10.1016/j.engappai.2015.10.006_bib98) 2012; 29 Alfa (10.1016/j.engappai.2015.10.006_bib4) 1991; 21 Tang (10.1016/j.engappai.2015.10.006_bib89) 2015; 37 Tarantilis (10.1016/j.engappai.2015.10.006_bib90) 2007; 179 Li (10.1016/j.engappai.2015.10.006_bib56) 2015; 12 10.1016/j.engappai.2015.10.006_bib8 10.1016/j.engappai.2015.10.006_bib9 Kirkpatrick (10.1016/j.engappai.2015.10.006_bib47) 1983; 220 10.1016/j.engappai.2015.10.006_bib5 Ma (10.1016/j.engappai.2015.10.006_bib61) 2015; 159 Laporte (10.1016/j.engappai.2015.10.006_bib51) 1992; 59 Laporte (10.1016/j.engappai.2015.10.006_bib50) 1992; 59 10.1016/j.engappai.2015.10.006_bib71 10.1016/j.engappai.2015.10.006_bib72 10.1016/j.engappai.2015.10.006_bib73 Bianchessi (10.1016/j.engappai.2015.10.006_bib10) 2007; 34 10.1016/j.engappai.2015.10.006_bib75 Mirjalili (10.1016/j.engappai.2015.10.006_bib67) 2014; 25 10.1016/j.engappai.2015.10.006_bib78 Yang (10.1016/j.engappai.2015.10.006_bib96) 2011; 3 Mahi (10.1016/j.engappai.2015.10.006_bib62) 2015; 30 Fister (10.1016/j.engappai.2015.10.006_bib27) 2013; 13 Jun-man (10.1016/j.engappai.2015.10.006_bib40) 2012; 17 10.1016/j.engappai.2015.10.006_bib60 10.1016/j.engappai.2015.10.006_bib68 Derrac (10.1016/j.engappai.2015.10.006_bib23) 2011; 1 Dorigo (10.1016/j.engappai.2015.10.006_bib24) 2005; 344 Carrabs (10.1016/j.engappai.2015.10.006_bib17) 2007; 19 Gendreau (10.1016/j.engappai.2015.10.006_bib31) 1998; 106 10.1016/j.engappai.2015.10.006_bib94 10.1016/j.engappai.2015.10.006_bib95 İnkaya (10.1016/j.engappai.2015.10.006_bib38) 2015; 28 Malek (10.1016/j.engappai.2015.10.006_bib63) 1989; 21 Ouaarab (10.1016/j.engappai.2015.10.006_bib74) 2014; 24 Groba (10.1016/j.engappai.2015.10.006_bib35) 2015; 56 10.1016/j.engappai.2015.10.006_bib99 10.1016/j.engappai.2015.10.006_bib13 Ralphs (10.1016/j.engappai.2015.10.006_bib79) 2003; 94 Marichelvam (10.1016/j.engappai.2015.10.006_bib64) 2013; 5 Yousefikhoshbakht (10.1016/j.engappai.2015.10.006_bib101) 2013; 90 Karaboga (10.1016/j.engappai.2015.10.006_bib42) 2007; 39 Urrutia (10.1016/j.engappai.2015.10.006_bib91) 2015; 22 Zhao (10.1016/j.engappai.2015.10.006_bib103) 2015; 12 Marinakis (10.1016/j.engappai.2015.10.006_bib65) 2011; 181 Parpinelli (10.1016/j.engappai.2015.10.006_bib77) 2011; 3 Lin (10.1016/j.engappai.2015.10.006_bib59) 1965; 44 10.1016/j.engappai.2015.10.006_bib81 10.1016/j.engappai.2015.10.006_bib82 Bortfeldt (10.1016/j.engappai.2015.10.006_bib12) 2015; 243 Imanian (10.1016/j.engappai.2015.10.006_bib37) 2014; 36 Glover (10.1016/j.engappai.2015.10.006_bib32) 1989; 1 10.1016/j.engappai.2015.10.006_bib85 Meng (10.1016/j.engappai.2015.10.006_bib66) 2015; 8 10.1016/j.engappai.2015.10.006_bib87 10.1016/j.engappai.2015.10.006_bib88 Caceres-Cruz (10.1016/j.engappai.2015.10.006_bib14) 2014; 47 Knox (10.1016/j.engappai.2015.10.006_bib48) 1994; 21 10.1016/j.engappai.2015.10.006_bib39 Yang (10.1016/j.engappai.2015.10.006_bib97) 2013; 5 Liang (10.1016/j.engappai.2015.10.006_bib57) 2015; 64 Abdel-Raouf (10.1016/j.engappai.2015.10.006_bib2) 2014; 6 Fiechter (10.1016/j.engappai.2015.10.006_bib26) 1994; 51 10.1016/j.engappai.2015.10.006_bib33 10.1016/j.engappai.2015.10.006_bib34 Saenphon (10.1016/j.engappai.2015.10.006_bib84) 2014; 35 Yip (10.1016/j.engappai.2015.10.006_bib100) 1995; 6 10.1016/j.engappai.2015.10.006_bib36 10.1016/j.engappai.2015.10.006_bib29 Christofides (10.1016/j.engappai.2015.10.006_bib19) 1976; 10 Pang (10.1016/j.engappai.2015.10.006_bib76) 2015; 12 Komarasamy (10.1016/j.engappai.2015.10.006_bib49) 2012; 84 Cao (10.1016/j.engappai.2015.10.006_bib16) 2015 Ardalan (10.1016/j.engappai.2015.10.006_bib6) 2015; 26 10.1016/j.engappai.2015.10.006_bib20 10.1016/j.engappai.2015.10.006_bib21 10.1016/j.engappai.2015.10.006_bib22 Aarts (10.1016/j.engappai.2015.10.006_bib1) 1988; 50 Chen (10.1016/j.engappai.2015.10.006_bib18) 2011; 38 Wang (10.1016/j.engappai.2015.10.006_bib92) 2014; 70 10.1016/j.engappai.2015.10.006_bib104 Zhang (10.1016/j.engappai.2015.10.006_bib102) 2012; 203 Roeva (10.1016/j.engappai.2015.10.006_bib83) 2013; 27 Ariyasingha (10.1016/j.engappai.2015.10.006_bib7) 2015; 23 Larrañaga (10.1016/j.engappai.2015.10.006_bib52) 1999; 13 Bora (10.1016/j.engappai.2015.10.006_bib11) 2012; 48 Wang (10.1016/j.engappai.2015.10.006_bib93) 2015; 42 10.1016/j.engappai.2015.10.006_bib54 10.1016/j.engappai.2015.10.006_bib55 Moayedikia (10.1016/j.engappai.2015.10.006_bib69) 2015; 44 Larranaga (10.1016/j.engappai.2015.10.006_bib53) 1999; 13 Reinelt (10.1016/j.engappai.2015.10.006_bib80) 1991; 3 Lin (10.1016/j.engappai.2015.10.006_bib58) 2012; 2 Shi (10.1016/j.engappai.2015.10.006_bib86) 2007; 103 Cantú-Paz (10.1016/j.engappai.2015.10.006_bib15) 2001; 7 Nagata (10.1016/j.engappai.2015.10.006_bib70) 2012; 39 Gandomi (10.1016/j.engappai.2015.10.006_bib30) 2014; 5 Kasperski (10.1016/j.engappai.2015.10.006_bib44) 2015; 565 10.1016/j.engappai.2015.10.006_bib41 10.1016/j.engappai.2015.10.006_bib43 Fister (10.1016/j.engappai.2015.10.006_bib28) 2015; 149 10.1016/j.engappai.2015.10.006_bib45 10.1016/j.engappai.2015.10.006_bib46 |
| References_xml | – volume: 106 start-page: 539 year: 1998 end-page: 545 ident: bib31 article-title: A tabu search heuristic for the undirected selective travelling salesman problem publication-title: Eur. J. Oper. Res. – volume: 84 start-page: 26 year: 2012 end-page: 273 ident: bib49 article-title: An optimized k-means clustering technique using bat algorithm publication-title: Eur. J. Sci. Res. – reference: Saji, Y., Riffi, M.E., Ahiod, B., 2014. Discrete bat-inspired algorithm for travelling salesman problem. In: Second World Conference on Complex Systems. IEEE, Agadir, pp. 28–31. – volume: 10 start-page: 55 year: 1976 end-page: 70 ident: bib19 article-title: The vehicle routing problem publication-title: RAIRO-Oper. Res.-Rech. Opér. – reference: Clerc, M., 2004. Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering. Springer, Berlin, pp. 219–239. – reference: Davis, L., 1985. Applying adaptive algorithms to epistatic domains. In: Proceedings of the International Joint Conference on Artificial Intelligence, vol. 1, pp. 161–163. – volume: 181 start-page: 4684 year: 2011 end-page: 4698 ident: bib65 article-title: Honey bees mating optimization algorithm for the euclidean traveling salesman problem publication-title: Inf. Sci. – reference: Rocki, K., Suda, R., 2012. Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem. In: IEEE International Conference on High Performance Computing and Simulation, pp. 489–495. – reference: Zhou, L., Ding, L., Qiang, X., 2014. A multi-population discrete firefly algorithm to solve TSP. In: Bio-Inspired Computing-Theories and Applications. Springer, Wuhan, pp. 648–653. – reference: Levin, M.S., 2015. System configuration and combinatorial optimization. In: Modular System Design and Evaluation. Springer, pp. 89–109. – volume: 12 start-page: 1165 year: 2015 end-page: 1169 ident: bib103 article-title: Simulated annealing with a hybrid local search for solving the traveling salesman problem publication-title: J. Comput. Theor. Nanosci. – volume: 12 start-page: 1440 year: 2015 end-page: 1444 ident: bib76 article-title: An improved ant colony optimization with optimal search library for solving the traveling salesman problem publication-title: J. Comput. Theor. Nanosci. – volume: 27 start-page: 4323 year: 2013 end-page: 4326 ident: bib83 article-title: Hybrid bat algorithm for parameter identification of an e. coli cultivation process model publication-title: Biotechnol. Biotechnol. Equip. – volume: 50 start-page: 187 year: 1988 end-page: 206 ident: bib1 article-title: A quantitative analysis of the simulated annealing algorithm publication-title: J. Stat. Phys. – reference: Nguyen, T.-T., Pan, J.-S., Dao, T.-K., Kuo, M.-Y., Horng, M.-F., et al., 2014. Hybrid bat algorithm with artificial bee colony. In: Intelligent Data Analysis and Its Applications. Springer, pp. 45–55. – reference: Misevičius, A., 2015. Using iterated tabu search for the traveling salesman problem. Inf. Technol. Control 32. – volume: 7 start-page: 311 year: 2001 end-page: 334 ident: bib15 article-title: Migration policies, selection pressure, and parallel evolutionary algorithms publication-title: J. Heuristics – volume: 3 start-page: 267 year: 2011 end-page: 274 ident: bib96 article-title: Bat algorithm for multi-objective optimisation publication-title: Int. J. Bio-Inspired Comput. – reference: Anbuudayasankar, S., Ganesh, K., Mohapatra, S., 2014. Survey of methodologies for TSP and VRP. In: Models for Practical Routing Problems in Logistics. Springer, Switzerland, pp. 11–42. – volume: 25 start-page: 663 year: 2014 end-page: 681 ident: bib67 article-title: Binary bat algorithm publication-title: Neural Comput. Appl. – volume: 39 start-page: 8947 year: 2012 end-page: 8953 ident: bib70 article-title: A new genetic algorithm for the asymmetric traveling salesman problem publication-title: Expert Syst. Appl. – volume: 203 start-page: 88 year: 2012 end-page: 93 ident: bib102 article-title: Image matching using a bat algorithm with mutation publication-title: Appl. Mech. Mater. – volume: 149 start-page: 993 year: 2015 end-page: 1002 ident: bib28 article-title: Planning the sports training sessions with the bat algorithm publication-title: Neurocomputing – volume: 19 start-page: 618 year: 2007 end-page: 632 ident: bib17 article-title: Variable neighborhood search for the pickup and delivery traveling salesman problem with lifo loading publication-title: INFORMS J. Comput. – volume: 21 start-page: 867 year: 1994 end-page: 876 ident: bib48 article-title: Tabu search performance on the symmetric traveling salesman problem publication-title: Comput. Oper. Res. – volume: 70 start-page: 124 year: 2014 end-page: 133 ident: bib92 article-title: The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem publication-title: Comput. Ind. Eng. – volume: 179 start-page: 806 year: 2007 end-page: 822 ident: bib90 article-title: A flexible adaptive memory-based algorithm for real-life transportation operations publication-title: Eur. J. Oper. Res. – volume: 29 start-page: 464 year: 2012 end-page: 483 ident: bib98 article-title: Bat algorithm publication-title: Eng. Comput. – volume: 220 start-page: 671 year: 1983 end-page: 680 ident: bib47 article-title: Optimization by simulated annealing publication-title: Science – reference: Burke, E.K., Cowling, P.I., Keuthen, R., 2001. Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem. In: Applications of Evolutionary Computing. Springer, Como, pp. 203–212. – volume: 3 start-page: 376 year: 1991 end-page: 384 ident: bib80 article-title: Tsplib publication-title: ORSA J. Comput. – volume: 90 start-page: 1495 year: 2013 end-page: 1505 ident: bib101 article-title: New imperialist competitive algorithm to solve the travelling salesman problem publication-title: Int. J. Comput. Math. – volume: 44 start-page: 153 year: 2015 end-page: 167 ident: bib69 article-title: Weighted bee colony algorithm for discrete optimization problems with application to feature selection publication-title: Eng. Appl. Artif. Intell. – reference: Luo, Q., Zhou, Y., Xie, J., Ma, M., Li, L., 2014. Discrete bat algorithm for optimal problem of permutation flow shop scheduling. Sci. World J. – reference: Goldberg, D., 1989. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional, Boston. – volume: 36 start-page: 148 year: 2014 end-page: 163 ident: bib37 article-title: Velocity based artificial bee colony algorithm for high dimensional continuous optimization problems publication-title: Eng. Appl. Artif. Intell. – volume: 4 start-page: 31 year: 1999 end-page: 52 ident: bib3 article-title: A survey of parallel distributed genetic algorithms publication-title: Complexity – reference: Karaboga, D., 2005. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department. – volume: 13 start-page: 34 year: 2013 end-page: 46 ident: bib27 article-title: A comprehensive review of firefly algorithms publication-title: Swarm Evol. Comput. – volume: 103 start-page: 169 year: 2007 end-page: 176 ident: bib86 article-title: Particle swarm optimization-based algorithms for TSP and generalized TSP publication-title: Inf. Process. Lett. – volume: 5 start-page: 141 year: 2013 end-page: 149 ident: bib97 article-title: Bat algorithm publication-title: Int. J. Bio-Inspired Comput. – volume: 21 start-page: 635 year: 1991 end-page: 639 ident: bib4 article-title: A 3-opt based simulated annealing algorithm for vehicle routing problems publication-title: Comput. Ind. Eng. – volume: 13 start-page: 129 year: 1999 end-page: 170 ident: bib53 article-title: Genetic algorithms for the travelling salesman problem publication-title: Artif. Intell. Rev. – reference: Jati, G.K., Manurung, R., Suyanto, 2013. Discrete firefly algorithm for traveling salesman problem: a new movement scheme. Swarm Intell. Bio-Inspired Comput.: Theory Appl., pp. 295–312. – reference: Khan, K., Nikov, A., Sahai, A., 2011. A fuzzy bat clustering method for ergonomic screening of office workplaces. In: Third International Conference on Software, Services and Semantic Technologies. Springer, Bourgas, pp. 59–66. – reference: Holland, J.H., 1975. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT Press, Boston. – volume: 5 start-page: 15 year: 2013 end-page: 29 ident: bib64 article-title: Solving hybrid flow shop scheduling problems using bat algorithm publication-title: Int. J. Logist. Econ. Glob. – volume: 39 start-page: 459 year: 2007 end-page: 471 ident: bib42 article-title: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm publication-title: J. Glob. Optim. – volume: 243 start-page: 82 year: 2015 end-page: 96 ident: bib12 article-title: Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3d loading constraints publication-title: Eur. J. Oper. Res. – volume: 1 start-page: 190 year: 1989 end-page: 206 ident: bib32 article-title: Tabu search, part i publication-title: ORSA J. Computing – volume: 6 start-page: 18 year: 2014 ident: bib2 article-title: An improved chaotic bat algorithm for solving integer programming problems publication-title: Int. J. Mod. Educ. Comput. Sci. – volume: 5 start-page: 224 year: 2014 end-page: 232 ident: bib30 article-title: Chaotic bat algorithm publication-title: J. Comput. Sci. – volume: 37 start-page: 9 year: 2015 end-page: 19 ident: bib89 article-title: Multi-strategy adaptive particle swarm optimization for numerical optimization publication-title: Eng. Appl. Artif. Intell. – volume: 24 start-page: 1659 year: 2014 end-page: 1669 ident: bib74 article-title: Discrete cuckoo search algorithm for the travelling salesman problem publication-title: Neural Comput. Appl. – reference: Osaba, E., Diaz, F., Onieva, E., 2014. Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Appl. Intell. 41, pp. 145–166. – volume: 26 start-page: 546 year: 2015 end-page: 555 ident: bib6 article-title: A novel imperialist competitive algorithm for generalized traveling salesman problems publication-title: Appl. Soft Comput. – reference: Fister, I., Yang, X.-S., Fister, D., Fister Jr, I., 2014. Firefly algorithm: a brief review of the expanding literature. In: Cuckoo Search and Firefly Algorithm. Springer, Switzerland, pp. 347–360. – volume: 34 start-page: 578 year: 2007 end-page: 594 ident: bib10 article-title: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery publication-title: Comput. Oper. Res. – volume: 38 start-page: 14439 year: 2011 end-page: 14450 ident: bib18 article-title: Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques publication-title: Expert Syst. Appl. – start-page: 1 year: 2015 end-page: 21 ident: bib16 article-title: A tabu search algorithm for cohesive clustering problems publication-title: J. Heuristics – volume: 2 start-page: 56 year: 2012 end-page: 63 ident: bib58 article-title: A chaotic levy flight bat algorithm for parameter estimation in nonlinear dynamic biological systems publication-title: Comput. Inf. Technol. – volume: 8 start-page: 383 year: 2015 end-page: 396 ident: bib66 article-title: A novel hybrid bat algorithm with differential evolution strategy for constrained optimization publication-title: Int. J. Hybrid Inf. Technol. – volume: 35 start-page: 324 year: 2014 end-page: 334 ident: bib84 article-title: Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem publication-title: Eng. Appl. Artif. Intell. – reference: Bezerra, L.C., López-Ibáñez, M., Stützle, T., 2014. Automatic design of evolutionary algorithms for multi-objective combinatorial optimization. In: Parallel Problem Solving from Nature. Springer, Ljubljana, pp. 508–517. – reference: Pérez, J., Valdez, F., Castillo, O., 2015. A new bat algorithm with fuzzy logic for dynamical parameter adaptation and its applicability to fuzzy control design. In: Fuzzy Logic Augmentation of Nature-Inspired Optimization Metaheuristics. Springer, pp. 65–79. – volume: 1 start-page: 3 year: 2011 end-page: 18 ident: bib23 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evol. Comput. – volume: 30 start-page: 484 year: 2015 end-page: 490 ident: bib62 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: 17 start-page: 319 year: 2012 end-page: 325 ident: bib40 article-title: Application of an improved ant colony optimization on generalized traveling salesman problem publication-title: Energy Procedia – reference: Pan, T.-S., Dao, T.-K., Chu, S.-C., et al., 2015. Hybrid particle swarm optimization with bat algorithm. In: Genetic and Evolutionary Computing. Springer, Nanchang, pp. 37–47. – reference: Yang, X.-S., 2009. Firefly algorithms for multimodal optimization. In: Stochastic Algorithms: Foundations and Applications. Springer, Sapporo, pp. 169–178. – reference: Kennedy, J., Eberhart, R., et al., 1995. Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4. Perth, Australia, pp. 1942–1948. – volume: 42 start-page: 5150 year: 2015 end-page: 5162 ident: bib93 article-title: An approximate method to compute a sparse graph for traveling salesman problem publication-title: Expert Syst. Appl. – volume: 565 start-page: 102 year: 2015 end-page: 112 ident: bib44 article-title: Combinatorial optimization problems with uncertain costs and the owa criterion publication-title: Theor. Comput. Sci. – volume: 3 start-page: 1 year: 2011 end-page: 16 ident: bib77 article-title: New inspirations in swarm intelligence publication-title: Int. J. Bio-Inspired Comput. – volume: 23 start-page: 11 year: 2015 end-page: 26 ident: bib7 article-title: Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem publication-title: Swarm Evol. Comput. – volume: 28 start-page: 301 year: 2015 end-page: 311 ident: bib38 article-title: Ant colony optimization based clustering methodology publication-title: Appl. Soft Comput. – volume: 344 start-page: 243 year: 2005 end-page: 278 ident: bib24 article-title: Ant colony optimization theory publication-title: Theor. Comput. Sci. – volume: 1 start-page: 53 year: 1997 end-page: 66 ident: bib25 article-title: Ant colony system publication-title: IEEE Trans. Evol. Comput. – volume: 47 start-page: 32 year: 2014 ident: bib14 article-title: Rich vehicle routing problem publication-title: ACM Comput. Surv. – volume: 21 start-page: 59 year: 1989 end-page: 84 ident: bib63 article-title: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem publication-title: Ann. Oper. Res. – volume: 51 start-page: 243 year: 1994 end-page: 267 ident: bib26 article-title: A parallel tabu search algorithm for large traveling salesman problems publication-title: Discret. Appl. Math. – volume: 64 start-page: 1088 year: 2015 end-page: 1097 ident: bib57 article-title: An enhanced firefly algorithm to multi-objective optimal active/reactive power dispatch with uncertainties consideration publication-title: Int. J. Electr. Power Energy Syst. – volume: 44 start-page: 2245 year: 1965 end-page: 2269 ident: bib59 article-title: Computer solutions of the traveling salesman problem publication-title: Bell Syst. Tech. J. – volume: 48 start-page: 947 year: 2012 end-page: 950 ident: bib11 article-title: Bat-inspired optimization approach for the brushless DC wheel motor problem publication-title: IEEE Trans. Magn. – volume: 12 start-page: 1277 year: 2015 end-page: 1281 ident: bib56 article-title: Firefly algorithm solving multiple traveling salesman problem publication-title: J. Comput. Theor. Nanosci. – volume: 59 start-page: 345 year: 1992 end-page: 358 ident: bib51 article-title: The vehicle routing problem publication-title: Eur. J. Oper. Res. – volume: 159 start-page: 288 year: 2015 end-page: 297 ident: bib61 article-title: Navigability analysis of magnetic map with projecting pursuit-based selection method by using firefly algorithm publication-title: Neurocomputing – reference: Grefenstette, J., Gopal, R., Rosmaita, B., Van Gucht, D., 1985. Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications. Lawrence Erlbaum, New Jersey, pp. 160–168. – reference: Syswerda, G., 1991. Schedule optimization using genetic algorithms. Handbook of Genetic Algorithms, pp. 332–349. – reference: Singh, A., Thapar, S., Bhatia, A., Singh, S., Goyal, R., Chen, J., 2015. Disk scheduling using a customized discrete firefly algorithm. Cogent Eng. 2 – 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: Conference on Graphics, Patterns and Images. IEEE, pp. 291–297. – volume: 56 start-page: 22 year: 2015 end-page: 32 ident: bib35 article-title: Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction publication-title: Comput. Oper. Res. – volume: 6 start-page: 290 year: 1995 end-page: 295 ident: bib100 article-title: Combinatorial optimization with use of guided evolutionary simulated annealing publication-title: IEEE Trans. Neural Netw. – reference: Rodriguez, A., Gutierrez, A., Rivera, L., Ramirez, L., 2015. Rwa: comparison of genetic algorithms and simulated annealing in dynamic traffic. In: Advanced Computer and Communication Engineering Technology. Springer, pp. 3–14. – reference: Atashpaz-Gargari, E., Lucas, C., 2007. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on Evolutionary Computation, pp. 4661–4667. – reference: Yang, X.-S., 2010. A new metaheuristic bat-inspired algorithm. In: Nature Inspired Cooperative Strategies for Optimization. Springer, pp. 65–74. – volume: 94 start-page: 343 year: 2003 end-page: 359 ident: bib79 article-title: On the capacitated vehicle routing problem publication-title: Math. Program. – volume: 22 start-page: 61 year: 2015 end-page: 75 ident: bib91 article-title: A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks publication-title: Int. Trans. Oper. Res. – reference: De Jong, K., 1975. Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. thesis, University of Michigan, Michigan, USA. – reference: Yao, W.-q., 2014. Genetic quantum particle swarm optimization algorithm for solving traveling salesman problems. In: Fuzzy Information & Engineering and Operations Research & Management. Springer, Babolsar, pp. 67–74. – volume: 59 start-page: 231 year: 1992 end-page: 247 ident: bib50 article-title: The traveling salesman problem publication-title: Eur. J. Oper. Res. – reference: Karaboga, D., Gorkemli, B., 2011. A combinatorial artificial bee colony algorithm for traveling salesman problem. In: International Symposium on Innovations in Intelligent Systems and Applications. IEEE, Istanbul, pp. 50–53. – volume: 13 start-page: 129 year: 1999 end-page: 170 ident: bib52 article-title: Genetic algorithms for the travelling salesman problem publication-title: Artif. Intell. Rev. – reference: Lawler, E.L., Lenstra, J.K., Kan, A.R., Shmoys, D.B., 1985. The traveling salesman problem: a guided tour of combinatorial optimization, vol. 3. Wiley, New York. – volume: 13 start-page: 129 year: 1999 ident: 10.1016/j.engappai.2015.10.006_bib52 article-title: Genetic algorithms for the travelling salesman problem publication-title: Artif. Intell. Rev. doi: 10.1023/A:1006529012972 – ident: 10.1016/j.engappai.2015.10.006_bib99 doi: 10.1007/978-3-642-38667-1_8 – ident: 10.1016/j.engappai.2015.10.006_bib68 – ident: 10.1016/j.engappai.2015.10.006_bib75 doi: 10.1007/978-3-319-12286-1_5 – volume: 12 start-page: 1440 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib76 article-title: An improved ant colony optimization with optimal search library for solving the traveling salesman problem publication-title: J. Comput. Theor. Nanosci. doi: 10.1166/jctn.2015.3910 – ident: 10.1016/j.engappai.2015.10.006_bib88 – ident: 10.1016/j.engappai.2015.10.006_bib95 doi: 10.1007/978-3-642-12538-6_6 – volume: 13 start-page: 34 year: 2013 ident: 10.1016/j.engappai.2015.10.006_bib27 article-title: A comprehensive review of firefly algorithms publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2013.06.001 – volume: 64 start-page: 1088 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib57 article-title: An enhanced firefly algorithm to multi-objective optimal active/reactive power dispatch with uncertainties consideration publication-title: Int. J. Electr. Power Energy Syst. doi: 10.1016/j.ijepes.2014.09.008 – ident: 10.1016/j.engappai.2015.10.006_bib33 – volume: 13 start-page: 129 year: 1999 ident: 10.1016/j.engappai.2015.10.006_bib53 article-title: Genetic algorithms for the travelling salesman problem publication-title: Artif. Intell. Rev. doi: 10.1023/A:1006529012972 – volume: 50 start-page: 187 year: 1988 ident: 10.1016/j.engappai.2015.10.006_bib1 article-title: A quantitative analysis of the simulated annealing algorithm publication-title: J. Stat. Phys. doi: 10.1007/BF01022991 – volume: 8 start-page: 383 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib66 article-title: A novel hybrid bat algorithm with differential evolution strategy for constrained optimization publication-title: Int. J. Hybrid Inf. Technol. doi: 10.14257/ijhit.2015.8.1.34 – volume: 29 start-page: 464 year: 2012 ident: 10.1016/j.engappai.2015.10.006_bib98 article-title: Bat algorithm publication-title: Eng. Comput. doi: 10.1108/02644401211235834 – ident: 10.1016/j.engappai.2015.10.006_bib72 doi: 10.1007/978-3-319-07773-4_5 – ident: 10.1016/j.engappai.2015.10.006_bib81 doi: 10.1109/HPCSim.2012.6266963 – volume: 21 start-page: 635 year: 1991 ident: 10.1016/j.engappai.2015.10.006_bib4 article-title: A 3-opt based simulated annealing algorithm for vehicle routing problems publication-title: Comput. Ind. Eng. doi: 10.1016/0360-8352(91)90165-3 – ident: 10.1016/j.engappai.2015.10.006_bib22 – volume: 1 start-page: 53 year: 1997 ident: 10.1016/j.engappai.2015.10.006_bib25 article-title: Ant colony system publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.585892 – volume: 30 start-page: 484 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib62 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. doi: 10.1016/j.asoc.2015.01.068 – ident: 10.1016/j.engappai.2015.10.006_bib36 – volume: 220 start-page: 671 year: 1983 ident: 10.1016/j.engappai.2015.10.006_bib47 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 39 start-page: 459 year: 2007 ident: 10.1016/j.engappai.2015.10.006_bib42 article-title: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm publication-title: J. Glob. Optim. doi: 10.1007/s10898-007-9149-x – volume: 26 start-page: 546 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib6 article-title: A novel imperialist competitive algorithm for generalized traveling salesman problems publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2014.08.033 – ident: 10.1016/j.engappai.2015.10.006_bib55 doi: 10.1007/978-3-319-09876-0_5 – ident: 10.1016/j.engappai.2015.10.006_bib73 doi: 10.1007/s10489-013-0512-y – ident: 10.1016/j.engappai.2015.10.006_bib78 doi: 10.1007/978-3-319-10960-2_4 – volume: 1 start-page: 3 year: 2011 ident: 10.1016/j.engappai.2015.10.006_bib23 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2011.02.002 – volume: 181 start-page: 4684 year: 2011 ident: 10.1016/j.engappai.2015.10.006_bib65 article-title: Honey bees mating optimization algorithm for the euclidean traveling salesman problem publication-title: Inf. Sci. doi: 10.1016/j.ins.2010.06.032 – ident: 10.1016/j.engappai.2015.10.006_bib94 doi: 10.1007/978-3-642-04944-6_14 – ident: 10.1016/j.engappai.2015.10.006_bib29 doi: 10.1007/978-3-319-02141-6_17 – ident: 10.1016/j.engappai.2015.10.006_bib5 doi: 10.1007/978-3-319-05035-5_2 – ident: 10.1016/j.engappai.2015.10.006_bib34 – ident: 10.1016/j.engappai.2015.10.006_bib71 doi: 10.1109/SIBGRAPI.2012.47 – volume: 6 start-page: 18 year: 2014 ident: 10.1016/j.engappai.2015.10.006_bib2 article-title: An improved chaotic bat algorithm for solving integer programming problems publication-title: Int. J. Mod. Educ. Comput. Sci. doi: 10.5815/ijmecs.2014.08.03 – volume: 10 start-page: 55 year: 1976 ident: 10.1016/j.engappai.2015.10.006_bib19 article-title: The vehicle routing problem publication-title: RAIRO-Oper. Res.-Rech. Opér. – volume: 51 start-page: 243 year: 1994 ident: 10.1016/j.engappai.2015.10.006_bib26 article-title: A parallel tabu search algorithm for large traveling salesman problems publication-title: Discret. Appl. Math. doi: 10.1016/0166-218X(92)00033-I – volume: 84 start-page: 26 year: 2012 ident: 10.1016/j.engappai.2015.10.006_bib49 article-title: An optimized k-means clustering technique using bat algorithm publication-title: Eur. J. Sci. Res. – volume: 3 start-page: 267 year: 2011 ident: 10.1016/j.engappai.2015.10.006_bib96 article-title: Bat algorithm for multi-objective optimisation publication-title: Int. J. Bio-Inspired Comput. doi: 10.1504/IJBIC.2011.042259 – volume: 59 start-page: 345 year: 1992 ident: 10.1016/j.engappai.2015.10.006_bib51 article-title: The vehicle routing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(92)90192-C – volume: 106 start-page: 539 year: 1998 ident: 10.1016/j.engappai.2015.10.006_bib31 article-title: A tabu search heuristic for the undirected selective travelling salesman problem publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(97)00289-0 – volume: 56 start-page: 22 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib35 article-title: Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.10.012 – volume: 22 start-page: 61 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib91 article-title: A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks publication-title: Int. Trans. Oper. Res. doi: 10.1111/itor.12053 – volume: 4 start-page: 31 year: 1999 ident: 10.1016/j.engappai.2015.10.006_bib3 article-title: A survey of parallel distributed genetic algorithms publication-title: Complexity doi: 10.1002/(SICI)1099-0526(199903/04)4:4<31::AID-CPLX5>3.0.CO;2-4 – volume: 21 start-page: 59 year: 1989 ident: 10.1016/j.engappai.2015.10.006_bib63 article-title: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem publication-title: Ann. Oper. Res. doi: 10.1007/BF02022093 – volume: 59 start-page: 231 year: 1992 ident: 10.1016/j.engappai.2015.10.006_bib50 article-title: The traveling salesman problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(92)90138-Y – volume: 19 start-page: 618 year: 2007 ident: 10.1016/j.engappai.2015.10.006_bib17 article-title: Variable neighborhood search for the pickup and delivery traveling salesman problem with lifo loading publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1060.0202 – volume: 23 start-page: 11 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib7 article-title: Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2015.02.003 – volume: 203 start-page: 88 year: 2012 ident: 10.1016/j.engappai.2015.10.006_bib102 article-title: Image matching using a bat algorithm with mutation publication-title: Appl. Mech. Mater. doi: 10.4028/www.scientific.net/AMM.203.88 – volume: 3 start-page: 1 year: 2011 ident: 10.1016/j.engappai.2015.10.006_bib77 article-title: New inspirations in swarm intelligence publication-title: Int. J. Bio-Inspired Comput. doi: 10.1504/IJBIC.2011.038700 – start-page: 1 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib16 article-title: A tabu search algorithm for cohesive clustering problems publication-title: J. Heuristics – volume: 47 start-page: 32 year: 2014 ident: 10.1016/j.engappai.2015.10.006_bib14 article-title: Rich vehicle routing problem publication-title: ACM Comput. Surv. doi: 10.1145/2666003 – volume: 94 start-page: 343 year: 2003 ident: 10.1016/j.engappai.2015.10.006_bib79 article-title: On the capacitated vehicle routing problem publication-title: Math. Program. doi: 10.1007/s10107-002-0323-0 – volume: 28 start-page: 301 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib38 article-title: Ant colony optimization based clustering methodology publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2014.11.060 – volume: 42 start-page: 5150 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib93 article-title: An approximate method to compute a sparse graph for traveling salesman problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2015.02.037 – volume: 35 start-page: 324 year: 2014 ident: 10.1016/j.engappai.2015.10.006_bib84 article-title: Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2014.06.026 – volume: 44 start-page: 153 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib69 article-title: Weighted bee colony algorithm for discrete optimization problems with application to feature selection publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2015.06.003 – ident: 10.1016/j.engappai.2015.10.006_bib39 doi: 10.1016/B978-0-12-405163-8.00013-2 – volume: 243 start-page: 82 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib12 article-title: Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3d loading constraints publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.12.001 – volume: 12 start-page: 1165 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib103 article-title: Simulated annealing with a hybrid local search for solving the traveling salesman problem publication-title: J. Comput. Theor. Nanosci. doi: 10.1166/jctn.2015.3868 – volume: 21 start-page: 867 year: 1994 ident: 10.1016/j.engappai.2015.10.006_bib48 article-title: Tabu search performance on the symmetric traveling salesman problem publication-title: Comput. Oper. Res. doi: 10.1016/0305-0548(94)90016-7 – ident: 10.1016/j.engappai.2015.10.006_bib9 doi: 10.1007/978-3-319-10762-2_50 – volume: 149 start-page: 993 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib28 article-title: Planning the sports training sessions with the bat algorithm publication-title: Neurocomputing doi: 10.1016/j.neucom.2014.07.034 – volume: 24 start-page: 1659 year: 2014 ident: 10.1016/j.engappai.2015.10.006_bib74 article-title: Discrete cuckoo search algorithm for the travelling salesman problem publication-title: Neural Comput. Appl. doi: 10.1007/s00521-013-1402-2 – volume: 159 start-page: 288 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib61 article-title: Navigability analysis of magnetic map with projecting pursuit-based selection method by using firefly algorithm publication-title: Neurocomputing doi: 10.1016/j.neucom.2015.01.028 – volume: 103 start-page: 169 year: 2007 ident: 10.1016/j.engappai.2015.10.006_bib86 article-title: Particle swarm optimization-based algorithms for TSP and generalized TSP publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2007.03.010 – volume: 37 start-page: 9 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib89 article-title: Multi-strategy adaptive particle swarm optimization for numerical optimization publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2014.08.002 – ident: 10.1016/j.engappai.2015.10.006_bib20 doi: 10.1007/978-3-540-39930-8_8 – volume: 44 start-page: 2245 year: 1965 ident: 10.1016/j.engappai.2015.10.006_bib59 article-title: Computer solutions of the traveling salesman problem publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1965.tb04146.x – volume: 12 start-page: 1277 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib56 article-title: Firefly algorithm solving multiple traveling salesman problem publication-title: J. Comput. Theor. Nanosci. doi: 10.1166/jctn.2015.3886 – volume: 3 start-page: 376 year: 1991 ident: 10.1016/j.engappai.2015.10.006_bib80 article-title: Tsplib publication-title: ORSA J. Comput. doi: 10.1287/ijoc.3.4.376 – volume: 39 start-page: 8947 year: 2012 ident: 10.1016/j.engappai.2015.10.006_bib70 article-title: A new genetic algorithm for the asymmetric traveling salesman problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2012.02.029 – volume: 48 start-page: 947 year: 2012 ident: 10.1016/j.engappai.2015.10.006_bib11 article-title: Bat-inspired optimization approach for the brushless DC wheel motor problem publication-title: IEEE Trans. Magn. doi: 10.1109/TMAG.2011.2176108 – volume: 565 start-page: 102 year: 2015 ident: 10.1016/j.engappai.2015.10.006_bib44 article-title: Combinatorial optimization problems with uncertain costs and the owa criterion publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2014.11.013 – volume: 7 start-page: 311 year: 2001 ident: 10.1016/j.engappai.2015.10.006_bib15 article-title: Migration policies, selection pressure, and parallel evolutionary algorithms publication-title: J. Heuristics doi: 10.1023/A:1011375326814 – ident: 10.1016/j.engappai.2015.10.006_bib45 doi: 10.1109/ICNN.1995.488968 – volume: 5 start-page: 15 year: 2013 ident: 10.1016/j.engappai.2015.10.006_bib64 article-title: Solving hybrid flow shop scheduling problems using bat algorithm publication-title: Int. J. Logist. Econ. Glob. – ident: 10.1016/j.engappai.2015.10.006_bib13 doi: 10.1007/3-540-45365-2_21 – volume: 344 start-page: 243 year: 2005 ident: 10.1016/j.engappai.2015.10.006_bib24 article-title: Ant colony optimization theory publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2005.05.020 – volume: 6 start-page: 290 year: 1995 ident: 10.1016/j.engappai.2015.10.006_bib100 article-title: Combinatorial optimization with use of guided evolutionary simulated annealing publication-title: IEEE Trans. Neural Netw. doi: 10.1109/72.363466 – volume: 36 start-page: 148 year: 2014 ident: 10.1016/j.engappai.2015.10.006_bib37 article-title: Velocity based artificial bee colony algorithm for high dimensional continuous optimization problems publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2014.07.012 – volume: 5 start-page: 224 year: 2014 ident: 10.1016/j.engappai.2015.10.006_bib30 article-title: Chaotic bat algorithm publication-title: J. Comput. Sci. doi: 10.1016/j.jocs.2013.10.002 – ident: 10.1016/j.engappai.2015.10.006_bib60 doi: 10.1155/2014/630280 – volume: 34 start-page: 578 year: 2007 ident: 10.1016/j.engappai.2015.10.006_bib10 article-title: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.03.014 – volume: 5 start-page: 141 year: 2013 ident: 10.1016/j.engappai.2015.10.006_bib97 article-title: Bat algorithm publication-title: Int. J. Bio-Inspired Comput. doi: 10.1504/IJBIC.2013.055093 – volume: 38 start-page: 14439 year: 2011 ident: 10.1016/j.engappai.2015.10.006_bib18 article-title: Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2011.04.163 – volume: 17 start-page: 319 year: 2012 ident: 10.1016/j.engappai.2015.10.006_bib40 article-title: Application of an improved ant colony optimization on generalized traveling salesman problem publication-title: Energy Procedia doi: 10.1016/j.egypro.2012.02.101 – ident: 10.1016/j.engappai.2015.10.006_bib54 doi: 10.2307/2582681 – ident: 10.1016/j.engappai.2015.10.006_bib21 – volume: 70 start-page: 124 year: 2014 ident: 10.1016/j.engappai.2015.10.006_bib92 article-title: The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2014.01.015 – ident: 10.1016/j.engappai.2015.10.006_bib104 doi: 10.1007/978-3-662-45049-9_106 – ident: 10.1016/j.engappai.2015.10.006_bib43 doi: 10.1109/INISTA.2011.5946125 – volume: 25 start-page: 663 year: 2014 ident: 10.1016/j.engappai.2015.10.006_bib67 article-title: Binary bat algorithm publication-title: Neural Comput. Appl. doi: 10.1007/s00521-013-1525-5 – ident: 10.1016/j.engappai.2015.10.006_bib82 doi: 10.1007/978-3-319-07674-4_1 – ident: 10.1016/j.engappai.2015.10.006_bib8 doi: 10.1109/CEC.2007.4425083 – volume: 1 start-page: 190 year: 1989 ident: 10.1016/j.engappai.2015.10.006_bib32 article-title: Tabu search, part i publication-title: ORSA J. Computing doi: 10.1287/ijoc.1.3.190 – volume: 27 start-page: 4323 year: 2013 ident: 10.1016/j.engappai.2015.10.006_bib83 article-title: Hybrid bat algorithm for parameter identification of an e. coli cultivation process model publication-title: Biotechnol. Biotechnol. Equip. doi: 10.5504/BBEQ.2013.0089 – ident: 10.1016/j.engappai.2015.10.006_bib85 doi: 10.1109/ICoCS.2014.7060983 – volume: 179 start-page: 806 year: 2007 ident: 10.1016/j.engappai.2015.10.006_bib90 article-title: A flexible adaptive memory-based algorithm for real-life transportation operations publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.03.059 – volume: 90 start-page: 1495 year: 2013 ident: 10.1016/j.engappai.2015.10.006_bib101 article-title: New imperialist competitive algorithm to solve the travelling salesman problem publication-title: Int. J. Comput. Math. doi: 10.1080/00207160.2012.758362 – volume: 2 start-page: 56 year: 2012 ident: 10.1016/j.engappai.2015.10.006_bib58 article-title: A chaotic levy flight bat algorithm for parameter estimation in nonlinear dynamic biological systems publication-title: Comput. Inf. Technol. – ident: 10.1016/j.engappai.2015.10.006_bib87 doi: 10.1080/23311916.2015.1011929 – ident: 10.1016/j.engappai.2015.10.006_bib41 – ident: 10.1016/j.engappai.2015.10.006_bib46 doi: 10.1007/978-3-642-23163-6_9 |
| SSID | ssj0003846 |
| Score | 2.5723517 |
| Snippet | Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 59 |
| SubjectTerms | Bat algorithm Combinatorial optimization Genetic algorithms Routing problems Traveling Salesman Problem |
| Title | An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems |
| URI | https://dx.doi.org/10.1016/j.engappai.2015.10.006 |
| Volume | 48 |
| WOSCitedRecordID | wos000368216900006&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-6769 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003846 issn: 0952-1976 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5FKQcuvBGlgPbArdpie7OxfYwgvISqSgQpEgdr1163bpt1ZKdR4RfxM5n1PmygovTAxUpW3nXs-TIzO56ZD6GXqWQyEJEgSSopmUQyJ0leciKKPJIBqM2QlR3ZRHx4mCyX6dFo9MPVwmzPY6WSy8t0_V9FDWMgbF06ewNx-0VhAD6D0OEIYofjPwl-pnTpY1NvwZXUNbcNuMX7guvQ7nHdVJuTVZda2H5brTSblm3X2n9daEIi06gbjEerY_xHhnWm_SWM3zcy3B--Be8SC5ouA6njAxm0_PQB3ZaLzmedK3lWe71jI9fLSpHPJ_7kNxXvYtw24O1P_1Sv5XfyTlMhcZNoXDT1MIYR-rTnQTAyImFqmGCcXjYdOK1itW3DjYk2pC1_KH8Thzg9kOoY7ptXOnGPHZjcvd7cuVf8v1lBn5vo0t5OM7dOpteBwazr7b4TxSxNxmhn9mG-_OitPk1MUZi7k0E1-tW_6GpHaODcLO6hO3ZXgmcGTffRSKoH6K7doWCr_1sYciQgbuwh-jpT2OENO7xhwBv2eMOAN-wBhkGKuMcb9njDDm_Y4e0R-vJ2vnj9nljGDpLTabAhIeWwIWB5JNJyygtaUpqyoggCkVORC1EkjIuCh7yYCsGTCWNiKhIZa7-SJqWkj9FY1Uo-QbiEOeDqh6Xe8usnzicsziexFEEZlGGxi5h7fFlu29lrVpXz7O8C3EWv_Ly1aehy7YzUSSezbqlxNzMA3jVzn974anvodv8PeYbGm-ZCPke38u2mapsXFnU_AR3SuQI |
| 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=An+improved+discrete+bat+algorithm+for+symmetric+and+asymmetric+Traveling+Salesman+Problems&rft.jtitle=Engineering+applications+of+artificial+intelligence&rft.au=Osaba%2C+Eneko&rft.au=Yang%2C+Xin-She&rft.au=Diaz%2C+Fernando&rft.au=Lopez-Garcia%2C+Pedro&rft.date=2016-02-01&rft.issn=0952-1976&rft.volume=48&rft.spage=59&rft.epage=71&rft_id=info:doi/10.1016%2Fj.engappai.2015.10.006&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_engappai_2015_10_006 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0952-1976&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0952-1976&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0952-1976&client=summon |