{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:49Z","timestamp":1740107869318,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T00:00:00Z","timestamp":1686528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T00:00:00Z","timestamp":1686528000000},"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":"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":["Soft Comput"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00500-023-08689-6","type":"journal-article","created":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T12:02:15Z","timestamp":1686571335000},"page":"15075-15093","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-ant colony optimization based on bidirectional induction mechanism and cooperative game"],"prefix":"10.1007","volume":"27","author":[{"given":"Lisheng","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,6,12]]},"reference":[{"key":"8689_CR1","doi-asserted-by":"publisher","unstructured":"Ahmmed A, Rana MAA, Haque AAMM, Mamun M Al (2008) A multiple Ant Colony System for dynamic vehicle routing problem with time window. In: Proceedings of 3rd international conference on convergence and hybrid information technology ICCIT 2008 2:182\u2013187. https:\/\/doi.org\/10.1109\/ICCIT.2008.249","DOI":"10.1109\/ICCIT.2008.249"},{"key":"8689_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887","author":"MAH Akhand","year":"2020","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA et al (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput J. https:\/\/doi.org\/10.1016\/j.asoc.2019.105887","journal-title":"Appl Soft Comput J"},{"key":"8689_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-022-10190-9","author":"C Changdar","year":"2022","unstructured":"Changdar C, Mondal M, Giri PK et al (2022) A two-phase ant colony optimization based approach for single depot multiple travelling salesman problem in Type-2 fuzzy environment. Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-022-10190-9","journal-title":"Artif Intell Rev"},{"key":"8689_CR4","doi-asserted-by":"publisher","first-page":"6552","DOI":"10.1007\/s10489-021-02774-9","volume":"52","author":"D Chen","year":"2022","unstructured":"Chen D, You XM, Liu S (2022) Ant colony algorithm with Stackelberg game and multi-strategy fusion. Appl Intell 52:6552\u20136574. https:\/\/doi.org\/10.1007\/s10489-021-02774-9","journal-title":"Appl Intell"},{"key":"8689_CR5","doi-asserted-by":"publisher","first-page":"56317","DOI":"10.1109\/ACCESS.2019.2900029","volume":"7","author":"J Chen","year":"2019","unstructured":"Chen J, You XM, Liu S, Li J (2019) Entropy-based dynamic heterogeneous ant colony optimization. IEEE Access 7:56317\u201356328. https:\/\/doi.org\/10.1109\/ACCESS.2019.2900029","journal-title":"IEEE Access"},{"key":"8689_CR6","doi-asserted-by":"publisher","unstructured":"Cho K, van Merri\u00ebnboer B, Bahdanau D, Bengio Y (2014) On the properties of neural machine translation: encoder\u2013decoder approaches. In: Proceedings of SSST-8, workshop on syntax, semantics and structure in statistical translation, pp 103\u2013111. https:\/\/doi.org\/10.3115\/v1\/w14-4012","DOI":"10.3115\/v1\/w14-4012"},{"key":"8689_CR7","doi-asserted-by":"publisher","unstructured":"Chung J, Gulcehre C, Cho K, Bengio Y (2014) Empirical evaluation of gated recurrent neural networks on sequence modeling. pp 1\u20139. https:\/\/doi.org\/10.48550\/arXiv.1412.3555","DOI":"10.48550\/arXiv.1412.3555"},{"key":"8689_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106312","author":"PK Das","year":"2020","unstructured":"Das PK, Jena PK (2020) Multi-robot path planning using improved particle swarm optimization algorithm through novel evolutionary operators. Appl Soft Comput J. https:\/\/doi.org\/10.1016\/j.asoc.2020.106312","journal-title":"Appl Soft Comput J"},{"key":"8689_CR9","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. https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"key":"8689_CR10","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. https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans Syst Man, Cybern Part B Cybern"},{"key":"8689_CR11","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6642009","author":"P Du","year":"2021","unstructured":"Du P, Liu N, Zhang H, Lu J (2021) An improved ant colony optimization based on an adaptive heuristic factor for the traveling salesman problem. J Adv Transp. https:\/\/doi.org\/10.1155\/2021\/6642009","journal-title":"J Adv Transp"},{"key":"8689_CR12","doi-asserted-by":"publisher","first-page":"44","DOI":"10.2991\/ijcis.d.200117.001","volume":"13","author":"W Gao","year":"2020","unstructured":"Gao W (2020) New ant colony optimization algorithm for the traveling salesman problem. Int J Comput Intell Syst 13:44\u201355. https:\/\/doi.org\/10.2991\/ijcis.d.200117.001","journal-title":"Int J Comput Intell Syst"},{"key":"8689_CR13","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"\u015e G\u00fclc\u00fc","year":"2018","unstructured":"G\u00fclc\u00fc \u015e, 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. https:\/\/doi.org\/10.1007\/s00500-016-2432-3","journal-title":"Soft Comput"},{"key":"8689_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107275","author":"M Gunduz","year":"2021","unstructured":"Gunduz M, Aslan M (2021) DJAYA: a discrete Jaya algorithm for solving traveling salesman problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2021.107275","journal-title":"Appl Soft Comput"},{"key":"8689_CR15","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"HH Hoos","year":"2000","unstructured":"Hoos HH, St\u00fctzle T (2000) MAX MIN ant system. Futur Gener Comput Syst 16:889\u2013914","journal-title":"Futur Gener Comput Syst"},{"key":"8689_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107085","author":"Y Huang","year":"2021","unstructured":"Huang Y, Shen XN, You X (2021) A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2021.107085","journal-title":"Appl Soft Comput"},{"key":"8689_CR17","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1007\/s12652-021-03120-0","volume":"13","author":"W Li","year":"2022","unstructured":"Li W, Xia L, Huang Y, Mahmoodi S (2022) An ant colony optimization algorithm with adaptive greedy strategy to optimize path problems. J Ambient Intell Humaniz Comput 13:1557\u20131571. https:\/\/doi.org\/10.1007\/s12652-021-03120-0","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"8689_CR18","doi-asserted-by":"publisher","first-page":"20281","DOI":"10.1371\/journal.pone.0257317","volume":"16","author":"S Liang","year":"2021","unstructured":"Liang S, Jiao T, Du W, Qu S (2021) An improved ant colony optimization algorithm based on context for tourism route planning. PLoS ONE 16:20281\u201320292. https:\/\/doi.org\/10.1371\/journal.pone.0257317","journal-title":"PLoS ONE"},{"key":"8689_CR19","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 J 30:484\u2013490. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.068","journal-title":"Appl Soft Comput J"},{"key":"8689_CR20","doi-asserted-by":"publisher","first-page":"3903","DOI":"10.1007\/s00500-022-06833-2","volume":"26","author":"J Meng","year":"2022","unstructured":"Meng J, You X, Liu S (2022) Heterogeneous ant colony optimization based on adaptive interactive learning and non-zero-sum game. Soft Comput 26:3903\u20133920. https:\/\/doi.org\/10.1007\/s00500-022-06833-2","journal-title":"Soft Comput"},{"key":"8689_CR21","doi-asserted-by":"publisher","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, Zhang B (2018) A best-path-updating information-guided ant colony optimization algorithm. Inf Sci (ny) 433\u2013434:142\u2013162. https:\/\/doi.org\/10.1016\/j.ins.2017.12.047","journal-title":"Inf Sci (ny)"},{"key":"8689_CR22","doi-asserted-by":"publisher","first-page":"101454","DOI":"10.1016\/j.jocs.2021.101454","volume":"55","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Transformation operators based grey wolf optimizer for travelling salesman problem. J Comput Sci 55:101454. https:\/\/doi.org\/10.1016\/j.jocs.2021.101454","journal-title":"J Comput Sci"},{"key":"8689_CR23","doi-asserted-by":"publisher","DOI":"10.3390\/E22080884","author":"P Stodola","year":"2020","unstructured":"Stodola P, Michenka K, Nohel J, Rybansk\u00fd M (2020) Hybrid algorithm based on ant colony optimization and simulated annealing applied to the dynamic traveling salesman problem. Entropy. https:\/\/doi.org\/10.3390\/E22080884","journal-title":"Entropy"},{"key":"8689_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101056","author":"P Stodola","year":"2022","unstructured":"Stodola P, Ot\u0159\u00edsal P, Hasilov\u00e1 K (2022) Adaptive Ant Colony Optimization with node clustering applied to the travelling salesman problem. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2022.101056","journal-title":"Swarm Evol Comput"},{"key":"8689_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106720","author":"AF Tuani","year":"2020","unstructured":"Tuani AF, Keedwell E, Collett M (2020) Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2020.106720","journal-title":"Appl Soft Comput"},{"key":"8689_CR26","doi-asserted-by":"publisher","first-page":"56375","DOI":"10.1109\/ACCESS.2022.3165198","volume":"10","author":"S Wang","year":"2022","unstructured":"Wang S, Liu Y, Qiu Y et al (2022) Cooperative task allocation for multi-robot systems based on multi-objective ant colony system. IEEE Access 10:56375\u201356387. https:\/\/doi.org\/10.1109\/ACCESS.2022.3165198","journal-title":"IEEE Access"},{"key":"8689_CR27","doi-asserted-by":"publisher","first-page":"107439","DOI":"10.1016\/j.asoc.2021.107439","volume":"107","author":"Y Wang","year":"2021","unstructured":"Wang Y, Han Z (2021) Ant colony optimization for traveling salesman problem based on parameters optimization. Appl Soft Comput 107:107439. https:\/\/doi.org\/10.1016\/j.asoc.2021.107439","journal-title":"Appl Soft Comput"},{"key":"8689_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675","author":"Y Wang","year":"2020","unstructured":"Wang Y, Wang L, Chen G et al (2020) An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100675","journal-title":"Swarm Evol Comput"},{"key":"8689_CR29","doi-asserted-by":"publisher","first-page":"153456","DOI":"10.1109\/ACCESS.2021.3128433","volume":"9","author":"C Wu","year":"2021","unstructured":"Wu C, Fu X, Pei J, Dong Z (2021) A Novel Sparrow Search Algorithm for the traveling salesman problem. IEEE Access 9:153456\u2013153471. https:\/\/doi.org\/10.1109\/ACCESS.2021.3128433","journal-title":"IEEE Access"},{"key":"8689_CR30","doi-asserted-by":"publisher","DOI":"10.3390\/jmse10091305","author":"S Yang","year":"2022","unstructured":"Yang S, Huang J, Li W, Xiang X (2022) A novel discrete group teaching optimization algorithm for TSP path planning with unmanned surface vehicles. J Mar Sci Eng. https:\/\/doi.org\/10.3390\/jmse10091305","journal-title":"J Mar Sci Eng"},{"key":"8689_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3389\/fbioe.2022.806177","volume":"10","author":"Z Yi","year":"2022","unstructured":"Yi Z, Hongda Y, Mengdi S, Yong X (2022) Hybrid swarming algorithm with van der waals force. Front Bioeng Biotechnol 10:1\u20137. https:\/\/doi.org\/10.3389\/fbioe.2022.806177","journal-title":"Front Bioeng Biotechnol"},{"key":"8689_CR32","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.4028\/www.scientific.net\/AMM.253-255.1075","volume":"253\u2013255","author":"L Yingyong","year":"2013","unstructured":"Yingyong L, Fangying Z, Li W et al (2013) The natural restoration capability of vegetation in different site types along the expressway 25, Lu-Su section, China. Appl Mech Mater 253\u2013255:1075\u20131081. https:\/\/doi.org\/10.4028\/www.scientific.net\/AMM.253-255.1075","journal-title":"Appl Mech Mater"},{"key":"8689_CR33","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2015","unstructured":"Yong W (2015) Hybrid Max\u2013Min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585\u2013596. https:\/\/doi.org\/10.1007\/s00500-014-1279-8","journal-title":"Soft Comput"},{"key":"8689_CR34","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. https:\/\/doi.org\/10.1109\/ACCESS.2019.2949860","journal-title":"IEEE Access"},{"key":"8689_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108469","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Han Y (2022) Discrete sparrow search algorithm for symmetric traveling salesman problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2022.108469","journal-title":"Appl Soft Comput"},{"key":"8689_CR36","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.apm.2017.01.001","volume":"45","author":"J Zhou","year":"2017","unstructured":"Zhou J, Wang C, Li Y et al (2017) A multi-objective multi-population ant colony optimization for economic emission dispatch considering power system security. Appl Math Model 45:684\u2013704. https:\/\/doi.org\/10.1016\/j.apm.2017.01.001","journal-title":"Appl Math Model"},{"key":"8689_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105139","author":"X Zhou","year":"2022","unstructured":"Zhou X, Ma H, Gu J et al (2022) Parameter adaptation-based ant colony optimization with dynamic hybrid mechanism. Eng Appl Artif Intell. https:\/\/doi.org\/10.1016\/j.engappai.2022.105139","journal-title":"Eng Appl Artif Intell"},{"key":"8689_CR38","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. https:\/\/doi.org\/10.1109\/ACCESS.2019.2915673","journal-title":"IEEE Access"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08689-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08689-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08689-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T12:08:45Z","timestamp":1693570125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08689-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,12]]},"references-count":38,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["8689"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08689-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2023,6,12]]},"assertion":[{"value":"27 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"All the authors have been informed and agreed to publish this article.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}