{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T04:24:30Z","timestamp":1782447870815,"version":"3.54.5"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T00:00:00Z","timestamp":1610496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T00:00:00Z","timestamp":1610496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673258 \/ 61075115"],"award-info":[{"award-number":["61673258 \/ 61075115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["19ZR1421600"],"award-info":[{"award-number":["19ZR1421600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10489-020-02099-z","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T02:40:10Z","timestamp":1610592010000},"page":"5644-5664","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Multiple ant colony optimization using both novel LSTM network and adaptive Tanimoto communication strategy"],"prefix":"10.1007","volume":"51","author":[{"given":"Shundong","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3879-6329","authenticated-orcid":false,"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,13]]},"reference":[{"key":"2099_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B (Cybern) 26:29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"2099_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"2099_CR3","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) MAX-MIN Ant System. Future Gen Comput Syst 16:889\u2013914","journal-title":"Future Gen Comput Syst"},{"key":"2099_CR4","doi-asserted-by":"publisher","first-page":"18464","DOI":"10.1109\/ACCESS.2019.2896104","volume":"7","author":"AM Abdelbar","year":"2019","unstructured":"Abdelbar AM, Salama KM (2019) Parameter self-adaptation in an ant colony algorithm for continuous optimization. IEEE Access 7:18464\u201318479","journal-title":"IEEE Access"},{"key":"2099_CR5","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.asoc.2014.12.002","volume":"28","author":"O Castillo","year":"2015","unstructured":"Castillo O, Neyoy H, Soria J, Melin P, Valdez F (2015) A new approach for dynamic fuzzy logic parameter tuning in Ant Colony Optimization and its application in fuzzy control of a mobile robot. Appl Soft Comput 28:150\u2013159","journal-title":"Appl Soft Comput"},{"key":"2099_CR6","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","volume":"47","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, M\u00fcller FM, Yang S (2017) Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybern 47:1743\u20131756","journal-title":"IEEE Trans Cybern"},{"key":"2099_CR7","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan \u00d6K, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput 30:484\u2013490","journal-title":"Appl Soft Comput"},{"key":"2099_CR8","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27:623\u2013656","journal-title":"Bell Syst Tech J"},{"key":"2099_CR9","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.future.2018.12.065","volume":"95","author":"X Dong","year":"2019","unstructured":"Dong X, Cai Y (2019) A novel genetic algorithm for large scale colored balanced traveling salesman problem. Futur Gener Comput Syst 95:727\u2013742","journal-title":"Futur Gener Comput Syst"},{"key":"2099_CR10","doi-asserted-by":"publisher","first-page":"4211","DOI":"10.1007\/s10489-019-01487-4","volume":"49","author":"L Ding","year":"2019","unstructured":"Ding L, Du W, Zhao X, Wang L, Jia W (2019) A new asynchronous reinforcement learning algorithm based on improved parallel PSO. Appled Intelligence 49:4211\u20134222","journal-title":"Appled Intelligence"},{"key":"2099_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2017.08.067","volume":"421","author":"Y Zhong","year":"2017","unstructured":"Zhong Y, Lin J, Wang L, Hui Z (2017) Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inform Sci 421:70\u201384","journal-title":"Inform Sci"},{"key":"2099_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.eswa.2019.05.037","volume":"134","author":"I K\u00fc\u00e7\u00fckoglu","year":"2019","unstructured":"K\u00fc\u00e7\u00fckoglu I, Dewil R, Cattrysse D (2019) Hybrid simulated annealing and tabu search method for the electric travelling salesman problem with time windows and mixed charging rates. Expert Syst Appl 134:279\u2013303","journal-title":"Expert Syst Appl"},{"key":"2099_CR13","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/TNNLS.2016.2608834","volume":"29","author":"X Peng","year":"2018","unstructured":"Peng X, Lu C, Yi Z, Tang H (2018) Connections between nuclear-norm and frobenius-norm-based representations. IEEE Trans Neural Netw Learn Syst 29:218\u2013224","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2099_CR14","doi-asserted-by":"publisher","first-page":"5076","DOI":"10.1109\/TIP.2018.2848470","volume":"27","author":"X Peng","year":"2018","unstructured":"Peng X, Feng J, Xiao S, Yau W, Zhou JT, Yang S (2018) Structured autoencoders for subspace clustering. IEEE Trans Image Process 27:5076\u20135086","journal-title":"IEEE Trans Image Process"},{"key":"2099_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCI.2019.2954644","volume":"15","author":"M Mavrovouniotis","year":"2020","unstructured":"Mavrovouniotis M, Yang S, Van M, Li C, Marios M (2020) Polycarpou, ant colony optimization algorithms for dynamic optimization: a case study of the dynamic travelling salesperson problem [research frontier]. IEEE Comput Intell Mag 15:52\u201363","journal-title":"IEEE Comput Intell Mag"},{"key":"2099_CR16","doi-asserted-by":"publisher","unstructured":"Yang K, You X, Liu S, Pan H (2020) A novel ant colony optimization based on game for traveling salesman problem. Appl Intell. Early Access. https:\/\/doi.org\/10.1007\/s10489-020-01799-w","DOI":"10.1007\/s10489-020-01799-w"},{"issue":"9","key":"2099_CR17","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1080\/13658816.2015.1013960","volume":"29","author":"J Yang","year":"2015","unstructured":"Yang J, Ding R, Zhang Y, Cong M, Wang F, Tang G (2015) An improved ant colony optimization (I-ACO) method for the quasi travelling salesman problem (Quasi-TSP). Int J Geogr Inf Sci 29(9):1534\u20131551","journal-title":"Int J Geogr Inf Sci"},{"key":"2099_CR18","doi-asserted-by":"publisher","first-page":"103649","DOI":"10.1016\/j.engappai.2020.103649","volume":"92","author":"S Ebadinezhad","year":"2020","unstructured":"Ebadinezhad S (2020) DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem. Eng Appl Artif Intell 92:103649","journal-title":"Eng Appl Artif Intell"},{"key":"2099_CR19","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"S Gulcu","year":"2018","unstructured":"Gulcu S, Mahi M, Baykan \u00d6K, Kodaz H (2018) A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem. Soft Comput 22:1669\u20131685","journal-title":"Soft Comput"},{"key":"2099_CR20","doi-asserted-by":"crossref","unstructured":"Jiang C, Wan Z, Peng Z (2020) A new efficient hybrid algorithm for large scale multiple traveling salesman problems. Expert Syst Appl 139","DOI":"10.1016\/j.eswa.2019.112867"},{"key":"2099_CR21","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"M Alipour","year":"2018","unstructured":"Alipour M, Razavi S, Derakhshi M, Balafar M (2018) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput and Applic 30:2935\u20132951","journal-title":"Neural Comput and Applic"},{"key":"2099_CR22","doi-asserted-by":"publisher","first-page":"56317","DOI":"10.1109\/ACCESS.2019.2900029","volume":"7","author":"J Chen","year":"2019","unstructured":"Chen J, You X, Liu S, Li J (2019) Entropy-based dynamic heterogeneous ant colony optimization. IEEE Access 7:56317\u201356328","journal-title":"IEEE Access"},{"key":"2099_CR23","doi-asserted-by":"publisher","first-page":"61628","DOI":"10.1109\/ACCESS.2019.2915673","volume":"7","author":"H Zhu","year":"2019","unstructured":"Zhu H, You X, Liu S (2019) Multiple ant colony optimization based on pearson correlation coefficient. IEEE Access 7:61628\u201361638","journal-title":"IEEE Access"},{"issue":"5","key":"2099_CR24","doi-asserted-by":"publisher","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","volume":"39","author":"G Dong","year":"2012","unstructured":"Dong G, Guo WW, Tickle K (2012) Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst Appl 39(5):5006\u20135011","journal-title":"Expert Syst Appl"},{"key":"2099_CR25","doi-asserted-by":"publisher","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"S Chen","year":"2011","unstructured":"Chen S, Chien C (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38:14439\u201314450","journal-title":"Expert Syst Appl"},{"key":"2099_CR26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.3906\/elk-1210-147","volume":"23","author":"M Gunduz","year":"2015","unstructured":"Gunduz M, Kiran MS, Ozceylan E (2015) A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk J Electr Eng Comput Sci 23:103\u2013117","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"2099_CR27","doi-asserted-by":"publisher","first-page":"38921","DOI":"10.1109\/ACCESS.2018.2853129","volume":"6","author":"E Liao","year":"2018","unstructured":"Liao E, Liu C (2018) A hierarchical algorithm based on density peaks clustering and ant colony optimization for traveling salesman problem. IEEE Access 6:38921\u201338933","journal-title":"IEEE Access"},{"key":"2099_CR28","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00500-014-1522-3","volume":"20","author":"G Pan","year":"2016","unstructured":"Pan G, Li K, Ouyang A, Li K (2016) Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP. Soft Comput 20:555\u2013566","journal-title":"Soft Comput"},{"key":"2099_CR29","doi-asserted-by":"crossref","unstructured":"Wang L, Cai R, Lin M, Zhong Y (2019) Enhanced list-based simulated annealing algorithm for large-scale traveling salesman problem, vol 7","DOI":"10.1109\/ACCESS.2019.2945570"},{"key":"2099_CR30","doi-asserted-by":"publisher","first-page":"66964","DOI":"10.1109\/ACCESS.2019.2917838","volume":"7","author":"X Chen","year":"2019","unstructured":"Chen X, Liu Y, Li X, Wang Z, Wang S, Gao C (2019) A new evolutionary multiobjective model for traveling salesman problem. IEEE Access 7:66964\u201366979","journal-title":"IEEE Access"},{"key":"2099_CR31","doi-asserted-by":"crossref","unstructured":"Zhang H, You X (2019) Multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism, vol 7","DOI":"10.1109\/ACCESS.2019.2950214"},{"key":"2099_CR32","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1049\/iet-its.2018.5359","volume":"13","author":"X Dong","year":"2019","unstructured":"Dong X, Lin Q, Xu M, Cai Y (2019) Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem. IET Intell Transp Syst 13:1483\u20131491","journal-title":"IET Intell Transp Syst"},{"key":"2099_CR33","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural Comput 9:1735\u20131780","journal-title":"Neural Comput"},{"key":"2099_CR34","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10489-018-1206-2","volume":"49","author":"X Wu","year":"2019","unstructured":"Wu X, Du Z, Guo Y, Fujita H (2019) Hierarchical attention based long short-term memory for Chinese lyric generation. Appl Intell 49:44\u201352","journal-title":"Appl Intell"},{"key":"2099_CR35","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1007\/s10489-019-01488-3","volume":"49","author":"G Lingam","year":"2019","unstructured":"Lingam G, Rout R, Somayajulu D (2019) Adaptive deep Q-learning model for detecting social bots and influential users in online social networks. Appl Intell 49:3947\u20133964","journal-title":"Appl Intell"},{"key":"2099_CR36","doi-asserted-by":"publisher","first-page":"2488","DOI":"10.1007\/s10489-020-01637-z","volume":"50","author":"E Lin","year":"2020","unstructured":"Lin E, Chen Q, Qi X (2020) Deep reinforcement learning for imbalanced classification. Appl Intell 50:2488\u20132502","journal-title":"Appl Intell"},{"key":"2099_CR37","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/TCBB.2015.2424435","volume":"13","author":"OM Rivera-Borroto","year":"2016","unstructured":"Rivera-Borroto OM, Garc\u00eda-de la Vega JM, Marrero-Ponce Y, Grau R (2016) Relational agreement measures for similarity searching of cheminformatic data sets. IEEE\/ACM Trans Comput Biol Bioinform 13:158\u2013167","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2099_CR38","doi-asserted-by":"publisher","first-page":"48:1","DOI":"10.1186\/s13321-018-0302-y","volume":"10","author":"A Racz","year":"2018","unstructured":"Racz A, Bajusz D, Heberger K (2018) Life beyond the Tanimoto coefficient: similarity measures for interaction fingerprints. J Cheminform 10:48:1\u201312","journal-title":"J Cheminform"},{"key":"2099_CR39","doi-asserted-by":"crossref","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA, Siddique NH, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput 86","DOI":"10.1016\/j.asoc.2019.105887"},{"key":"2099_CR40","doi-asserted-by":"crossref","unstructured":"Yu J, You X, Liu S (2020) Dynamic density clustering ant colony algorithm with filtering recommendation backtracking mechanism, vol 8","DOI":"10.1109\/ACCESS.2020.3002817"},{"key":"2099_CR41","doi-asserted-by":"crossref","unstructured":"Bas E, Ulker E (2020) Discrete social spider algorithm for the traveling salesman problem. Artif Intell Rev. Early Access","DOI":"10.1007\/s10462-020-09869-8"},{"key":"2099_CR42","doi-asserted-by":"publisher","first-page":"103649","DOI":"10.1016\/j.engappai.2020.103649","volume":"92","author":"S Ebadinezhad","year":"2020","unstructured":"Ebadinezhad S (2020) DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem. Eng Appl Artif Intell 92:103649","journal-title":"Eng Appl Artif Intell"},{"key":"2099_CR43","doi-asserted-by":"publisher","first-page":"53250","DOI":"10.1109\/ACCESS.2020.2967076","volume":"8","author":"L Meng","year":"2020","unstructured":"Meng L, You X, Liu S, Li S (2020) Multi-colony ant algorithm using both generative adversarial nets and adaptive stagnation avoidance strategy. IEEE Access 8:53250\u201353260","journal-title":"IEEE Access"},{"key":"2099_CR44","doi-asserted-by":"publisher","first-page":"157303","DOI":"10.1109\/ACCESS.2019.2949860","volume":"7","author":"D Zhang","year":"2019","unstructured":"Zhang D, You X, Liu S, Yang K (2019) Multi-colony ant colony optimization based on generalized Jaccard similarity recommendation strategy. IEEE Access 7:157303\u2013157317","journal-title":"IEEE Access"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02099-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-02099-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02099-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T04:40:33Z","timestamp":1625805633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-02099-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,13]]},"references-count":44,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["2099"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-02099-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,13]]},"assertion":[{"value":"26 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}