Pasar al contenido principal

OPTIMIZACION, APRENDIZAJE Y COOPERACION CON APLICACIONES EN LOGISTICA

PID2021-124030NB-C31

•
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 2021
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDADE DA CORUÑA

Resultados relacionados

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

Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

An allocation rule for connection scheduling problems

  • Davila Pena, Laura
  • Borm, Peter
  • García Jurado, Ignacio
  • Schouten, Jop
This paper studies so-called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a source is minimal and second to find a fair cost allocation of such an optimal order among the players involved. We restrict our attention to connection scheduling problems on trees and propose a recursive method to solve these tree connection scheduling problems integrated with an allocation approach. This latter mechanism consistently and recursively uses benchmark endogenous myopic orders to determine potential cost savings, which will then be appropriately allocated. Interestingly, the transition process from a benchmark myopic order to an optimal one will be smooth using the switching of blocks of agents based on the basic notion of merge segments
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Application of decomposition techniques in a wildfire suppression optimization model

  • Rodríguez Veiga, Jorge
  • Rodríguez Penas, David
  • González Rueda, Ángel Manuel
  • Ginzo Villamayor, María José
Resource assignment and scheduling models provides an automatic and fast decision support system for wildfire suppression logistics. However, this process generates challenging optimization problems in many real-world cases, and the computational time becomes a critical issue, especially in realistic-size instances. Thus, to overcome that limitation, this work studies and applies a set of decomposition techniques such as augmented Lagrangian, branch and price, and Benders decomposition’s to a wildfire suppression model. Moreover, a reformulation strategy, inspired by Benders’ decomposition, is also introduced and demonstrated. Finally, a numerical study comparing the behavior of the proposals using different problem sizes is conducted
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Parameter estimation in ODEs: assessing the potential of local and global solvers

  • Fernández de Dios, M.
  • González Rueda, Ángel Manuel
  • Rodríguez Banga, Julio
  • González Díaz, Julio
  • Rodríguez Penas, David
We consider the problem of parameter estimation in dynamic systems described by ordinary differential equations. A review of the existing literature emphasizes the need for deterministic global optimization methods due to the nonconvex nature of these problems. Recent works have focused on expanding the capabilities of specialized deterministic global optimization algorithms to handle more complex problems. Despite advancements, current deterministic methods are limited to problems with a maximum of around five state and five decision variables, prompting ongoing efforts to enhance their applicability to practical problems. Our study seeks to assess the effectiveness of state-of-the-art general-purpose global and local solvers in handling realistic-sized problems efficiently, and evaluating their capabilities to cope with the nonconvex nature of the underlying estimation problems.
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Evaluating the impact of items and cooperation in inventory models with exemptable ordering costs

  • Fiestras Janeiro, Maria Gloria
  • García Jurado, Ignacio
  • Meca, Ana
  • Mosquera Rodríguez, Manuel Alfredo
In this paper we introduce and analyse, from a game theoretical perspective, several multi-agent or multi-item continuous review inventory models in which the buyers are exempted from ordering costs if the price of their orders is greater than or equal to a certain amount. For all models we obtain the optimal ordering policy. We first analyse a simple model with one firm and one item. Then, we study a model with one firm and several items, for which we design a procedure based on cooperative game theory to evaluate the impact of each item on the total cost. Then, we deal with a model with several firms and one item for each firm, for which we characterise a rule to allocate the total cost among the firms in a coalitionally stable way. Finally, we discuss a model with several firms and several items, for which we characterise a rule to allocate the total cost among the firms in a coalitionally stable way and to evaluate the impact of each item on the cost that would be payable to each firm when using the allocation rule. All the concepts and results of this article are illustrated using data from a case study., Agencia Estatal de Investigación | Ref. MTM2017-87197-C3-1-P, Agencia Estatal de Investigación | Ref. MTM2017-87197-C3-2-P, Agencia Estatal de Investigación | Ref. PGC2018-097965-B-I00, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C31, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, MCIN/AEI/10.13039/501100011033/ | Ref. PID2022-137211NB-100, Comunidad Valenciana | Ref. PROMETEO/2021/063, Xunta de Galicia | Ref. ED431C-2020/03, Xunta de Galicia | Ref. ED431C-2020/14, Universidade da Coruña/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

