Pasar al contenido principal

OPTIMIZACION Y COOPERACION CON APLICACIONES EN ECONOMIA, ENERGIA Y LOGISTICA

MTM2017-87197-C3-1-P

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D (Excelencia / Generación de Conocimiento)
Año convocatoria 2017
Plan Estatal 2017-2020 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): 23
Encontrada(s) 1 página(s)

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

Assessment of the influence of features on a classification problem: an application to COVID-19 patients

  • Davila Pena, Laura
  • García Jurado, Ignacio
  • Casas Méndez, Balbina
This paper deals with an important subject in classification problems addressed by machine learning techniques: the evaluation of the influence of each of the features on the classification of individuals. Specifically, a measure of that influence is introduced using the Shapley value of cooperative games. In addition, an axiomatic characterisation of the proposed measure is provided based on properties of efficiency and balanced contributions. Furthermore, some experiments have been designed in order to validate the appropriate performance of such measure. Finally, the methodology introduced is applied to a sample of COVID-19 patients to study the influence of certain demographic or risk factors on various events of interest related to the evolution of the disease
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Analysis of the impact of DMUs on the overall efficiency in the event of a merger

  • Saavedra Nieves, Alejandro
  • Fiestras-Janeiro, María Gloria
This paper addresses several mechanisms for overall ranking Decision Making Units (DMUs) according to the contribution of DMUs to the relative efficiency score of a merger considering aggregate units The possible organization of agents outside each possible merger naturally influences the relative efficiency score, which motivates the use of games in partition function form and specific ranking indices for DMUs based on the Shapley value. Several computational problems arise in their exact computation when the number of DMUs increases. We describe two sampling alternatives to reduce these drawbacks. Finally, we apply these methods to analyse the efficiency of the hotel industry in Spain
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Computational advances in polynomial optimization: RAPOSa, a freely available global solver

  • González Rodríguez, Brais
  • Ossorio Castillo, Joaquín
  • González Díaz, Julio
  • González Rueda, Ángel Manuel
  • Rodríguez Penas, David
In this paper we introduce RAPOSa, a global optimization solver specifically designed for (continuous) polynomial programming problems with box-constrained variables. Written entirely in C++, RAPOSa is based on the Reformulation-Linearization (Sherali and Tuncbilek in J Glob Optim 103:225–249, 1992). We present a description of the main characteristics of RAPOSa along with a thorough analysis of the impact on its performance of various enhancements discussed in the literature, such as bound tightening and SDP cuts. We also present a comparative study with three of the main state-of-the-art global optimization solvers: BARON, Couenne and SCIP
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
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

A heuristic approach to the task planning problem in a home care business

  • Méndez-Fernández, Isabel
  • Lorenzo Freire, Silvia
  • García-Jurado, Ignacio
  • Costa, Julián
  • Carpente, Luisa
