Article
Version 1
Preserved in Portico This version is not peer-reviewed
Binary Particle Swarm Optimization Algorithm for Kidney Exchanges
Version 1
: Received: 21 December 2020 / Approved: 22 December 2020 / Online: 22 December 2020 (12:57:56 CET)
Version 2 : Received: 11 May 2021 / Approved: 14 May 2021 / Online: 14 May 2021 (11:03:30 CEST)
Version 2 : Received: 11 May 2021 / Approved: 14 May 2021 / Online: 14 May 2021 (11:03:30 CEST)
How to cite: Abdel-Rehim, W. M. F. Binary Particle Swarm Optimization Algorithm for Kidney Exchanges. Preprints 2020, 2020120563. https://doi.org/10.20944/preprints202012.0563.v1 Abdel-Rehim, W. M. F. Binary Particle Swarm Optimization Algorithm for Kidney Exchanges. Preprints 2020, 2020120563. https://doi.org/10.20944/preprints202012.0563.v1
Abstract
In this paper, we implement a Particle Swarm Optimization (PSO) based method for solving the kidney exchange problem. Because using a kidney exchange, we can help incompatible patient-donor couples to swap donors to receive a compatible kidney. Implementing Particle Swarm Optimization in solving the kidney exchange problem is an effective method because the obtained results indicate that PSO outperforms other stochastic-based methods such as Genetic Algorithm regarding the efficient the number of resulting exchanges.
Keywords
kidney exchange; Particle Swarm; Meta-heuristics; Optimization
Subject
Computer Science and Mathematics, Algebra and Number Theory
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment