New algorithms for hierarchical optimisation in kidney exchange programmes

Delorme, M., García, S., Gondzio, J., Kalcsics, J., Manlove, D. and Pettersson, W. (2022) New algorithms for hierarchical optimisation in kidney exchange programmes. Operations Research, (doi: 10.1287/opre.2022.2374) (Early Online Publication)

[img] Text
277419.pdf - Published Version
Available under License Creative Commons Attribution.

1MB
[img] Text
277419Suppl1.pdf - Supplemental Material

2MB

Abstract

Many kidney exchange programs (KEPs) use integer linear programming (ILP) based on a hierarchical set of objectives to determine optimal sets of transplants. We propose innovative techniques to remove barriers in existing mathematical models, vastly reducing solution times and allowing significant increases in potential KEP pool sizes. Our techniques include two methods to avoid unnecessary variables, and a diving algorithm that reduces the need to solve multiple complex ILP models while still guaranteeing optimality of a final solution. We also show how to transition between two existing formulations (namely, the cycle formulation and the position-indexed chain-edge formulation) when optimizing successive objective functions. We use this technique to devise a new algorithm, which, among other features, intelligently exploits the different advantages of the prior two models. We demonstrate the performance of our new algorithms with extensive computational experiments modeling the UK KEP, where we show that our improvements reduce running times by three orders of magnitude compared with the cycle formulation. We also provide substantial empirical evidence that the new methodology offers equally spectacular improvements when applied to the Spanish and Dutch KEP objectives, suggesting that our approach is not just viable, but a significant performance improvement, for many KEPs worldwide.

Item Type:Articles
Additional Information:Funding: This work was supported by the Engineering and Physical Sciences Research Council [Grants EP/P028306/1 and EP/P029825/1].
Status:Early Online Publication
Refereed:Yes
Glasgow Author(s) Enlighten ID:Manlove, Professor David and Pettersson, Dr William
Authors: Delorme, M., García, S., Gondzio, J., Kalcsics, J., Manlove, D., and Pettersson, W.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Operations Research
Publisher:INFORMS
ISSN:0030-364X
ISSN (Online):1526-5463
Copyright Holders:Copyright © 2023 The Author(s)
First Published:First published in Operations Research
Publisher Policy:Reproduced under a Creative Commons license

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
300808IP-MATCH: Integer Programming for Large and Complex Matching ProblemsDavid ManloveEngineering and Physical Sciences Research Council (EPSRC)EP/P028306/1Computing Science