{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T14:58:50Z","timestamp":1773586730343,"version":"3.50.1"},"reference-count":32,"publisher":"MDPI AG","issue":"16","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Healthcare service centers must be sited in strategic locations that meet the immediate needs of patients. The current situation due to the COVID-19 pandemic makes this problem particularly relevant. Assume that each center corresponds to an assigned place for vaccination and that each center uses one or more vaccine brands\/laboratories. Then, each patient could choose a center instead of another, because she\/he may prefer the vaccine from a more reliable laboratory. This defines an order of preference that might depend on each patient who may not want to be vaccinated in a center where there are only her\/his non-preferred vaccine brands. In countries where the vaccination process is considered successful, the order assigned by each patient to the vaccination centers is defined by incentives that local governments give to their population. These same incentives for foreign citizens are seen as a strategic decision to generate income from tourism. The simple plant\/center location problem (SPLP) is a combinatorial approach that has been extensively studied. However, a less-known natural extension of it with order (SPLPO) has not been explored in the same depth. In this case, the size of the instances that can be solved is limited. The SPLPO considers an order of preference that patients have over a set of facilities to meet their demands. This order adds a new set of constraints in its formulation that increases the complexity of the problem to obtain an optimal solution. In this paper, we propose a new two-stage stochastic formulation for the SPLPO (2S-SPLPO) that mimics the mentioned pandemic situation, where the order of preference is treated as a random vector. We carry out computational experiments on simulated 2S-SPLPO instances to evaluate the performance of the new proposal. We apply an algorithm based on Lagrangian relaxation that has been shown to be efficient for large instances of the SPLPO. A potential application of this new algorithm to COVID-19 vaccination is discussed and explored based on sensor-related data. Two further algorithms are proposed to store the patient\u2019s records in a data warehouse and generate 2S-SPLPO instances using sensors.<\/jats:p>","DOI":"10.3390\/s21165352","type":"journal-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T02:03:55Z","timestamp":1628474635000},"page":"5352","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A Two-Stage Location Problem with Order Solved Using a Lagrangian Algorithm and Stochastic Programming for a Potential Use in COVID-19 Vaccination Based on Sensor-Related Data"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3128-001X","authenticated-orcid":false,"given":"Xavier","family":"Cabezas","sequence":"first","affiliation":[{"name":"Faculty of Natural Sciences and Mathematics, Universidad Polit\u00e9cnica ESPOL, Guayaquil 090902, Ecuador"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4281-6916","authenticated-orcid":false,"given":"Sergio","family":"Garc\u00eda","sequence":"additional","affiliation":[{"name":"School of Mathematics, The University of Edinburgh, Scotland EH9 3FD, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8797-681X","authenticated-orcid":false,"given":"Carlos","family":"Martin-Barreiro","sequence":"additional","affiliation":[{"name":"Faculty of Natural Sciences and Mathematics, Universidad Polit\u00e9cnica ESPOL, Guayaquil 090902, Ecuador"},{"name":"Faculty of Engineering, Universidad Esp\u00edritu Santo, Samborond\u00f3n 0901952, Ecuador"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5933-4839","authenticated-orcid":false,"given":"Erwin","family":"Delgado","sequence":"additional","affiliation":[{"name":"Faculty of Natural Sciences and Mathematics, Universidad Polit\u00e9cnica ESPOL, Guayaquil 090902, Ecuador"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4755-3270","authenticated-orcid":false,"given":"V\u00edctor","family":"Leiva","sequence":"additional","affiliation":[{"name":"School of Industrial Engineering, Pontificia Universidad Cat\u00f3lica de Valpara\u00edso, Valpara\u00edso 2362807, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"key":"ref_1","unstructured":"Birge, J., and Louveaux, F. (2014). Introduction to Stochastic Programming, Springer."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","article-title":"Linear programming under uncertainty","volume":"1","author":"Dantzig","year":"1955","journal-title":"Manag. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1111\/j.2517-6161.1955.tb00191.x","article-title":"On minimizing a convex function subject to linear inequalities","volume":"17","author":"Beale","year":"1955","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.1016\/j.cor.2008.03.001","article-title":"A two-stage stochastic programming model for transportation network protection","volume":"36","author":"Liu","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10479-013-1333-4","article-title":"Two-stage stochastic lot-sizing problem under cost uncertainty","volume":"209","author":"Zhou","year":"2013","journal-title":"Ann. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Rojas, F., Leiva, V., Wanke, P., Lillo, C., and Pascual, J. (2019). Modeling lot-size with time-dependent demand based on stochastic programming and case study of drug supply in Chile. PLoS ONE, 14.","DOI":"10.1371\/journal.pone.0212768"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.3389\/fceng.2020.622241","article-title":"A review of stochastic programming methods for optimization of process systems under uncertainty","volume":"2","author":"Li","year":"2021","journal-title":"Front. Chem. Eng."},{"key":"ref_8","first-page":"789","article-title":"Location of bank accounts to optimize float: An analytic study of axact and approximated algorithms","volume":"23","author":"Fisher","year":"1977","journal-title":"Manag. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","article-title":"The integer L-shaped method for stochastic integer programs with complete recourse","volume":"13","author":"Laporte","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"ref_10","unstructured":"Kall, P., and Mayer, J. (2005). Stochastic Linear Programming: Models, Theory, and Computation, Springer."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1022995128597","article-title":"Differential Evolution Training Algorithm for Feed-Forward Neural Networks","volume":"7","author":"Ilonen","year":"2003","journal-title":"Neural Process. Lett."},{"key":"ref_12","unstructured":"Cabezas, X., and Garc\u00eda, S. (2018). A Lagrangian relaxation algorithm for the simple plant location problem with preferences. arxiv."},{"key":"ref_13","unstructured":"Cabezas, X. (2018). Heuristic Methods for Solving Two Discrete Optimization Problems. [Ph.D. Thesis, The University of Edinburgh]."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Martin-Barreiro, C., Ramirez-Figueroa, J.A., Cabezas, X., Leiva, V., and Galindo-Villardon, M.P. (2021). Disjoint and functional principal component analysis for infected cases and deaths due to COVID-19 in South American countries with sensor-related data. Sensors, 21.","DOI":"10.3390\/s21124094"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10589-010-9338-2","article-title":"Semi-Lagrangian relaxation applied to the uncapacited facility location problem","volume":"51","author":"Vial","year":"2012","journal-title":"Computat. Optim. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Program."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Program."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","article-title":"Lagrangian relaxation","volume":"11","author":"Guignard","year":"2003","journal-title":"Top"},{"key":"ref_19","first-page":"593","article-title":"A general method for solving extremum problems","volume":"8","author":"Polyak","year":"1967","journal-title":"Sov. Math. Dokl."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Bagirov, A.M., Gaudioso, M., Karmitsa, N., M\u00e4kel\u00e4, M.M., and Taheri, S. (2020). Numerical Nonsmooth Optimization. State of the Art Algorithms, Springer.","DOI":"10.1007\/978-3-030-34910-3"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., and Zambelli, G. (2014). Integer Programming, Springer.","DOI":"10.1007\/978-3-319-11008-0"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10589-006-6513-6","article-title":"Solving the p-Median Problem with a Semi-Lagrangian Relaxation","volume":"35","author":"Tandoki","year":"2006","journal-title":"Comput. Optim. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Doumari, S.A., Givi, H., Dehghani, M., Montazeri, Z., Leiva, V., and Guerrero, J.M. (2021). A New Two-Stage Algorithm for Solving Optimization Problems. Entropy, 23.","DOI":"10.3390\/e23040491"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.21629\/JSEE.2016.05.14","article-title":"Solution to the quadratic assignment problem using semi-lagrangian relaxation","volume":"27","author":"Zhang","year":"2016","journal-title":"J. Syst. Eng. Electron."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1007\/s10589-019-00061-5","article-title":"Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce","volume":"72","author":"Zhang","year":"2019","journal-title":"Comput. Optim. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0166-0462(87)90011-1","article-title":"A facility location problem with clients\u2019 preference orderings","volume":"17","author":"Hanjoul","year":"1987","journal-title":"Reg. Sci. Urban Econ."},{"key":"ref_27","first-page":"141","article-title":"A strengthened formulation for the simple plant location problem with order","volume":"35","year":"2006","journal-title":"Oper. Res.Lett."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library: Distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Rojas, F., Leiva, V., Huerta, M., and Martin-Barreiro, C. (2021). Lot-size models with uncertain demand considering its skewness\/kurtosis and stochastic programming applied to hospital pharmacy with sensor-related COVID-19 data. Sensors, 21.","DOI":"10.3390\/s21155198"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"100001","DOI":"10.1016\/j.socl.2019.100001","article-title":"A hybrid heuristic approach for traffic light synchronization based on the MAXBAND","volume":"1","author":"Cabezas","year":"2019","journal-title":"Soft Comput. Lett."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Ramirez-Figueroa, J.A., Martin-Barreiro, C., Nieto-Librero, A.B., Leiva, V., and Galindo-Villard\u00f3n, M.P. (2021). A new principal component analysis by particle swarm optimization with an environmental application for data science. Stoch. Environ. Res. Risk Assess., in press.","DOI":"10.1007\/s00477-020-01961-3"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Martin-Barreiro, C., Ramirez-Figueroa, J.A., Nieto-Librero, A.B., Leiva, V., Martin-Casado, A., and Galindo-Villard\u00f3n, M.P. (2021). A new algorithm for computing disjoint orthogonal components in the three-way Tucker model. Mathematics, 9.","DOI":"10.3390\/math9030203"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/21\/16\/5352\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:42:38Z","timestamp":1760164958000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/21\/16\/5352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":32,"journal-issue":{"issue":"16","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["s21165352"],"URL":"https:\/\/doi.org\/10.3390\/s21165352","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,9]]}}}