{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:58:15Z","timestamp":1768820295037,"version":"3.49.0"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T00:00:00Z","timestamp":1722211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Evol. Learn. Optim."],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>\n            Probability-based algorithms have proven to be a solid alternative for approaching optimization problems. Nevertheless, in many cases, using probabilistic models that efficiently exploit the characteristics of the problem involves large computational overheads, and therefore, lower complexity models such as those that are univariate are usually employed within approximation algorithms. With the motivation to address such an issue, in this article, we aim to introduce an iterative optimization framework that employs generative models to efficiently estimate the parameters of probability models for optimization problems. This allows the use of complex probabilistic models (or those that are appropriate for each problem) in a way that is feasible to apply them iteratively. Specifically, the framework is composed of three elements: a generative model, a probability model whose probability rule is differentiable, and a loss function. The possibility of modifying any of the three elements of the framework offers the flexibility to design algorithms that best adapt to the problem at hand. Experiments conducted on two case studies reveal that the presented approach has strong performance in terms of objective value and execution time when compared to other probability-based algorithms. Moreover, the experimental analysis demonstrates that the convergence of the algorithms is controllable by adjusting the components of the framework. For the sake of reproducibility, the source code, results, scripts, figures, and other material related to the manuscript are available at\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"url\" xlink:href=\"https:\/\/github.com\/mikelma\/nnco_lib\">https:\/\/github.com\/mikelma\/nnco_lib<\/jats:ext-link>\n            .\n          <\/jats:p>","DOI":"10.1145\/3665650","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:30:12Z","timestamp":1716381012000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Combinatorial Optimization Framework for Probability-Based Algorithms by Means of Generative Models"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8246-9918","authenticated-orcid":false,"given":"Mikel","family":"Malag\u00f3n","sequence":"first","affiliation":[{"name":"University of the Basque Country (UPV\/EHU), Donostia\/San Sebastian, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3218-5735","authenticated-orcid":false,"given":"Ekhine","family":"Irurozki","sequence":"additional","affiliation":[{"name":"Telecom Paris, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7120-6338","authenticated-orcid":false,"given":"Josu","family":"Ceberio","sequence":"additional","affiliation":[{"name":"University of the Basque Country (UPV\/EHU), Donostia\/San Sebastian, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,29]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.07.049"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.060"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477774"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838159"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100740"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_79"},{"key":"e_1_3_3_8_1","volume-title":"Introduction to Sequencing and Scheduling","author":"Baker Kenneth R.","year":"1974","unstructured":"Kenneth R. Baker. 1974. Introduction to Sequencing and Scheduling. John Wiley & Sons, Inc."},{"key":"e_1_3_3_9_1","volume-title":"Mixed IDEAs","author":"Bosman Peter A. N.","year":"2000","unstructured":"Peter A. N. Bosman and Dirk Thierens. 2000. Mixed IDEAs. Technical Report. Utrech University."},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","unstructured":"Eric Brochu Vlad M. Cora and Nando de Freitas. 2010. A tutorial on Bayesian optimization of expensive cost functions with application to active user modeling and hierarchical reinforcement learning. arXiv:1012.2599. DOI: 10.48550\/ARXIV.1012.2599","DOI":"10.48550\/ARXIV.1012.2599"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2260548"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557609"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.041"},{"issue":"1","key":"e_1_3_3_14_1","first-page":"1","article-title":"A roadmap for solving optimization problems with estimation of distribution algorithms","volume":"23","author":"Ceberio Josu","year":"2022","unstructured":"Josu Ceberio, Alexander Mendiburu, and Jose A. Lozano. 2022. A roadmap for solving optimization problems with estimation of distribution algorithms. Natural Computing 23, 1 (2022), 1\u201315.","journal-title":"Natural Computing"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02295838"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"e_1_3_3_17_1","first-page":"332","article-title":"Global optimization with Bayesian networks","author":"Etxeberria Ramon","year":"1999","unstructured":"Ramon Etxeberria and Pedro Larra\u00f1aga. 1999. Global optimization with Bayesian networks. In II Symposium on Artificial Intelligence, Special Session on Distributions and Evolutionary Optimization (CIMAF99). 332\u2013339.","journal-title":"II Symposium on Artificial Intelligence, Special Session on Distributions and Evolutionary Optimization (CIMAF99)"},{"key":"e_1_3_3_18_1","first-page":"625","volume-title":"Proceedings of Advances in Neural Information Processing Systems","volume":"7","author":"Fritzke Bernd","year":"1994","unstructured":"Bernd Fritzke. 1994. A growing neural gas network learns topologies. Proceedings of Advances in Neural Information Processing Systems 7, 1 (1994), 625\u2013632."},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/318371.318612"},{"key":"e_1_3_3_20_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"Goodfellow Ian","year":"2014","unstructured":"Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014. Generative adversarial nets. In Proceedings of Advances in Neural Information Processing Systems."},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.02.001"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28900-2_11"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.79.8.2554"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00339943"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459366"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_3_3_28_1","unstructured":"Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv:1412.6980."},{"key":"e_1_3_3_29_1","first-page":"1\u20131","article-title":"Estimation of distribution algorithms in machine learning: A survey","author":"Larra\u00f1aga Pedro","year":"2023","unstructured":"Pedro Larra\u00f1aga and Concha Bielza. 2023. Estimation of distribution algorithms in machine learning: A survey. IEEE Transactions on Evolutionary Computation. 1\u20131","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_3_30_1","first-page":"201","volume-title":"Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program","volume":"11","author":"Larranaga Pedro","year":"2000","unstructured":"Pedro Larranaga, Ramon Etxeberria, Jose Lozano, and Jos\u00e9 Pe\u00f1a. 2000. Optimization in continuous domains by learning and simulation of Gaussian networks. In Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, Vol. 11. 201\u2013204."},{"key":"e_1_3_3_31_1","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"Larra\u00f1aga Pedro","year":"2001","unstructured":"Pedro Larra\u00f1aga and Jose A. Lozano. 2001. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Vol. 2. Springer Science & Business Media."},{"key":"e_1_3_3_32_1","first-page":"179","volume-title":"Proceedings of Symposia in Applied Mathematics","volume":"10","author":"Lehmer Derrick H.","year":"1960","unstructured":"Derrick H. Lehmer. 1960. Teaching combinatorial tricks to a computer. In Proceedings of Symposia in Applied Mathematics, Vol. 10. 179\u2013193."},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03751-1_5"},{"key":"e_1_3_3_34_1","volume-title":"Individual Choice Behavior: A Theoretical Analysis","author":"Luce R. Duncan","year":"2012","unstructured":"R. Duncan Luce. 2012. Individual Choice Behavior: A Theoretical Analysis. Courier Corporation."},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185678"},{"key":"e_1_3_3_36_1","volume-title":"Analyzing and Modeling Rank Data","author":"Marden John I.","year":"1996","unstructured":"John I. Marden. 1996. Analyzing and Modeling Rank Data. CRC Press."},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389230"},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9384-9"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28900-2_9"},{"key":"e_1_3_3_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb005359"},{"key":"e_1_3_3_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/645823.670694"},{"key":"e_1_3_3_43_1","first-page":"8024","volume-title":"Proceedings of Advances in Neural Information Processing Systems","volume":"32","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019. PyTorch: An imperative style, high-performance deep learning library. In Proceedings of Advances in Neural Information Processing Systems. H. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E. Fox, and R. Garnett (Eds.), Vol. 32, Curran Associates, Inc., 8024\u20138035. Retrieved from http:\/\/papers.neurips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf"},{"key":"e_1_3_3_44_1","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201999)","volume":"1","author":"Pelikan Martin","year":"1999","unstructured":"Martin Pelikan, David E. Goldberg, and Erick Cant\u00fa-Paz. 1999. BOA: The Bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201999), Vol. 1."},{"key":"e_1_3_3_45_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.06.066"},{"key":"e_1_3_3_47_1","article-title":"Cybernetic solution path of an experimental problem","author":"Rechenberg Ingo","year":"1965","unstructured":"Ingo Rechenberg. 1965. Cybernetic solution path of an experimental problem. Royal Aircraft Establishment Library Translation 1122.","journal-title":"Royal Aircraft Establishment Library Translation"},{"key":"e_1_3_3_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3208110"},{"key":"e_1_3_3_49_1","doi-asserted-by":"crossref","unstructured":"Valentino Santucci and Josu Ceberio. 2023. Doubly stochastic matrix models for estimation of distribution algorithms. arXiv:2304.02458.","DOI":"10.1145\/3583131.3590371"},{"key":"e_1_3_3_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377929.3398094"},{"key":"e_1_3_3_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/IBCAST.2012.6177539"},{"key":"e_1_3_3_52_1","unstructured":"John Schulman Filip Wolski Prafulla Dhariwal Alec Radford and Oleg Klimov. 2017. Proximal policy optimization algorithms. arXiv:1707.06347."},{"key":"e_1_3_3_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/539468"},{"key":"e_1_3_3_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-007-0262-6"},{"key":"e_1_3_3_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28900-2"},{"key":"e_1_3_3_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670313"},{"key":"e_1_3_3_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"e_1_3_3_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"e_1_3_3_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00363956"}],"container-title":["ACM Transactions on Evolutionary Learning and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3665650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3665650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:04Z","timestamp":1750291564000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3665650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,29]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3665650"],"URL":"https:\/\/doi.org\/10.1145\/3665650","relation":{},"ISSN":["2688-3007"],"issn-type":[{"value":"2688-3007","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,29]]},"assertion":[{"value":"2022-10-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}