{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T18:51:55Z","timestamp":1772736715663,"version":"3.50.1"},"reference-count":33,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Spanish Ministry of Science and Innovation","award":["PID2022-138860NB-I00"],"award-info":[{"award-number":["PID2022-138860NB-I00"]}]},{"name":"Spanish Ministry of Science and Innovation","award":["RED2022-134703-T"],"award-info":[{"award-number":["RED2022-134703-T"]}]},{"name":"Spanish Ministry of Science and Innovation","award":["HORIZON-CL4-2022-HUMAN-01-14-101092612"],"award-info":[{"award-number":["HORIZON-CL4-2022-HUMAN-01-14-101092612"]}]},{"name":"Spanish Ministry of Science and Innovation","award":["PROMETEO\/2021\/065"],"award-info":[{"award-number":["PROMETEO\/2021\/065"]}]},{"name":"SUN project of the Horizon Europe program","award":["PID2022-138860NB-I00"],"award-info":[{"award-number":["PID2022-138860NB-I00"]}]},{"name":"SUN project of the Horizon Europe program","award":["RED2022-134703-T"],"award-info":[{"award-number":["RED2022-134703-T"]}]},{"name":"SUN project of the Horizon Europe program","award":["HORIZON-CL4-2022-HUMAN-01-14-101092612"],"award-info":[{"award-number":["HORIZON-CL4-2022-HUMAN-01-14-101092612"]}]},{"name":"SUN project of the Horizon Europe program","award":["PROMETEO\/2021\/065"],"award-info":[{"award-number":["PROMETEO\/2021\/065"]}]},{"name":"i4OPT project of the Generalitat Valenciana","award":["PID2022-138860NB-I00"],"award-info":[{"award-number":["PID2022-138860NB-I00"]}]},{"name":"i4OPT project of the Generalitat Valenciana","award":["RED2022-134703-T"],"award-info":[{"award-number":["RED2022-134703-T"]}]},{"name":"i4OPT project of the Generalitat Valenciana","award":["HORIZON-CL4-2022-HUMAN-01-14-101092612"],"award-info":[{"award-number":["HORIZON-CL4-2022-HUMAN-01-14-101092612"]}]},{"name":"i4OPT project of the Generalitat Valenciana","award":["PROMETEO\/2021\/065"],"award-info":[{"award-number":["PROMETEO\/2021\/065"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommunication network. While each element typically has a bounded service capacity, in this research, we introduce a twist. The capacity of each node might be influenced by a random Bernoulli component, thereby rendering the possibility of a node having zero capacity, which is contingent upon a black box mechanism that accounts for environmental variables. Recognizing the inherent complexity and the NP-hard nature of the capacitated dispersion problem, heuristic algorithms have become indispensable for handling larger instances. In this paper, we introduce a novel approach by hybridizing a heuristic algorithm with reinforcement learning to address this intricate problem variant.<\/jats:p>","DOI":"10.3390\/a16120532","type":"journal-article","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T03:54:37Z","timestamp":1700625277000},"page":"532","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7692-9922","authenticated-orcid":false,"given":"Juan F.","family":"Gomez","sequence":"first","affiliation":[{"name":"Research Center on Production Management and Engineering, Universitat Polit\u00e8cnica de Val\u00e8ncia, 03801 Alcoy, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5506-1674","authenticated-orcid":false,"given":"Antonio R.","family":"Uguina","sequence":"additional","affiliation":[{"name":"Research Center on Production Management and Engineering, Universitat Polit\u00e8cnica de Val\u00e8ncia, 03801 Alcoy, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3793-3328","authenticated-orcid":false,"given":"Javier","family":"Panadero","sequence":"additional","affiliation":[{"name":"Department of Computer Architecture & Operating Systems, Universitat Aut\u00f2noma de Barcelona, 08193 Bellaterra, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1392-1776","authenticated-orcid":false,"given":"Angel A.","family":"Juan","sequence":"additional","affiliation":[{"name":"Research Center on Production Management and Engineering, Universitat Polit\u00e8cnica de Val\u00e8ncia, 03801 Alcoy, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2023,11,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.ejor.2017.04.009","article-title":"Supply chain network design under uncertainty: A comprehensive review and future research directions","volume":"263","author":"Govindan","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.omega.2015.01.006","article-title":"Sustainable supply chain network design: An optimization-oriented review","volume":"54","author":"Eskandarpour","year":"2015","journal-title":"Omega"},{"key":"ref_3","first-page":"393","article-title":"Consolidation centers in city logistics: A cooperative approach based on the location routing problem","volume":"10","author":"Nataraj","year":"2019","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.ejor.2021.07.044","article-title":"A review on discrete diversity and dispersion maximization from an OR perspective","volume":"299","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.cie.2012.11.001","article-title":"Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions","volume":"64","author":"Correia","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Tordecilla, R.D., Copado-M\u00e9ndez, P.J., Panadero, J., Quintero-Araujo, C.L., Montoya-Torres, J.R., and Juan, A.A. (2021). Combining heuristics with simulation and fuzzy logic to solve a flexible-size location routing problem under uncertainty. Algorithms, 14.","DOI":"10.3390\/a14020045"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"100888","DOI":"10.1016\/j.swevo.2021.100888","article-title":"A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems","volume":"64","author":"Osaba","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"ref_8","unstructured":"Szepesv\u00e1ri, C. (2022). Algorithms for Reinforcement Learning, Springer Nature."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Juan, A.A., Marugan, C.A., Ahsini, Y., Fornes, R., Panadero, J., and Martin, X.A. (2023). Using Reinforcement Learning to Solve a Dynamic Orienteering Problem with Random Rewards Affected by the Battery Status. Batteries, 9.","DOI":"10.3390\/batteries9080416"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1009802105661","article-title":"Facility Dispersion Problems under Capacity and Cost Constraints","volume":"4","author":"Rosenkrantz","year":"2000","journal-title":"J. Comb. Optim."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"107269","DOI":"10.1016\/j.asoc.2021.107269","article-title":"Machine learning based simulation optimisation for urban routing problems","volume":"105","author":"Bayliss","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Mele, U.J., Gambardella, L.M., and Montemanni, R. (2021). A new constructive heuristic driven by machine learning for the traveling salesman problem. Algorithms, 14.","DOI":"10.3390\/a14090267"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","article-title":"Analyzing and modeling the maximum diversity problem by zero-one programming","volume":"24","author":"Kuo","year":"1993","journal-title":"Decis. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1007\/978-3-319-07124-4_61","article-title":"Diversity and equity models","volume":"2-2","author":"Sandoya","year":"2018","journal-title":"Handbook of Heuristics"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1111\/itor.12799","article-title":"Heuristics for the capacitated dispersion problem","volume":"28","author":"Laguardia","year":"2021","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Resende, M.G., and Ribeiro, C.C. (2016). Optimization by GRASP, Springer.","DOI":"10.1007\/978-1-4939-6530-4"},{"key":"ref_17","unstructured":"Duarte, A., Mladenovic, N., S\u00e1nchez-Oro, J., and Todosijevi\u0107, R. (2018). Handbook of Heuristics, Springer."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-009-0597-1","article-title":"The case for strategic oscillation","volume":"183","author":"Glover","year":"2011","journal-title":"Ann. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s12293-020-00318-1","article-title":"The capacitated dispersion problem: An optimization model and a memetic algorithm","volume":"13","year":"2021","journal-title":"Memetic Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Laguna, M., and Mart\u00ed, R.C. (2003). Scatter Search: Methodology and Implementations in C, Springer Science & Business Media.","DOI":"10.1007\/978-1-4615-0337-8"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"119856","DOI":"10.1016\/j.eswa.2023.119856","article-title":"Solution-based tabu search for the capacitated dispersion problem","volume":"223","author":"Lu","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_22","unstructured":"Gendreau, M. (2003). Handbook of Metaheuristics, Springer."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1561\/2200000097","article-title":"Reinforcement learning, bit by bit","volume":"16","author":"Lu","year":"2023","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"105400","DOI":"10.1016\/j.cor.2021.105400","article-title":"Reinforcement learning for combinatorial optimization: A survey","volume":"134","author":"Mazyavkina","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1515\/math-2017-0029","article-title":"Learnheuristics: Hybridizing metaheuristics with machine learning for optimization with dynamic inputs","volume":"15","author":"Calvet","year":"2017","journal-title":"Open Math."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","article-title":"A branch and bound algorithm for the maximum diversity problem","volume":"200","author":"Gallego","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ejor.2006.01.021","article-title":"Tabu search and GRASP for the maximum diversity problem","volume":"178","author":"Duarte","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Gomez, J.F., Panadero, J., Tordecilla, R.D., Castaneda, J., and Juan, A.A. (2022). A multi-start biased-randomized algorithm for the capacitated dispersion problem. Mathematics, 10.","DOI":"10.3390\/math10142405"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"116899","DOI":"10.1016\/j.eswa.2022.116899","article-title":"Max\u2013min dispersion with capacity and cost for a practical location problem","volume":"200","author":"Duarte","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.simpat.2018.04.005","article-title":"A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem","volume":"86","author":"Hatami","year":"2018","journal-title":"Simul. Model. Pract. Theory"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Rabe, M., Gonzalez-Feliu, J., Chicaiza-Vaca, J., and Tordecilla, R.D. (2021). Simulation-optimization approach for multi-period facility location problems with forecasted and random demands in a last-mile logistics application. Algorithms, 14.","DOI":"10.3390\/a14020041"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1080\/17445760.2018.1428969","article-title":"GPU parallelization strategies for metaheuristics: A survey","volume":"34","author":"Essaid","year":"2019","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1111\/itor.12070","article-title":"A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations","volume":"21","author":"Dominguez","year":"2014","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/12\/532\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:27:00Z","timestamp":1760131620000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/12\/532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,22]]},"references-count":33,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["a16120532"],"URL":"https:\/\/doi.org\/10.3390\/a16120532","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,22]]}}}