This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https:// doi.org/10.1007/s10729-020-09509-1, [Abstract]: In this paper, we study a task scheduling problem in a home care business. The company has a set of supervisors in charge of scheduling the caregivers’ weekly plans. This can be a time-consuming task due to the large number of services they work with, as well as the need to consider user preferences, services required time windows and travel times between users’ homes. Apart from that, it is also important to have a continuity of care, i.e., that users generally prefer not to have their caregiver changed. This problem involves both route planning and employee task planning, which are usually very challenging. We first propose to model it using integer linear programming methodology. Since the real instances that the company needs to solve are very large, we design a heuristic algorithm, based on the simulated annealing philosophy, that allows the company to obtain the caregivers’ weekly schedules. Lastly, we check the algorithm’s good performance, by comparing the solutions it proposes with those provided by the integer linear programming methodology, in small size problems, and we present a case study to confirm that the algorithm correctly solves real-life instances. © 2020, Springer Science+Business Media, LLC, part of Springer Nature., This work has been supported by the ERDF; the MINECO/AEI grants MTM2014-53395-C3-1-P, MTM2017-87197-C3-1-P and ITC-20151247; and by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2016-015 and Centro Singular de Investigación de Galicia ED431G/01). The authors would like to thank two anonymous referees for their very helpful suggestions to improve this article., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431G/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Assessment of the Influence of Features on a Classification Problem: An Application to COVID-19 Patients

  • Davila-Pena, Laura
  • García-Jurado, Ignacio
  • Casas Méndez, Balbina Virginia
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] This paper deals with an important subject in classification problems addressed by machine learning techniques: the evaluation of the influence of each of the features on the classification of individuals. Specifically, a measure of that influence is introduced using the Shapley value of cooperative games. In addition, an axiomatic characterisation of the proposed measure is provided based on properties of efficiency and balanced contributions. Furthermore, some experiments have been designed in order to validate the appropriate performance of such measure. Finally, the methodology introduced is applied to a sample of COVID-19 patients to study the influence of certain demographic or risk factors on various events of interest related to the evolution of the disease., The authors are grateful to Ricardo Cao Abad and to the Dirección Xeral de Saúde Pública of the Xunta de Galicia in Spain. This work has been supported by the ERDF, the Government of Spain/AEI [grants MTM2017-87197-C3-1-P and MTM2017-87197-C3-3-P]; the Xunta de Galicia [Grupos de Referencia Competitiva ED431C2016-015, ED431C2017/38, and ED431C 2021/24, and Centro Singular de Investigación de Galicia ED431G/01]; and by the collaborative research project of the IMAT “Mathematical, statistical and dynamic study of the epidemic COVID-19”, subsidized by the Vice-Rector’s Office for Research and Innovation at the University of Santiago de Compostela, Spain. The research of Laura Davila-Pena has been funded by the Government of Spain [grant FPU17/02126], Xunta de Galicia; ED431C2016-015, Xunta de Galicia; ED431C2017/38, Xunta de Galicia; ED431C 2021/24, Xunta de Galicia; ED431G/01
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)

Subgame Perfection and the Rule of k Names

  • García-Jurado, Ignacio
  • Méndez-Naya, Luciano
This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10726-019-09625-6, [Abstract]: In this paper we revisit the rule of k names from a game theoretic perspective. This rule can be described as follows. Given a set of candidates for a position, a committee (formed by the proposers) selects k elements of that set using a screening rule; then a single individual from outside the committee (the chooser) chooses for the position one of the k selected candidates. In this context we first give conditions for the existence of a subgame perfect equilibrium. Then we provide conditions for the existence of subgame perfect q-strong equilibria when the screening rule is majoritarian. Finally, we show that when the chooser can strategically appoint a delegate to choose on behalf of him, the conditions for the existence of subgame perfect q-strong equilibria are weaker., This work has been supported by the ERDF, the MINECO/AEI grants MTM2014-53395-C3-1-P, MTM2017-87197-C3-1-P, MTM2017-87197-C3-3-P, and by the Xunta de Galicia (Grupo de Referencia Competitiva ED431C-2016-015 and Centro Singular de Investigación de Galicia ED431G/01)., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431G/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Two novel distances for ordinal time series and their application to fuzzy clustering

  • López-Oriona, Ángel
  • Weiß, Christian H.
  • Vilar, José
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Time series clustering is a central machine learning task with applications in many fields. While the majority of the methods focus on real-valued time series, very few works consider series with discrete response. In this paper, the problem of clustering ordinal time series is addressed. To this aim, two novel distances between ordinal time series are introduced and used to construct fuzzy clustering procedures. Both metrics are functions of estimated cumulative probabilities, thus automatically taking advantage of the ordering inherent to the series' range. The resulting clustering algorithms are computationally efficient and able to group series generated from similar stochastic processes, reaching accurate results with series coming from a wide variety of models. Since the dynamics of the series may vary over the time, we adopt a fuzzy approach, thus enabling the procedures to locate each series into several clusters with different membership degrees. An extensive simulation study shows that the proposed methods outperform several alternative procedures. Weighted versions of the clustering algorithms are also presented and their advantages with respect to the original methods are discussed. Two specific applications involving economic time series illustrate the usefulness of the proposed approaches., The authors thank the referees for their useful comments on an earlier draft of this article. The research of Ángel López-Oriona and José A. Vilar has been supported by the Ministerio de Economía y Competitividad (MINECO) grant MTM2017-87197-C3-1-P, the Xunta de Galicia through the ERDF (Grupos de Referencia Competitiva ED431C-2016-015), and the Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia and the European Union (European Regional Development Fund-Galicia 2014-2020 Program), by grant ED431G 2019/01. The author Ángel López-Oriona would like to thank Prof. Christian H. Weiß for his kindness during the doctoral stay at the Helmut Schmidt University of Hamburg, where this research was carried out. This work has received funding for open access charge by Universidade da Coruña/CISUG., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

