{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:56:26Z","timestamp":1781103386441,"version":"3.54.1"},"reference-count":44,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4,1]]},"abstract":"<p>A recent study (Yin et al., 2010) showed that combining particle swarm optimization (PSO) with the strategies of scatter search (SS) and path relinking (PR) produces a Cyber Swarm Algorithm that creates a more effective form of PSO than methods that do not incorporate such mechanisms. This paper proposes a Complementary Cyber Swarm Algorithm (C\/CyberSA) that performs in the same league as the original Cyber Swarm Algorithm but adopts different sets of ideas from the tabu search (TS) and the SS\/PR template. The C\/CyberSA exploits the guidance information and restriction information produced in the history of swarm search and the manipulation of adaptive memory. Responsive strategies using long term memory and path relinking implementations are proposed that make use of critical events encountered in the search. Experimental results with a large set of challenging test functions show that the C\/CyberSA outperforms two recently proposed swarm-based methods by finding more optimal solutions while simultaneously using a smaller number of function evaluations. The C\/CyberSA approach further produces improvements comparable to those obtained by the original CyberSA in relation to the Standard PSO 2007 method (Clerc, 2008).<\/p>","DOI":"10.4018\/jsir.2011040102","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:51:03Z","timestamp":1319028663000},"page":"22-41","source":"Crossref","is-referenced-by-count":6,"title":["A Complementary Cyber Swarm Algorithm"],"prefix":"10.4018","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2835-9002","authenticated-orcid":true,"given":"Peng-Yeng","family":"Yin","sequence":"first","affiliation":[{"name":"National Chi Nan University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[{"name":"OptTek Systems, Inc., USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[{"name":"University of Colorado, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia-Xian","family":"Zhu","sequence":"additional","affiliation":[{"name":"National Chi Nan University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jsir.2011040102-0","unstructured":"Angeline, P. J. (1999). Using selection to improve particle swarm optimization. In Proceedings of the IEEE International Joint Conference on Neural Networks (pp. 84-89)."},{"key":"jsir.2011040102-1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400378742"},{"key":"jsir.2011040102-2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012793906010"},{"key":"jsir.2011040102-3","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00255-6"},{"key":"jsir.2011040102-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.08.053"},{"key":"jsir.2011040102-5","unstructured":"Clerc, M. (2008). Particle swarm programs. Retrieved from http:\/\/www.particleswarm.info\/Programs.html"},{"key":"jsir.2011040102-6","doi-asserted-by":"publisher","DOI":"10.1109\/4235.985692"},{"key":"jsir.2011040102-7","author":"A.Duarte","year":"2007","journal-title":"Adaptive memory programming for global optimization"},{"key":"jsir.2011040102-8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0596-2"},{"key":"jsir.2011040102-9","first-page":"15","article-title":"Path relinking for large scale global optimization.","author":"A.Duarte","year":"2011","journal-title":"Soft Computing"},{"key":"jsir.2011040102-10","unstructured":"Eberhart, R. C., & Shi, Y. (1998). Evolving artificial neural networks. In Proceedings of the International Conference on Neural Networks and Brain (pp. 5-13)."},{"key":"jsir.2011040102-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2005.11.012"},{"key":"jsir.2011040102-12","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"jsir.2011040102-13","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90211-9"},{"key":"jsir.2011040102-14","first-page":"1","article-title":"Tabu search and adaptive memory programming - advances, applications and challenges","author":"F.Glover","year":"1996","journal-title":"Interfaces in computer science and operations research"},{"key":"jsir.2011040102-15","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00037-E"},{"key":"jsir.2011040102-16","doi-asserted-by":"crossref","unstructured":"Glover, F. (1998). A template for scatter search and path relinking. In J.-K. Hao, E. Lutton, E. M. A. Ronald, M. Schoenauer, & D. Snyers (Eds.), Proceedings of the Third European Conference on Artificial Evolution (LNCS 1363, pp. 3-54).","DOI":"10.1007\/BFb0026589"},{"key":"jsir.2011040102-17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","author":"F.Glover","year":"1997","journal-title":"Tabu search"},{"key":"jsir.2011040102-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.05.033"},{"key":"jsir.2011040102-19","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-006-0021-6"},{"key":"jsir.2011040102-20","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-006-4192-1"},{"key":"jsir.2011040102-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.01.039"},{"key":"jsir.2011040102-22","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2009.2014556"},{"key":"jsir.2011040102-23","doi-asserted-by":"crossref","unstructured":"Kennedy, J. (1999, July). Small world and mega-minds: Effects of neighbourhood topology on particle swarm performance. In Proceedings of the Congress on Evolutionary Computation (pp. 1931-1938).","DOI":"10.1109\/CEC.1999.785509"},{"key":"jsir.2011040102-24","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"jsir.2011040102-25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","author":"M.Laguna","year":"2003","journal-title":"Scatter search: Methodology and implementation in C"},{"key":"jsir.2011040102-26","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-004-1936-z"},{"key":"jsir.2011040102-27","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2010102602"},{"key":"jsir.2011040102-28","unstructured":"Lovbjerg, M., Rasmussen, T. K., & Krink, T. (2001). Hybrid particle swarm optimizer with breeding and subpopulations. In Proceedings of the Genetic and Evolutionary Computation Conference."},{"key":"jsir.2011040102-29","doi-asserted-by":"crossref","unstructured":"Lu, Z., Hao, J.-K., & Glover, F. (2010). Neighborhood analysis: A case study on curriculum-based course timetabling. Journal of Heuristics.","DOI":"10.1007\/s10732-010-9128-0"},{"key":"jsir.2011040102-30","unstructured":"Luke, S. (2009). Essentials of metaheuristics. Retrieved from http:\/\/cs.gmu.edu\/~sean\/book\/metaheuristics\/"},{"key":"jsir.2011040102-31","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826074"},{"key":"jsir.2011040102-32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72377-6_6"},{"key":"jsir.2011040102-33","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"jsir.2011040102-34","unstructured":"Nakano, S., Ishigame, A., & Yasuda, K. (2007). Particle swarm optimization based on the concept of tabu search. In Proceedings of the IEEE Congress on Evolutionary Computation (pp. 3258-3263)."},{"key":"jsir.2011040102-35","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0656-7"},{"key":"jsir.2011040102-36","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2007.10.001"},{"key":"jsir.2011040102-37","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2002.807051"},{"key":"jsir.2011040102-38","article-title":"Metaheuristics","author":"K.S\u00f6rensen","year":"2010","journal-title":"Encyclopedia of operations research"},{"key":"jsir.2011040102-39","first-page":"239","article-title":"Multiple neighbourhood search in commercial VRP packages: Evolving towards self-adaptive methods.","volume":"136","author":"K.S\u00f6rensen","year":"2008","journal-title":"Studies in Computational Statistics"},{"key":"jsir.2011040102-40","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9133-5"},{"key":"jsir.2011040102-41","unstructured":"Wang, Y. X., Zhao, Z. D., & Ren, R. (2007). Hybrid particle swarm optimizer with tabu strategy for global numerical optimization. In Proceedings of the IEEE Congress on Evolutionary Computation (pp. 2310-2316)."},{"key":"jsir.2011040102-42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.03.035"},{"key":"jsir.2011040102-43","unstructured":"Yoshida, H., Kawata, K., Fukuyama, Y., & Nakanishi, Y. (1999). A particle swarm optimization for reactive power and voltage control considering voltage stability. In Proceedings of the International Conference on Intelligent System Application to Power Systems (pp. 117-121)."}],"container-title":["International Journal of Swarm Intelligence Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=55318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T22:51:03Z","timestamp":1741819863000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jsir.2011040102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jsir.2011040102","relation":{},"ISSN":["1947-9263","1947-9271"],"issn-type":[{"value":"1947-9263","type":"print"},{"value":"1947-9271","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}