{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T20:41:00Z","timestamp":1775421660274,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2012,5,5]],"date-time":"2012-05-05T00:00:00Z","timestamp":1336176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00500-012-0855-z","type":"journal-article","created":{"date-parts":[[2012,5,4]],"date-time":"2012-05-04T10:27:18Z","timestamp":1336127238000},"page":"1707-1722","source":"Crossref","is-referenced-by-count":156,"title":["A novel two-stage hybrid swarm intelligence optimization algorithm and application"],"prefix":"10.1007","volume":"16","author":[{"given":"Wu","family":"Deng","sequence":"first","affiliation":[]},{"given":"Rong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Bing","family":"He","sequence":"additional","affiliation":[]},{"given":"Yaqing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Lifeng","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Jinghuan","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,5]]},"reference":[{"issue":"2","key":"855_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1111\/j.1467-8640.2010.00367.x","volume":"27","author":"G Acampora","year":"2011","unstructured":"Acampora G, Gaeta M, Loia V (2011) Combining multi agent paradigm and memetic computing for personalized and adaptive learning experiences. Comput Intell J 27(2):141\u2013165","journal-title":"Comput Intell J"},{"key":"855_CR2","unstructured":"Adachi N, Yoshida Y (1995) Accelerating genetic algorithms: protected chromosomes and parallel processing. In: Proceedings of the first international conference on genetic algorithms in engineering systems: innovations and applications, pp 1\u201320"},{"issue":"3","key":"855_CR3","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M Albayrak","year":"2011","unstructured":"Albayrak M, Allahverdi N (2011) Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms. Expert Syst Appl 38(3):1313\u20131320","journal-title":"Expert Syst Appl"},{"issue":"12","key":"855_CR4","doi-asserted-by":"crossref","first-page":"5223","DOI":"10.1016\/j.energy.2010.07.043","volume":"35","author":"E Assareh","year":"2010","unstructured":"Assareh E, Behrang MA, Assari MR, Ghanbarzadeh A (2010) Application of PSO (particle swarm optimization) and GA (genetic algorithm) techniques on demand estimation of oil in Iran. Energy 35(12):5223\u20135229","journal-title":"Energy"},{"key":"855_CR5","unstructured":"Banaszak D, Dale GA, Watkins AN, Jordan JD(2009) An optical technique for detecting fatigue cracks in aerospace structures. In: Proc 18th ICIASF, pp 1\u20137"},{"issue":"1","key":"855_CR6","first-page":"25","volume":"7","author":"B Bullnheimer","year":"1997","unstructured":"Bullnheimer B, Hartl RF, Strauss C( (1997) A new rank based version of the ant system\u2014a computational study. Cent Eur J Oper Res Econ 7(1):25\u201338","journal-title":"Cent Eur J Oper Res Econ"},{"issue":"4","key":"855_CR7","doi-asserted-by":"crossref","first-page":"3873","DOI":"10.1016\/j.eswa.2010.09.048","volume":"38","author":"SM Chen","year":"2011","unstructured":"Chen SM, Chien CY (2011) Parallelized genetic ant colony systems for solving the traveling salesman problem. Expert Syst Appl 38(4):3873\u20133883","journal-title":"Expert Syst Appl"},{"issue":"9\u201310","key":"855_CR9","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1016\/j.mcm.2006.11.035","volume":"46","author":"CB Cheng","year":"2007","unstructured":"Cheng CB, Mao CP (2007) A modified ant colony system for solving the travelling salesman problem with time windows. Math Comput Model 46(9\u201310):1225\u20131235","journal-title":"Math Comput Model"},{"issue":"2","key":"855_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00034-008-9025-z","volume":"27","author":"SC Chu","year":"2008","unstructured":"Chu SC, Huang HC, Shi Y, Wu SY, Shieh CS (2008) Genetic watermarking for zerotree-based applications. Circuits Syst Signal Process 27(2):171\u2013182","journal-title":"Circuits Syst Signal Process"},{"issue":"10","key":"855_CR11","doi-asserted-by":"crossref","first-page":"1499","DOI":"10.1016\/S0893-6080(03)00056-X","volume":"16","author":"EM Cochrane","year":"2003","unstructured":"Cochrane EM, Beasley JE (2003) The co-adaptive neural network approach to the Euclidean traveling salesman problem. Neural Netw 16(10):1499\u20131525","journal-title":"Neural Netw"},{"key":"855_CR12","unstructured":"Colorni A, Dorigo M, ManiezzoV (1991) Distributed optimization by ant colonies. In: Proceedings of the first European conference on artificial life, Paris, France, pp 134\u2013142"},{"issue":"4","key":"855_CR13","doi-asserted-by":"crossref","first-page":"4198","DOI":"10.1016\/j.eswa.2010.09.083","volume":"38","author":"W Deng","year":"2011","unstructured":"Deng W, Li W, Yang XH (2011) A novel hybrid optimization algorithm of computational intelligence techniques for highway passenger volume prediction. Expert Syst Appl 38(4):4198\u20134205","journal-title":"Expert Syst Appl"},{"issue":"1","key":"855_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.camwa.2011.11.028","volume":"63","author":"W Deng","year":"2012","unstructured":"Deng W, Chen R, Gao J et al (2012) A novel parallel hybrid intelligence optimization algorithm for function approximation problem. Comput Math Appl 63(1):325\u2013336","journal-title":"Comput Math Appl"},{"issue":"1","key":"855_CR15","doi-asserted-by":"crossref","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":"5","key":"855_CR16","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1016\/j.ins.2006.09.016","volume":"177","author":"I Ellabib","year":"2007","unstructured":"Ellabib I, Calamai P, Basir O (2007) Exchange strategies for multiple ant colony system. Inf Sci 177(5):1248\u20131264","journal-title":"Inf Sci"},{"issue":"4","key":"855_CR17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.cie.2005.01.022","volume":"50","author":"SKS Fan","year":"2006","unstructured":"Fan SKS, Liang YC, Zahara E (2006) A genetic algorithm and a particle swarm optimizer hybridized with Nelder\u2013Mead simplex search. Comput Ind Eng 50(4):401\u2013425","journal-title":"Comput Ind Eng"},{"issue":"1","key":"855_CR18","doi-asserted-by":"crossref","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"XT Geng","year":"2011","unstructured":"Geng XT, Chen ZH, Yang W, Shi DQ, Zhao K (2011) Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl Soft Comput 11(1):3680\u20133689","journal-title":"Appl Soft Comput"},{"key":"855_CR19","unstructured":"Grimaldi AE, Gandelli A, Grimaccia F, Musseeta M, Zich RE (2005) A new hybrid technique for the optimization of large-domain electromagnetic problems. In: Antennas and propagation society international symposium, pp 61\u201364"},{"issue":"108","key":"855_CR20","first-page":"109","volume":"2","author":"U Guvenc","year":"2011","unstructured":"Guvenc U, Duman S, Saracoglu B, Ozturk A (2011) A hybrid GA\u2013PSO approach based on similarity for various types of economic dispatch problems. Electron Electr Eng Kaunas: Technologija 2(108):109\u2013114","journal-title":"Electron Electr Eng Kaunas: Technologija"},{"key":"855_CR21","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18:1138\u20131162","journal-title":"Oper Res"},{"key":"855_CR22","first-page":"4104","volume":"2718","author":"T Hendtlass","year":"2003","unstructured":"Hendtlass T (2003) Preserving diversity in particle swarm optimization. Lect Notes Comput Sci 2718:4104\u20134108","journal-title":"Lect Notes Comput Sci"},{"key":"855_CR23","unstructured":"Hoffman AJ, Wolfe P (1985) History. In: Lawler L, Rinooy K, Shmoys D (eds) The traveling salesman problem. Wiley, Chichester, pp 1\u201316"},{"key":"855_CR24","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press"},{"issue":"19","key":"855_CR25","doi-asserted-by":"crossref","first-page":"2869","DOI":"10.1016\/j.ins.2005.04.009","volume":"176","author":"Z Hua","year":"2006","unstructured":"Hua Z, Huang F (2006) A variable-grouping based genetic algorithm for large-scale integer programming. Inf Sci 176(19):2869\u20132885","journal-title":"Inf Sci"},{"issue":"2","key":"855_CR26","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.asoc.2007.07.002","volume":"8","author":"YT Kao","year":"2008","unstructured":"Kao YT, Zahara E (2008) A hybrid genetic algorithm and particle swarm optimization for multimodal functions. Appl Soft Comput 8(2):849\u2013857","journal-title":"Appl Soft Comput"},{"issue":"5\u20136","key":"855_CR27","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.compstruc.2009.01.003","volume":"87","author":"A Kaveh","year":"2009","unstructured":"Kaveh A, Talatahari S (2009) Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures. Comput Struct 87(5\u20136):267\u2013283","journal-title":"Comput Struct"},{"key":"855_CR28","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization, Proceedings of the IEEE international conference on neural networks, IEEE Press, Piscataway, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"3","key":"855_CR29","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1111\/j.1468-0394.2010.00517.x","volume":"27","author":"H Kuo","year":"2010","unstructured":"Kuo H, Horng SJ, Kao TW, Lin TL et al (2010) Hybrid swarm intelligence algorithm for the travelling salesman problem. Expert Syst Appl 27(3):166\u2013179","journal-title":"Expert Syst Appl"},{"issue":"10","key":"855_CR30","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1007\/s00500-007-0264-x","volume":"12","author":"KK Lim","year":"2008","unstructured":"Lim KK, Ong YS, Lim MH, Chen XS, Agarwal A (2008) Hybrid ant colony algorithms for path planning in sparse graphs. Soft Comput 12(10):981\u20131004","journal-title":"Soft Comput"},{"issue":"3","key":"855_CR31","doi-asserted-by":"crossref","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2009","unstructured":"Liu F, Zeng G (2009) Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Syst Appl 36(3):6995\u20137001","journal-title":"Expert Syst Appl"},{"issue":"5","key":"855_CR32","first-page":"1","volume":"28","author":"CC Lo","year":"1998","unstructured":"Lo CC, Hus CC (1998) Annealing framework with learning memory. IEEE Trans Syst Man Cybern Part A 28(5):1\u201313","journal-title":"IEEE Trans Syst Man Cybern Part A"},{"issue":"4","key":"855_CR34","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.engappai.2010.02.002","volume":"23","author":"Y Marinakis","year":"2010","unstructured":"Marinakis Y, Marinaki M, Dounias G (2010) A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng Appl Artif Intell 23(4):463\u2013472","journal-title":"Eng Appl Artif Intell"},{"issue":"10","key":"855_CR35","doi-asserted-by":"crossref","first-page":"1454","DOI":"10.1016\/j.ins.2008.12.016","volume":"179","author":"TA Masutti","year":"2009","unstructured":"Masutti TA, de Castro LN (2009) A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf Sci 179(10):1454\u20131468","journal-title":"Inf Sci"},{"issue":"7","key":"855_CR36","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1007\/s00500-010-0680-1","volume":"15","author":"M Mavrovouniotis","year":"2011","unstructured":"Mavrovouniotis M, Yang SX (2011) A memetic ant colony optimization algorithm for the dynamic travelling salesman problem. Soft Comput 15(7):1405\u20131425","journal-title":"Soft Comput"},{"issue":"5","key":"855_CR37","first-page":"941","volume":"4","author":"MK Mehmet Ali","year":"1993","unstructured":"Mehmet Ali MK, Kamoun F (1993) Neural networks for shortest tour computation and routing in computer networks. IEEE Trans Neural Netw 4(5):941\u2013953","journal-title":"IEEE Trans Neural Netw"},{"issue":"1","key":"855_CR38","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.eswa.2007.09.048","volume":"36","author":"HM Naimi","year":"2009","unstructured":"Naimi HM, Taherinejad N (2009) A new robust and efficient ant colony algorithms: using new interpretation of local updating process. Expert Syst Appl 36(1):481\u2013488","journal-title":"Expert Syst Appl"},{"issue":"2","key":"855_CR39","first-page":"119","volume":"16","author":"T Niknam","year":"2005","unstructured":"Niknam T, Ranjbar AM, Shirani AR (2005) A new approach for distribution state estimation based on ant colony algorithm with regard to distributed generation. J Intell Fuzzy Syst 16(2):119\u2013131","journal-title":"J Intell Fuzzy Syst"},{"issue":"3","key":"855_CR40","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1080\/00207540310001614150","volume":"42","author":"GC Onwubolu","year":"2004","unstructured":"Onwubolu GC, Clerc M (2004) Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int J Prod Res 42(3):473\u2013491","journal-title":"Int J Prod Res"},{"issue":"4\u20136","key":"855_CR100","first-page":"1013","volume":"70","author":"HS Paulo","year":"2007","unstructured":"Paulo HS, Maria TAS, S\u00e9rgio S (2007) A new approach to solve the traveling salesman problem. Neurocomputing 70(4\u20136):1013\u20131021","journal-title":"Neurocomputing"},{"issue":"9\u201312","key":"855_CR41","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1007\/s00170-010-2562-1","volume":"50","author":"H Sarhadi","year":"2010","unstructured":"Sarhadi H, Ghoseiri K (2010) An ant colony system approach for fuzzy traveling salesman problem with time windows. Int J Adv Manuf Technol 50(9\u201312):1203\u20131215","journal-title":"Int J Adv Manuf Technol"},{"key":"855_CR42","doi-asserted-by":"crossref","unstructured":"Shen G, Zhang YQ (2011) A new evolutionary algorithm using shadow price guided operators. Appl Soft Comput 11(2):1983\u20131992","DOI":"10.1016\/j.asoc.2010.06.014"},{"issue":"5","key":"855_CR43","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang QX (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103(5):169\u2013176","journal-title":"Inf Process Lett"},{"issue":"1","key":"855_CR44","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s10489-009-0179-6","volume":"34","author":"B Shuang","year":"2011","unstructured":"Shuang B, Chen JP, Li ZB (2011) Study on hybrid PS\u2013ACO algorithm. Appl Intell 34(1):64\u201373","journal-title":"Appl Intell"},{"issue":"1","key":"855_CR45","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00500-008-0312-1","volume":"13","author":"A Singh","year":"2009","unstructured":"Singh A, Baghel AS (2009) A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput 13(1):95\u2013101","journal-title":"Soft Comput"},{"issue":"4\u20136","key":"855_CR47","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1057\/palgrave.jors.2600439","volume":"48","author":"S Somhom","year":"1997","unstructured":"Somhom S, Modares A, Enkawa T (1997) A self-organizing model for the traveling salesman problem. J Oper Res Soc 48(4\u20136):919\u2013928","journal-title":"J Oper Res Soc"},{"issue":"8","key":"855_CR48","doi-asserted-by":"crossref","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\u2013MIN ant system. Future Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"855_CR49","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.asoc.2009.07.001","volume":"10","author":"N Taher","year":"2010","unstructured":"Taher N, Babak A (2010) An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl Soft Comput 10(1):183\u2013197","journal-title":"Appl Soft Comput"},{"key":"855_CR50","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Suganthan PN, Pan QK, Liang YC (2007) A genetic algorithm for the generalized traveling salesman problem. In: Proceedings of the 2007 IEEE congress on evolutionary computation, pp 2382\u20132389","DOI":"10.1109\/CEC.2007.4424769"},{"issue":"1\u20134","key":"855_CR51","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"CF Tsai","year":"2004","unstructured":"Tsai CF, Tsai CW, Tseng CC (2004) A new hybrid heuristic approach for solving large traveling salesman problem. Inf Sci 166(1\u20134):67\u201381","journal-title":"Inf Sci"},{"key":"855_CR52","unstructured":"Wang KP, Huang L, Zhou CG, Pang W (2003) Particle swarm optimization for traveling salesman problem. In: International conference on machine learning and cybernetics, pp 1583\u20131585"},{"issue":"3","key":"855_CR53","first-page":"30","volume":"4","author":"X Wang","year":"2007","unstructured":"Wang X, Gao XZ, Ovaska SJ (2007) A hybrid optimization algorithm based on ant colony and immune principles. Int J Comput Sci Appl 4(3):30\u201344","journal-title":"Int J Comput Sci Appl"},{"issue":"8","key":"855_CR54","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1016\/j.engappai.2008.01.003","volume":"21","author":"LN Xing","year":"2008","unstructured":"Xing LN, Chen YW, Yang KW et al (2008) A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem. Eng Appl Artif Intell 21(8):1370\u20131380","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"855_CR101","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.cor.2009.03.004","volume":"37","author":"M Yannis","year":"2010","unstructured":"Yannis M, Magdalene M (2010) A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Comput Oper Res 37(3):432\u2013442","journal-title":"Comput Oper Res"},{"issue":"2","key":"855_CR55","doi-asserted-by":"crossref","first-page":"3880","DOI":"10.1016\/j.eswa.2008.02.039","volume":"36","author":"E Zahara","year":"2009","unstructured":"Zahara E, Kao YT (2009) Hybrid Nelder\u2013Mead simplex search and particle swarm optimization for constrained engineering design problems. Expert Syst Appl 36(2):3880\u20133886","journal-title":"Expert Syst Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-012-0855-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-012-0855-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-012-0855-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:30:30Z","timestamp":1743053430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-012-0855-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,5]]},"references-count":54,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["855"],"URL":"https:\/\/doi.org\/10.1007\/s00500-012-0855-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,5]]}}}