{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T14:48:24Z","timestamp":1710254904496},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T00:00:00Z","timestamp":1405036800000},"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":[[2015,7]]},"DOI":"10.1007\/s00500-014-1368-8","type":"journal-article","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T07:21:33Z","timestamp":1404976893000},"page":"1843-1861","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hybrid PSO6 for hard continuous optimization"],"prefix":"10.1007","volume":"19","author":[{"given":"Jos\u00e9","family":"Garc\u00eda-Nieto","sequence":"first","affiliation":[]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,11]]},"reference":[{"issue":"1","key":"1368_CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1504\/IJICA.2007.013403","volume":"1","author":"E Alba","year":"2007","unstructured":"Alba E, Luque G, Garc\u00eda-Nieto J, Ordo\u00f1ez G, Leguizam\u00f3n G (2007) MALLBA: a software library to design efficient optimisation algorithms. Int J Innovative Comput Appl (IJICA) 1(1):74\u201385","journal-title":"Int J Innovative Comput Appl (IJICA)"},{"key":"1368_CR2","first-page":"1769","volume":"2","author":"A Auger","year":"2005","unstructured":"Auger A, Hansen N (2005) A restart CMA evolution strategy with increasing population size. IEEE Congr Evol Comput 2:1769\u20131776","journal-title":"IEEE Congr Evol Comput"},{"key":"1368_CR3","unstructured":"Chen J, Qin Z, Liu Y, Lu J (2005) Particle swarm optimization with local search. In: Neural Networks and Brain, 2005. ICNN B \u201905. International Conference on, vol 1, pp 481\u2013484"},{"key":"1368_CR4","doi-asserted-by":"crossref","unstructured":"Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58\u201373","DOI":"10.1109\/4235.985692"},{"key":"1368_CR5","doi-asserted-by":"crossref","unstructured":"Das S, Koduru P, Gui M, Cochran M, Wareing A, Welch SM, Babin BR (2006) Adding local search to particle swarm optimization. In: IEEE Congress on Evolutionary Computation, CEC 2006, pp 428\u2013433","DOI":"10.1109\/CEC.2006.1688340"},{"key":"1368_CR6","doi-asserted-by":"crossref","unstructured":"dos Santos Coelho L, Mariani VC (2006) Particle swarm optimization with quasi-newton local search for solving economic dispatch problem. In: IEEE International Conference on Systems, Man and Cybernetics, SMC 2006, vol 4, pp 3109\u20133113","DOI":"10.1109\/ICSMC.2006.384593"},{"key":"1368_CR7","doi-asserted-by":"crossref","unstructured":"Eberhart R, Shi Y (2000) Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation CEC\u201900., vol 1, La Jolla, pp 84\u201388","DOI":"10.1109\/CEC.2000.870279"},{"issue":"1","key":"1368_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10589-011-9449-4","volume":"53","author":"A El Dor","year":"2012","unstructured":"El Dor A, Clerc M, Siarry P (2012) A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization. Comput Optim Appl 53(1):271\u2013295","journal-title":"Comput Optim Appl"},{"issue":"6","key":"1368_CR9","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005. J Heuristics 15(6):617\u2013644","journal-title":"J Heuristics"},{"key":"1368_CR10","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Nieto J, Alba E (2011) Empirical computation of the quasi-optimal number of informants in particle swarm optimization. In: Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO \u201911. ACM, New York, pp 147\u2013154","DOI":"10.1145\/2001576.2001597"},{"key":"1368_CR11","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Nieto J, Alba E (2012) Why six informants is optimal in PSO. In: Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference, GECCO \u201912. ACM, New York, pp 25\u201332","DOI":"10.1145\/2330163.2330168"},{"key":"1368_CR12","unstructured":"Herrera F, Lozano M (2009) Workshop for evolutionary algorithms and other metaheuristics for continuous optimization problems: a scalability test. Technical report, SCI2S, University of Granada, Pisa"},{"key":"1368_CR13","doi-asserted-by":"crossref","unstructured":"Herrera F, Lozano M, Molina D (2010) Test suite for the special issue of soft computing on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems. Technical report, SCI2S, University of Granada, Spain","DOI":"10.1007\/s00500-010-0639-2"},{"key":"1368_CR14","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart RC (2001) Swarm intelligence. Morgan Kaufmann Pub, San Francisco"},{"key":"1368_CR15","doi-asserted-by":"crossref","unstructured":"Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: Proceedings of the Congress of Evolutionary Computation CEC\u201902, vol 2. IEEE Computer Society, Washington, DC, pp 1671\u20131676","DOI":"10.1109\/CEC.2002.1004493"},{"issue":"3","key":"1368_CR16","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TSMCB.2011.2171946","volume":"42","author":"C Li","year":"2012","unstructured":"Li C, Yang S, Nguyen TT (2012) A self-learning particle swarm optimizer for global optimization problems. IEEE Trans Syst Man Cybern Part B Cybern 42(3):627\u2013646","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"1368_CR17","doi-asserted-by":"crossref","unstructured":"Liang JJ, Suganthan PN (2005) Dynamic multi-swarm particle swarm optimizer with local search. In: The IEEE Congress on Evolutionary Computation, CEC 2005, vol 1, pp 522\u2013528","DOI":"10.1109\/CEC.2005.1554727"},{"key":"1368_CR18","doi-asserted-by":"crossref","unstructured":"Liao T, Montes de Oca MA, Aydin D, St\u00fctzle T, Dorigo M (2011) An incremental ant colony algorithm with local search for continuous optimization. In: Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO \u201911. ACM, New York, pp 125\u2013132","DOI":"10.1145\/2001576.2001594"},{"key":"1368_CR19","doi-asserted-by":"crossref","unstructured":"Mendes R, Kennedy J, Neves J (June 2004) The fully informed particle swarm: simpler, maybe better. IEEE Trans Evol Comput 8(3):204\u2013210","DOI":"10.1109\/TEVC.2004.826074"},{"key":"1368_CR20","doi-asserted-by":"crossref","unstructured":"Mohais AS, Mendes R, Ward C, Posthoff C (2005) Neighborhood re-structuring in particle swarm optimization. In: LNCS 3809. Proceedings of the 18th Australian Joint Conference on Artificial Intelligence. Springer, New York, pp 776\u2013785","DOI":"10.1007\/11589990_80"},{"key":"1368_CR21","doi-asserted-by":"crossref","unstructured":"Monson CK, Seppi KD (2005) Exposing origin-seeking bias in PSO. In: Proceedings of the 2005 conference on Genetic and evolutionary computation, GECCO \u201905. ACM, New York, pp 241\u2013248","DOI":"10.1145\/1068009.1068045"},{"key":"1368_CR22","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1007\/s00500-010-0649-0","volume":"15","author":"MA Montes de Oca","year":"2011","unstructured":"Montes de Oca MA, Aydin D, St\u00fctzle T (2011) An incremental particle swarm for large-scale continuous optimization problems: an example of tuning-in-the-loop (re)design of optimization algorithms. Soft Comput 15:2233\u20132255","journal-title":"Soft Comput"},{"issue":"2","key":"1368_CR23","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/TSMCB.2010.2055848","volume":"41","author":"MA Montes de Oca","year":"2011","unstructured":"Montes de Oca MA, St\u00fctzle T, Van den Enden K, Dorigo M (2011) Incremental social learning in particle swarms. IEEE Trans Syst Man Cybern Part B 41(2):368\u2013384","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"1368_CR24","doi-asserted-by":"crossref","unstructured":"Muelas S, La Torre A, Pe\u00f1a J (2009) A memetic differential evolution algorithm for continuous optimization. In: Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications, ISDA \u201909. IEEE Computer Society, Washington, DC, pp 1080\u20131084","DOI":"10.1109\/ISDA.2009.47"},{"issue":"4","key":"1368_CR25","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s00500-010-0603-1","volume":"15","author":"S Muelas","year":"2010","unstructured":"Muelas S, Pe\u00f1a J, La Torre A, Robles V (2010) A new initialization procedure for the distributed estimation of distribution algorithms. Soft Comput 15(4):713\u2013720","journal-title":"Soft Comput"},{"key":"1368_CR26","doi-asserted-by":"crossref","unstructured":"M\u00fcller CL, Baumgartner B, Sbalzarini IF (2009) Particle swarm cma evolution strategy for the optimization of multi-funnel landscapes. In: Proceedings of the Eleventh conference on Congress on Evolutionary Computation, CEC\u201909. IEEE Press, Piscataway, pp 2685\u20132692","DOI":"10.1109\/CEC.2009.4983279"},{"key":"1368_CR27","doi-asserted-by":"crossref","unstructured":"Powell MJD (1964) An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput J 7(2):155\u2013162","DOI":"10.1093\/comjnl\/7.2.155"},{"key":"1368_CR28","unstructured":"PSO-Central-Group (2011) Standard PSO 2006, 2007, and 2011. Technical Report [online] http:\/\/www.particleswarm.info\/ . Particle Swarm Central, Jan 2011"},{"key":"1368_CR29","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ins.2012.02.011","volume":"197","author":"B Qu","year":"2012","unstructured":"Qu B, Liang J, Suganthan P (2012) Niching particle swarm optimization with local search for multi-modal optimization. Inform Sci 197:131\u2013143","journal-title":"Inform Sci"},{"key":"1368_CR30","unstructured":"Sheskin DJ (2007) Handbook of parametric and nonparametric statistical procedures. Chapman & Hall\/CRC, New York"},{"key":"1368_CR31","unstructured":"Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y-P, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC\u201905 special session on real-parameter optimization. Technical Report KanGAL Report 2005005, Nanyang Technological University, Singapore and Kanpur, India"},{"key":"1368_CR32","doi-asserted-by":"crossref","unstructured":"Sutton AM, Whitley D, Lunacek M, Howe A (2006) PSO and multi-funnel landscapes: how cooperation might limit exploration. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation, GECCO \u201906. ACM, pp 75\u201382","DOI":"10.1145\/1143997.1144008"},{"key":"1368_CR33","unstructured":"Tang K, Yao X, Suganthan PN, MacNish C, Chen YP, Chen CM, Yang Z (2007) Benchmark functions for the CEC\u201908 special session and competition on large scale global optimization. Technical report, Nature Inspired Computation and Applications Laboratory, USTC, China, November"},{"issue":"2\u20134","key":"1368_CR34","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/cpe.938","volume":"17","author":"D Thain","year":"2005","unstructured":"Thain D, Tannenbaum T, Livny M (2005) Distributed computing in practice: the condor experience. Concurr Pract Exp 17(2\u20134):323\u2013356","journal-title":"Concurr Pract Exp"},{"key":"1368_CR35","doi-asserted-by":"crossref","unstructured":"Tseng L, Chun C (2008) Multiple trajectory search for large scale global optimization. In: IEEE Congress on Evolutionary Computation, CEC\u20192008. IEEE Press, pp 3052\u20133059","DOI":"10.1109\/CEC.2008.4631210"},{"key":"1368_CR36","doi-asserted-by":"crossref","unstructured":"Tseng L, Chen C (2009) Multiple trajectory search for unconstrained\/constrained multi-objective optimization. In: Proceedings of the Eleventh conference on Congress on Evolutionary Computation, CEC\u201909. IEEE Press, Piscataway, pp 1951\u20131958","DOI":"10.1109\/CEC.2009.4983179"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1368-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1368-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1368-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T19:15:37Z","timestamp":1649618137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1368-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,11]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1368"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1368-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,11]]}}}