{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T03:02:25Z","timestamp":1792551745062,"version":"4.5.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:00:00Z","timestamp":1595376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:00:00Z","timestamp":1595376000000},"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"],"award-info":[{"award-number":["61673258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61075115"],"award-info":[{"award-number":["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":[[2020,12]]},"DOI":"10.1007\/s10489-020-01799-w","type":"journal-article","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T08:09:31Z","timestamp":1595405371000},"page":"4529-4542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":67,"title":["A novel ant colony optimization based on game for traveling salesman problem"],"prefix":"10.1007","volume":"50","author":[{"given":"Kang","family":"Yang","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":"Shen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"key":"1799_CR1","doi-asserted-by":"crossref","unstructured":"Yu F, Fu X, Li H (2016) Dong g improved roulette wheel Selection-Based genetic algorithm for TSP. In: 2016 International conference on network and information systems for computers (ICNISC)","DOI":"10.1109\/ICNISC.2016.041"},{"key":"1799_CR2","doi-asserted-by":"crossref","unstructured":"Dubey I, Gupta M (2017) Uniform mutation and SPV rule based optimized PSO algorithm for TSP problem. In: 2017 4th International Conference on Electronics and Communication Systems (ICECS), pp 168\u2013172","DOI":"10.1109\/ECS.2017.8067862"},{"key":"1799_CR3","doi-asserted-by":"crossref","unstructured":"I\u015fik AH (2020) Simulated Annealing Algorithm for a Medium-Sized TSP Data. In: Hemanth DJ, Kose U (eds) Artificial Intelligence and Applied Mathematics in Engineering Problems. Springer International Publishing, Cham, pp 457\u2013465","DOI":"10.1007\/978-3-030-36178-5_35"},{"issue":"1","key":"1799_CR4","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(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"1","key":"1799_CR5","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"},{"issue":"8","key":"1799_CR6","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"1999","unstructured":"St\u00fctzle T, Hoos H (1999) MAX-MIN Ant system. Fut Gener Comp Sy 16(8):889\u2013914","journal-title":"Fut Gener Comp Sy"},{"key":"1799_CR7","unstructured":"Bullnheimer B, Hartl R, Strauss C (1997) A new rank based version of the ant system: A computational study. sfb report - Sonderforschungsbereich 010 \u201dAdaptive Information Systems and Modelling in Economics and Management Science\u201d Initiative 5 \u201dArtificial Factory\u201d"},{"key":"1799_CR8","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 O\u0308K, 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"},{"issue":"5","key":"1799_CR9","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 O\u0308K, 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 (5):1669\u20131685","journal-title":"Soft Comput"},{"key":"1799_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.04.012","volume":"86","author":"R Skinderowicz","year":"2017","unstructured":"Skinderowicz R (2017) An improved Ant Colony System for the Sequential Ordering Problem. Comput Oper Res 86:1\u201317","journal-title":"Comput Oper Res"},{"key":"1799_CR11","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ins.2017.12.047","volume":"433-434","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 433-434:142\u2013162","journal-title":"Inf Sci"},{"key":"1799_CR12","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.swevo.2016.06.006","volume":"32","author":"H Ismkhan","year":"2017","unstructured":"Ismkhan H (2017) Effective heuristics for ant colony optimization to handle large-scale problems. Swarm Evol Comput 32:140\u2013149","journal-title":"Swarm Evol Comput"},{"key":"1799_CR13","doi-asserted-by":"crossref","unstructured":"Shetty A, Puthusseri KS, Shankaramani DR (2018) An Improved Ant Colony optimization Algorithm: Minion Ant(MAnt) and its Application on TSP. In: 2018 IEEE Symposium Series on Computational Intelligence (SSCI), pp 1219\u20131225","DOI":"10.1109\/SSCI.2018.8628805"},{"key":"1799_CR14","first-page":"126","volume":"5","author":"Z Othman","year":"2013","unstructured":"Othman Z, Srour A, Hamdan A, Ling P (2013) Performance water flow-like algorithm for TSP by improving its local search. Int J Adv Comput Technol 5:126","journal-title":"Int J Adv Comput Technol"},{"key":"1799_CR15","doi-asserted-by":"crossref","unstructured":"Hara A, Matsushima S, Ichimura T, Takahama T (2010) Ant Colony Optimization using exploratory ants for constructing partial solutions. In: IEEE Congress on Evolutionary Computation, pp 1\u20137","DOI":"10.1109\/CEC.2010.5586009"},{"key":"1799_CR16","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":"5","key":"1799_CR17","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":"1799_CR18","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":"12","key":"1799_CR19","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1016\/j.ins.2010.02.017","volume":"180","author":"C Twomey","year":"2010","unstructured":"Twomey C, St\u00fctzle T, Dorigo M, Manfrin M, Birattari M (2010) An analysis of communication policies for homogeneous multi-colony ACO algorithms. Inf Sci 180(12):2390\u20132404","journal-title":"Inf Sci"},{"key":"1799_CR20","doi-asserted-by":"publisher","first-page":"152646","DOI":"10.1109\/ACCESS.2019.2948395","volume":"7","author":"M Liu","year":"2019","unstructured":"Liu M, You X, Yu X, Liu S (2019) KL Divergence-Based Pheromone fusion for heterogeneous Multi-Colony ant optimization. IEEE Access 7:152646\u2013152657","journal-title":"IEEE Access"},{"issue":"3","key":"1799_CR21","first-page":"569","volume":"19","author":"Y Wang","year":"2015","unstructured":"Wang Y (2015) Hybrid max\u2013min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19(3):569\u2013596","journal-title":"Soft Comput"},{"issue":"12","key":"1799_CR22","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1016\/j.ins.2010.02.017","volume":"180","author":"C Twomey","year":"2010","unstructured":"Twomey C, St\u00fctzle T, Dorigo M, Manfrin M, Birattari M (2010) An analysis of communication policies for homogeneous multi-colony ACO algorithms. Inf Sci 180(12):2390\u20132404","journal-title":"Inf Sci"},{"key":"1799_CR23","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"},{"key":"1799_CR24","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":"1799_CR25","doi-asserted-by":"publisher","first-page":"433","DOI":"10.20965\/jaciii.2007.p0433","volume":"11","author":"K-S Hung","year":"2007","unstructured":"Hung K-S, Su S-F, Lee Z-J (2007) Improving ant colony optimization algorithms for solving traveling salesman problems. JACIII 11:433\u2013442","journal-title":"JACIII"},{"key":"1799_CR26","doi-asserted-by":"crossref","unstructured":"Bui KT, Pham TV, Tran HC (2017) A load balancing game approach for VM provision cloud computing based on ant colony optimization. In: Vinh P C, Anh L T, Loan N T T, Siricharoen W V (eds) Lecture notes of the institute for computer sciences social informatics and telecommunications engineering, vol 193, pp 52\u201363","DOI":"10.1007\/978-3-319-56357-2_6"},{"key":"1799_CR27","doi-asserted-by":"crossref","unstructured":"Rao SS (2010) Particle Swarm and Ant Colony Approaches in Multiobjective Optimization. In: Paruya S, Kar S, Roy S (eds) International Conference on Modeling, Optimization, and Computing, vol 1298. AIP Conference Proceedings, Amer Inst Physics, Melville, pp 7\u201311","DOI":"10.1063\/1.3516427"},{"key":"1799_CR28","doi-asserted-by":"crossref","unstructured":"Subbaraj S, Savarimuthu P (2014) Eigentrust-based non-cooperative game model assisting ACO look-ahead secure routing against selfishness. EURASIP J Wirel Commun Netw:20","DOI":"10.1186\/1687-1499-2014-78"},{"issue":"1","key":"1799_CR29","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/TPWRS.2015.2398821","volume":"31","author":"EA Farsani","year":"2016","unstructured":"Farsani EA, Abyaneh HA, Abedi M, Hosseinian SH (2016) A novel policy for LMP calculation in distribution networks based on loss and emission reduction allocation using nucleolus theory. IEEE Trans Power Syst 31(1):143\u2013152","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"1799_CR30","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.ejor.2010.01.015","volume":"205","author":"M Frisk","year":"2010","unstructured":"Frisk M, Gothe-Lundgren M, Jornsten K, Ronnqvist M (2010) Cost allocation in collaborative forest transportation. Eur J Oper Res 205(2):448\u2013458","journal-title":"Eur J Oper Res"},{"issue":"36","key":"1799_CR31","first-page":"9","volume":"44","author":"K Deng","year":"2009","unstructured":"Deng K, Lin J, Zhang P (2009) Multiple heterogeneous ant colonies algorithm based on information entropy. Comput Eng Appl 44(36):9\u201316","journal-title":"Comput Eng Appl"},{"key":"1799_CR32","doi-asserted-by":"publisher","first-page":"27014","DOI":"10.1109\/ACCESS.2017.2768665","volume":"5","author":"X Sun","year":"2017","unstructured":"Sun X, Zhang K, Ma M, Su H (2017) Multi-Population Ant colony algorithm for virtual machine deployment. IEEE Access 5:27014\u201327022","journal-title":"IEEE Access"},{"key":"1799_CR33","doi-asserted-by":"crossref","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput:86","DOI":"10.1016\/j.asoc.2019.105887"},{"issue":"4","key":"1799_CR34","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1007\/s11036-019-01258-y","volume":"24","author":"N Klug","year":"2019","unstructured":"Klug N, Chauhan AVV, Ragala R (2019) k-RNN: Extending NN-heuristics for the TSP. Mob Netw Appl 24(4):1210\u20131213","journal-title":"Mob Netw Appl"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01799-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01799-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01799-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T00:04:05Z","timestamp":1626912245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01799-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,22]]},"references-count":34,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1799"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01799-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,22]]},"assertion":[{"value":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}