{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T11:50:38Z","timestamp":1744199438894},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00500-019-04452-y","type":"journal-article","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T20:02:56Z","timestamp":1573502576000},"page":"9257-9278","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["CAAS: a novel collective action-based ant system algorithm for solving TSP problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Sicong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saihua","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruizhi","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"issue":"6","key":"4452_CR1","first-page":"96","volume":"3","author":"ZH Ahmed","year":"2010","unstructured":"Ahmed ZH (2010) Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int J Biom Bioinform 3(6):96\u2013105","journal-title":"Int J Biom Bioinform"},{"issue":"1","key":"4452_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1002\/net.21468","volume":"61","author":"F Carrabs","year":"2013","unstructured":"Carrabs F, Cerulli R, Speranza MG (2013) A branch-and-bound algorithm for the double TSP with two stacks. Networks 61(1):58\u201375","journal-title":"Networks"},{"issue":"1","key":"4452_CR4","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 Evolut Comput 1(1):53\u201366","journal-title":"IEEE Trans Evolut Comput"},{"issue":"12","key":"4452_CR5","first-page":"340","volume":"3","author":"M Dorigo","year":"1991","unstructured":"Dorigo M, Maniezzo V, Colorni A (1991) Ant system: an autocatalytic optimizing process technical report 91-016. Clustering 3(12):340","journal-title":"Clustering"},{"issue":"1","key":"4452_CR6","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 Cybernet Part B: Cybernet 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybernet Part B: Cybernet"},{"issue":"1","key":"4452_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.solener.2011.09.032","volume":"86","author":"KM El-Naggar","year":"2012","unstructured":"El-Naggar KM, Alrashidi MR, Alhajri MF, AI-Othman AK (2012) Simulated annealing algorithm for photovoltaic parameters identification. Sol Energy 86(1):266\u2013274","journal-title":"Sol Energy"},{"issue":"2","key":"4452_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129\u2013154","journal-title":"Eng Optim"},{"key":"4452_CR9","doi-asserted-by":"crossref","unstructured":"Fan JH, Wei XL, Wang TX, Lan T, Subramaniam S (2017) Deadline-aware task scheduling in a tiered IoT infrastructure. In: 2017 IEEE global telecommunications conference","DOI":"10.1109\/GLOCOM.2017.8255037"},{"key":"4452_CR10","first-page":"679","volume":"255","author":"T Fei","year":"2014","unstructured":"Fei T, Zhang LY, Li Y, Yang YL, Wang F (2014) The artificial fish swarm algorithm to solve traveling salesman problem. Int Conf Comput Sci Inf Technol (CSAIT) 255:679\u2013685","journal-title":"Int Conf Comput Sci Inf Technol (CSAIT)"},{"issue":"6","key":"4452_CR11","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420\u20131443","journal-title":"Am J Sociol"},{"key":"4452_CR12","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.compbiolchem.2018.11.001","volume":"77","author":"BX Guan","year":"2018","unstructured":"Guan BX, Zhao YH, Sun WJ (2018) Ant colony optimization with an automatic adjustment mechanism for detecting epistatic interactions. Comput Biol Chem 77:354\u2013362","journal-title":"Comput Biol Chem"},{"issue":"5","key":"4452_CR13","doi-asserted-by":"publisher","first-page":"3355","DOI":"10.3233\/JIFS-169276","volume":"32","author":"JQ He","year":"2017","unstructured":"He JQ, Sun XJ, Li W, Chen J (2017) A new pheromone update strategy for ant colony optimization. J Intell Fuzzy Syst 32(5):3355\u20133364","journal-title":"J Intell Fuzzy Syst"},{"issue":"1","key":"4452_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196\u2013210","journal-title":"J Soc Ind Appl Math"},{"issue":"2","key":"4452_CR15","first-page":"170","volume":"26","author":"CC Hsu","year":"2018","unstructured":"Hsu CC, Wang WY, Chien YH, Hou RY (2018) FPGA implementation of improved ant colony optimization algorithm based on pheromone diffusion mechanism for path planning. J Marine Sci Technol Taiwan 26(2):170\u2013179","journal-title":"J Marine Sci Technol Taiwan"},{"key":"4452_CR16","unstructured":"Ji WD, Wang KQ (2012) An improved particle swarm optimization algorithm. In: 2011 international conference on computer science and network technology, pp 585\u2013589"},{"issue":"10","key":"4452_CR18","doi-asserted-by":"publisher","first-page":"1927","DOI":"10.1080\/00207160.2017.1364370","volume":"95","author":"DY Li","year":"2018","unstructured":"Li DY, Wang XY, Huang PH (2018) A Max-Min ant colony algorithm for fractal dimension of complex networks. Int J Comput Math 95(10):1927\u20131936","journal-title":"Int J Comput Math"},{"key":"4452_CR19","doi-asserted-by":"crossref","unstructured":"Lim YF, Hong PY, Ramli R, Khalid R (2013) Modified reactive tabu search for the symmetric traveling salesman problems. In: 2013 international conference on mathematical sciences and statistics vol 1557, pp 505\u2013509","DOI":"10.1063\/1.4823966"},{"issue":"1","key":"4452_CR20","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TCBB.2015.2462349","volume":"14","author":"YX Liu","year":"2017","unstructured":"Liu YX, Gao C, Zhang ZL, Lu YX, Chen S, Liang MX, Tao L (2017) Solving NP-hard problems with physarum-based ant colony system. IEEE-ACM Trans Comput Biol Bioinform 14(1):108\u2013120","journal-title":"IEEE-ACM Trans Comput Biol Bioinform"},{"key":"4452_CR21","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.matcom.2018.08.011","volume":"156","author":"J Luan","year":"2019","unstructured":"Luan J, Yao Z, Zhao FT, Song X (2019) A novel method to solve supplier selection problem: hybrid algorithm of genetic algorithm and ant colony optimization. Math Comput Simul 156:294\u2013309","journal-title":"Math Comput Simul"},{"issue":"8","key":"4452_CR22","doi-asserted-by":"publisher","first-page":"2637","DOI":"10.1007\/s11276-015-1061-6","volume":"22","author":"A Mohajerani","year":"2016","unstructured":"Mohajerani A, Gharavian D (2016) An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks. Wirel Netw 22(8):2637\u20132647","journal-title":"Wirel Netw"},{"key":"4452_CR23","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.engappai.2014.06.026","volume":"35","author":"T Saenphon","year":"2014","unstructured":"Saenphon T, Phimoltares S, Lursinsap C (2014) Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem. Eng Appl Artif Intell 35:324\u2013334","journal-title":"Eng Appl Artif Intell"},{"key":"4452_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.eswa.2018.12.022","volume":"121","author":"S Sayed","year":"2019","unstructured":"Sayed S, Nassef M, Badr A, Farag I (2019) A nested genetic algorithm for feature selection in high-dimensional cancer microarray datasets. Expert Syst Appl 121:233\u2013243","journal-title":"Expert Syst Appl"},{"issue":"1","key":"4452_CR25","doi-asserted-by":"publisher","first-page":"1950002","DOI":"10.1142\/S0218001419500022","volume":"33","author":"Q Shao","year":"2019","unstructured":"Shao Q, Xu CC, Zhu Y (2019) Multi-helicopter search and rescue route planning based on strategy optimization algorithm. Int J Pattern Recognit Artif Intell 33(1):1950002","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"4452_CR26","unstructured":"Song CH, Lee K, Lee WD (2003) Extended simulated annealing for augmented TSP and multi-salesmen TSP. In: 2003 international joint conference on neural networks vol 3, pp 2340\u20132343"},{"key":"4452_CR27","doi-asserted-by":"crossref","unstructured":"Stutzle T, Hoos H (1997) MAX-MIN ant system and local search for the traveling salesman problem. In: 1997 IEEE international conference on evolutionary computation, pp 309\u2013314","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"1","key":"4452_CR29","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1186\/s10033-018-0311-9","volume":"31","author":"L Wang","year":"2018","unstructured":"Wang L, Xia XH, Cao JH, Liu X, Liu JW (2018) Improved ant colony-genetic algorithm for information transmission path optimization in remanufacturing service system. Chin J Mech Eng 31(1):107","journal-title":"Chin J Mech Eng"},{"issue":"12","key":"4452_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/1550147718793799","volume":"14","author":"P Xu","year":"2018","unstructured":"Xu P, He G, Li Z, Zhang Z (2018) An efficient load balancing algorithm for virtual machine allocation based on ant colony optimization. Int J Distrib Sens Netw 14(12):1\u20139","journal-title":"Int J Distrib Sens Netw"},{"issue":"1-2","key":"4452_CR31","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10479-017-2531-2","volume":"273","author":"BZ Yao","year":"2019","unstructured":"Yao BZ, Chen C, Song XL, Yang XL (2019) Fresh seafood delivery routing problem using an improved ant colony optimization. Ann Cper Res 273(1-2):163\u2013186","journal-title":"Ann Cper Res"},{"issue":"3","key":"4452_CR32","doi-asserted-by":"publisher","first-page":"036006","DOI":"10.1088\/1748-3182\/9\/3\/036006","volume":"9","author":"ZL Zhang","year":"2014","unstructured":"Zhang ZL, Gao C, Liu YX, Qian T (2014) A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model. Bioinspiration Biomim 9(3):036006","journal-title":"Bioinspiration Biomim"},{"issue":"2","key":"4452_CR33","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1007\/s11277-017-5214-z","volume":"102","author":"JY Zhang","year":"2018","unstructured":"Zhang JY, Fan XX, Li M, Zhou SS, Liu JM (2018) Ant system with negative for the hospital ward color planning. Wirel Pers Commun 102(2):1589\u20131601","journal-title":"Wirel Pers Commun"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04452-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04452-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04452-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:28:32Z","timestamp":1604968112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04452-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":30,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4452"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04452-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"11 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"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":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}