Pasar al contenido principal

MODELIZACION Y OPTIMIZACION DE PROBLEMAS ESTRUCTURADOS Y APLICACIONES

PID2022-139219OB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 6
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Heuristic algorithm tool for planning mass vaccine campaigns

  • Rodríguez-Pereira, Jessica
  • Ramalhinho-Lourenço, Helena
  • Sarrà, Paula
Purpose: The planning of massive vaccination campaigns often falls to nongovernmental organizations that have to face the critical challenge of vaccinating the largest number of people in the shortest time. This study aims to provide an easy tool for minimizing the duration of mass vaccination campaigns in rural and remote areas of developing countries. Design/methodology/approach: This paper presents a linear mathematical model that combines location, scheduling and routing decisions that allows determining where to locate the vaccination centers, as well as the schedule/route that each medical team must follow to meet the target demand in the shortest time possible. In addition, the paper proposes an heuristic approach that can be integrated in a spreadsheet. Findings: As the numerical experiments show, the proposed heuristic provides good solutions in a short time. Due to its simplicity and flexibility, the proposed approach allows decision-makers to analyze and evaluate several possible scenarios for decision-making by simply playing with input parameters. Social implications: The integration of the heuristic approach in a spreadsheet provides a simple and efficient tool to help decision-makers while avoiding the need for large investments in information systems infrastructure by user organizations. Originality/value: Motivated by a real-life problem and different from previous studies, the objective of the planning is to reduce the length of the vaccination campaigns with the available resources and ensure a target coverage instead of planning for minimizing costs or maximizing coverage. Furthermore, for helping implementation to practitioners, the heuristic can be solved in a spreadsheet., Helena Ramalhinho was supported by a grant from "la Caixa" Foundation under the project code LCF/PR/SR19/52540014 and by the Planetari Wellbeing Initiative 2021 from the Universitat Pompeu Fabra. Jessica Rodríguez-Pereira was funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGeneration EU/PRTR under the grant RYC2021-032589-I, and by MCIN/AEI/10.13039/501100011033/ FEDER-EU project PID2022-139219OB-I00. Paula Sarra was funded by a grant from the Planetari Wellbeing Initiative 2021 from the Universitat Pompeu Fabra. This support is gratefully acknowledged.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Weightedness measures from inequality systems

  • Albareda Sambola, Maria|||0000-0002-7666-6218
  • Molinero Albareda, Xavier|||0000-0002-5203-4347
  • Roura Ferret, Salvador|||0000-0003-4394-5939
A simple game is a cooperative game where some coalitions among players or voters became the (monotonic) set of winning coalitions, and the other ones form the set of losing coalitions. It is well-known that weighted voting games form a strict subclass of simple games, where each player has a voting weight so that a coalition wins if and only if the sum of weights of their members exceeds a given quota, otherwise it loses. This work studies how far away a simple game is for being representable as a weighted voting game, which allows for a more compact representation. There are several measures that determine the weightedness of a simple game, such as the dimension, the trade-robustness, the critical threshold value associated with the a-roughly weightedness property, etc. In this work we propose some new weightedness measures, all based on linear programming. In general terms, for a given simple game, a linear program is used to identify its weightedness: (i) the ¿-roughly value (µe ), (ii) the Z+ -roughly value (µZ+ ), (iii) the ¿-roughly value (µ¿ ), and (iv) the outlier value (¿M ). We show a close relation between the known critical threshold value of weightedness and the new measure µ¿ . Finally, we also present an exhaustive comparison of weightedness measures for simple games with up to six players., M. Albareda-Sambola was funded by MCIN/AEI/10.13039/501100011033/FEDER-EU project PID2022-139219OB-I00 and RED2022-134149-T. X. Molinero was partially supported by MCIN/AEI/10.13039/501100011033 under grant PID2020-112581GB-C21 (MOTION). X. Molinero and S. Roura were also partially supported by the Catalan government [2021 SGR 01419 ALBCOM]., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

An extension of an interior-point method to include risk aversion in large-scale multistage stochastic optimization

  • Castro Pérez, Jordi|||0000-0003-3573-4568
  • Escudero Bueno, Laureano F.
  • Monge Ivars, Juan Francisco
