{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:23:13Z","timestamp":1767856993244,"version":"3.49.0"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T00:00:00Z","timestamp":1618963200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T00:00:00Z","timestamp":1618963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we propose a hybrid metaheuristic based on Particle Swarm Optimization, which we tailor on a portfolio selection problem. To motivate and apply our hybrid metaheuristic, we reformulate the portfolio selection problem as an unconstrained problem, by means of penalty functions in the framework of the exact penalty methods. Our metaheuristic is hybrid as it adaptively updates the penalty parameters of the unconstrained model during the optimization process. In addition, it iteratively refines its solutions to reduce possible infeasibilities. We report also a numerical case study. Our hybrid metaheuristic appears to perform better than the corresponding Particle Swarm Optimization solver with constant penalty parameters. It performs similarly to two corresponding Particle Swarm Optimization solvers with penalty parameters respectively determined by a REVAC-based tuning procedure and an <jats:italic>irace<\/jats:italic>-based one, but on average it just needs less than 4% of the computational time requested by the latter procedures.<\/jats:p>","DOI":"10.1007\/s10479-021-04075-3","type":"journal-article","created":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T23:04:51Z","timestamp":1619046291000},"page":"109-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["A novel hybrid PSO-based metaheuristic for costly portfolio selection problems"],"prefix":"10.1007","volume":"304","author":[{"given":"Marco","family":"Corazza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7044-6014","authenticated-orcid":false,"given":"Giacomo","family":"di Tollo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4721-8114","authenticated-orcid":false,"given":"Giovanni","family":"Fasano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5890-4238","authenticated-orcid":false,"given":"Raffaele","family":"Pesenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,21]]},"reference":[{"issue":"5","key":"4075_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1941487.1941511","volume":"54","author":"S Arora","year":"2011","unstructured":"Arora, S., Barak, B., Brunnermeier, M., & Ge, R. (2011). Computational complexity and information asymmetry in financial products. Communication ACM, 54(5), 101\u2013107.","journal-title":"Communication ACM"},{"issue":"3","key":"4075_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner, P., Delbaen, F., Eber, J.-M., & Heath, D. (1999). Coherent measures of risk. Mathematical Finance, 9(3), 203\u2013228.","journal-title":"Mathematical Finance"},{"key":"4075_CR3","doi-asserted-by":"crossref","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T. (2007). Improvement strategies for the F-Race algorithm: Sampling design and iterative refinement. In T.\u00a0Bartz-Beielstein, M.\u00a0Blesa, C.\u00a0Blum, B.\u00a0Naujoks, A.\u00a0Roli, G.\u00a0Rudolph, M.\u00a0Sampels (Eds.), Hybrid metaheuristics Vol.\u00a04771 of Lecture Notes in Computer Science (pp.\u00a0108\u2013122). Springer, Heidelberg.","DOI":"10.1007\/978-3-540-75514-2_9"},{"key":"4075_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-02538-9_14","volume-title":"Experimental Methods for the Analysis of optimization algorithms","author":"T Bartz-Beielstein","year":"2010","unstructured":"Bartz-Beielstein, T., Lasarczyk, C., & Preuss, M. (2010). The sequential parameter optimization toolbox. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete, & M. Preuss (Eds.), Experimental Methods for the Analysis of optimization algorithms (pp. 337\u2013360). Berlin: Springer."},{"key":"4075_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2006). Nonlinear Programming: Theory and Algorithms (3rd ed.). London: Wiley.","edition":"3"},{"key":"4075_CR6","unstructured":"Bergstra, J., Bardenet, R., Bengio, Y., K\u00e9gl, B. ( 2011). Algorithms for hyper-parameter optimization. In Proceedings of the 24th international conference on neural information processing systems, NIPS\u201911 (pp.\u00a02546\u20132554). Curran Associates Inc., Red Hook, NY."},{"key":"4075_CR7","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas, D. P. (2016). Nonlinear Programming (3rd ed.). Nashua: Athena Scientific.","edition":"3"},{"key":"4075_CR8","doi-asserted-by":"crossref","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., & St\u00fctzle, T. (2010). F-race and iterated f-race: An overview. In Experimental Methods for the Analysis of Optimization Algorithms (pp.\u00a0311\u2013336). Springer.","DOI":"10.1007\/978-3-642-02538-9_13"},{"issue":"3","key":"4075_CR9","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TEVC.2015.2460753","volume":"20","author":"MR Bonyadi","year":"2016","unstructured":"Bonyadi, M. R., & Michalewicz, Z. (2016). Analysis of stability, local convergence, and transformation sensitivity of a variant of particle swarm optimization algorithm. IEEE Transactions on Evolutionary Computation, 20(3), 370\u2013385.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4075_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-69404-7_17","volume-title":"Learning and Intelligent Optimization","author":"LP C\u00e1ceres","year":"2017","unstructured":"C\u00e1ceres, L. P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Hoos, H., & St\u00fctzle, T. (2017). An experimental study of adaptive capping in Irace. In R. Battiti, D. E. Kvasov, & Y. D. Sergeyev (Eds.), Learning and Intelligent Optimization (pp. 235\u2013250). Cham: Springer."},{"issue":"3","key":"4075_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10898-009-9493-0","volume":"48","author":"EF Campana","year":"2010","unstructured":"Campana, E. F., Fasano, G., & Pinto, A. (2010). Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization. Journal of Global Optimization, 48(3), 347\u2013397.","journal-title":"Journal of Global Optimization"},{"issue":"10","key":"4075_CR12","doi-asserted-by":"publisher","first-page":"2070","DOI":"10.1016\/j.physa.2010.01.016","volume":"389","author":"W Chen","year":"2010","unstructured":"Chen, W., & Zhang, W.-G. (2010). The admissible portfolio selection problem with transaction costs and an improved pso algorithm. Physica A: Statistical Mechanics and its Applications, 389(10), 2070\u20132076.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"4075_CR13","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1016\/j.jbankfin.2008.07.004","volume":"32","author":"Z Chen","year":"2008","unstructured":"Chen, Z., & Wang, Y. (2008). Two-sided coherent risk measures and their application in realistic portfolio optimization. Journal of Banking and Finance, 32, 2667\u20132673.","journal-title":"Journal of Banking and Finance"},{"key":"4075_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-95098-3_24","volume":"102","author":"M Corazza","year":"2019","unstructured":"Corazza, M., di Tollo, G., Fasano, G., & Pesenti, R. (2019). A PSO-based framework for nonsmooth portfolio selection problems. Neural Advances in Processing Nonlinear Dynamic Signals, Smart Innovations, Systems and Technologies, 102, 265\u2013275.","journal-title":"Neural Advances in Processing Nonlinear Dynamic Signals, Smart Innovations, Systems and Technologies"},{"issue":"1","key":"4075_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc, M., & Kennedy, J. (2002). The particle swarm\u2014explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1), 58\u201373.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4075_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-88-470-2342-0_15","volume-title":"Mathematical and Statistical Methods for Actuarial Sciences and Finance","author":"M Corazza","year":"2012","unstructured":"Corazza, M., Fasano, G., & Gusso, R. (2012). Portfolio selection with an alternative measure of risk: Computational performances of particle swarm optimization and genetic algorithms. In C. Perna & M. Sibillo (Eds.), Mathematical and Statistical Methods for Actuarial Sciences and Finance (pp. 123\u2013130). Berlin: Springer."},{"key":"4075_CR17","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.amc.2013.07.091","volume":"224","author":"M Corazza","year":"2013","unstructured":"Corazza, M., Fasano, G., & Gusso, R. (2013). Particle swarm optimization with non-smooth penalty reformulation, for a complex portfolio selection problem. Applied Mathematics and Computation, 224, 611\u2013624.","journal-title":"Applied Mathematics and Computation"},{"key":"4075_CR18","doi-asserted-by":"crossref","unstructured":"Dai, Y., Liu, L., & Li, Y. (2011). An intelligent parameter selection method for particle swarm optimization algorithm. In 2011 Fourth international joint conference on computational sciences and optimization (pp.\u00a0960\u2013964).","DOI":"10.1109\/CSO.2011.79"},{"key":"4075_CR19","doi-asserted-by":"crossref","unstructured":"Eberhart, R. C., & Shi, Y. (2000). Comparing inertia weights and constriction factors in particle swarm optimization. In Proceedings of IEEE congress on evolutionary computation (pp.\u00a084\u201388).","DOI":"10.1109\/CEC.2000.870279"},{"key":"4075_CR20","doi-asserted-by":"crossref","unstructured":"Eberhart, R. C., & Shi, Y. (2001). Particle swarm optimization: Developments, applications and resources. In Proceedings of the 2001 congress on evolutionary computation (IEEE Cat. No.01TH8546) (Vol.\u00a01, pp.\u00a081\u201386).","DOI":"10.1109\/CEC.2001.934374"},{"key":"4075_CR21","unstructured":"Eggensperger, K., Feurer, M., Hutter, F., Bergstra, J., Snoek, J., Hoos, H. H., & Leyton-brown, K. (2013). Towards an empirical foundation for assessing Bayesian optimization of hyperparameters In In NIPS workshop on Bayesian optimization in theory and practice."},{"key":"4075_CR22","doi-asserted-by":"crossref","unstructured":"Eggensperger, K., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2015). Efficient benchmarking of hyperparameter optimizers via surrogates. In Proceedings of the twenty-Ninth AAAI conference on artificial intelligence (pp.\u00a01114\u20131120). AAAI Press.","DOI":"10.1609\/aaai.v29i1.9375"},{"issue":"2","key":"4075_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999). Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2), 124\u2013141.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4075_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben, A. E., & Smith, J. E. (2003). Introduction to Evolutionary Computing. Berlin: Springer."},{"issue":"2","key":"4075_CR25","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher, M. L. (1985). An applications oriented guide to Lagrangian relaxation. Interfaces, 15(2), 10\u201321.","journal-title":"Interfaces"},{"key":"4075_CR26","unstructured":"Gander, M. J. (2008). Schwarz methods over course of time. Electronic Transactions on Numerical Analysis, 31, 228\u2013255."},{"issue":"1","key":"4075_CR27","first-page":"36","volume":"2010","author":"JD Griffin","year":"2010","unstructured":"Griffin, J. D., & Kolda, T. G. (2010). Nonlinearly constrained optimization using heuristic penalty methods and asynchronous parallel generating set search. Applied Mathematics Research Express, 2010(1), 36\u201362.","journal-title":"Applied Mathematics Research Express"},{"issue":"39","key":"4075_CR28","first-page":"4558","volume":"4","author":"D Guang-Feng","year":"2012","unstructured":"Guang-Feng, D., Woo-Tsong, L., & Chih-Chung, L. (2012). Markowitz-based portfolio selection with cardinality constraints using improved particle swarm optimization. Expert Systems with Applications, 4(39), 4558\u20134566.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"4075_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s11721-017-0150-9","volume":"12","author":"KR Harrison","year":"2018","unstructured":"Harrison, K. R., Engelbrecht, A. P., & Ombuki-Berman, B. M. (2018). Self-adaptive particle swarm optimization: A review and analysis of convergence. Swarm Intelligence, 12(3), 187\u2013226.","journal-title":"Swarm Intelligence"},{"issue":"1","key":"4075_CR30","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.enconman.2008.08.031","volume":"50","author":"W-C Hong","year":"2009","unstructured":"Hong, W.-C. (2009). Chaotic particle swarm optimization algorithm in a support vector regression electric load forecasting model. Energy Conversion and Management, 50(1), 105\u2013117.","journal-title":"Energy Conversion and Management"},{"issue":"444\u2013456","key":"4075_CR31","first-page":"05","volume":"39","author":"S-T Hsieh","year":"2009","unstructured":"Hsieh, S.-T., Sun, T.-Y., Liu, C.-C., & Tsai, S.-J. (2009). Efficient population utilization strategy for particle swarm optimizer. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 39(444\u2013456), 05.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"issue":"2","key":"4075_CR32","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2019.2921598","volume":"24","author":"C Huang","year":"2019","unstructured":"Huang, C., Li, Y., & Yao, X. (2019). A survey of automatic parameter tuning methods for metaheuristics. IEEE Transactions on Evolutionary Computation, 24(2), 201\u2013216.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4075_CR33","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011). Sequential model-based optimization for general algorithm configuration. In C. A. C. Coello (Ed.), Learning and Intelligent Optimization (pp. 507\u2013523). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"4075_CR34","unstructured":"Hutter, F., Hoos, H. H., St\u00fctzle, T. (2007). Automatic algorithm configuration based on local search. In Proceedings of the 22nd national conference on artificial intelligence-volume 2, AAAI\u201907 (pp.\u00a01152\u20131157). AAAI Press."},{"key":"4075_CR35","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.asoc.2018.09.027","volume":"74","author":"B Jana","year":"2019","unstructured":"Jana, B., Mitra, S., & Acharyya, S. (2019). Repository and mutation based particle swarm optimization (rmpso): A new pso variant applied to reconstruction of gene regulatory network. Applied Soft Computing, 74, 330\u2013355.","journal-title":"Applied Soft Computing"},{"key":"4075_CR36","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the 1995 IEEE International Conference on Neural Networks. Australia, IEEE Service Center, Piscataway, NJ, IV: Perth."},{"key":"4075_CR37","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10898-004-2703-x","volume":"32","author":"H Konno","year":"2005","unstructured":"Konno, H., & Yamamoto, R. (2005). Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs. Journal of Global Optimization, 32, 207\u2013219.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"4075_CR38","doi-asserted-by":"publisher","first-page":"422","DOI":"10.15807\/jorsj.42.422","volume":"42","author":"H Konno","year":"1999","unstructured":"Konno, H., & Wijayanayake, A. (1999). Mean-absolute deviation portfolio optimization model under transaction costs. Journal of the Operations Research Society of Japan, 42(4), 422\u2013435.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"4075_CR39","first-page":"81","volume-title":"Auto-WEKA: Automatic model selection and hyperparameter optimization in WEKA","author":"L Kotthoff","year":"2019","unstructured":"Kotthoff, L., Thornton, C., Hoos, H. H., Hutter, F., & Leyton-Brown, K. (2019). Auto-WEKA: Automatic model selection and hyperparameter optimization in WEKA (pp. 81\u201395). Cham: Springer."},{"key":"4075_CR40","doi-asserted-by":"crossref","unstructured":"Liang, J. J., & Suganthan, P. N. (2006). Dynamic multi-swarm particle swarm optimizer with a novel constraint-handling mechanism. In Proceeding IEEE congress on evolutionary computation (pp.\u00a09\u201316). IEEE.","DOI":"10.1109\/CEC.2006.1688284"},{"issue":"4","key":"4075_CR41","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.1016\/j.eswa.2007.08.088","volume":"35","author":"S-W Lin","year":"2008","unstructured":"Lin, S.-W., Ying, K.-C., Chen, S.-C., & Lee, Z.-J. (2008). Particle swarm optimization for parameter determination and feature selection of support vector machines. Expert Systems with Applications, 35(4), 1817\u20131824.","journal-title":"Expert Systems with Applications"},{"key":"4075_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69432-8","volume-title":"Parameter Setting in Evolutionary Algorithms","author":"FG Lobo","year":"2007","unstructured":"Lobo, F. G., Lima, C. F., & Michalewicz, Z. (2007). Parameter Setting in Evolutionary Algorithms (1st ed.). Berlin: Springer.","edition":"1"},{"key":"4075_CR43","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L. P., Birattari, M., & St\u00fctzle, T. (2016). The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3, 43\u201358.","journal-title":"Operations Research Perspectives"},{"key":"4075_CR44","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01588250","volume":"17","author":"O Mangasarian","year":"1979","unstructured":"Mangasarian, O., & Han, S. (1979). Exact penalty functions in nonlinear programming. Mathematical Programming, 17, 251\u2013269.","journal-title":"Mathematical Programming"},{"key":"4075_CR45","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-18567-5_10","volume-title":"Optimization, control, and applications in the information age","author":"Y Marinakis","year":"2015","unstructured":"Marinakis, Y., Marinaki, M., & Migdalas, A. (2015). Adaptive tunning of all parameters in a multi-swarm particle swarm optimization algorithm: An application to the probabilistic traveling salesman problem. In A. Migdalas & A. Karakitsiou (Eds.), Optimization, control, and applications in the information age (pp. 187\u2013207). Cham: Springer."},{"issue":"1\u20135","key":"4075_CR46","first-page":"193","volume":"11","author":"O Maron","year":"1997","unstructured":"Maron, O., & Moore, A. (1997). The racing algorithm: Model selection for lazy learners. Artificial Intelligence Research, 11(1\u20135), 193\u2013225.","journal-title":"Artificial Intelligence Research"},{"key":"4075_CR47","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.asoc.2013.12.017","volume":"17","author":"E Montero","year":"2014","unstructured":"Montero, E., Riff, M.-C., & Neveu, B. (2014). A beginner\u2019s guide to tuning methods. Applied Soft Computing, 17, 39\u201351.","journal-title":"Applied Soft Computing"},{"key":"4075_CR48","doi-asserted-by":"crossref","unstructured":"Nannen, V., & Eiben, A. E. (2007a). Relevance estimation and value calibration of evolutionary algorithm parameters. In Proceedings of the 20th international joint conference on artifical intelligence, IJCAI\u201907 (pp.\u00a0975\u2013980). Morgan Kaufmann Publishers Inc., San Francisco, CA","DOI":"10.1109\/CEC.2007.4424460"},{"key":"4075_CR49","doi-asserted-by":"crossref","unstructured":"Nannen, V., & Eiben, A. E. (2007b). Relevance estimation and value calibration of evolutionary algorithm parameters. In M.\u00a0M. Veloso (Ed.), IJCAI 2007, proceedings of the 20th international joint conference on artificial intelligence (pp.\u00a01034\u20131039).","DOI":"10.1109\/CEC.2007.4424460"},{"key":"4075_CR50","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-540-87700-4_53","volume-title":"Parallel problem solving from nature-PPSN X","author":"V Nannen","year":"2008","unstructured":"Nannen, V., Smit, S. K., & Eiben, A. E. (2008). Costs and benefits of tuning parameters of evolutionary algorithms. In G. Rudolph, T. Jansen, N. Beume, S. Lucas, & C. Poloni (Eds.), Parallel problem solving from nature-PPSN X (pp. 528\u2013538). Berlin, Heidelberg: Springer."},{"key":"4075_CR51","volume-title":"Numerical Optimization\u2014Springer series in operations research and financial engineering","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., & Wright, S. (2006). Numerical Optimization\u2014Springer series in operations research and financial engineering (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"4","key":"4075_CR52","first-page":"22","volume":"4","author":"E Ozcan","year":"2016","unstructured":"Ozcan, E., Bas, S., & Akman, Y. (2016). The improved part\u0131cle swarm algor\u0131thm (pso) methods for search and rescue teams. International Journal of Advanced Computational Engineering and Networking, 4(4), 22\u201324.","journal-title":"International Journal of Advanced Computational Engineering and Networking"},{"issue":"3","key":"4075_CR53","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TEVC.2004.826071","volume":"8","author":"A Ratnaweera","year":"2004","unstructured":"Ratnaweera, A., Halgamuge, S. K., & Watson, H. C. (2004a). Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation, 8(3), 240\u2013255.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"8","key":"4075_CR54","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TEVC.2004.826071","volume":"3","author":"A Ratnaweera","year":"2004","unstructured":"Ratnaweera, A., Halgamuge, S. K., & Watson, H. C. (2004b). Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation, 3(8), 240\u2013254.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4075_CR55","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-5225-8103-1","volume-title":"Metaheuristic Approaches to Portfolio Optimization","author":"MADSKJ Ray","year":"2019","unstructured":"Ray, M. A. D. S. K. J., & Klepac, G. E. (2019). Metaheuristic Approaches to Portfolio Optimization. New York: IGI Global."},{"key":"4075_CR56","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.asoc.2016.08.028","volume":"49","author":"A Serani","year":"2016","unstructured":"Serani, A., Leotardi, C., Iemma, U., Campana, E. F., Fasano, G., & Diez, M. (2016). Parameter selection in synchronous and asynchronous deterministic particle swarm optimization for ship hydrodynamics problems. Applied Soft Computing, 49, 313\u2013334.","journal-title":"Applied Soft Computing"},{"key":"4075_CR57","first-page":"144","volume":"23","author":"M Sharma","year":"2019","unstructured":"Sharma, M., & Chhabra, J. K. (2019). Sustainable automatic data clustering using hybrid pso algorithm with mutation. Sustainable Computing: Informatics and Systems, 23, 144\u2013157.","journal-title":"Sustainable Computing: Informatics and Systems"},{"key":"4075_CR58","unstructured":"Shi, Y., & Eberhart, R. (1998a). A modified particle swarm optimizer. In 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No.98TH8360) (pp.\u00a069\u201373)."},{"key":"4075_CR59","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0040810","volume-title":"Evolutionary Programming VII","author":"Y Shi","year":"1998","unstructured":"Shi, Y., & Eberhart, R. C. (1998b). Parameter selection in particle swarm optimization. In V. W. Porto, N. Saravanan, D. Waagen, & A. E. Eiben (Eds.), Evolutionary Programming VII (pp. 591\u2013600). Berlin: Springer."},{"key":"4075_CR60","doi-asserted-by":"crossref","unstructured":"Shi, Y., & Obaiahnahatti, B. (1998). A modified particle swarm optimizer. In Proceeding IEEE Congress on Evolutionary Computation (Vol. 6, pp. 69\u201373).","DOI":"10.1109\/ICEC.1998.699146"},{"key":"4075_CR61","doi-asserted-by":"crossref","unstructured":"Si, T., Jana, N., & Sil, J. (2011). Particle swarm optimization with adaptive polynomial mutation. In Proceedings of the 2011 world congress on information and communication technologies, WICT 2011, (pp. 12).","DOI":"10.1109\/WICT.2011.6141233"},{"key":"4075_CR62","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-35380-2_49","volume-title":"Swarm, Evolutionary, and Memetic Computing","author":"T Si","year":"2012","unstructured":"Si, T., Jana, N. D., & Sil, J. (2012). Pso-tuned control parameter in differential evolution algorithm. In B. K. Panigrahi, S. Das, P. N. Suganthan, & P. K. Nanda (Eds.), Swarm, Evolutionary, and Memetic Computing (pp. 417\u2013424). Berlin: Springer."},{"key":"4075_CR63","unstructured":"Snoek, J., Larochelle, H., Adams, R.\u00a0P. (2012). Practical bayesian optimization of machine learning algorithms. In Proceedings of the 25th international conference on neural information processing systems-volume 2 (pp.\u00a02951\u20132959), Curran Associates Inc., Red Hook, NY."},{"issue":"1","key":"4075_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3054133","volume":"50","author":"A Soler-Dom\u00ednguez","year":"2017","unstructured":"Soler-Dom\u00ednguez, A., Juan, A. A., & Kizys, R. (2017). A survey of financial applications of metaheuristics. ACM Computing Survey, 50(1), 1\u201323.","journal-title":"ACM Computing Survey"},{"key":"4075_CR65","doi-asserted-by":"crossref","unstructured":"Talbi, E., & Nakib, A. (Eds.). (2019). Bioinspired heuristics for optimization. Berlin: Springer.","DOI":"10.1007\/978-3-319-95104-1"},{"issue":"8","key":"4075_CR66","doi-asserted-by":"publisher","first-page":"4713","DOI":"10.1016\/j.asoc.2011.07.012","volume":"11","author":"Y Tang","year":"2011","unstructured":"Tang, Y., Wang, Z., & Fang, J. (2011). Feedback learning particle swarm optimization. Applied Soft Computing, 11(8), 4713\u20134725.","journal-title":"Applied Soft Computing"},{"issue":"6","key":"4075_CR67","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(02)00447-7","volume":"85","author":"IC Trelea","year":"2003","unstructured":"Trelea, I. C. (2003). The particle swarm optimization algorithm: Convergence analysis and parameter selection. Information Processing Letters, 85(6), 317\u2013325.","journal-title":"Information Processing Letters"},{"key":"4075_CR68","doi-asserted-by":"crossref","unstructured":"Trujillo, L., Gonz\u00e1lez, E.\u00a0\u00c1., Galv\u00e1n, E., Tapia, J. J., & Ponsich, A. (2020). On the analysis of hyper-parameter space for a genetic programming system with iterated f-race. Soft Computing, 24, 14757\u201314770.","DOI":"10.1007\/s00500-020-04829-4"},{"key":"4075_CR69","doi-asserted-by":"crossref","unstructured":"Wang, H., Geng, Q., & Qiao, Z. (2014). Parameter tuning of particle swarm optimization by using Taguchi method and its application to motor design. In 2014 4th IEEE international conference on information science and technology (pp.\u00a0722\u2013726).","DOI":"10.1109\/ICIST.2014.6920579"},{"key":"4075_CR70","doi-asserted-by":"publisher","first-page":"105496","DOI":"10.1016\/j.asoc.2019.105496","volume":"81","author":"S Wang","year":"2019","unstructured":"Wang, S., Li, Y., & Yang, H. (2019). Self-adaptive mutation differential evolution algorithm based on particle swarm optimization. Applied Soft Computing, 81, 105496.","journal-title":"Applied Soft Computing"},{"key":"4075_CR71","doi-asserted-by":"crossref","unstructured":"Winner, K., Miner, D., & desJardins, M. (2009). Controlling particle swarm optimization with learned parameters. In Self-Adaptive and Self-Organizing Systems (SASO), 2009 3rd IEEE International Conference on (pp. 288\u2013290).","DOI":"10.1109\/SASO.2009.12"},{"key":"4075_CR72","doi-asserted-by":"crossref","unstructured":"Wu, P., & Zhang, J. (2013). Novel particle swarm optimization for unconstrained problems. In 2013 25th Chinese control and decision conference (CCDC) (pp.\u00a0368\u2013372). IEEE.","DOI":"10.1109\/CCDC.2013.6560950"},{"issue":"7","key":"4075_CR73","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1007\/s00607-019-00782-9","volume":"102","author":"X Xia","year":"2020","unstructured":"Xia, X., Tang, Y., Wei, B., Zhang, Y., Gui, L., & Li, X. (2020). Dynamic multi-swarm global particle swarm optimization. Computing, 102(7), 1587\u20131626.","journal-title":"Computing"},{"key":"4075_CR74","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/mnsc.13.5.344","volume":"13","author":"W Zangwill","year":"1967","unstructured":"Zangwill, W. (1967). Nonlinear programming with penalty functions. Management Science, 13, 344\u2013358.","journal-title":"Management Science"},{"key":"4075_CR75","doi-asserted-by":"publisher","first-page":"105789","DOI":"10.1016\/j.knosys.2020.105789","volume":"196","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Liu, X., Bao, F., Chi, J., Zhang, C., & Liu, P. (2020). Particle swarm optimization with adaptive learning strategy. Knowledge-Based Systems, 196, 105789.","journal-title":"Knowledge-Based Systems"},{"issue":"6","key":"4075_CR76","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1109\/TSMCB.2009.2015956","volume":"39","author":"Z Zhan","year":"2009","unstructured":"Zhan, Z., Zhang, J., Li, Y., & Chung, H. S. (2009). Adaptive particle swarm optimization. IEEE Transactions on Systems, Man, and Cybernetics: Part B (Cybernetics), 39(6), 1362\u20131381.","journal-title":"IEEE Transactions on Systems , Man, and Cybernetics: Part B (Cybernetics)"},{"key":"4075_CR77","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-540-87527-7_21","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"Z-H Zhan","year":"2008","unstructured":"Zhan, Z.-H., & Zhang, J. (2008). Adaptive particle swarm optimization. In M. Dorigo, M. Birattari, C. Blum, M. Clerc, T. St\u00fctzle, & A. F. T. Winfield (Eds.), Ant Colony Optimization and Swarm Intelligence (pp. 227\u2013234). Berlin, Heidelberg: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04075-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04075-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04075-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T01:50:01Z","timestamp":1675216201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04075-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,21]]},"references-count":77,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["4075"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04075-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,21]]},"assertion":[{"value":"7 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"Authors declare that they have no significant competing financial, professional, or personal interests that might have influenced the performance or presentation of the work described in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}