ProjectManagement: an R Package for Managing Projects

  • Gonçalves-Dosantos, J.C.
  • García-Jurado, Ignacio
  • Costa, Julián
[Abstract]:Project management is an important body of knowledge and practices that comprises the planning, organisation and control of resources to achieve one or more pre-determined objectives. In this paper, we introduce ProjectManagement, a new R package that provides the necessary tools to manage projects in a broad sense, and illustrate its use by examples., This work has been supported by the MINECO grant MTM2017-87197-C3-1-P and by the Xunta de Galicia through the ERDF (Grupos de Referencia Competitiva ED431C-2016-015 and Centro Singular de Investigación de Galicia ED431G/01). The comments of an anonymous reviewer have helped us to improve this paper significantly., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431G/01
RUC. Repositorio da Universidade da Coruña
Publicación Capítulo o parte de un libro (BookPart)

A New Shapley Value-Based Rule for Distributing Delay Costs in Stochastic Projects

  • Costa, Julián
  • García-Jurado, Ignacio
  • Gonçalves-Dosantos, J.C.
This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-031-04137-2_2, [Abstract]: In this paper we propose a new allocation rule for stochastic projects with delays based on the Shapley value and compare it with another Shapley value-based rule introduced in a recent paper. First we justify the interest of considering a new rule of this kind, then we compare it with the old one in some examples and finally we study some theoretical properties that distinguish them., This work has been supported by the ERDF, the MINECO/AEI grant MTM2017-87197-C3-1-P and the Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2020-14, and Centro de Investigación del Sistema universitario de Galicia ED431G 2019/01). Juan Carlos Gonçalves-Dosantos has a Margarita Salas postdoctoral grant and he is doing a stay at the Center of Operations Research (CIO), Miguel Hernandez University of Elche (UMH)., 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)

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 Artículo científico (JournalArticle)

On benefits of cooperation under strategic power

  • Fiestras Janeiro, María Gloria
  • García-Jurado, Ignacio
  • Meca Martínez, Ana
  • Mosquera Rodríguez, Manuel Alfredo
This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https:// doi.org/10.1007/s10479-019-03495-6, [Abstract]: We introduce a new model involving TU-games and exogenous structures. Specifically, we consider that each player in a population can choose an element in a strategy set and that, for every possible strategy profile, a TU-game is associated with the population. This is what we call a TU-game with strategies. We propose and characterize the maxmin procedure to map every game with strategies to a TU-game. We also study whether or not the relevant properties of TU-games are transmitted by applying the maxmin procedure. Finally, we examine two relevant classes of TU-games with strategies: airport and simple games with strategies., The authors would like to thank two anonymous referees for their helpful suggestions to improve this article. This work has been supported by the Ministerio de Economía y Competitividad through Grants PGC2018-097965-B-100, MTM2017-87197-C3-1-P, MTM2017-87197-C3-2-P, MTM2014-53395-C3-1-P, MTM2014-53395-C3-3-P, MTM2014-54199-P, and by the Xunta de Galicia through the European Regional Development Fund (Grupos de Referencia Competitiva ED431C-2016-015 and ED431C-2016-040, and Centro Singular de Investigación de Galicia ED431G/01)., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431C-2016-040, Xunta de Galicia; ED431G/01
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

A Bi-Objective Scheduling Problem in a Home Care Business

  • Méndez-Fernández, Isabel
  • Lorenzo Freire, Silvia
  • González Rueda, Ángel Manuel
Presented at the 4th XoveTIC Conference, A Coruña, Spain, 7–8 October 2021., [Abstract] In this work we study a routing and scheduling problem for a home care business. The problem is composed of two conflicting objectives, therefore we study it as a bi-objective one. We obtain the Pareto frontier for small size instances using the AUGMECON2 method and, for bigger cases, we developed an heuristic algorithm. We also obtained some preliminary results that show the algorithm has good behaviour., This research/work has been supported by MINECO grant MTM2017-87197-C3-1-P, and by the Xunta de Galicia through the ERDF (Grupos de Referencia Competitiva ED431C-2016-015 and ED431C-2020-14 and Centro de Investigación del Sistema universitario de Galicia ED431G 2019/01)., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431C-2020-14, Xunta de Galicia; ED431G 2019/01
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)