In the earlier paper “On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach, (Castro et al., 2023)” the authors presented a novel approach based on a specialized interior-point method (IPM) for solving (risk neutral) large-scale multistage stochastic optimization problems. The method computed the Newton direction by combining Cholesky factorizations with preconditioned conjugate gradients (PCG). This work extends that approach to the risk averse setting by incorporating coherent risk measures, namely expected conditional value-at-risk and second-order expected conditional stochastic dominance. Introducing risk aversion makes the optimization problems substantially more challenging and, for very large instances, can even exhaust the available memory resources. The contributions of this work are twofold. First, we propose a reformulation of risk averse stochastic optimization models based on a novel variable splitting scheme, which proves highly effective for general-purpose IPM solvers. Second, we show that the reformulated problem remains fully compatible with the specialized IPM. In particular, the new risk averse constraints extend the PCG preconditioner with an additional diagonal matrix, thereby preserving the efficiency of the solution process. Extensive computational experiments are reported for large-scale risk averse multistage stochastic revenue management problems with up to 278 million variables and 99 million constraints. The results show that the proposed splitting formulation significantly outperforms the classical compact formulation when using state-of-the-art solvers, and that the specialized IPM achieves superior performance on most of the largest problem instances., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A gentle introduction to deep neural networks for operations researchers

  • Amaré, Pau
  • Castro Pérez, Jordi|||0000-0003-3573-4568
Computing a neural network is, in essence, a large unconstrained optimization problem, though this fact is often obscured by machine learning jargon. We present a gentle introduction to deep learning for operations researchers, describing in a didactic manner the underlying optimization problem and providing examples developed from scratch. These examples are solved using both standard modeling languages and modern machine learning frameworks. We conclude by discussing applications of neural networks in operations research, illustrated through a concrete example involving the knapsack problem., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Weightedness measures from inequality systems

  • Albareda Sambola, Maria
  • Molinero Albareda, Xavier
  • Roura Ferret, Salvador
A simple game is a cooperative game where some coalitions among players or voters became the (monotonic) set of winning coalitions, and the other ones form the set of losing coalitions. It is well-known that weighted voting games form a strict subclass of simple games, where each player has a voting weight so that a coalition wins if and only if the sum of weights of their members exceeds a given quota, otherwise it loses. This work studies how far away a simple game is for being representable as a weighted voting game, which allows for a more compact representation. There are several measures that determine the weightedness of a simple game, such as the dimension, the trade-robustness, the critical threshold value associated with the a-roughly weightedness property, etc. In this work we propose some new weightedness measures, all based on linear programming. In general terms, for a given simple game, a linear program is used to identify its weightedness: (i) the ¿-roughly value (µe ), (ii) the Z+ -roughly value (µZ+ ), (iii) the ¿-roughly value (µ¿ ), and (iv) the outlier value (¿M ). We show a close relation between the known critical threshold value of weightedness and the new measure µ¿ . Finally, we also present an exhaustive comparison of weightedness measures for simple games with up to six players., M. Albareda-Sambola was funded by MCIN/AEI/10.13039/501100011033/FEDER-EU project PID2022-139219OB-I00 and RED2022-134149-T. X. Molinero was partially supported by MCIN/AEI/10.13039/501100011033 under grant PID2020-112581GB-C21 (MOTION). X. Molinero and S. Roura were also partially supported by the Catalan government [2021 SGR 01419 ALBCOM]., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Heuristic algorithm tool for planning mass vaccine campaigns

  • Rodríguez-Pereira, Jessica
  • Ramalhinho-Lourenço, Helena
  • Sarrà, Paula
Purpose: The planning of massive vaccination campaigns often falls to nongovernmental organizations that have to face the critical challenge of vaccinating the largest number of people in the shortest time. This study aims to provide an easy tool for minimizing the duration of mass vaccination campaigns in rural and remote areas of developing countries. Design/methodology/approach: This paper presents a linear mathematical model that combines location, scheduling and routing decisions that allows determining where to locate the vaccination centers, as well as the schedule/route that each medical team must follow to meet the target demand in the shortest time possible. In addition, the paper proposes an heuristic approach that can be integrated in a spreadsheet. Findings: As the numerical experiments show, the proposed heuristic provides good solutions in a short time. Due to its simplicity and flexibility, the proposed approach allows decision-makers to analyze and evaluate several possible scenarios for decision-making by simply playing with input parameters. Social implications: The integration of the heuristic approach in a spreadsheet provides a simple and efficient tool to help decision-makers while avoiding the need for large investments in information systems infrastructure by user organizations. Originality/value: Motivated by a real-life problem and different from previous studies, the objective of the planning is to reduce the length of the vaccination campaigns with the available resources and ensure a target coverage instead of planning for minimizing costs or maximizing coverage. Furthermore, for helping implementation to practitioners, the heuristic can be solved in a spreadsheet., Helena Ramalhinho was supported by a grant from "la Caixa" Foundation under the project code LCF/PR/SR19/52540014 and by the Planetari Wellbeing Initiative 2021 from the Universitat Pompeu Fabra. Jessica Rodríguez-Pereira was funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGeneration EU/PRTR under the grant RYC2021-032589-I, and by MCIN/AEI/10.13039/501100011033/ FEDER-EU project PID2022-139219OB-I00. Paula Sarra was funded by a grant from the Planetari Wellbeing Initiative 2021 from the Universitat Pompeu Fabra. This support is gratefully acknowledged.