On how the rules that extend the concede-and-divide principle differ for pairs of claimants

  • Mirás Calvo, Miguel Ángel
  • Núñez Lugilde, Iago
  • Quinteiro Sandomingo, Maria Del Carmen
  • Sánchez Rodríguez, María Estela
In the context of conflicting claims problems, the Talmud, adjusted proportional, random arrival, minimal overlap, and average-of-awards rules are well-known extensions of the two-claimant concede-and-divide rule to larger populations. We analyze how the awards recommended by these rules for each couple of claimants differ from what they would receive if the concede-and-divide principle were applied to distribute among them their joint payoff. To compare the behavior of these rules for pairs of claimants, we rely on geometric features of the corresponding two-dimensional paths of awards. We study properties pertaining to the impact, in absolute and relative terms, that one claimant leaving the problem has on the awards of the remaining claimants., Agencia Estatal de Investigación | Ref. PID2021-124030NB-C31, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, Universidade de Vigo/CISUG
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

On how the Rules that Extend the Concede-and-Divide Principle Differ for Pairs of Claimants

  • Mirás Calvo, Miguel Ángel
  • Núñez Lugilde, Iago
  • Quinteiro Sandomingo, Carmen
  • Sánchez-Rodríguez, Estela
Financiado para publicación en acceso aberto: Universidade de Vigo/CISUG, [Abstract]: In the context of conflicting claims problems, the Talmud, adjusted proportional, random arrival, minimal overlap, and average-of-awards rules are well-known extensions of the two-claimant concede-and-divide rule to larger populations. We analyze how the awards recommended by these rules for each couple of claimants differ from what they would receive if the concede-and-divide principle were applied to distribute among them their joint payoff. To compare the behavior of these rules for pairs of claimants, we rely on geometric features of the corresponding two-dimensional paths of awards. We study properties pertaining to the impact, in absolute and relative terms, that one claimant leaving the problem has on the awards of the remaining claimants., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. Funding for open access charge: Universidade de Vigo/CISUG. This work was supported by projects PID2021-124030NB-C31 and PID2021-124030NB-C33, funded by MCIN/AEI/10.13039/ 501100011033/ and by “ERDF A way of making Europe”/EU.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

An allocation rule for connection scheduling problems

  • Davila-Pena, Laura
  • Borm, Peter
  • García-Jurado, Ignacio
  • Schouten, Jop
[Abstract]: This paper studies so-called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a source is minimal and second to find a fair cost allocation of such an optimal order among the players involved. We restrict our attention to connection scheduling problems on trees and propose a recursive method to solve these tree connection scheduling problems integrated with an allocation approach. This latter mechanism consistently and recursively uses benchmark endogenous myopic orders to determine potential cost savings, which will then be appropriately allocated. Interestingly, the transition process from a benchmark myopic order to an optimal one will be smooth using the switching of blocks of agents based on the basic notion of merge segments., Laura Davila-Pena’s research was funded by the Ministry of Education, Culture and Sports ofSpain (contract FPU17/02126). This work is part of the R&D projects MTM2017-87197-C3-1-P, MTM2017-87197-C3-3-P, PID2021-124030NB-C31, and PID2021-124030NB-C32, granted byMICIU/AEI/10.13039/501100011033/ and by “ERDF A way of making Europe”/EU. This re-search was also funded by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C2021/24 and ED431C 2020/14). The authors would like to thank the editor-in-chief, the asso-ciate editor, and the three anonymous referees for their valuable comments, which helped improvean earlier version of this paper.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

