{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:21:00Z","timestamp":1773656460074,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T00:00:00Z","timestamp":1599696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T00:00:00Z","timestamp":1599696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001652","name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001652","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the variant of Particle Swarm Optimization that applies random velocities in a dimension instead of the regular velocity update equations as soon as the so-called <jats:italic>potential<\/jats:italic> of the swarm falls below a certain small bound in this dimension, arbitrarily set by the user. In this case, the swarm performs a <jats:italic>forced move<\/jats:italic>.\nIn this paper, we are interested in how, by counting the forced moves, the swarm can decide for itself to stop its movement because it is improbable to find better candidate solutions than the already-found best solution. We formally prove that when the swarm is close to a (local) optimum, it behaves like a blind-searching cloud and that the frequency of forced moves exceeds a certain, objective function-independent value. Based on this observation, we define stopping criteria and evaluate them experimentally showing that good candidate solutions can be found much faster than setting upper bounds on the iterations and better solutions compared to applying other solutions from the literature.<\/jats:p>","DOI":"10.1007\/s11721-020-00185-z","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T19:08:41Z","timestamp":1599764921000},"page":"285-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Self-adaptive potential-based stopping criteria for Particle Swarm Optimization with forced moves"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7258-5584","authenticated-orcid":false,"given":"Bernd","family":"Bassimir","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Schmitt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5729-3727","authenticated-orcid":false,"given":"Rolf","family":"Wanka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,10]]},"reference":[{"issue":"3","key":"185_CR1","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/S0377-2217(99)00321-5","volume":"126","author":"H Aytug","year":"2000","unstructured":"Aytug, H., & Koehler, G. J. (2000). New Stopping Criterion for Genetic Algorithms. European Journal of Operational Research, 126(3), 662\u2013674. https:\/\/doi.org\/10.1016\/S0377-2217(99)00321-5.","journal-title":"European Journal of Operational Research"},{"key":"185_CR2","doi-asserted-by":"publisher","unstructured":"Bassimir, B., Schmitt, M., & Wanka, R. (2014). How Much Forcing is Necessary to Let the Results of Particle Swarms Converge? In Proceedings of International Conference on Swarm Intelligence Based Optimization (ICSIBO), pp 98\u2013105, https:\/\/doi.org\/10.1007\/978-3-319-12970-9_11","DOI":"10.1007\/978-3-319-12970-9_11"},{"key":"185_CR3","unstructured":"Carlisle, A., & Dozier, G. (2001). An Off-the-Shelf PSO. In Proceedings of the Workshop on Particle Swarm Optimization"},{"key":"185_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1950-7","volume-title":"Probability Theory","author":"YS Chow","year":"1978","unstructured":"Chow, Y. S., & Teicher, H. (1978). Probability Theory. Berlin: Springer. https:\/\/doi.org\/10.1007\/978-1-4612-1950-7."},{"key":"185_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21548-8","volume-title":"Elementary Probability Theory with Stochastic Processes","author":"KL Chung","year":"1974","unstructured":"Chung, K. L. (1974). Elementary Probability theory with Stochastic Processes. Berlin: Springer. https:\/\/doi.org\/10.1007\/978-0-387-21548-8."},{"key":"185_CR6","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, 58\u201373. https:\/\/doi.org\/10.1109\/4235.985692.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"185_CR7","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/0328048","volume":"28","author":"CCY Dorea","year":"1990","unstructured":"Dorea, C. C. Y. (1990). Stopping rules for a Random Optimization Method. SIAM Journal on Control and Optimization, 28(4), 841\u2013850. https:\/\/doi.org\/10.1137\/0328048.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"185_CR8","doi-asserted-by":"publisher","unstructured":"Eberhart RC, Kennedy J (1995) A New Optimizer using Particle Swarm Theory. In Proceedings of 6th International Symposium on Micro Machine and Human Science, pp 39\u201343, https:\/\/doi.org\/10.1109\/MHS.1995.494215","DOI":"10.1109\/MHS.1995.494215"},{"key":"185_CR9","doi-asserted-by":"publisher","unstructured":"Engelbrecht, A.P. (2014). Fitness function evaluations: A fair stopping condition? In 2014 IEEE Symposium on Swarm Intelligence (SIS), pp 181\u2013188, https:\/\/doi.org\/10.1109\/SIS.2014.7011793","DOI":"10.1109\/SIS.2014.7011793"},{"key":"185_CR10","unstructured":"Helwig, S. (2010). Particle swarms for constrained optimization. PhD thesis, Department of Computer Science, University of Erlangen\u2013Nuremberg, Germany, urn:nbn:de:bvb:29-opus-19334"},{"key":"185_CR11","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.C. (1995). Particle Swarm Optimization. In Proceedings of IEEE International Conference on Neural Networks, vol\u00a04, pp 1942\u20131948, https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"185_CR12","doi-asserted-by":"publisher","unstructured":"Kwok, N.M., Ha, Q.P., Liu, D.K., Fang, G., Tan, K.C. (2007). Efficient Particle Swarm Optimization: a termination condition based on the decision-making approach. In Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp 3353\u20133360, https:\/\/doi.org\/10.1109\/CEC.2007.4424905","DOI":"10.1109\/CEC.2007.4424905"},{"key":"185_CR13","doi-asserted-by":"publisher","unstructured":"Lehre, P.K., Witt, C. (2013). Finite first hitting time versus stochastic convergence in particle swarm optimisation. In: Advances in Metaheuristics, Operations Research\/Computer Science Interfaces Series, vol\u00a053, Springer, pp 1\u201320, https:\/\/doi.org\/10.1007\/978-1-4614-6322-1_1","DOI":"10.1007\/978-1-4614-6322-1_1"},{"key":"185_CR14","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ins.2016.07.025","volume":"367\u2013368","author":"L Mart\u00ed","year":"2016","unstructured":"Mart\u00ed, L., Garc\u00eda, J., Berlanga, A., & Molina, J. (2016). A stopping criterion for multi-objective optimization evolutionary Algorithms. Information Sciences, 367\u2013368, 700\u2013718. https:\/\/doi.org\/10.1016\/j.ins.2016.07.025.","journal-title":"Information Sciences"},{"issue":"1","key":"185_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/S0219622014500837","volume":"14","author":"BT Ong","year":"2015","unstructured":"Ong, B. T., & Fukushima, M. (2015). Automatically terminated Particle Swarm Optimization with principal component analysis. International Journal of Information Technology & Decision Making, 14(1), 171\u2013194. https:\/\/doi.org\/10.1142\/S0219622014500837.","journal-title":"International Journal of Information Technology & Decision Making"},{"key":"185_CR16","doi-asserted-by":"publisher","first-page":"4","DOI":"10.5334\/jors.282","volume":"8","author":"A Ra\u00df","year":"2020","unstructured":"Ra\u00df, A. (2020). High Precision Particle Swarm Optimization Algorithm (HiPPSO). Journal of Open Research Software, 8, 4. https:\/\/doi.org\/10.5334\/jors.282.","journal-title":"Journal of Open Research Software"},{"key":"185_CR17","doi-asserted-by":"publisher","unstructured":"Ra\u00df, A., Schmitt, M., Wanka, R. (2015). Explanation of stagnation at points that are not local optima in Particle Swarm Optimization by potential analysis. In Companion of Proceedings of 17th Genetic and Evolutionary Computation Conference (GECCO), pp 1463\u20131464, https:\/\/doi.org\/10.1145\/2739482.2764654","DOI":"10.1145\/2739482.2764654"},{"key":"185_CR18","doi-asserted-by":"publisher","unstructured":"Ribeiro, C.C., Rosseti, I., Souza, R.C. (2011). Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations. In Proceedings of 5th International Conference on Learning and Intelligent Optimization (LION), pp 146\u2013160, https:\/\/doi.org\/10.1007\/978-3-642-25566-3_11","DOI":"10.1007\/978-3-642-25566-3_11"},{"key":"185_CR19","doi-asserted-by":"publisher","unstructured":"Safe, M., Carballido, J., Ponzoni, I., Brignole, N. (2004). On stopping criteria for genetic Algorithms. In Proceedings of 17th Brazilian Symposium on Artificial Intelligence (SBIA), pp 405\u2013413, https:\/\/doi.org\/10.1007\/978-3-540-28645-5_41","DOI":"10.1007\/978-3-540-28645-5_41"},{"key":"185_CR20","doi-asserted-by":"publisher","unstructured":"Schmitt, M., & Wanka, R. (2013a). Particle Swarm Optimization almost surely finds local optima. In Proceedings of 15th Genetic and Evolutionary Computation Conference (GECCO), pp 1629\u20131636, https:\/\/doi.org\/10.1145\/2463372.2463563","DOI":"10.1145\/2463372.2463563"},{"key":"185_CR21","doi-asserted-by":"publisher","unstructured":"Schmitt, M., & Wanka, R. (2013b). Particles prefer walking along the axes: Experimental insights into the behavior of a particle swarm. In Companion of Proceedings of 15th Genetic and Evolutionary Computation Conference (GECCO), pp 17\u201318, https:\/\/doi.org\/10.1145\/2464576.2464583","DOI":"10.1145\/2464576.2464583"},{"key":"185_CR22","doi-asserted-by":"publisher","unstructured":"Schmitt, M., & Wanka, R. (2015). Particle Swarm Optimization almost surely finds local optima. Theoretical Computer Science 561, Part A:57\u201372, https:\/\/doi.org\/10.1016\/j.tcs.2014.05.017, extended, full version of Schmitt and Wanka (2013a)","DOI":"10.1016\/j.tcs.2014.05.017"},{"key":"185_CR23","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.compchemeng.2013.05.004","volume":"56","author":"S Sharma","year":"2013","unstructured":"Sharma, S., & Rangaiah, G. P. (2013). An improved multi-objective differential evolution with a termination criterion for optimizing chemical processes. Computers & Chemical Engineering, 56, 155\u2013173. https:\/\/doi.org\/10.1016\/j.compchemeng.2013.05.004.","journal-title":"Computers & Chemical Engineering"},{"issue":"1","key":"185_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"FJ Solis","year":"1981","unstructured":"Solis, F. J., & Wets, R. J. B. (1981). Minimization by random search techniques. Mathematics of Operations Research, 6(1), 19\u201330. https:\/\/doi.org\/10.1287\/moor.6.1.19.","journal-title":"Mathematics of Operations Research"},{"key":"185_CR25","unstructured":"Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., & Tiwari, S. (2005). Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical report, KanGAL Report Number 2005005 (Kanpur Genetic Algorithms Laboratory, IIT Kanpur)"},{"key":"185_CR26","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 Process Letter, 85, 317\u2013325. https:\/\/doi.org\/10.1016\/S0020-0190(02)00447-7.","journal-title":"Information Process Letter"},{"key":"185_CR27","doi-asserted-by":"publisher","unstructured":"van den Bergh, F., & Engelbrecht, A.P. (2002). A new locally convergent particle swarm optimiser. In Proceedings of IEEE International Conference on Systems, Man and Cybernetics (SMC), vol\u00a03, pp 94\u201399, https:\/\/doi.org\/10.1109\/ICSMC.2002.1176018","DOI":"10.1109\/ICSMC.2002.1176018"},{"key":"185_CR28","doi-asserted-by":"publisher","unstructured":"Yi, D., & Seppi, K.D., & Goodrich, M.A. (2018). Understanding Particle Swarm Optimization: A component-decomposition perspective. In Proceedings of IEEE Congress on Evolutionary Computation (CEC), https:\/\/doi.org\/10.1109\/CEC.2018.8477832","DOI":"10.1109\/CEC.2018.8477832"},{"key":"185_CR29","first-page":"51","volume":"31","author":"K Zielinski","year":"2007","unstructured":"Zielinski, K., & Laur, R. (2007). Stopping criteria for a constrained single-objective Particle Swarm Optimization Algorithm. Informatica, 31, 51\u201359.","journal-title":"Informatica"},{"key":"185_CR30","unstructured":"Zielinski, K., Peters, D., & Laur, R. (2005). Stopping criteria for single-objective optimization. In Proceedings of 3rd International Conference on Computational Intelligence, Robotics and Autonomous Systems (CIRAS)"}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-020-00185-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11721-020-00185-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-020-00185-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T02:56:49Z","timestamp":1631242609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11721-020-00185-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,10]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["185"],"URL":"https:\/\/doi.org\/10.1007\/s11721-020-00185-z","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"value":"1935-3812","type":"print"},{"value":"1935-3820","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,10]]},"assertion":[{"value":"27 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2020","order":3,"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"}}]}}