{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T06:17:20Z","timestamp":1762928240410},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T00:00:00Z","timestamp":1381881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10710-013-9206-9","type":"journal-article","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T08:39:30Z","timestamp":1381826370000},"page":"169-193","source":"Crossref","is-referenced-by-count":26,"title":["A new real-coded Bayesian optimization algorithm based on a team of learning automata for continuous optimization"],"prefix":"10.1007","volume":"15","author":[{"given":"Behnaz","family":"Moradabadi","sequence":"first","affiliation":[]},{"given":"Hamid","family":"Beigy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,16]]},"reference":[{"key":"9206_CR1","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Reading, 1989)"},{"key":"9206_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"Genetic Algorithms: The Design of Innovation","author":"DE Goldberg","year":"2002","unstructured":"D.E. Goldberg, K. Sastry, Genetic Algorithms: The Design of Innovation, 2nd edn. (Springer, Berlin, 2002)","edition":"2"},{"key":"9206_CR3","volume-title":"Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms","year":"2006","unstructured":"J.A. Lozano, P. Larranaga, I. Inza, E. Bengoetxea (eds.), Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Springer, Berlin, 2006)"},{"key":"9206_CR4","volume-title":"Scalable Optimization Via Probabilistic Modeling: From Algorithms to Applications","year":"2006","unstructured":"M. Pelikan, K. Sastry, E. Cantu-Paz (eds.), Scalable Optimization Via Probabilistic Modeling: From Algorithms to Applications (Springer, Berlin, 2006)"},{"key":"9206_CR5","unstructured":"M. Pelikan, Bayesian Optimization Algorithm: From Single Level to Hierarchy, Ph.D. Dissertation (University of Illinois at Urbana-Champaign, Urbana, 2002)"},{"key":"9206_CR6","volume-title":"Linkage Learning in Via Probabilistic Modeling in the ECGA","author":"G Harik","year":"1999","unstructured":"G. Harik, Linkage Learning in Via Probabilistic Modeling in the ECGA (University of Illinois at Urbana-Champaign, Urbana, 1999)"},{"issue":"4","key":"9206_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H Muhlenbein","year":"1999","unstructured":"H. Muhlenbein, T. Mahnig, FDA\u2014a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evol. Comput. 7(4), 353\u2013376 (1999)","journal-title":"Evol. Comput."},{"key":"9206_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/b10910","volume-title":"BOA: The Bayesian Optimization Algorithm","author":"M Pelikan","year":"2005","unstructured":"M. Pelikan, BOA: The Bayesian Optimization Algorithm (Springer, Berlin, 2005)"},{"key":"9206_CR9","unstructured":"P. Larranaga, R. Etxeberria, J.A. Lozano, J.M. Pena, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program. Optimization in continuous domains by learning and simulation of Gaussian networks (2000), pp. 201\u2013204"},{"key":"9206_CR10","unstructured":"J. Ocenasek, J. Schwarz, in Proceedings of the 2nd Euro-International Symposium on Computational Intelligence. Estimation of distribution algorithm for mixed continuous discrete optimization problems (2002), pp. 227\u2013232"},{"key":"9206_CR11","unstructured":"P.A.N. Bosman, Design and Application of Iterated Density-Estimation Evolutionary Algorithms, Ph.D. Dissertation (Utrecht University, Utrecht, 2003)"},{"key":"9206_CR12","doi-asserted-by":"crossref","unstructured":"C.W. Ahn, R.S. Ramakrishna, D.E. Goldberg, Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World, Lecture Notes in Computer Science, vol. 3102 (Springer, Berlin, 2004), pp. 840\u2013851","DOI":"10.1007\/978-3-540-24854-5_86"},{"key":"9206_CR13","unstructured":"X. Wei, In Proceedings of the IEEE 10th International Conference of Signal Processing (ICSP). Evolutionary continuous optimization by Bayesian networks and Gaussian mixture model (2010), pp. 1437\u20131440"},{"key":"9206_CR14","unstructured":"B. Moradabadi, H. Beigy, C.W. Ahn, In Proceedings of IEEE Congress on Evolutionary Algorithm. An improved real-coded Bayesian optimization algorithm (2011)"},{"issue":"6","key":"9206_CR15","first-page":"2505","volume":"9","author":"B Moradabadi","year":"2013","unstructured":"B. Moradabadi, H. Beigy, C.W. Ahn, An improved real-coded Bayesian optimization algorithm for continuous global optimization. Int. J. Innov. Comput. Inf. Control 9(6), 2505\u20132519 (2013)","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"key":"9206_CR16","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TSMCB.2002.1049606","volume":"32","author":"MAL Thathachar","year":"2002","unstructured":"M.A.L. Thathachar, P.S. Sastry, Varieties of learning automata: an overview. IEEE Trans. Syst. Man Cybern. B Cybern. 32, 711\u2013722 (2002)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"9206_CR17","unstructured":"D.M. Chickering, D. Geiger, D. Heckerman, Learning Bayesian Network is NP-hard, Technical Report MSR-TR-94-17 (1994)"},{"key":"9206_CR18","first-page":"33","volume-title":"A Tutorial on Learning with Bayesian Networks, Innovations in Bayesian Networks, Chapter 3","author":"D Heckerman","year":"2008","unstructured":"D. Heckerman, D. Geiger, D.M. Chickering, A Tutorial on Learning with Bayesian Networks, Innovations in Bayesian Networks, Chapter 3 (Springer, Berlin, 2008), pp. 33\u201382"},{"key":"9206_CR19","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1109\/TSMCB.2010.2043094","volume":"40","author":"XM Hu","year":"2010","unstructured":"X.M. Hu, J. Zhang, H. Chung, Y. Li, O. Liu, Sam-ACO: variable sampling ant colony optimization algorithm. IEEE Trans. Syst. Man Cybern. B Cybern. 40, 1555\u20131566 (2010)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"9206_CR20","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1016\/j.amc.2010.01.088","volume":"216","author":"Q Pan","year":"2010","unstructured":"Q. Pan, P.N. Suganthan, M.F. Tasgetiren, J.J. Liang, A self-adaptive global best harmony search algorithm for continuous. Appl. Math. Comput. 216, 830\u2013848 (2010)","journal-title":"Appl. Math. Comput."},{"key":"9206_CR21","unstructured":"M. Gallagher, I. Wood, J. Keith, In Proceedings of the IEEE Congress on Evolutionary Computation. Bayesian inference in estimation of distribution algorithms (2007), pp. 127\u2013133"},{"key":"9206_CR22","unstructured":"M. Li, D.E. Goldberg, K. Sastry, T.L. Yu, Real-coded ECGA for solving decomposable real-valued optimization problems. Link. Evol. Comput. 157, 61\u201386 (2008)"},{"issue":"3","key":"9206_CR23","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TEVC.2007.902856","volume":"12","author":"CW Ahn","year":"2008","unstructured":"C.W. Ahn, R.S. Ramakrishna, On the scalability of real-coded Bayesian optimization algorithm. IEEE Trans. Evol. Comput. 12(3), 307\u2013322 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9206_CR24","unstructured":"D. Heckerman, D. Geiger, D.M. Chickering, Learning Bayesian Networks: The Combination of Knowledge and Statistical Data, Technical Report MSR-TR-94-09 (Microsoft Research, Redmond, 1995)"},{"key":"9206_CR25","volume-title":"Advances in Evolutionary Algorithms: Theory, Design and Practice, Studies in Computational Intelligence","author":"CW Ahn","year":"2006","unstructured":"C.W. Ahn, Advances in Evolutionary Algorithms: Theory, Design and Practice, Studies in Computational Intelligence (Springer, Berlin, 2006)"},{"key":"9206_CR26","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.jfranklin.2005.07.004","volume":"343","author":"H Beigy","year":"2006","unstructured":"H. Beigy, M.R. Meybodi, A new continuous action-set learning automata for function optimization. J. Franklin Inst. 343, 27 (2006)","journal-title":"J. Franklin Inst."},{"issue":"5","key":"9206_CR27","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/0016-0032(94)90039-6","volume":"331B","author":"G Santharam","year":"1994","unstructured":"G. Santharam, P.S. Sastry, M.A.L. Thathachar, Continuous action set learning automata for stochastic optimization. J. Franklin Inst. 331B(5), 607\u2013628 (1994)","journal-title":"J. Franklin Inst."},{"key":"9206_CR28","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/12.862220","volume":"49","author":"BJ Oommen","year":"2000","unstructured":"B.J. Oommen, T.D. Roberts, Continuous learning automata solutions to the capacity assignment problem. IEEE Trans. Comput. 49, 608\u2013620 (2000)","journal-title":"IEEE Trans. Comput."},{"key":"9206_CR29","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1109\/TSMCB.2002.1049615","volume":"32","author":"MS Obaidat","year":"2002","unstructured":"M.S. Obaidat, G.I. Papadimitriou, A.S. Pomportsis, H.S. Laskaridis, Learning automata-based bus arbitration for shared-medium ATM switches. IEEE Trans. Syst. Man Cybern. B Cybern. 32, 815\u2013820 (2002)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"9206_CR30","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1109\/TSMCB.2002.1049612","volume":"32","author":"GI Papadimitriou","year":"2002","unstructured":"G.I. Papadimitriou, M.S. Obaidat, A.S. Pomportsis, On the use of learning automata in the control of broad-cast networks: a methodology. IEEE Trans. Syst. Man Cybern. B Cybern. 32, 781\u2013790 (2002)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"issue":"3","key":"9206_CR31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1142\/S1469026809002618","volume":"8","author":"H Beigy","year":"2009","unstructured":"H. Beigy, M.R. Meybodi, Cellular learning automata based dynamic channel assignment algorithms. Int. J. Comput. Intell. Appl. 8(3), 287\u2013314 (2009)","journal-title":"Int. J. Comput. Intell. Appl."},{"key":"9206_CR32","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1142\/S0218488506004217","volume":"14","author":"H Beigy","year":"2006","unstructured":"H. Beigy, M.R. Meybodi, Utilizing distributed learning automata to solve stochastic shortest path problems. Int. J. Uncertain Fuzz Knowl. Based Syst. 14, 591\u2013615 (2006)","journal-title":"Int. J. Uncertain Fuzz Knowl. Based Syst."},{"key":"9206_CR33","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TSMCB.2006.879012","volume":"37","author":"OC Granmo","year":"2007","unstructured":"O.C. Granmo, B.J. Oommen, S.A. Myrer, M.G. Olsen, Learning automata-based solutions to the non-linear fractional knapsack problem with applications to optimal resource allocation. IEEE Trans. Syst. Man Cybern. B Cybern. 37, 166\u2013175 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"issue":"6","key":"9206_CR34","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1142\/S0218488509006315","volume":"17","author":"H Beigy","year":"2009","unstructured":"H. Beigy, M.R. Meybodi, Adaptive limited fractional guard channel algorithms a learning automata approach. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 17(6), 881\u2013913 (2009)","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"9206_CR35","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/00207720802145924","volume":"40","author":"H Beigy","year":"2009","unstructured":"H. Beigy, M.R. Meybodi, A learning automata-based algorithm for determination of the number of hidden units for three layer neural networks. Int. J. Syst. Sci. 40, 101\u2013118 (2009)","journal-title":"Int. J. Syst. Sci."},{"key":"9206_CR36","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/TSMCB.2009.2032155","volume":"40","author":"PS Sastry","year":"2010","unstructured":"P.S. Sastry, G.D. Nagendra, N. Manwani, A team of continuous-action learning automata for noise-tolerant learning of half-spaces. IEEE Trans. Syst. Man Cybern. B Cybern. 40, 19\u201328 (2010)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"issue":"4","key":"9206_CR37","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/j.compeleceng.2011.04.003","volume":"37","author":"H Beigy","year":"2011","unstructured":"H. Beigy, M.R. Meybodi, Learning automata based dynamic guard channel algorithms. J. Comput. Electr. Eng. 37(4), 601\u2013613 (2011)","journal-title":"J. Comput. Electr. Eng."},{"key":"9206_CR38","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TSMCB.2009.2032414","volume":"40","author":"BJ Oommen","year":"2010","unstructured":"B.J. Oommen, M.K. Hashem, Modeling a student classroom interaction in a tutorial-like system using learning automata. IEEE Trans. Syst. Man Cybern. B Cybern. 40, 29\u201342 (2010)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"9206_CR39","volume-title":"Learning Automata: An Introduction","author":"S Narendra","year":"1989","unstructured":"S. Narendra, K.S. Thathachar, Learning Automata: An Introduction (Prentice-Hall, New York, 1989)"},{"key":"9206_CR40","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1016\/j.patrec.2008.02.014","volume":"29","author":"KR Z\u00e3lik","year":"2008","unstructured":"K.R. Z\u00e3lik, An efficient k\u2019-means clustering algorithm. Pattern Recogn. Lett. 29, 1385\u20131391 (2008)","journal-title":"Pattern Recogn. Lett."},{"key":"9206_CR41","unstructured":"Function definitions and performance criteria for the special session on real-parameter optimization at CEC2005 (2005). http:\/\/www.ntu.edu.sg\/home\/EPNSugan . Accessed Apr 2013"},{"key":"9206_CR42","unstructured":"Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems. http:\/\/www.ntu.edu.sg\/home\/EPNSugan . Accessed Apr 2013"},{"key":"9206_CR43","unstructured":"D.H. Wolpert, W.G. Macready, No free lunch theorems for search. IEEE Trans. Evol. Comput. 5(3), 295\u2013296 (1997)"},{"key":"9206_CR44","unstructured":"Competition on Testing Evolutionary Algorithms on Real-world Numerical Optimization Problems. http:\/\/www.ntu.edu.sg\/home\/EPNSugan . Accessed Apr 2013"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-013-9206-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-013-9206-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-013-9206-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T17:14:37Z","timestamp":1564506877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-013-9206-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,16]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9206"],"URL":"https:\/\/doi.org\/10.1007\/s10710-013-9206-9","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,16]]}}}