{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:27:35Z","timestamp":1769441255543,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540018698","type":"print"},{"value":"9783540369707","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36970-8_20","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:05:20Z","timestamp":1184601920000},"page":"282-294","source":"Crossref","is-referenced-by-count":36,"title":["MOPED: A Multi-objective Parzen-Based Estimation of Distribution Algorithm for Continuous Problems"],"prefix":"10.1007","author":[{"given":"Mario","family":"Costa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmondo","family":"Minisci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,4,1]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H. M\u00fchlenbein","year":"1998","unstructured":"M\u00fchlenbein, H., The equation for the response to selection and its use for prediction, Evolutionary Computation 5(3), pp. 303\u2013346, 1998.","journal-title":"Evolutionary Computation"},{"key":"20_CR2","series-title":"Tech. Rep.","volume-title":"Population based incremental learning: A method for integrating genetic search based function optimization and competitive learning","author":"S. Baluja","year":"1994","unstructured":"Baluja, S., Population based incremental learning: A method for integrating genetic search based function optimization and competitive learning (Tech. Rep. No. CMU-CS-94-163). Pittsburgh, PA: Carnegie Mellon University, 1994."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/ICEC.1998.700083","volume-title":"Proceedings of the International Conference on Evolutionary Computation 1998","author":"G. R. Harik","year":"1998","unstructured":"Harik, G. R., Lobo, F. G., and Goldberg, D. E., The compact genetic algorithm, In Proceedings of the International Conference on Evolutionary Computation 1998, pp. 523\u2013528, Piscataway, NJ: IEEE Service Center, 1998."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/BFb0056884","volume-title":"Parallel Problem Solving from Nature PPSN V","author":"M. Sebag","year":"1998","unstructured":"Sebag, M., Ducoulombier, A., Extending population-based incremental learning to continuous search spaces, In Parallel Problem Solving from Nature PPSN V, pp. 418\u2013427, Berlin: Springer Verlag, 1998"},{"key":"20_CR5","first-page":"424","volume-title":"Advances in Neural Information Processing Systems","author":"J. S. Bonet De","year":"1997","unstructured":"De Bonet, J. S., Isbell, C. L., and Viola, P., MIMIC: Finding optima by estimating probability densities. In Mozer, M. C., Jordan, M. I., & Petsche, T. (Eds.), Advances in Neural Information Processing Systems, Vol. 9, pp. 424, The MIT Press, Cambridge, 1997."},{"key":"20_CR6","unstructured":"Baluja, S., Davies, S., Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. In Proceedings of the 14th International Conference on Machine Learning, pp. 30\u201338, Morgan Kaufmann, 1997."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/978-1-4471-0819-1_39","volume-title":"Advances in Soft Computing Engineering Design and Manufacturing","author":"M. Pelikan","year":"1999","unstructured":"Pelikan, M., M\u00fchlenbein, H., The bivariate marginal distribution algorithm. In Roy, R., Furuhashi, T., & Chawdhry, P. K. (Eds.), Advances in Soft Computing Engineering Design and Manufacturing, pp. 521\u2013535, London: Springer-Verlag, 1999."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein, H., Mahnig, T., The Factorized Distribution Algorithm for Additively Decomposed Functions, Proceedings of the 1999 Congress on Evolutionary Computation, pp. 752\u2013759, 1999","DOI":"10.1109\/CEC.1999.782008"},{"key":"20_CR9","first-page":"525","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99","author":"M. Pelikan","year":"1999","unstructured":"Pelikan, M., Goldberg, D. E., and Cant\u00fa-Paz, E. (1999). BOA: The Bayesian optimization algorithm. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., & Smith, R. E. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, Vol. I, pp. 525\u2013532. Orlando, FL, Morgan Kaufmann Publishers, San Francisco, CA, 1999."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Bosman, P.A.N., Thierens, D., Expanding from discrete to continuous estimation of distribution algorithms: The IDEA, in M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo, and H.-P. Schwefel, eds., Parallel Problem Solving from Nature, pp 767\u2013776, Springer, 2000.","DOI":"10.1007\/3-540-45356-3_75"},{"key":"20_CR11","unstructured":"Thierens, D., Bosman, P.A.N., Multi-Objective Mixture-based Iterated Density Estimation Evolutionary Algorithms L. Spector, E.D. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.H. Garzon and E. Burke, editors, Proceedings of the Genetic and Evolutionary Computation Conference \u2014 GECCO-2001, pages 663\u2013670, Morgan Kaufmann Publishers, 2001."},{"key":"20_CR12","unstructured":"Khan, N., Goldberg, D.E., and Pelikan, M., Multi-Objective Bayesian Optimization Algorithm, IlliGAL Report No. 2002009, March 2002."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T., A fast and elitist Multiobjective Genetic Algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2, April 2002.","DOI":"10.1109\/4235.996017"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"33","author":"E. Parzen","year":"1962","unstructured":"Parzen, E., On Estimation of a Probability Density Function and Mode, Ann. Math. Stat., Vol. 33, pp. 1065\u20131076, 1962.","journal-title":"Ann. Math. Stat."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02869528","volume":"18","author":"T. Cacoullos","year":"1966","unstructured":"Cacoullos, T., Estimation of a Multivariate Density, Ann. Inst. Stat. Math., Vol. 18, pp. 179\u2013189, 1966.","journal-title":"Ann. Inst. Stat. Math."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1162\/evco.1999.7.3.205","volume":"7","author":"K. Deb","year":"1999","unstructured":"Deb, K., Multi-Objective Genetic Algorithm: Problem Difficulties and Construction of Test Problems, Evolutionary Computation, Vol. 7, No. 3, pp. 205\u2013230, The MIT Press, 1999.","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36970-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:47:31Z","timestamp":1737287251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36970-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540018698","9783540369707"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36970-8_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}