Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Interest
Topics
Details

Details

008
Publications

2021

Fairness models for multi-agent kidney exchange programmes

Authors
Klimentova, X; Viana, A; Pedroso, JP; Santos, N;

Publication
Omega (United Kingdom)

Abstract
Nowadays there are several countries running independent kidney exchange programmes (KEPs). These programmes allow a patient with kidney failure, having a willing healthy but incompatible donor, to receive a transplant from a similar pair where the donor is compatible with him. Since in general larger patient-donor pools allow for more patients to be matched, this prompts independent programmes (agents) to merge their pools and collaborate in order to increase the overall number of transplants. Such collaboration does however raise a problem: how to assign transplants to agents so that there is a balance between the contribution each agent brings to the merged pool and the benefit it gets from the collaboration. In this paper we propose a new Integer Programming model for multi-agent kidney exchange programmes (mKEPs). It considers the possible existence of multiple optimal solutions in each matching period of a KEP and, in consecutive matching periods, selects the optimal solution among the set of alternative ones in such a way that in the long-term the benefit each agent gets from participating in the mKEP is balanced accordingly to a given criterion. This is done by use of a memory mechanism. Extensive computational tests show the benefit of mKEPs, when compared to independent KEPs, in terms of potential increase in the number of transplants. Furthermore, they show that, under different policies, the number of additional transplants each agent receives can vary significantly. More importantly, results show that the proposed methodology consistently obtains more stable results than methodologies that do not use memory. © 2020 Elsevier Ltd

2021

A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals

Authors
Silva, M; Pedroso, JP; Viana, A; Klimentova, X;

Publication
21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, September 9-10, 2021, Lisbon, Portugal (Virtual Conference).

Abstract

2021

The Sea Exploration Problem Revisited

Authors
Dionísio, J; Santos, Dd; Pedroso, JP;

Publication
Machine Learning, Optimization, and Data Science - 7th International Conference, LOD 2021, Grasmere, UK, October 4-8, 2021, Revised Selected Papers, Part I

Abstract

2020

Heuristics for Packing Semifluids

Authors
Pedroso, JP;

Publication
CoRR

Abstract

2020

A multi-objective Monte Carlo tree search for forest harvest scheduling

Authors
Neto, T; Constantino, M; Martins, I; Pedroso, JP;

Publication
European Journal of Operational Research

Abstract

Supervised
thesis

2021

Survival model analysis applied to kidney transplant data

Author
Karyn Silva de Azevedo

Institution
UP-FCUP

2021

A Mixed-Integer Optimization Model for Efficient Power Transformer Maintenance and Operation

Author
João Pedro Gonçalves Dionísio

Institution
UP-FCUP

2021

Connecting quantum computing and machine learning to improve quantum simulation and optimization

Author
Pedro Miguel Miranda Queiroz da Cruz

Institution
UP-FCUP

2020

Connections and advantages between quantum computing, machine learning, and quantum simulation

Author
Pedro Miguel Miranda Queiroz da Cruz

Institution
UP-FCUP

2020

Remote Sensing and Machine Learning Tools for Vegetation Monitoring

Author
Sofia Perestrelo de Vasconcelos Cardoso Pereira

Institution
UP-FCUP