{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T09:22:18Z","timestamp":1778923338072,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T00:00:00Z","timestamp":1616112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T00:00:00Z","timestamp":1616112000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["61903089"],"award-info":[{"award-number":["61903089"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["20202BABL202020"],"award-info":[{"award-number":["20202BABL202020"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["20202BAB202014"],"award-info":[{"award-number":["20202BAB202014"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61903089"],"award-info":[{"award-number":["61903089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12652-021-03120-0","type":"journal-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T16:20:03Z","timestamp":1616170803000},"page":"1557-1571","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["An ant colony optimization algorithm with adaptive greedy strategy to optimize path problems"],"prefix":"10.1007","volume":"13","author":[{"given":"Wei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8862-0092","authenticated-orcid":false,"given":"Ying","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soroosh","family":"Mahmoodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,19]]},"reference":[{"issue":"6791","key":"3120_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1038\/35017500","volume":"406","author":"E Bonabeau","year":"2000","unstructured":"Bonabeau E, Dorigo M, Theraulaz G (2000) Inspiration for optimization from social insect behaviour. Nature 406(6791):39","journal-title":"Nature"},{"issue":"8","key":"3120_CR2","doi-asserted-by":"publisher","first-page":"3349","DOI":"10.1007\/s12652-019-01531-8","volume":"11","author":"G Che","year":"2020","unstructured":"Che G, Liu L, Yu Z (2020) An improved ant colony optimization algorithm based on particle swarm optimization algorithm for path planning of autonomous underwater vehicle. J Ambient Intell Humaniz Comput 11(8):3349\u20133354","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"2","key":"3120_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/ijoc.8.2.125","volume":"8","author":"B Codenotti","year":"1996","unstructured":"Codenotti B, Manzini G, Margara L et al (1996) Perturbation: an efficient technique for the solution of very large instances of the Euclidean TSP. INFORMS J Comput 8(2):125\u2013133","journal-title":"INFORMS J Comput"},{"key":"3120_CR4","first-page":"134","volume":"142","author":"A Colorni","year":"1991","unstructured":"Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. Proc First Eur Conf Artif Life 142:134\u2013142","journal-title":"Proc First Eur Conf Artif Life"},{"issue":"1","key":"3120_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391","journal-title":"Manag Sci"},{"key":"3120_CR6","doi-asserted-by":"publisher","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","volume":"7","author":"W Deng","year":"2019","unstructured":"Deng W, Xu J, Zhao H (2019) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7:20281\u201320292","journal-title":"IEEE Access"},{"issue":"1","key":"3120_CR7","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(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"3120_CR8","first-page":"311","volume-title":"Ant colony optimization: overview and recent advances. Handbook of metaheuristics","author":"M Dorigo","year":"2019","unstructured":"Dorigo M, St\u00fctzle T (2019) Ant colony optimization: overview and recent advances. Handbook of metaheuristics. Springer, Berlin, pp 311\u2013351"},{"issue":"9","key":"3120_CR9","doi-asserted-by":"publisher","first-page":"168781401666529","DOI":"10.1177\/1687814016665297","volume":"8","author":"J Gao","year":"2016","unstructured":"Gao J, Gu F, Hu P et al (2016) Automobile chain maintenance parts delivery problem using an improved ant colony algorithm. Adv Mech Eng 8(9):1687814016665297","journal-title":"Adv Mech Eng"},{"issue":"9","key":"3120_CR10","doi-asserted-by":"publisher","first-page":"3537","DOI":"10.1007\/s00500-015-1710-9","volume":"20","author":"P He","year":"2016","unstructured":"He P, Deng Z, Wang H, Liu Z (2016) Model approach to grammatical evolution: theory and case study. Soft Comput 20(9):3537\u20133548","journal-title":"Soft Comput"},{"key":"3120_CR11","doi-asserted-by":"publisher","first-page":"404","DOI":"10.7763\/IJIET.2011.V1.67","volume":"1","author":"ZC Hlaing","year":"2011","unstructured":"Hlaing ZC, Su S, Khine MA (2011) Solving traveling salesman problem by using improved ant colony optimization algorithm. Int J Inform Educ Technol 1:404\u2013409","journal-title":"Int J Inform Educ Technol"},{"key":"3120_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2019.09.068","volume":"512","author":"N Jiang","year":"2020","unstructured":"Jiang N, Dong X, Zhou J, Yan H, Wan T, Zheng J (2020a) Toward optimal participant decisions with voting-based incentive model for crowd sensing. Inform Sci 512:1\u201317","journal-title":"Inform Sci"},{"key":"3120_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ins.2020.03.080","volume":"530","author":"N Jiang","year":"2020","unstructured":"Jiang N, Chen J, Zhou R-G, Changxing W, Chen H, Zheng J, Wan T (2020b) PAN: pipeline assisted neural networks model for data-to-text generation in social internet of things. Inform Sci 530:167\u2013179","journal-title":"Inform Sci"},{"issue":"1","key":"3120_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ejor.2018.09.038","volume":"274","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic R, Tuba M, Vo\u00df S (2019) An efficient ant colony optimization algorithm for the blocks relocation problem. Eur J Oper Res 274(1):78\u201390","journal-title":"Eur J Oper Res"},{"key":"3120_CR15","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.comnet.2018.07.001","volume":"144","author":"PM Kumar","year":"2018","unstructured":"Kumar PM, Devi U, Manogaran G et al (2018) Ant colony optimization algorithm with Internet of Vehicles for intelligent traffic control system. Comput Netwo 144:154\u2013162","journal-title":"Comput Netwo"},{"key":"3120_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ins.2020.02.034","volume":"529","author":"W Li","year":"2020","unstructured":"Li W, Meng X et al (2020) Multipopulation cooperative particle swarm optimization with a mixed mutation strategy. Inform Sci 529:179\u2013196","journal-title":"Inform Sci"},{"key":"3120_CR17","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.jclepro.2019.03.185","volume":"227","author":"Y Li","year":"2019","unstructured":"Li Y, Soleimani H, Zohal M (2019) An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives. J Clean Prod 227:1161\u20131172","journal-title":"J Clean Prod"},{"key":"3120_CR18","first-page":"1","volume":"21","author":"D Liang","year":"2019","unstructured":"Liang D, Zhan Z, Zhang Y, Zhang J (2019) An efficient ant colony system approach for new energy vehicle dispatch problem. IEEE Trans Intell Transp Syst 21:1\u201314","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"3120_CR19","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00500-007-0264-x","volume":"12","author":"KK Lim","year":"2008","unstructured":"Lim KK et al (2008) A hybrid ant colony algorithms for path planning in sparse graphs. Soft Comput 12:981\u2013994","journal-title":"Soft Comput"},{"key":"3120_CR20","first-page":"224","volume":"4150","author":"M Manfrin","year":"2006","unstructured":"Manfrin M, Birattari M, St\u00fctzle T et al (2006) Parallel ant colony optimization for the traveling salesman problem. Int Worksh Ant Colony Optimiz Swarm Intell 4150:224\u2013234","journal-title":"Int Worksh Ant Colony Optimiz Swarm Intell"},{"issue":"1","key":"3120_CR21","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCI.2019.2954644","volume":"15","author":"M Mavrovouniotis","year":"2020","unstructured":"Mavrovouniotis M et al (2020) Ant colony optimization algorithms for dynamic optimization: a case study of the dynamic travelling salesperson problem [research frontier]. IEEE Comput Intell Mag 15(1):52\u201363","journal-title":"IEEE Comput Intell Mag"},{"key":"3120_CR22","first-page":"7","volume":"811","author":"S Mirjalili","year":"2020","unstructured":"Mirjalili S, Dong JS (2020) Ant colony optimizer: theory, literature review, and application in AUV path planning. Nat Inspir Optim 811:7\u201321","journal-title":"Nat Inspir Optim"},{"issue":"9","key":"3120_CR23","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1006\/jpdc.2002.1854","volume":"62","author":"M Randall","year":"2002","unstructured":"Randall M, Lewis A (2002) A parallel implementation of ant colony optimization. J Parallel Distrib Comput 62(9):1421\u20131432","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"3120_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard \u00c9D (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1):147\u2013167","journal-title":"J Heuristics"},{"key":"3120_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100581","volume":"51","author":"M Roshanzamir","year":"2019","unstructured":"Roshanzamir M, Palhang M, Mirzaei A (2019) Graph structure optimization of Genetic Network Programming with ant colony mechanism in deterministic and stochastic environments. Swarm Evol Comput 51:100581","journal-title":"Swarm Evol Comput"},{"key":"3120_CR26","first-page":"1","volume":"12","author":"A Schrijver","year":"2005","unstructured":"Schrijver A (2005) On the history of combinatorial optimization (till 1960). Handb Oper Res Manag Sci 12:1\u201368","journal-title":"Handb Oper Res Manag Sci"},{"issue":"8","key":"3120_CR27","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 Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"},{"key":"3120_CR28","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) An overview of vehicle routing problems. The vehicle routing problem, pp  1\u201326","DOI":"10.1137\/1.9780898718515.ch1"},{"issue":"3","key":"3120_CR29","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa E, Pecin D, Pessoa A et al (2017) New benchmark instances for the capacitated vehicle routing problem. Europ J Oper Res 257(3):845\u2013858","journal-title":"Europ J Oper Res"},{"issue":"3","key":"3120_CR30","first-page":"479","volume":"24","author":"F Wang","year":"2020","unstructured":"Wang F, Li Y, Zhou A, Tang K (2020a) An estimation of distribution algorithm for mixed-varialbe newsvendor problems. IEEE Trans Evol Comput 24(3):479\u2013493","journal-title":"IEEE Trans Evol Comput"},{"key":"3120_CR31","doi-asserted-by":"publisher","first-page":"106592","DOI":"10.1016\/j.asoc.2020.106592","volume":"96","author":"F Wang","year":"2020","unstructured":"Wang F, Li Y, Liao F, Yan H (2020b) An ensemble learning based prediction strategy for dynamic multi-objective optimization. Appl Soft Comput 96:106592","journal-title":"Appl Soft Comput"},{"key":"3120_CR32","doi-asserted-by":"publisher","first-page":"100808","DOI":"10.1016\/j.swevo.2020.100808","volume":"60","author":"F Wang","year":"2021","unstructured":"Wang F, Zhang H, Zhou A (2021) A particle swarm optimization algorithm for mixed-variable optimization problems. Swarm Evol Comput 60:100808","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"3120_CR33","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1007\/s12652-018-0751-1","volume":"10","author":"Z Zou","year":"2019","unstructured":"Zou Z, Qian Y (2019) Wireless sensor network routing method based on improved ant colony algorithm. J Ambient Intell Humaniz Comput 10(3):991\u2013998","journal-title":"J Ambient Intell Humaniz Comput"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-021-03120-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-021-03120-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-021-03120-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T10:36:08Z","timestamp":1646130968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-021-03120-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,19]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["3120"],"URL":"https:\/\/doi.org\/10.1007\/s12652-021-03120-0","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,19]]},"assertion":[{"value":"16 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interests regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}