An Adaptive Large Neighbourhood Search algorithm for a real-world Home Care Scheduling Problem with time windows and dynamic breaks

  • Méndez-Fernández, Isabel
  • Lorenzo Freire, Silvia
  • González Rueda, Ángel Manuel
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: This paper presents a Home Care Scheduling Problem (from now on HCSP) based on a real case of a care company for elderly and dependent people located in the North of Spain. The problem incorporates many of the common features addressed in the HCSP literature, such as soft and hard time windows for the services, available working time of the caregivers or affinity levels between users and caregivers. However, it also includes other novel characteristics that increase the difficulty of the problem significantly, since the breaks between services will play a key role in the quality of the solutions. To evaluate the solutions, the users welfare will be prioritized over the cost associated with the schedule. The problem has been formulated as a Mixed Integer Linear Programming (MILP) one but, due to the complexity of the model, it is not possible to solve it for real size instances. Therefore, we have designed a method that combines the Adaptive Large Neighbourhood Search (ALNS) methodology with a heuristic approach necessary to evaluate the objective functions. To analyse the behaviour of the algorithm, a set of computational experiments are carried out under different configurations. First, the MILP formulation and the algorithm have been compared over some standard instances from the literature. Finally, the performance of the algorithm is evaluated over a real case study based on the timetables of the company during some weeks from 2016 to 2017., This research was funded by MICINN/AEI/10.13039/501100011033/ and ERDF/EU through R+D+I project grants MTM2017-87197-C3-1-P and PID2021-124030NB-C31 and by Consellería de Cultura, Educación e Universidades, Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2020/14 and Centro de Investigación del Sistema universitario de Galicia ED431G-2019/01). Funding for open access charge: Universidade da Coruña/CISUG. Constructive comments from several referees and the editor are also gratefully acknowledged., Xunta de Galicia; ED431C-2020/14, Xunta de Galicia; ED431G-2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

On egalitarian values for cooperative games with level structures

  • Alonso-Meijide, José Mª.
  • Costa, Julián
  • García-Jurado, Ignacio
  • Gonçalves-Dosantos, J.C.
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: In this paper we extend the equal division and the equal surplus division values for transferable utility cooperative games to the more general setup of transferable utility cooperative games with level structures. In the case of the equal surplus division value we propose three possible extensions, one of which has already been described in the literature. We provide axiomatic characterizations of the values considered, apply them to a particular cost sharing problem and compare them in the framework of such an application., Xunta de Galicia; ED431G-2019/01, Xunta de Galicia; ED431C-2020/14, Xunta de Galicia; ED431C-2021/24, This work is part of the R+D+I project grants MTM2017-87197-C3-1-P, MTM2017-87197- C3-3-P, PID2021-124030NB-C31 and PID2021-124030NB-C32, funded by MCIN/AEI/10.13039/501100011033/ and by "ERDF A way of making Europe”/EU. This research was also funded by Grupos de Referencia Competitiva ED431G-2019/01, ED431C-2020/14 and ED431C-2021/24 from the Consellería de Cultura, Educación e Universidades, Xunta de Galicia. During the completion of this work, J. C. Gonçalves-Dosantos is a "Margarita Salas” postdoctoral researcher, carrying out a research stay at the CIO, Centro de Investigación Operativa of the Miguel Hernández University of Elche (Spain), to which he is grateful for the welcome. Funding for open access charge: Universidade da Coruña/CISUG
RUC. Repositorio da Universidade da Coruña
Publicación Tesis doctoral (DoctoralThesis)

Decision Support Systems for Scheduling and Routing Problems in a Home Care Business

  • Méndez-Fernández, Isabel
