{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:15:18Z","timestamp":1768094118661,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61673258"],"award-info":[{"award-number":["61673258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100007219","name":"Shanghai Natural Science Foundation","doi-asserted-by":"crossref","award":["19ZR1421600"],"award-info":[{"award-number":["19ZR1421600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10586-023-04136-1","type":"journal-article","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T09:02:14Z","timestamp":1695373334000},"page":"3113-3133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-ant colony optimization algorithm based on game strategy and hierarchical temporal memory model"],"prefix":"10.1007","volume":"27","author":[{"given":"Qihuan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"4136_CR1","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109832","volume":"132","author":"G Rodr\u00edguez-Corominas","year":"2023","unstructured":"Rodr\u00edguez-Corominas, G., Blesa, M.J., Blum, C.: AntNetAlign: ant colony optimization for network alignment. Appl. Soft Comput. 132, 109832 (2023)","journal-title":"Appl. Soft Comput."},{"key":"4136_CR2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.future.2020.03.051","volume":"109","author":"N Yi","year":"2020","unstructured":"Yi, N., Xu, J., Yan, L., et al.: Task optimization and scheduling of distributed cyber\u2013physical system based on improved ant colony algorithm. Futur. Gener. Comput. Syst. 109, 134\u2013148 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"4136_CR3","volume":"215","author":"L Wu","year":"2023","unstructured":"Wu, L., Huang, X., Cui, J., et al.: Modified adaptive ant colony optimization algorithm and its application for solving path planning of mobile robot. Expert Syst. Appl. 215, 119410 (2023)","journal-title":"Expert Syst. Appl."},{"key":"4136_CR4","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.106510","volume":"216","author":"D Zhao","year":"2021","unstructured":"Zhao, D., Liu, L., Yu, F., et al.: Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2D Kapur entropy. Knowl.-Based Syst. 216, 106510 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"4136_CR5","volume":"122","author":"P Qian","year":"2023","unstructured":"Qian, P., Luo, H., Liu, L., et al.: A hybrid Gaussian mutation PSO with search space reduction and its application to intelligent selection of piston seal grooves for homemade pneumatic cylinders. Eng. Appl. Artif. Intell. 122, 106156 (2023)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"4136_CR6","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.119529","volume":"218","author":"R Norat","year":"2023","unstructured":"Norat, R., Wu, A.S., Liu, X.: Genetic algorithms with self-adaptation for predictive classification of Medicare standardized payments for physical therapists. Expert Syst. Appl. 218, 119529 (2023)","journal-title":"Expert Syst. Appl."},{"key":"4136_CR7","volume":"205","author":"D Lei","year":"2022","unstructured":"Lei, D., He, S.: An adaptive artificial bee colony for unrelated parallel machine scheduling with additional resource and maintenance. Expert Syst. Appl. 205, 117577 (2022)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"4136_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man. Cybern. B Cybern. 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man. Cybern. B Cybern."},{"issue":"1","key":"4136_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"4136_CR10","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Min\u2013max ant system. Future Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"4136_CR11","doi-asserted-by":"crossref","first-page":"3263","DOI":"10.1007\/s00500-020-05376-8","volume":"25","author":"W Gao","year":"2020","unstructured":"Gao, W.: Modified ant colony optimization with improved tour construction and pheromone updating strategies for traveling salesman problem. Soft. Comput. 25(4), 3263\u20133289 (2020)","journal-title":"Soft. Comput."},{"key":"4136_CR12","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101056","volume":"70","author":"P Stodola","year":"2022","unstructured":"Stodola, P., Ot\u0159\u00edsal, P., Hasilov\u00e1, K.: Adaptive ant colony optimization with node clustering applied to the travelling salesman problem. Swarm Evol Comput. 70, 101056 (2022)","journal-title":"Swarm Evol Comput."},{"key":"4136_CR13","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ins.2017.12.047","volume":"433\u2013434","author":"J Ning","year":"2018","unstructured":"Ning, J., Zhang, Q., Zhang, C., et al.: A best-path-updating information-guided ant colony optimization algorithm. Inf. Sci. 433\u2013434, 142\u2013162 (2018)","journal-title":"Inf. Sci."},{"key":"4136_CR14","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.neucom.2012.12.084","volume":"148","author":"X Deng","year":"2015","unstructured":"Deng, X., Zhang, L., Lin, H., et al.: Pheromone mark ant colony optimization with a hybrid node-based pheromone update strategy. Neurocomputing 148, 46\u201353 (2015)","journal-title":"Neurocomputing"},{"issue":"10","key":"4136_CR15","doi-asserted-by":"crossref","first-page":"3209","DOI":"10.1007\/s00521-017-2912-0","volume":"30","author":"Q Zhang","year":"2017","unstructured":"Zhang, Q., Zhang, C.: An improved ant colony optimization algorithm with strengthened pheromone updating mechanism for constraint satisfaction problem. Neural Comput. Appl. 30(10), 3209\u20133220 (2017)","journal-title":"Neural Comput. Appl."},{"key":"4136_CR16","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107293","volume":"105","author":"A Abuhamdah","year":"2021","unstructured":"Abuhamdah, A.: Adaptive elitist-ant system for solving combinatorial optimization problems. Appl. Soft Comput. 105, 107293 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"4136_CR17","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.3390\/math8101650","volume":"8","author":"Z Zhang","year":"2020","unstructured":"Zhang, Z., Xu, Z., Luan, S., et al.: Opposition-based ant colony optimization algorithm for the traveling salesman problem. Mathematics. 8(10), 1650 (2020)","journal-title":"Mathematics."},{"key":"4136_CR18","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114021","volume":"164","author":"B Guan","year":"2021","unstructured":"Guan, B., Zhao, Y., Li, Y.: An improved ant colony optimization with an automatic updating mechanism for constraint satisfaction problems. Expert Syst. Appl. 164, 114021 (2021)","journal-title":"Expert Syst. Appl."},{"key":"4136_CR19","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106720","volume":"97","author":"AF Tuani","year":"2020","unstructured":"Tuani, A.F., Keedwell, E., Collett, M.: Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem. Appl. Soft Comput. 97, 106720 (2020)","journal-title":"Appl. Soft Comput."},{"key":"4136_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2021\/6610670","volume":"2021","author":"Y Tamura","year":"2021","unstructured":"Tamura, Y., Sakiyama, T., Arizono, I., et al.: Ant colony optimization using common social information and self-memory. Complexity 2021, 1\u20137 (2021)","journal-title":"Complexity"},{"issue":"8","key":"4136_CR21","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.3390\/s19081837","volume":"19","author":"F Dahan","year":"2019","unstructured":"Dahan, F., El Hindi, K., Mathkour, H., et al.: Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem. Sensors (Basel). 19(8), 1837 (2019)","journal-title":"Sensors (Basel)."},{"issue":"7","key":"4136_CR22","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","volume":"47","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis, M., Muller, F.M., Shengxiang, Y.: Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans. Cybern. 47(7), 1743\u20131756 (2017)","journal-title":"IEEE Trans. Cybern."},{"key":"4136_CR23","doi-asserted-by":"crossref","first-page":"202508","DOI":"10.1109\/ACCESS.2020.3035584","volume":"8","author":"M Liu","year":"2020","unstructured":"Liu, M., Li, Y., Li, A., et al.: A slime mold-ant colony fusion algorithm for solving traveling salesman problem. IEEE Access. 8, 202508\u2013202521 (2020)","journal-title":"IEEE Access."},{"key":"4136_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2022\/3608899","volume":"2022","author":"Y Gao","year":"2022","unstructured":"Gao, Y., Zhang, Y., Hong, W.-C.: Path optimization of welding robot based on ant colony and genetic algorithm. J. Appl. Math. 2022, 1\u201311 (2022)","journal-title":"J. Appl. Math."},{"key":"4136_CR25","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis, M., Ellinas G., Li, C., Polycarpou, M.: A multiple ant colony system for the electric vehicle routing problem with time windows. In: 2022 IEEE Symposium Series on Computational Intelligence (SSCI), pp 796\u2013803, (2022)","DOI":"10.1109\/SSCI51031.2022.10022257"},{"issue":"9","key":"4136_CR26","doi-asserted-by":"crossref","first-page":"9045","DOI":"10.1007\/s13369-021-05694-5","volume":"46","author":"S Li","year":"2021","unstructured":"Li, S., You, X., Liu, S.: Co-evolutionary multi-colony ant colony optimization based on adaptive guidance mechanism and its application. Arab. J. Sci. Eng. 46(9), 9045\u20139063 (2021)","journal-title":"Arab. J. Sci. Eng."},{"key":"4136_CR27","doi-asserted-by":"publisher","unstructured":"Xin-Hua, X.: Research on application of game theory in the information fusion. In: 2010 Second International Conference on Computer Engineering and Applications. (2010). https:\/\/doi.org\/10.1109\/iccea.2010.166","DOI":"10.1109\/iccea.2010.166"},{"issue":"4","key":"4136_CR28","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1934145","volume":"52","author":"SH Hurlbert","year":"1971","unstructured":"Hurlbert, S.H.: The nonconcept of species diversity: a critique and alternative parameters. Ecology 52(4), 577\u2013586 (1971)","journal-title":"Ecology"},{"issue":"14","key":"4136_CR29","doi-asserted-by":"crossref","first-page":"1630","DOI":"10.3390\/electronics10141630","volume":"10","author":"R Sousa","year":"2021","unstructured":"Sousa, R., Lima, T., Abelha, A., et al.: Hierarchical Temporal memory theory approach to stock market time series forecasting. Electronics 10(14), 1630 (2021)","journal-title":"Electronics"},{"key":"4136_CR30","first-page":"1","volume":"2016","author":"P Li","year":"2016","unstructured":"Li, P., Zhu, H.: Parameter selection for ant colony algorithm based on bacterial foraging algorithm. Math. Probl. Eng. 2016, 1\u201312 (2016)","journal-title":"Math. Probl. Eng."},{"key":"4136_CR31","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101046","volume":"70","author":"Y Zhou","year":"2022","unstructured":"Zhou, Y., Li, W., Wang, X., et al.: Adaptive gradient descent enabled ant colony optimization for routing problems. Swarm Evol. Comput. 70, 101046 (2022)","journal-title":"Swarm Evol. Comput."},{"key":"4136_CR32","volume":"107","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Han, Z.: Ant colony optimization for traveling salesman problem based on parameters optimization. Appl. Soft Comput. 107, 107439 (2021)","journal-title":"Appl. Soft Comput."},{"key":"4136_CR33","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.108746","volume":"121","author":"P Karakostas","year":"2022","unstructured":"Karakostas, P., Sifaleras, A.: A double-adaptive general variable neighborhood search algorithm for the solution of the traveling salesman problem. Appl. Soft Comput. 121, 108746 (2022)","journal-title":"Appl. Soft Comput."},{"key":"4136_CR34","doi-asserted-by":"crossref","first-page":"3903","DOI":"10.1007\/s00500-022-06833-2","volume":"26","author":"J Meng","year":"2022","unstructured":"Meng, J., You, X., Liu, S.: Heterogeneous ant colony optimization based on adaptive interactive learning and non-zero-sum game. Soft. Comput. 26, 3903\u20133920 (2022)","journal-title":"Soft. Comput."},{"key":"4136_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2021\/6668345","volume":"2021","author":"M Yousefikhoshbakht","year":"2021","unstructured":"Yousefikhoshbakht, M.: Solving the traveling salesman problem: a modified metaheuristic algorithm. Complexity 2021, 1\u201313 (2021)","journal-title":"Complexity"},{"issue":"8","key":"4136_CR36","doi-asserted-by":"crossref","first-page":"10531","DOI":"10.1007\/s13369-022-06579-x","volume":"47","author":"J Zhao","year":"2022","unstructured":"Zhao, J., You, X., Duan, Q., et al.: Multiple ant colony algorithm combining community relationship network. Arab J Sci Eng. 47(8), 10531\u201310546 (2022)","journal-title":"Arab J Sci Eng."},{"key":"4136_CR37","volume":"86","author":"MAH Akhand","year":"2020","unstructured":"Akhand, M.A.H., Ayon, S.I., Shahriyar, S.A., et al.: Discrete spider monkey optimization for travelling salesman problem. Appl. Soft Comput. 86, 105887 (2020)","journal-title":"Appl. Soft Comput."},{"key":"4136_CR38","doi-asserted-by":"crossref","DOI":"10.1016\/j.jocs.2021.101454","volume":"55","author":"K Panwar","year":"2021","unstructured":"Panwar, K., Deep, K.: Transformation operators based grey wolf optimizer for travelling salesman problem. J. Comput. Sci. 55, 101454 (2021)","journal-title":"J. Comput. Sci."},{"key":"4136_CR39","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","volume":"68","author":"S Hore","year":"2018","unstructured":"Hore, S., Chatterjee, A., Dewanji, A.: Improving variable neighborhood search to solve the traveling salesman problem. Appl. Soft Comput. 68, 83\u201391 (2018)","journal-title":"Appl. Soft Comput."},{"key":"4136_CR40","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi, M., Baykan, \u00d6.K., Kodaz, H.: 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 (2015)","journal-title":"Appl. Soft Comput."},{"key":"4136_CR41","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2014","unstructured":"Yong, W.: Hybrid Max\u2013Min ant system with four vertices and three lines inequality for traveling salesman problem. Soft. Comput. 19, 585\u2013596 (2014)","journal-title":"Soft. Comput."},{"key":"4136_CR42","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.eswa.2017.06.007","volume":"87","author":"AE-S Ezugwu","year":"2017","unstructured":"Ezugwu, A.E.-S., Adewumi, A.O.: Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst. Appl. 87, 70\u201378 (2017)","journal-title":"Expert Syst. Appl."},{"key":"4136_CR43","doi-asserted-by":"crossref","first-page":"153456","DOI":"10.1109\/ACCESS.2021.3128433","volume":"9","author":"C Wu","year":"2021","unstructured":"Wu, C., Fu, X., Pei, J., et al.: A novel sparrow search algorithm for the traveling salesman problem. IEEE Access. 9, 153456\u2013153471 (2021)","journal-title":"IEEE Access."},{"issue":"12","key":"4136_CR44","doi-asserted-by":"crossref","first-page":"7339","DOI":"10.3390\/app13127339","volume":"13","author":"F Uddin","year":"2023","unstructured":"Uddin, F., Riaz, N., Manan, A., et al.: An improvement to the 2-opt heuristic algorithm for approximation of optimal TSP tour. Appl. Sci. 13(12), 7339 (2023)","journal-title":"Appl. Sci."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-023-04136-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-023-04136-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-023-04136-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T21:12:29Z","timestamp":1717017149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-023-04136-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["4136"],"URL":"https:\/\/doi.org\/10.1007\/s10586-023-04136-1","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,22]]},"assertion":[{"value":"1 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}