{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:58:14Z","timestamp":1726034294311},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10489-021-02774-9","type":"journal-article","created":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T06:02:37Z","timestamp":1631512957000},"page":"6552-6574","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Ant colony algorithm with Stackelberg game and multi-strategy fusion"],"prefix":"10.1007","volume":"52","author":[{"given":"Da","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3879-6329","authenticated-orcid":false,"given":"XiaoMing","family":"You","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,13]]},"reference":[{"issue":"6114","key":"2774_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1038\/326689a0","volume":"326","author":"R Durbin","year":"1987","unstructured":"Durbin R, Willshaw D (1987) An analogue approach to the travelling salesman problem using an elastic net method. Nature 326(6114):689\u2013691","journal-title":"Nature"},{"key":"2774_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.future.2020.07.008","volume":"114","author":"X Dong","year":"2021","unstructured":"Dong X, Zhang H, Xu M, Shen F (2021) Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem. Futur Gener Comput Syst 114:229\u2013242","journal-title":"Futur Gener Comput Syst"},{"key":"2774_CR3","doi-asserted-by":"crossref","unstructured":"Zelinka I, Das S (2020) Gamesourcing: an unconventional tool to assist the solution of the traveling salesman problem. Nat Comput (Suppl. 2):1\u201311","DOI":"10.1007\/s11047-020-09817-z"},{"key":"2774_CR4","doi-asserted-by":"crossref","unstructured":"Benyamin A, Farhad SG, Saeid B (2020) Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems. International Journal of Intelligent Systems","DOI":"10.1002\/int.22342"},{"key":"2774_CR5","doi-asserted-by":"crossref","unstructured":"Zhong Y, Wang L, Lin M, Zhang H (2019) Discrete pigeon-inspired optimization algorithm with metropolis acceptance criterion for large-scale traveling salesman problem. Swarm Evol Comput:48","DOI":"10.1016\/j.swevo.2019.04.002"},{"key":"2774_CR6","doi-asserted-by":"publisher","first-page":"103582","DOI":"10.1016\/j.engappai.2020.103582","volume":"91","author":"X Xiang","year":"2020","unstructured":"Xiang X, Qiu J, Xiao J, Zhang X (2020) Demand coverage diversity based ant colony optimization for dynamic vehicle routing problems. Eng Appl Artif Intell 91:103582","journal-title":"Eng Appl Artif Intell"},{"key":"2774_CR7","doi-asserted-by":"crossref","unstructured":"Shokouhifar M (2021) Fh-aco: Fuzzy heuristic-based ant colony optimization for joint virtual network function placement and routing. Appl Soft Comput 107(2):107401","DOI":"10.1016\/j.asoc.2021.107401"},{"key":"2774_CR8","unstructured":"Jia YH, Chen WN, Yuan H, Gu T, Zhang H, Gao Y, Zhang J (2018) An intelligent cloud workflow scheduling system with time estimation and adaptive ant colony optimization. IEEE Trans Syst Man Cybern Syst:1\u201316"},{"key":"2774_CR9","unstructured":"Liang D, Zhan ZH, Zhang Y, Zhang J (2019) An efficient ant colony system approach for new energy vehicle dispatch problem. IEEE Trans Intell Transp Syst PP(99):1\u201314"},{"issue":"1","key":"2774_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 cybernetics - part b. IEEE Trans Cybern 26(1):29\u201341","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"2774_CR11","first-page":"53","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 Ec 1(1):53\u201366","journal-title":"IEEE Trans Ec"},{"issue":"4","key":"2774_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, St\u00fctzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"8","key":"2774_CR13","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. Futur Gener Comput Syst 16(8):889\u2013914","journal-title":"Futur Gener Comput Syst"},{"key":"2774_CR14","doi-asserted-by":"crossref","unstructured":"Wu Y, Ma W, Miao Q, Wang S (2019) Multimodal continuous ant colony optimization for multisensor remote sensing image registration with local search. Swarm Evol Comput 47:89\u201395","DOI":"10.1016\/j.swevo.2017.07.004"},{"key":"2774_CR15","doi-asserted-by":"crossref","unstructured":"Gao W (2016) Premium-penalty ant colony optimization and its application in slope stability analysis. Appl Soft Comput 43:480\u2013488","DOI":"10.1016\/j.asoc.2016.03.001"},{"key":"2774_CR16","doi-asserted-by":"crossref","unstructured":"Ye K, Zhang C, Ning J, Liu X (2017) Ant-colony algorithm with a strengthened negative-feedback mechanism for constraint-satisfaction problems. Inf Sci 406\u2013407:29\u201341","DOI":"10.1016\/j.ins.2017.04.016"},{"issue":"12","key":"2774_CR17","doi-asserted-by":"publisher","first-page":"9257","DOI":"10.1007\/s00500-019-04452-y","volume":"24","author":"S Li","year":"2020","unstructured":"Li S, Cai S, Li L, Sun R, Yuan G (2020) Caas: a novel collective action-based ant system algorithm for solving tsp problem. Soft Comput 24(12):9257\u20139278","journal-title":"Soft Comput"},{"key":"2774_CR18","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1007\/s00521-017-2912-0","volume":"30","author":"Q Zhang","year":"2018","unstructured":"Zhang Q, Zhang C (2018) An improved ant colony optimization algorithm with strengthened pheromone updating mechanism for constraint satisfaction problem. Neural Comput Appl 30:3209\u20133220","journal-title":"Neural Comput Appl"},{"key":"2774_CR19","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":"2774_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.future.2020.01.011","volume":"106","author":"R Skinderowicz","year":"2020","unstructured":"Skinderowicz R (2020) Implementing a gpu-based parallel max-min ant system. Fut Gener Comput Syst 106:277\u2013295","journal-title":"Fut Gener Comput Syst"},{"key":"2774_CR21","doi-asserted-by":"crossref","unstructured":"Zhao D, Liu L, Yu F, Heidari AA, Wang M, Oliva D, Muhammad K, Chen H (2021a) Ant colony optimization with horizontal and vertical crossover search: Fundamental visions for multi-threshold image segmentation. Expert Syst Appl 167:114122","DOI":"10.1016\/j.eswa.2020.114122"},{"key":"2774_CR22","doi-asserted-by":"crossref","unstructured":"Zhao D, Liu L, Yu F, Heidari AA, Wang M, Liang G, Muhammad K, Chen H (2021b) Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2d kapur entropy. Knowl-Based Syst 216:106510","DOI":"10.1016\/j.knosys.2020.106510"},{"key":"2774_CR23","doi-asserted-by":"crossref","unstructured":"Han Z, Wang Y, Tian D (2021) Ant colony optimization for assembly sequence planning based on parameters optimization. Frontiers of Mechanical Engineering","DOI":"10.1007\/s11465-020-0613-3"},{"key":"2774_CR24","doi-asserted-by":"crossref","unstructured":"Gao W (2020) Modified ant colony optimization with improved tour construction and pheromone updating strategies for traveling salesman problem. Soft Comput:1\u201327","DOI":"10.1007\/s00500-020-05376-8"},{"key":"2774_CR25","doi-asserted-by":"crossref","unstructured":"Wang X, Yang K, Yang L (2018) Application research of inner-plant economical operation by multi-colony ant optimization. Water Resources Management","DOI":"10.1007\/s11269-018-2048-8"},{"key":"2774_CR26","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, Wang P, Li C, Lu P, Mo L (2017) A multi-objective multi-population ant colony optimization for economic emission dispatch considering power system security. Appl Math Model 45:684\u2013704","journal-title":"Appl Math Model"},{"key":"2774_CR27","doi-asserted-by":"crossref","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","DOI":"10.1109\/ACCESS.2019.2949860"},{"key":"2774_CR28","doi-asserted-by":"crossref","unstructured":"Pan H, You X, Liu S, Zhang D (2020) Pearson correlation coefficient-based pheromone refactoring mechanism for multi-colony ant colony optimization. Appl Intell:1\u201323","DOI":"10.1007\/s10489-020-01841-x"},{"issue":"3","key":"2774_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. The Bell Syst Techn J 27 (3):379\u2013423","journal-title":"The Bell Syst Techn J"},{"key":"2774_CR30","doi-asserted-by":"crossref","unstructured":"Emile J (1953) Stackelberg (Heinrich von) - The Theory of the Market Economy, translated from the German and with an introduction by Alan T. PEACOCK. Revue \u00c9con 4(6):944\u2013945","DOI":"10.2307\/3497517"},{"issue":"5","key":"2774_CR31","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"S Gu\u0307lcu\u0307","year":"2018","unstructured":"Gu\u0307lcu\u0307 S, Mahi M, Baykan O\u0307K, 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":"2774_CR32","doi-asserted-by":"publisher","first-page":"106720","DOI":"10.1016\/j.asoc.2020.106720","volume":"97","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 97:106720","journal-title":"Appl Soft Comput"},{"key":"2774_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ACCESS.2019.2943243","volume":"7","author":"H Zhang","year":"2019","unstructured":"Zhang H, You X (2019) Multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism. IEEE Access 7:1\u20131","journal-title":"IEEE Access"},{"key":"2774_CR34","doi-asserted-by":"crossref","unstructured":"Liao E, Liu C (2018) A hierarchical algorithm based on density peaks clustering and ant colony optimization for traveling salesman problem. IEEE Access PP(99):1\u20131","DOI":"10.1109\/ACCESS.2018.2853129"},{"issue":"apr.","key":"2774_CR35","first-page":"124","volume":"70","author":"W Yong","year":"2014","unstructured":"Yong W (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70(apr.):124\u2013133","journal-title":"Comput Ind Eng"},{"key":"2774_CR36","doi-asserted-by":"crossref","unstructured":"Zhong Y, Lin J, Wang L, Hui Z (2017) Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf Sci:421","DOI":"10.1016\/j.ins.2017.08.067"},{"key":"2774_CR37","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"MM Alipour","year":"2018","unstructured":"Alipour MM, Razavi SN, Derakhshi MRF, Balafar MA (2018) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput Appl 30:2935\u20132951","journal-title":"Neural Comput Appl"},{"key":"2774_CR38","doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK (2018) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput:S2210650216304588","DOI":"10.1016\/j.swevo.2018.05.006"},{"key":"2774_CR39","doi-asserted-by":"crossref","unstructured":"Wu C, Fu X (2020) An agglomerative greedy brain storm optimization algorithm for solving the tsp. IEEE Access 8:201606\u2013201621","DOI":"10.1109\/ACCESS.2020.3035899"},{"key":"2774_CR40","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 K, 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":"2774_CR41","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang XS, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371","journal-title":"Eng Appl Artif Intell"},{"key":"2774_CR42","doi-asserted-by":"crossref","unstructured":"Eneko O, Del SJ, Ali S, Nekane BM, DCavid B (2018) A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Appl Soft Comput 71:S1568494618303818\u2013","DOI":"10.1016\/j.asoc.2018.06.047"},{"key":"2774_CR43","unstructured":"Wang Y (2015) Hybrid max\u2013min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Computing"},{"key":"2774_CR44","doi-asserted-by":"crossref","unstructured":"Yu J, You X, Liu S (2020) Dynamic density clustering ant colony algorithm with filtering recommendation backtracking mechanism. IEEE Access PP(99):1\u20131","DOI":"10.1109\/ACCESS.2020.3002817"},{"issue":"1","key":"2774_CR45","first-page":"68","volume":"1","author":"Y Zhou","year":"2014","unstructured":"Zhou Y, Ouyang X, Jian X (2014) A discrete cuckoo search algorithm for travelling salesman problem. Int J Collab Intell 1(1):68","journal-title":"Int J Collab Intell"},{"key":"2774_CR46","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput 44:428\u2013438","journal-title":"Swarm Evol Comput"},{"key":"2774_CR47","doi-asserted-by":"publisher","first-page":"105887","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"M Akhand","year":"2020","unstructured":"Akhand M, Ayon SI, Shahriyar S, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput 86:105887","journal-title":"Appl Soft Comput"},{"key":"2774_CR48","doi-asserted-by":"crossref","unstructured":"Deng W, Zhao H, Zou L, Li G, Yang X, Wu D (2017) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Computing","DOI":"10.1007\/s00500-016-2071-8"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02774-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02774-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02774-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T04:21:52Z","timestamp":1649823712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02774-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,13]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["2774"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02774-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,13]]},"assertion":[{"value":"16 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}