Kidney exchange programmes increase the rate of living donor kidney transplants, and operations research techniques are vital to such programmes. These techniques, as well as changes to policy regarding kidney exchange programmes, are often tested using random instances created by a Saidman generator. We devise a new matheuristic that can optimally solve a benchmark set of Saidman instances in seconds: these instances have not been solved in under thirty minutes previously. This is possible as we take advantage of particular properties of these random instances that are noticeably different in real-world instances. We follow up this matheuristic with new techniques for generating random kidney exchange instances that are far more similar to real-world instances from the UK kidney exchange programme. This new process for generating random instances provides a more accurate base for comparisons of algorithms and models, and gives policy-makers a better understanding of potential changes to policy leading to an improved decision-making process.
Unpublished: Technical Report, University of Glasgow, May 2021