{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:55:21Z","timestamp":1761663321868},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,11,8]],"date-time":"2014-11-08T00:00:00Z","timestamp":1415404800000},"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":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s13042-014-0308-3","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T12:14:03Z","timestamp":1415967243000},"page":"451-477","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Particle swarm optimization with neighborhood-based budget allocation"],"prefix":"10.1007","volume":"7","author":[{"given":"D.","family":"Souravlias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. E.","family":"Parsopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"issue":"8","key":"308_CR1","doi-asserted-by":"crossref","first-page":"2694","DOI":"10.1016\/j.cam.2010.11.021","volume":"235","author":"R Akbari","year":"2011","unstructured":"Akbari R, Ziarati K (2011) A rank based particle swarm optimization algorithm with dynamic adaptation. J Comput Appl Math 235(8):2694\u20132714","journal-title":"J Comput Appl Math"},{"key":"308_CR2","doi-asserted-by":"crossref","unstructured":"Auger A, Hansen N (2005) A restart CMA evolution strategy with increasing population size. In Proc. IEEE Congress On Evolutionary Computation, pages 1769\u20131776, Edinburgh, UK","DOI":"10.1109\/CEC.2005.1554902"},{"key":"308_CR3","doi-asserted-by":"crossref","DOI":"10.1887\/0750308958","volume-title":"Handbook of evolutionary computation","author":"T B\u00e4ck","year":"1997","unstructured":"B\u00e4ck T, Fogel D, Michalewicz Z (1997) Handbook of evolutionary computation. IOP Publishing and Oxford University Press, New York"},{"key":"308_CR4","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein T, Blum D, Branke J (2007) Particle swarm optimization and sequential sampling in noisy environments. vol 39 of In Metaheuristics, Operations Research\/Computer Science Interfaces Series, Springer, p 261\u2013273","DOI":"10.1007\/978-0-387-71921-4_14"},{"issue":"1","key":"308_CR5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","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","journal-title":"IEEE Trans Evol Comput"},{"key":"308_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"CA Coello Coello","year":"2002","unstructured":"Coello Coello CA, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer, New York"},{"issue":"11","key":"308_CR7","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1007\/s00500-010-0650-7","volume":"15","author":"A Duarte","year":"2011","unstructured":"Duarte A, Mart R, Gortazar F (2011) Path relinking for large-scale global optimization. Soft Comput 15(11):2257\u20132273","journal-title":"Soft Comput"},{"key":"308_CR8","doi-asserted-by":"crossref","unstructured":"Eshelman J (1991) The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. Foundations of Genetic Algorithms, p 265\u2013283","DOI":"10.1016\/B978-0-08-050684-5.50020-3"},{"issue":"3","key":"308_CR9","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/TSMCA.2008.918599","volume":"38","author":"C Grosan","year":"2008","unstructured":"Grosan C, Abraham A (2008) A new approach for solving nonlinear equations systems. IEEE Trans Syst Man Cybern Part A Syst Hum 38(3):698\u2013714","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"},{"key":"308_CR10","unstructured":"Jin Y, Olhofer M, Sendhoff B (2001) Evolutionary dynamic weighted aggregation for multiobjective optimization: Why does it work and how? In: Proceedings of the GECCO 2001 Conference, San Francisco, CA, p 1042\u20131049"},{"key":"308_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy J (1999) Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. In: Proceedings of the 1999 congress on evolutionary computation, Washington, D.C., USA, IEEE Press, p 1931\u20131938","DOI":"10.1109\/CEC.1999.785509"},{"key":"308_CR12","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, vol IV, Piscataway, NJ, IEEE Service Center p 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"308_CR13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.swevo.2014.03.001","volume":"17","author":"R Kumar","year":"2014","unstructured":"Kumar R (2014) Directed bee colony optimization algorithm. Swarm Evol Comput 17:60\u201373","journal-title":"Swarm Evol Comput"},{"issue":"11","key":"308_CR14","doi-asserted-by":"crossref","first-page":"2085","DOI":"10.1007\/s00500-010-0639-2","volume":"15","author":"M Lozano","year":"2011","unstructured":"Lozano M, Molina D, Herrera F (2011) Editorial scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems. Soft Comput 15(11):2085\u20132087","journal-title":"Soft Comput"},{"issue":"2","key":"308_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s13042-013-0167-3","volume":"5","author":"W Ma","year":"2014","unstructured":"Ma W, Wang M, Zhu X (2014) Improved particle swarm optimization based approach for bilevel programming problem-an application on supply chain model. Int J Mach Learn Cybern 5(2):281\u2013292","journal-title":"Int J Mach Learn Cybern"},{"issue":"2","key":"308_CR16","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.amc.2007.09.004","volume":"198","author":"MGH Omran","year":"2008","unstructured":"Omran MGH, Mahdavi M (2008) Global-best harmony search. Appl Math Comput 198(2):643\u2013656","journal-title":"Appl Math Comput"},{"issue":"2","key":"308_CR17","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1016\/j.amc.2006.01.066","volume":"181","author":"H Pan","year":"2006","unstructured":"Pan H, Wang L, Liu B (2006) Particle swarm optimization for function optimization in noisy environment. Appl Math Comput 181(2):908\u2013919","journal-title":"Appl Math Comput"},{"key":"308_CR18","doi-asserted-by":"crossref","unstructured":"Parsopoulos KE, Vrahatis MN (2002) Particle swarm optimization method in multiobjective problems. In: Proceedins of the ACM 2002 Symposium on Applied Computing (SAC 2002), p 603\u2013607, Madrid, Spain. ACM Press","DOI":"10.1145\/508791.508907"},{"key":"308_CR19","doi-asserted-by":"crossref","unstructured":"Parsopoulos KE, Vrahatis MN (2010) Particle swarm optimization and intelligence: advances and applications. Information Science Publishing (IGI Global)","DOI":"10.4018\/978-1-61520-666-7"},{"key":"308_CR20","unstructured":"Poli R (2007) An analysis of publications on particle swarm optimisation applications. Technical Report CSM-649, University of Essex, Department of Computer Science, UK"},{"key":"308_CR21","doi-asserted-by":"crossref","unstructured":"Rada-Vilela J, Zhang M, Johnston M (2013) Optimal computing budget allocation in particle swarm optimization. In Proc. 2013 Genetic and Evolutionary Computation Conference (GECCO\u201913), Amsterdam, Netherlands, p 81\u201388","DOI":"10.1109\/CEC.2013.6557669"},{"issue":"4","key":"308_CR22","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s13042-012-0103-y","volume":"4","author":"S Rana","year":"2013","unstructured":"Rana S, Jasola S, Kumar R (2013) A boundary restricted adaptive particle swarm optimization for data clustering. Int J Mach Learn Cybern 4(4):391\u2013400","journal-title":"Int J Mach Learn Cybern"},{"key":"308_CR23","doi-asserted-by":"crossref","unstructured":"Souravlias D, Parsopoulos KE (2013) Particle swarm optimization with budget allocation through neighborhood ranking. In: Proceedings of the 2013 Genetic and Evolutionary Computation Conference (GECCO\u201913), p 105\u2013112","DOI":"10.1145\/2463372.2463379"},{"key":"308_CR24","unstructured":"Suganthan PN (1999) Particle swarm optimizer with neighborhood operator. In: Proceedings of the IEEE Congress on Evolutionary Computation, Washington, D.C., USA p 1958\u20131961"},{"issue":"2","key":"308_CR25","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s13042-013-0168-2","volume":"5","author":"N Tian","year":"2014","unstructured":"Tian N, Lai C-H (2014) Parallel quantum-behaved particle swarm optimization. Int J Mach Learn Cybern 5(2):309\u2013318","journal-title":"Int J Mach Learn Cybern"},{"key":"308_CR26","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(02)00447-7","volume":"85","author":"IC Trelea","year":"2003","unstructured":"Trelea IC (2003) The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf Process Lett 85:317\u2013325","journal-title":"Inf Process Lett"},{"key":"308_CR27","doi-asserted-by":"crossref","unstructured":"Voglis C, Parsopoulos KE, Lagaris IE (2012) Particle swarm optimization with deliberate loss of information. Soft Comput 16(8):1373\u20131392","DOI":"10.1007\/s00500-012-0841-5"},{"key":"308_CR28","unstructured":"Wan L-Y, Li W (2008) An improved particle swarm optimization algorithm with rank-based selection. In: Proceedings of the IEEE international conference on machine learning and cybernetics, vol 7, pp 4090\u20134095"},{"issue":"19","key":"308_CR29","doi-asserted-by":"crossref","first-page":"4230","DOI":"10.1016\/j.ins.2011.06.002","volume":"181","author":"X Wang","year":"2011","unstructured":"Wang X, He Y, Dong L, Zhao H (2011) Particle swarm optimization for determining fuzzy measures from data. Inf Sci 181(19):4230\u20134252","journal-title":"Inf Sci"},{"key":"308_CR30","doi-asserted-by":"crossref","unstructured":"Whitley D, Lunacek M, Knight J (2004) Ruffled by ridges: How evolutionary algorithms can fail. In: Deb K et al. (ed.) Lecture Notes in Computer science (LNCS), vol 3103, p 294\u2013306. Springer","DOI":"10.1007\/978-3-540-24855-2_26"},{"key":"308_CR31","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ins.2011.12.035","volume":"196","author":"P Yadav","year":"2012","unstructured":"Yadav P, Kumar R, Panda SK, Chang CS (2012) An intelligent tuned harmony search algorithm for optimisation. Inf Sci 196:47\u201372","journal-title":"Inf Sci"},{"key":"308_CR32","doi-asserted-by":"crossref","unstructured":"Zambrano-Bigiarini M, Clerc M, Rojas R (2013) Standard particle swarm optimisation 2011 at cec-2013: a baseline for future pso improvements. In: Proceedings of the IEEE 2013 congress on evolutionary computation, Mexico, p 2337\u20132344","DOI":"10.1109\/CEC.2013.6557848"},{"key":"308_CR33","doi-asserted-by":"crossref","unstructured":"Zhang S, Chen P, Lee LH, Peng CE, Chen C-H (2011) Simulation optimization using the particle swarm optimization with optimal computing budget allocation. In: Proceedings of the 2011 winter simulation conference, p 4298\u20134309","DOI":"10.1109\/WSC.2011.6148117"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0308-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-014-0308-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0308-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T14:31:16Z","timestamp":1559485876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-014-0308-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,8]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["308"],"URL":"https:\/\/doi.org\/10.1007\/s13042-014-0308-3","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,8]]}}}