[Abstract] Home care services aim to help elderly, sick or dependent people in maintain their quality of life without having to leave their homes. This type of problem is denoted as Home Care Scheduling Problem (HCSP) and the goal is to obtain the routes that the company’s caregivers must follow, as well as the timeframe in which each service should be carried out. That is, a HCSP can be seen as a routing and scheduling problem. This thesis studies a real HCSP presented by a company called Mayores. First, the original problem proposed by the company is presented, which consists in updating the weekly schedules of the caregivers in order to solve a set of possible incidents. This problem is tackled using the Simulated Annealing method embedded inside a custom heuristic algorithm. Second, a more general version of the problem is described, which aims to obtain the best possible schedules of the caregivers from scratch, considering two objectives: the welfare of the users and the cost of the schedule. The problem is solved considering three approaches: two hierarchical ones (prioritizing the welfare or prioritizing the cost) and a biobjective one. Finally, a computational study is presented in order to evaluate the resolution approaches, using instances from the literature and real data from the company, [Resumen] Los servicios de atención a domicilio tienen como objetivo ayudar a personas mayores o dependientes a mantener o mejorar su calidad de vida sin necesidad de abandonar sus hogares. Esta clase de problema se denomina Home Care Scheduling Problem (HCSP) y su objetivo es obtener las rutas que deben seguir las auxiliares de la empresa, así como los horarios en los que debe realizarse cada servicio. Es decir, los HCSP pueden ser considerados como problemas de planificación de rutas y horarios. En esta tesis se estudia un HCSP real presentado por una empresa llamada Mayores. En primer lugar, se presenta el problema original propuesto por la empresa, que consiste en actualizar los horarios semanales de las auxiliares con el fin de resolver un conjunto de incidencias. En segundo lugar, se describe una versión más general del problema, cuyo objetivo es obtener, partiendo desde cero, las mejores planificaciones para las auxiliares, considerando dos objetivos: el bienestar de los usuarios y el coste de la planificación. El problema se resuelve considerando tres enfoques: dos jerárquicos (dando prioridad al bienestar o al coste) y uno biobjetivo. Por último, se presenta un estudio computacional para evaluar los enfoques de resolución propuestos, utilizando instancias de la literatura y datos reales proporcionados por la empresa., [Resumo] Os servizos de atención a domicilio teñen como obxectivo axudar a persoas maiores ou dependentes a manter ou mellorar a súa calidade de vida sen necesidade de abandonar os seus fogares. Esta clase de problema denomínase Home Care Scheduling Problem (HCSP) e o seu obxectivo é obter as rutas que deben seguir as auxiliares da empresa, así como os horarios nos que debe realizarse cada servizo. É dicir, os HCSP poden ser considerados como problemas de planificación de rutas e horarios. Nesta tese estúdase un HCSP real presentado por unha empresa chamada Mayores. En primeiro lugar, preséntase o problema orixinal proposto pola empresa, que consiste en actualizar os horarios semanais das auxiliares co fin de resolver un conxunto de incidencias. En segundo lugar, descríbese unha versión máis xeral do problema, cuxo obxectivo é obter, partindo desde cero, as mellores planificacións para as auxiliares, considerando dous obxectivos: o benestar dos usuarios e o custo da planificación. O problema resólvese considerando tres enfoques: dous xerárquicos (dando prioridade ao benestar ou ao custo) e un biobxetivo. Por último, preséntase un estudo computacional para avaliar os enfoques de resolución propostos, empregando instancias da literatura e datos reais proporcionados pola empresa., Xunta de Galicia; ED431C-2020/14, Xunta de Galicia; ED431G-2019/01, The PhD candidate’s research was sponsored by the Spanish Grant for Predoctoral Research Trainees RD 103/2019. This research was funded by MICINN/AEI/10.13039/501100011033/ and ERDF/EU through R+D+I project grants MTM2017-87197-C3-1-P and PID2021-124030NB-C31 and by Consellería de Cultura, Educación e Universidades, Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2020/14 and Centro de Investigación del Sistema universitario de Galicia ED431G-2019/01).
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Evaluating the impact of items and cooperation in inventory models with exemptable ordering costs

  • Fiestras Janeiro, María Gloria
  • García-Jurado, Ignacio
  • Meca Martínez, Ana
  • Mosquera Rodríguez, Manuel Alfredo