Sharing delay costs in stochastic scheduling problems with delays

  • Gonçalves-Dosantos, J.C.
  • García-Jurado, Ignacio
  • Costa, Julián
This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10288-019-00427-9., [Abstract]: An important problem in project management is determining ways to distribute amongst activities the costs that are incurred when a project is delayed because some activities end later than expected. In this study, we address this problem in stochastic projects, where the durations of activities are unknown but their corresponding probability distributions are known. We propose and characterise an allocation rule based on the Shapley value, illustrate its behaviour by using examples, and analyse features of its calculation for large problems., This work has been supported by the MINECO grants MTM2014-53395-C3-1-P and MTM2017-87197-C3-1-P, and by the Xunta de Galicia through the ERDF (Grupos de Referencia Competitiva ED431C-2016-015 and Centro Singular de Investigación de Galicia ED431G/01). The authors also acknowledge the useful comments of two anonymous referees., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431G/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

New results on egalitarian values for games with a priori unions

  • Gonçalves-Dosantos, J.C.
  • Alonso-Meijide, José Mª.
This is an Accepted Manuscript version of the following article, accepted for publication in Optimization. J. C. Gonçalves-Dosantos & J. M. Alonso-Meijide (2023): New results on egalitarian values for games with a priori unions, Optimization, 72:3, 861-881, DOI: 10.1080/02331934.2021.1995731. It is deposited under the terms of the Creative Commons Attribution-NonCommercial License (http://creativecommons.org/licenses/by-nc/4.0/ ), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited., [Abstract]: Several extensions of the equal division value and the equal surplus division value to the family of games with a priori unions have been proposed by Alonso-Meijide et al. [On egalitarian values for cooperative games with a priori unions. TOP. 2020;28:672–688]. In this study, we provide new axiomatic characterizations of these values. Furthermore, using the equal surplus division value in two steps, we propose a new coalitional value. The balanced contributions and quotient game properties generate a different modification of the equal surplus division value., This work has been supported by the ERDF, the MINECO/AEI grants MTM2017-87197-C3-1-P, MTM2017-87197-C3-3-P, and by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2016-015 and ED431C-2017/38). CITIC as Centro de Investigación do Sistema universitario de Galicia is financed by Consellería de Educación, Universidade e Formación Profesional of Xunta de Galicia through the Fondo Europeo de Desenvolvemento Rexional (FEDER) with 80%, Programa operativo FEDER Galicia 2014–2020 and the remaining 20% by the Secretaría Xeral de Universidades (Ref. ED431G 2019/01)., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431C-2017/38, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Optimization in Sanger sequencing

  • Carpente, Luisa
  • Cerdeira-Pena, Ana
  • Lorenzo Freire, Silvia
  • Saavedra Places, Ángeles
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/. This version of the article Carpente, L., Cerdeira-Pena, A., Lorenzo-Freire, S., Places, Á.S., 2019. Optimization in Sanger sequencing. Computers & Operations Research 109, 250–262 has been accepted for publication in Computers & Operations Research. The Version of Record is available online at https://doi.org/10.1016/j.cor.2019.05.011, [Abstract]: The main objective of this paper is to solve the optimization problem that is associated with the classification of DNA samples in PCR plates for Sanger sequencing. To achieve this goal, we design an integer linear programming model. Given that the real instances involve the classification of thousands of samples and the linear model can only be solved for small instances, the paper includes a heuristic to cope with bigger problems. The heuristic algorithm is based on the simulated annealing technique. This algorithm obtains satisfactory solutions to the problem in a short amount of time. It has been tested with real data and yields improved results compared to some commercial software typically used in (clinical) laboratories. Moreover, the algorithm has already been implemented in the laboratory and is being successfully used., This work has been supported by MINECO: MTM2014-53395-C3-1-P, MINECO: MTM2017-87197-C3-1-P, Xunta de Galicia/FEDER-UE ERDF: ED431C-2016-015, Xunta de Galicia/FEDER-UE ERDF: ED431G/01, FEDER-UE ESF, Xunta de Galicia Conecta Peme-2014: IN852A-2014/9, Xunta de Galicia/FEDER-UE CSI: ED431G/01, Xunta de Galicia/FEDER-UE GRC: ED431C 2017/58, MINECO-CDTI/FEDER-UE CIEN LPS-BIGGER: IDI-20141259, MINECO-CDTI/FEDER-UE INNTERCONECTA uForest: ITC-20161074, MINECO-AEI/FEDER-UE eDSalud: RTC-2016-5143-1, MINECO-AEI/FEDER-UE Datos 4.0: TIN2016-78011-C4-1-R and MINECO-AEI/FEDER-UE ETOME-RDFD3: TIN2015-69951-R., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431G/01, Xunta de Galicia; ED431G/01, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; IN852A-2014/9
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

On egalitarian values for cooperative games with a priori unions

  • Alonso-Meijide, José Mª.
  • Costa, Julián
  • García-Jurado, Ignacio
  • Gonçalves-Dosantos, J.C.
This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s11750-020-00553-2., [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 a priori unions. In the case of the equal surplus division value we propose three possible extensions. We provide axiomatic characterizations of the new values. Furthermore, we apply the proposed modifications to a particular motivating example and compare the numerical results with those obtained with the original values., This work has been supported by the ERDF, the MINECO/AEI grants MTM2017-87197-C3-1-P, MTM2017-87197-C3-3-P, and by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2016-015 and ED431C-2017/38 and Centro Singular de Investigación de Galicia ED431G/01). The authors would like to thank two anonymous referees for their helpful suggestions to improve this article., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431C-2017/38, Xunta de Galicia; ED431G/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Null, Nullifying, and Necessary Agents: Parallel Characterizations of the Banzhaf and Shapley Values

  • Alonso-Meijide, José Mª
  • Costa, Julián
  • García-Jurado, Ignacio
This version of the article has been accepted for publication, after peer review, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10957-018-1403-5., [Abstract]: In a cooperative game, we consider three special kinds of agents: null, nullifying, and necessary agents. A coalition with a null agent receives the same payoff if this agent leaves the coalition, a coalition with a nullifying agent receives nothing, and a coalition without a necessary agent also receives nothing. The null agent property proposes zero payoff to any null agent. We introduce new properties that propose payoffs for nullifying and necessary players. With these three properties and additivity, we obtain new characterizations of the Banzhaf and Shapley values., This work has been supported by the ERDF, the MINECO/AEI grants MTM2017-87197-C3-1-P, MTM2017-87197-C3-1-P, and by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2016-015 and ED431C-2017/38 and Centro Singular de Investigación de Galicia ED431G/01)., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431C-2017/38, Xunta de Galicia; ED431G/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Necessary players and values

  • Gonçalves-Dosantos, J.C.
  • García-Jurado, Ignacio
  • Costa, Julián
  • Alonso-Meijide, José Mª.
This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10479-021-03950-3., [Abstract]: In this paper we introduce the Γ value, a new value for cooperative games with transferable utility. We also provide an axiomatic characterization of the Γ value based on a property concerning the so-called necessary players. A necessary player of a game is one without which the characteristic function is zero. We illustrate the performance of the Γ value in a particular cost allocation problem that arises when the owners of the apartments in a building plan to install an elevator and share its installation cost; in the resulting example we compare the proposals of the Γ value, the equal division value and the Shapley value in two different scenarios. In addition, we propose an extension of the Γ value for cooperative games with transferable utility and with a coalition structure. Finally, we provide axiomatic characterizations of the coalitional Γ value and of the Owen and Banzhaf-Owen values using alternative properties concerning necessary players., This work has been supported by the ERDF, the MINECO/AEI grants MTM2017-87197-C3-1-P, MTM2017-87197-C3-3-P, and by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2016-015, ED431C-2017-38 and ED431C-2020-14, and Centro Singular de Investigación de Galicia ED431G 2019/01). We also acknowledge the comments of two anonymous referees that have been very useful to improve this paper., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431C-2017-38, 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)

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