{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T06:47:45Z","timestamp":1769323665475,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2016,2,18]],"date-time":"2016-02-18T00:00:00Z","timestamp":1455753600000},"content-version":"tdm","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":[[2017,8]]},"DOI":"10.1007\/s00500-016-2071-8","type":"journal-article","created":{"date-parts":[[2016,2,18]],"date-time":"2016-02-18T01:16:28Z","timestamp":1455758188000},"page":"4387-4398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":362,"title":["A novel collaborative optimization algorithm in solving complex optimization problems"],"prefix":"10.1007","volume":"21","author":[{"given":"Wu","family":"Deng","sequence":"first","affiliation":[]},{"given":"Huimin","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Li","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Guangyu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xinhua","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Daqing","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,18]]},"reference":[{"issue":"1","key":"2071_CR1","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/j.asoc.2012.07.024","volume":"13","author":"S Akpinar","year":"2013","unstructured":"Akpinar S, Mirac Bayhan G, Baykasoglu A (2013) Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks. Appl Soft Comput J 13(1):574\u2013589","journal-title":"Appl Soft Comput J"},{"key":"2071_CR2","unstructured":"Ali RN, Mohammad HF, Niaki STA (2015) A hybrid genetic and imperialist competitive algorithm for green vendor managed inventory of multi-item multi-constraint EOQ model under shortage. Appl Soft Comput J 30(5):353\u2013364"},{"issue":"6","key":"2071_CR3","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum C, Puchinger J, Raidl GR, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11(6):4135\u20134151","journal-title":"Appl Soft Comput"},{"issue":"4","key":"2071_CR4","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":"14","key":"2071_CR5","doi-asserted-by":"crossref","first-page":"2633","DOI":"10.1016\/j.ins.2010.02.019","volume":"180","author":"E Corchado","year":"2010","unstructured":"Corchado E, Abraham A (2010) Hybrid intelligent algorithms and applications. Inf Sci 180(14):2633\u20132634","journal-title":"Inf Sci"},{"issue":"10","key":"2071_CR6","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","volume":"16","author":"W Deng","year":"2012","unstructured":"Deng W, Chen R, He B, Liu YQ, Yin LF, Guo JH (2012) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput 16(10):1707\u20131722","journal-title":"Soft Comput"},{"issue":"2","key":"2071_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Biosystems 43(2):73\u201381","journal-title":"Biosystems"},{"issue":"3","key":"2071_CR8","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s10589-009-9270-5","volume":"48","author":"A Duarte","year":"2011","unstructured":"Duarte A, Laguna M, Marti R (2011) Tabu search for the linear ordering problem with cumulative costs. Comput Optim Appl 48(3):697\u2013715","journal-title":"Comput Optim Appl"},{"issue":"1","key":"2071_CR9","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.eswa.2014.07.054","volume":"42","author":"JB Escario","year":"2015","unstructured":"Escario JB, Jimenez JF, Giron-Sierra JM (2015) Ant colony extended: experiments on the travelling salesman problem. Expert Syst Appl 42(1):390\u2013410","journal-title":"Expert Syst Appl"},{"key":"2071_CR10","doi-asserted-by":"crossref","unstructured":"Fister I, Perc M, Kamal SM, Fister I (2015) A review of chaos-based firefly algorithms: perspectives and research challenges. Appl Math Comput 252:155\u2013165","DOI":"10.1016\/j.amc.2014.12.006"},{"issue":"1","key":"2071_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11721-007-0004-y","volume":"1","author":"S Garnier","year":"2007","unstructured":"Garnier S, Gautrais J, Theraulaz G (2007) The biological principles of swarm intelligence. Swarm Intell 1(1):3\u201331","journal-title":"Swarm Intell"},{"issue":"1","key":"2071_CR12","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.knosys.2012.10.017","volume":"39","author":"A Ghanbari","year":"2013","unstructured":"Ghanbari A, Kazemi SMR, Mehmanpazir F, Nakhostin MM (2013) A cooperative ant colony optimization-genetic algorithm approach for construction of energy demand forecasting knowledge-based expert systems. Knowl-Based Syst 39(1):194\u2013206","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"2071_CR13","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1016\/j.cie.2013.08.008","volume":"66","author":"A Hamzadayi","year":"2013","unstructured":"Hamzadayi A, Yildiz G (2013) A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines. Comput Ind Eng 66(4):1070\u20131084","journal-title":"Comput Ind Eng"},{"key":"2071_CR14","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1977","unstructured":"Holland JH (1977) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"issue":"7","key":"2071_CR15","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1007\/s00500-013-1150-3","volume":"18","author":"SY Jing","year":"2014","unstructured":"Jing SY (2014) A hybrid genetic algorithm for feature subset selection in rough set theory. Soft Comput 18(7):1373\u20131382","journal-title":"Soft Comput"},{"issue":"8","key":"2071_CR16","doi-asserted-by":"crossref","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Jovanovic","year":"2011","unstructured":"Jovanovic R, Tuba M (2011) An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl Soft Comput 11(8):5360\u20135366","journal-title":"Appl Soft Comput"},{"issue":"4","key":"2071_CR17","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s00500-014-1223-y","volume":"18","author":"P Kromer","year":"2014","unstructured":"Kromer P, Zelinka I, Snasel V (2014) Behaviour of pseudo-random and chaotic sources of stochasticity in nature-inspired optimization methods. Soft Comput 18(4):619\u2013629","journal-title":"Soft Comput"},{"issue":"1","key":"2071_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.asoc.2006.10.012","volume":"8","author":"ZJ Lee","year":"2008","unstructured":"Lee ZJ, Su SF, Huang CC, Liu KH (2008) Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl Soft Comput J 8(1):55\u201378","journal-title":"Appl Soft Comput J"},{"issue":"8","key":"2071_CR19","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1080\/00207540110119991","volume":"40","author":"WD Li","year":"2002","unstructured":"Li WD, Ong SK, Nee AYC (2002) Hybrid genetic algorithm and simulated annealing approach for the optimization of process plans for prismatic parts. Int J Prod Res 40(8):1899\u20131922","journal-title":"Int J Prod Res"},{"issue":"3","key":"2071_CR20","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1109\/TSMCB.2006.887946","volume":"37","author":"BB Li","year":"2007","unstructured":"Li BB, Wang L (2007) A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE Trans Syst Man Cybern Part B Cybern 37(3):576\u2013591","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"5","key":"2071_CR21","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan \u00d6K, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for travelling salesman problem. Appl Soft Comput J 30(5):484\u2013490","journal-title":"Appl Soft Comput J"},{"issue":"3","key":"2071_CR22","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.cor.2009.03.004","volume":"37","author":"Y Marinakisa","year":"2010","unstructured":"Marinakisa Y, Marinaki 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":"14","key":"2071_CR23","doi-asserted-by":"crossref","first-page":"11685","DOI":"10.1016\/j.eswa.2012.04.053","volume":"39","author":"K Metaxiotis","year":"2012","unstructured":"Metaxiotis K, Liagkouras K (2012) Multiobjective evolutionary algorithms for portfolio management: a comprehensive literature review. Expert Syst Appl 39(14):11685\u201311698","journal-title":"Expert Syst Appl"},{"issue":"2","key":"2071_CR24","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1016\/j.asoc.2012.10.025","volume":"13","author":"T Okamoto","year":"2013","unstructured":"Okamoto T, Hirata H (2013) Global optimization using a multipoint type quasi-chaotic optimization method. Appl Soft Comput 13(2):1247\u20131264","journal-title":"Appl Soft Comput"},{"issue":"1","key":"2071_CR25","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TEVC.2012.2185846","volume":"17","author":"FEB Otero","year":"2013","unstructured":"Otero FEB, Freitas AA, Johnson CG (2013) A new sequential covering strategy for inducing classification rules with ant colony algorithms. IEEE Trans Evol Comput 17(1):64\u201376","journal-title":"IEEE Trans Evol Comput"},{"key":"2071_CR26","doi-asserted-by":"publisher","unstructured":"Pan ZQ, Zhang Y, Kwong S (2015) Efficient motion and disparity estimation optimization for low complexity multiview video coding. IEEE Trans Broadcast. doi:\n                        10.1109\/TBC.2015.2419824","DOI":"10.1109\/TBC.2015.2419824"},{"key":"2071_CR27","unstructured":"Pasti R, Castro LND (2006) A neuro-immune network for solving the travelling salesman problem. In Proceedings of 2006 international joint conference on neural networks, Vancouver, pp 3760\u20133766"},{"key":"2071_CR28","doi-asserted-by":"crossref","unstructured":"Rizk-Allah RM, Zaki EM, El-Sawy AA (2013) Hybridizing ant colony optimization with firefly algorithm for unconstrained optimization problems. Appl Math Comput 224:473\u2013483","DOI":"10.1016\/j.amc.2013.07.092"},{"key":"2071_CR29","doi-asserted-by":"crossref","unstructured":"Robertson BL, Price CJ, Reale M (2013) CARTopt: a random search method for nonsmooth unconstrained optimization. Comput Optim Appl 56(2):291\u2013315","DOI":"10.1007\/s10589-013-9560-9"},{"key":"2071_CR30","doi-asserted-by":"crossref","unstructured":"Sheikhan M, Mohammadi N (2012) Neural-based electricity load forecasting using hybrid of GA and ACO for feature selection. Neural Comput Appl 21(8):1961\u20131970","DOI":"10.1007\/s00521-011-0599-1"},{"key":"2071_CR31","doi-asserted-by":"crossref","unstructured":"Sioud A, Gravel M, Gagn\u00e9 C (2012) A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. Comput Oper Res 39(10):2415\u20132424","DOI":"10.5772\/36225"},{"issue":"1","key":"2071_CR32","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.ejor.2008.08.023","volume":"198","author":"LY Tseng","year":"2009","unstructured":"Tseng LY, Lin YT (2009) A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 198(1):84\u201392","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2071_CR33","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.cie.2014.04.006","volume":"73","author":"XH Wang","year":"2014","unstructured":"Wang XH, Duan HB (2014) A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput Ind Eng 73(1):96\u2013114","journal-title":"Comput Ind Eng"},{"issue":"3","key":"2071_CR34","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.amc.2003.11.023","volume":"160","author":"LY Wei","year":"2005","unstructured":"Wei LY, Zhao M (2005) A niche hybrid genetic algorithm for global optimization of continuous multimodal functions. Appl Math Comput (N Y) 160(3):649\u2013661","journal-title":"Appl Math Comput (N Y)"},{"issue":"3","key":"2071_CR35","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/j.ins.2010.10.001","volume":"181","author":"Y Wen","year":"2011","unstructured":"Wen Y, Xu H, Yang JD (2011) A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system. Inf Sci 181(3):567\u2013581","journal-title":"Inf Sci"},{"issue":"1","key":"2071_CR36","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ins.2014.10.040","volume":"295","author":"XZ Wen","year":"2015","unstructured":"Wen XZ, Shao L, Xue Y, Fang W (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295(1):395\u2013406","journal-title":"Inf Sci"},{"issue":"4","key":"2071_CR37","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1109\/TSMCB.2011.2107899","volume":"41","author":"LN Xing","year":"2011","unstructured":"Xing LN, Rohlfshagen P, Chen YW, Yao X (2011) A hybrid ant colony optimization algorithm for the extended capacitated arc routing problem. IEEE Trans Syst Man Cybern Part B Cybern 41(4):1110\u20131123","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"1","key":"2071_CR38","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1590\/S0101-74382013000100002","volume":"33","author":"HH Yanass","year":"2013","unstructured":"Yanass HH (2013) A review of three decades of research on some combinatorial optimization problems. Pesqui Oper 33(1):11\u201336","journal-title":"Pesqui Oper"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2071-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2071-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2071-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2071-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:46:15Z","timestamp":1559079975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2071-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,18]]},"references-count":38,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["2071"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2071-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,18]]}}}