[Absctract]: In this paper we introduce and analyse, from a game theoretical perspective, several multi-agent or multi-item continuous review inventory models in which the buyers are exempted from ordering costs if the price of their orders is greater than or equal to a certain amount. For all models we obtain the optimal ordering policy. We first analyse a simple model with one firm and one item. Then, we study a model with one firm and several items, for which we design a procedure based on cooperative game theory to evaluate the impact of each item on the total cost. Then, we deal with a model with several firms and one item for each firm, for which we characterise a rule to allocate the total cost among the firms in a coalitionally stable way. Finally, we discuss a model with several firms and several items, for which we characterise a rule to allocate the total cost among the firms in a coalitionally stable way and to evaluate the impact of each item on the cost that would be payable to each firm when using the allocation rule. All the concepts and results of this article are illustrated using data from a case study., This work is part of the R+D+I project grants MTM2017-87197-C3-1-P, MTM2017-87197-C3-2-P, PGC2018-097965-B-I00, PID2021-124030NB-C31, PID2021-124030NB-C33 and PID2022-137211NB-100, that were funded by MCIN/AEI/10.13039/501100011033/ and by “ERDF A way of making Europe”/EU. This research was also funded by project PROMETEO/2021/063 from the Comunidad Valenciana, and by Grupos de Referencia Competitiva ED431C-2020/03 and ED431C-2020/14 from the Consellería de Cultura, Educación e Universidades, Xunta de Galicia. Funding for open access charge: Universidade da Coruña/CISUG . The authors would also like to thank the anonymous reviewers for their comments, which have contributed to the improvement of this article., Xunta de Galicia; ED431C-2020/03, Xunta de Galicia; ED431C-2020/14, Generalitat Valenciana; PROMETEO/2021/063
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Application of decomposition techniques in a wildfire suppression optimization model

  • Rodríguez-Veiga, J.
  • Penas, David R.
  • González-Rueda, A. M.
  • Ginzo-Villamayor, M.
Resource assignment and scheduling models provides an automatic and fast decision support system for wildfire suppression logistics. However, this process generates challenging optimization problems in many real-world cases, and the computational time becomes a critical issue, especially in realistic-size instances. Thus, to overcome that limitation, this work studies and applies a set of decomposition techniques such as augmented Lagrangian, branch and price, and Benders decomposition’s to a wildfire suppression model. Moreover, a reformulation strategy, inspired by Benders’ decomposition, is also introduced and demonstrated. Finally, a numerical study comparing the behavior of the proposals using different problem sizes is conducted., This research work is supported by the R+D+I project grants PID2020-116587GB-I00 and PID2021-124030NB (C31 and C32), funded by MCIN/AEI/10.13039/501100011033/ and by “ERDF A way of making Europe”/EU. Second author investigation is funded by the Xunta de Galicia (contract post-doctoral 2019-2022). We acknowledge the computational resources provided by CESGA. Third author acknowledges support from the Xunta de Galicia through the ERDF (ED431C-2020-14 and ED431G 2019/01), and “CITIC”. Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Parameter estimation in ODEs: assessing the potential of local and global solvers

  • Fernández de Dios, M.
  • González-Rueda, Ángel M.
  • Banga, Julio R.
  • González-Díaz, Julio
  • Penas, David R.
39 pages, 12 tables, 14 figures; The online version contains supplementary material available at https://doi.org/10.1007/s11081-025-09978-9; Upon acceptance, all AMPL models used in the computational study will be made publicly available according to the journal standards., In this work, we address parameter estimation in models described by nonlinear ordinary differential equations (ODEs) using a direct transcription approach. Controls and state profiles are discretized, leading to a nonlinear programming (NLP) problem solvable via mathematical programming techniques. The main goal of this work is to analyze the potential of mathematical modeling and state-of-the-art solvers to handle these problems. For this purpose, an extensive numerical study on eight challenging parameter estimation problems in nonlinear dynamic biological systems is carried out. Different modeling aspects, such as discretization schemes and formulation variants, are explored. The use of global and local solvers provides insights into local optimality and identifiability challenges. Our approach yields promising results, surpassing previously reported capabilities in the literature., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work is part of the R&D projects PID2021-124030NB-C31 and PID2021-124030NB-C32 funded by MICIU/AEI/10.13039/501100011033/ and by ERDF/EU. This research was also funded by Grupos de Referencia Competitiva ED431C-2021/24 from the Consellería de Cultura, Educación e Universidades, Xunta de Galicia. JRB acknowledges support from grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/501100011033, from grant PID2023-146275NB-C22 (DYNAMO-bio) funded by MICIU/AEI/ 10.13039/501100011033 and ERDF/EU, and from grant CSIC PIE 202470E108 (LARGO). The authors acknowledge CESGA (Centro de Supercomputación de Galicia) for providing access to its FinisTerrae III supercomputer.