{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:26:32Z","timestamp":1781105192791,"version":"3.54.1"},"reference-count":19,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<p>To control particles to fly inside the limited search space and deal with the problems of slow search speed and premature convergence of particle swarm optimization algorithm, this paper applies the theory of topology, and proposed a quotient space-based boundary condition named QsaBC by using the properties of quotient space and homeomorphism. In QsaBC, Search space-zoomed factor and Attractor are introduced according to the dynamic behavior and stability of particles, which not only reduce the subjective interference and enforce the capability of global search, but also enhance the power of local search and escaping from an inferior local optimum. Four CEC\u20192008 benchmark functions are selected to evaluate the performance of QsaBC. Comparative experiments show that QsaBC can achieve the satisfactory optimization solution with fast convergence speed. Furthermore, QsaBC is more effective with errant particles, and has easier calculation and better robustness than other methods.<\/p>","DOI":"10.4018\/jssci.2011010106","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:48:56Z","timestamp":1319028536000},"page":"78-89","source":"Crossref","is-referenced-by-count":0,"title":["Quotient Space-Based Boundary Condition for Particle Swarm Optimization Algorithm"],"prefix":"10.4018","volume":"3","author":[{"given":"Yuhong","family":"Chi","sequence":"first","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fuchun","family":"Sun","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Langfan","family":"Jiang","sequence":"additional","affiliation":[{"name":"PLA, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunyang","family":"Yu","sequence":"additional","affiliation":[{"name":"Northeastern University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunli","family":"Chen","sequence":"additional","affiliation":[{"name":"China University of Geosciences, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jssci.2011010106-0","doi-asserted-by":"crossref","unstructured":"Bratton, D., & Kennedy, J. (2007). Defining a standard for particle swarm optimization. In Proceedings of the IEEE Swarm Intelligence Symposium (pp. 120-127). Washington, DC: IEEE Computer Society.","DOI":"10.1109\/SIS.2007.368035"},{"key":"jssci.2011010106-1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-009-0119-4"},{"key":"jssci.2011010106-2","unstructured":"Eberhart, R. C., & Shi, Y. H. (2001). Particle swarm optimization: Developments, applications, and resources. In Proceedings of the IEEE International Conference on Evolutionary Computation 1, (Vol. 1, pp. 81-86). Washington, DC: IEEE Computer Society."},{"key":"jssci.2011010106-3","doi-asserted-by":"crossref","unstructured":"Helwig, S., & Wanka, R. (2008). Theoretical analysis of initial particle swarm behavior. In G. Rudolph, T. Jansen, S. Lucas, C. Poloni, & N. Beume (Eds.), Proceedings of the 10th International Conference on Parallel Problem Solving from Nature (LNCS 5199, pp. 889-898).","DOI":"10.1007\/978-3-540-87700-4_88"},{"key":"jssci.2011010106-4","doi-asserted-by":"publisher","DOI":"10.1109\/LAWP.2005.846166"},{"key":"jssci.2011010106-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2007.01.009"},{"key":"jssci.2011010106-6","author":"E. I.Jury","year":"1964","journal-title":"Theory and application of the z-transform method"},{"key":"jssci.2011010106-7","unstructured":"Kennedy, J. (2005). Why does it need velocity? In Proceedings of the IEEE Swarm Intelligence Symposium (pp. 38-44). Washington, DC: IEEE Computer Society."},{"key":"jssci.2011010106-8","doi-asserted-by":"publisher","DOI":"10.5019\/j.ijcir.2008.127"},{"key":"jssci.2011010106-9","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"jssci.2011010106-10","author":"J.Klaus","year":"1984","journal-title":"Topology"},{"key":"jssci.2011010106-11","doi-asserted-by":"crossref","unstructured":"Li, J., Ren, B., & Wang, C. (2007). A random velocity boundary condition for robust particle swarm optimization. In K. Li, G. W. Irwin, M. Fei, & S. Ma (Eds.), Proceedings of the Life System Modeling and Simulation International Conference on Bio-Inspired Computational Intelligence and Applications (LNCS 4688, pp. 92-99).","DOI":"10.1007\/978-3-540-74769-7_11"},{"key":"jssci.2011010106-12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"key":"jssci.2011010106-13","unstructured":"Ozcan, E., & Mohan, C. (1999). Particle swarm optimization: Surfing the waves. In Proceedings of the IEEE International Congress on Evolutionary Computation (pp. 1939-1944). Washington, DC: IEEE Computer Society."},{"key":"jssci.2011010106-14","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2004.823969"},{"key":"jssci.2011010106-15","unstructured":"Shi, Y. H., & Eberhart, R. C. (1998). A modified particle swarm optimizer. In Proceedings of the IEEE International Congress on Evolutionary Computation (pp. 69-73). Washington, DC: IEEE Computer Society."},{"key":"jssci.2011010106-16","unstructured":"Tang, K., Yao, X., Suganthan, P. N., MacNish, C., Chen, Y. P., Chen, C. M., et al. (2007). Benchmark functions for the CEC\u20192008 special session and competition on large scale global optimization (Tech. Rep. No. NCL-TR-2007012). Hefei, China: University of Science and Technology of China."},{"key":"jssci.2011010106-17","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2007.891562"},{"key":"jssci.2011010106-18","first-page":"2307","article-title":"Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space. In","volume":"2","author":"W. J.Zhang","year":"2004","journal-title":"Proceedings of the IEEE International Congress on Evolutionary Computation"}],"container-title":["International Journal of Software Science and Computational Intelligence"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=53164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:50:52Z","timestamp":1654098652000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jssci.2011010106"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jssci.2011010106","relation":{},"ISSN":["1942-9045","1942-9037"],"issn-type":[{"value":"1942-9045","type":"print"},{"value":"1942-9037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}