用于肾脏交换的 Ant Lion 优化算法_java_代码_下载

## ALO_algorithm_for_Kidney_Exchanges <p align="justify"> Ant Lion Optimization is a bio-inspired stochastic-based algorithm that mimics the hunting behavior of ant lions when catching its preferable prey, i.e. ants. We used ALO algorithm to solve an optimization problem called Kidney Exchanges or Kidney Paired Donation, KPD. In the kidney exchange problem, patients with end-stage renal disease have relatives that are willing to donate their kidney but they have incompatible blood/tissue types. These patients constitute donor-patient couples and create a pool of pairs that are able to exchange their kidneys based on their blood/tissue type's compatibility.</p> <p align="justify"> Having a set of incompatible pairs, there is a possibility that a donor of a pair <b> <i> i </i> </b> is compatible with the patient of a pair <b> <i>j</i> </b> and vice versa. This case achieves mutual benefits among donor-patient pairs. The goal of ALO kidney exchange program is maximizing the number of possible matches (feasible cycles and chains) among the incompatible pairs in a given pool, and hence enhancing the success of kidney transplantation through living donors.</p> <p align="justify"> Ant Lion Optimization algorithm can be adopted easily for on-line exchanges and the integration of weights for hard-to-match patients, which will improve the future decisions of kidney exchange programs.</p> <br> <b>Copyright (C) 2017-2018, and GNU GPL, by Eslam Hamouda, Sara El-Metwally, and Mayada Tarek.</b> ## System requirements 32-bit/64-bit Windows machine with MATLAB 2010a or higher. ## Quick usage guide 1. Clone the [GitHub repo](https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges), e.g. with: > `git clone https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges.git` 2. Run using MATLAB `ALO_toolbox.m` in the repo directory. - The following window will appear to you! <img src="https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges/blob/master/Snapshots/image(1).png" class="centerImage" width="750" height="450"/> 3. You have two options: - Option 1: create a new KPD pool randomly and this will generate the following graph: - Each number represents patient/donor pairs , and red numbers denote altruistic donors. - Arcs represent the compatibility information between the nodes (i.e. pairs). - The bi-directional arcs drew by a black color. - An arc from n to m where n > m drew by a red color. - An arc from n to m where n < m drew by a blue color. <img src="https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges/blob/master/Snapshots/image(2).png" class="centerImage" width="750" height="450"/> - Option 2: load a KPD pool that previously generated from a simulation step. - To load your simulated data correctly, you should have two files: `Alt.txt` and `Edges.txt`. - File `Alt.txt` contains the altruistic donors information. - File `Edges.txt` contains the compatibility information represented by edges. <img src="https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges/blob/master/Snapshots/image(5).png" class="centerImage" width="750" height="450"/> <img src="https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges/blob/master/Snapshots/image(6).png" class="centerImage" width="750" height="450"/> 4. All extracted chains and cycles from a KPD pool generated from <b> step no. 3 </b> are shown in a list box entitled `All cycles and chains `. <img src="https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges/blob/master/Snapshots/image(7).png" class="centerImage" width="750" height="450"/> 5. Set ALO population size,`Pop. Size` , and the maximum number of iterations, `Generatio`. 6. Press `Run ALO` button to start the optimization process and find the maximum number of possible exchanges among the pool pairs. <img src="https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges/blob/master/Snapshots/image(3).png" class="centerImage" width="750" height="450"/> <img src="https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges/blob/master/Snapshots/image(8).png" class="centerImage" width="750" height="450"/> 7. The total number of exchanges/ matches returned by ALO is shown in the field entitled `The current fitness`. 8. The total number of exchanges/ matches returned by ALO followed by the post-processing step is shown in the field entitled `Number of matched`. 9. The resulting exchanges/ matches is listed in a list box entitled `Solution`. 10. If the resulting solution is non feasible (a solution contains nodes that are involved in multiple exchanges), the `Number of matched` will be displayed as `Infeasible Solution!`. <img src="https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges/blob/master/Snapshots/image(4).png" class="centerImage" width="750" height="450"/>