{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T07:23:36Z","timestamp":1763277816162,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"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","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":[[2021,7]]},"DOI":"10.1007\/s00500-021-05851-w","type":"journal-article","created":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T15:44:00Z","timestamp":1622562240000},"page":"8035-8050","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Ant colony algorithm based on magnetic neighborhood and filtering recommendation"],"prefix":"10.1007","volume":"25","author":[{"given":"Jin","family":"Yu","sequence":"first","affiliation":[]},{"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,1]]},"reference":[{"issue":"5","key":"5851_CR1","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1007\/s00034-018-0959-5","volume":"38","author":"N Agrawal","year":"2019","unstructured":"Agrawal N, Kumar A, Bajaj V (2019) A new method for designing of stable digital IIR filter using hybrid method. Circuits Syst Signal Process 38(5):2187","journal-title":"Circuits Syst Signal Process"},{"key":"5851_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal N, Kumar A, Bajaj V (2018) Design of digital IIR filter with low quantization error using hybrid optimization technique. Soft Comput Fus Methodol Appl","DOI":"10.1007\/s00500-017-2548-0"},{"key":"5851_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal N, Kumar A, Bajaj V (2020) Design of infinite impulse response filter using fractional derivative constraints and hybrid particle swarm optimization. Circuits Syst Signal Process 39(9)","DOI":"10.1007\/s00034-020-01456-0"},{"issue":"2","key":"5851_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/MGS-150232","volume":"11","author":"MM Alipour","year":"2015","unstructured":"Alipour MM, Razavi SN (2015) A new multiagent reinforcement learning algorithm to solve the symmetric traveling salesman problem. Multiagent Grid Syst 11(2):107","journal-title":"Multiagent Grid Syst"},{"issue":"9","key":"5851_CR5","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(9):2935","journal-title":"Neural Comput Appl"},{"key":"5851_CR6","doi-asserted-by":"crossref","unstructured":"Chen H, Tan G, Qian G, Chen R (2018) Ant Colony Optimization With Tabu Table to Solve TSP Problem. In: Proceedings of the 37th Chinese control conference pp 2523\u20132527","DOI":"10.23919\/ChiCC.2018.8483278"},{"key":"5851_CR7","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","journal-title":"IEEE Access"},{"key":"5851_CR8","doi-asserted-by":"crossref","unstructured":"Deng W, Xu J, Zhao H (2019) An Improved Ant Colony Optimization Algorithm Based on Hybrid Strategies for Scheduling problem. IEEE Access, 1\u20131","DOI":"10.1109\/ACCESS.2019.2897580"},{"key":"5851_CR9","unstructured":"M.A.H.A. A, S.I.A. A, S.A.S. A, N.S. B, H.A. C, Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput 86"},{"issue":"1","key":"5851_CR10","first-page":"29","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 26(1):29","journal-title":"IEEE Trans Syst"},{"issue":"4","key":"5851_CR11","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/CI-M.2006.248054","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization: artificial ants as a computational intelligence technique. IEEE Comput Intell Mag 1(4):28","journal-title":"IEEE Comput Intell Mag"},{"key":"5851_CR12","doi-asserted-by":"crossref","unstructured":"Feng Z (2019) Constructing rural e-commerce logistics model based on ant colony algorithm and artificial intelligence method. Soft Comput 24(10)","DOI":"10.1007\/s00500-019-04046-8"},{"key":"5851_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.compeleceng.2016.09.035","volume":"60","author":"D Gaifang","year":"2017","unstructured":"Gaifang D, Xueliang F, Honghui L, Pengfei X (2017) Cooperative ant colony-genetic algorithm based on spark. Comput Electr Eng 60:66","journal-title":"Comput Electr Eng"},{"key":"5851_CR14","doi-asserted-by":"crossref","unstructured":"Gulcu A, Mahi M, Baykan OK, 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","DOI":"10.1007\/s00500-016-2432-3"},{"issue":"3","key":"5851_CR15","first-page":"899","volume":"248","author":"G Jian","year":"2015","unstructured":"Jian G, Geng L (2015) Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem. Eur J Oper Res 248(3):899","journal-title":"Eur J Oper Res"},{"key":"5851_CR16","doi-asserted-by":"crossref","unstructured":"Kang Y, You X (2020) A novel ant colony optimization based on game for traveling salesman problem. Appl Intell, 7","DOI":"10.1007\/s10489-020-01799-w"},{"key":"5851_CR17","doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK (2018) A swap sequence based Artificial Bee Colony algorithm for Traveling Salesman Problem. Swarm Evolut Comput, S2210650216304588","DOI":"10.1016\/j.swevo.2018.05.006"},{"key":"5851_CR18","doi-asserted-by":"publisher","first-page":"38921","DOI":"10.1109\/ACCESS.2018.2853129","volume":"6","author":"E Liao","year":"2018","unstructured":"Liao E, Liu C (2018) A hierarchical algorithm based on density peaks clustering and ant colony optimization for traveling salesman problem. IEEE Access 6:38921","journal-title":"IEEE Access"},{"key":"5851_CR19","doi-asserted-by":"crossref","unstructured":"Li J, Xia Y, Li B, Zeng Z (2018) A Pseudo-dynamic search ant colony optimization algorithm with improved negative feedback mechanism to solve TSP. Lect Notes Comput Sci, 19\u201324","DOI":"10.1007\/978-3-319-95957-3_3"},{"issue":"6","key":"5851_CR20","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1007\/s00521-019-04172-2","volume":"32","author":"Q Luo","year":"2020","unstructured":"Luo Q, Wang H, Zheng Y, He J (2020) Research on path planning of mobile robot based on improved ant colony algorithm. Neural Comput Appl 32(6):1555","journal-title":"Neural Comput Appl"},{"key":"5851_CR21","doi-asserted-by":"crossref","unstructured":"Ma YN, Gong YJ, Xiao CF, Gao Y, Zhang J (2018) Path planning for autonomous underwater vehicles: an ant colony algorithm incorporating alarm pheromone. IEEE Trans Veh Technol","DOI":"10.1109\/TVT.2018.2882130"},{"key":"5851_CR22","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 OK, 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","journal-title":"Appl Soft Comput"},{"key":"5851_CR23","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 X, Diaz F, Lopezgarcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems. Eng Appl Artif Intell 48:59","journal-title":"Eng Appl Artif Intell"},{"key":"5851_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.asoc.2018.06.047","volume":"71","author":"E Osaba","year":"2018","unstructured":"Osaba E, Ser JD, Sadollah A, Bilbao MN, Camacho D (2018) A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Appl Soft Comput 71:277","journal-title":"Appl Soft Comput"},{"key":"5851_CR25","doi-asserted-by":"crossref","unstructured":"Starzec M, Starzec G, Byrski A, Turek W, Pietak K (2020) Desynchronization in distributed Ant Colony Optimization in HPC environment. Future Gener Comput Syst 109","DOI":"10.1016\/j.future.2020.03.045"},{"issue":"9","key":"5851_CR26","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Stutzle","year":"2000","unstructured":"Stutzle T, Hoos HH (2000) MAX-MIN Ant system. Future Gener Comput Syst 16(9):889","journal-title":"Future Gener Comput Syst"},{"key":"5851_CR27","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.ijinfomgt.2018.12.001","volume":"50","author":"J Uthayakumar","year":"2020","unstructured":"Uthayakumar J, Metawa N, Shankar K, Lakshmanaprabu SK (2020) Financial crisis prediction model using ant colony optimization. Int J Inf Manag 50:538","journal-title":"Int J Inf Manag"},{"issue":"70","key":"5851_CR28","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cie.2014.01.015","volume":"70","author":"Y Wang","year":"2014","unstructured":"Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70(70):124","journal-title":"Comput Ind Eng"},{"key":"5851_CR29","doi-asserted-by":"crossref","unstructured":"Yang H (2014) Study on traveling salesman problem based on the improved chaos ant colony algorithm. Adv Mater Res, 2196\u20132199","DOI":"10.4028\/www.scientific.net\/AMR.989-994.2196"},{"issue":"7","key":"5851_CR30","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.pnsc.2008.01.030","volume":"18","author":"J Yang","year":"2008","unstructured":"Yang J, Wu C, Lee HP, Liang Y (2008) Solving traveling salesman problems using generalized chromosome genetic algorithm. Progress Nat Sci 18(7):887","journal-title":"Progress Nat Sci"},{"issue":"3","key":"5851_CR31","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-Min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19(3):585","journal-title":"Soft Comput"},{"key":"5851_CR32","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","DOI":"10.1109\/ACCESS.2020.3002817"},{"key":"5851_CR33","doi-asserted-by":"publisher","first-page":"158160","DOI":"10.1109\/ACCESS.2019.2950214","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:158160","journal-title":"IEEE Access"},{"key":"5851_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","journal-title":"IEEE Access"},{"key":"5851_CR35","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","volume":"42","author":"Y Zhong","year":"2018","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2018) Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evolut Comput 42:77","journal-title":"Swarm Evolut Comput"},{"key":"5851_CR36","doi-asserted-by":"crossref","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2017) Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf Sci","DOI":"10.1016\/j.ins.2017.08.067"},{"key":"5851_CR37","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.neucom.2014.01.078","volume":"151","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Luo Q, Chen H, He A, Wu J (2015) A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing 151:1227","journal-title":"Neurocomputing"},{"key":"5851_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","journal-title":"IEEE Access"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05851-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05851-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05851-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T13:28:06Z","timestamp":1623677286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05851-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,1]]},"references-count":38,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5851"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05851-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2021,6,1]]},"assertion":[{"value":"27 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","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 authors have declared no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Humans\/animals are not involved in this work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}