In this paper, we implement a new method binary Particle Swarm Optimization (PSO) for solving the kidney exchange problem, which will improve the future decisions of kidney exchange programs. Because using a kidney exchange, we can help incompatible patient-donor couples to swap donors to receive a compatible kidney. Kidney paired donation programs provide an innovative approach for increasing the number of available kidneys. Further, we implementing binary particle swarm optimization in parallel with MATLAB with one, two, three and four threads and from the computations point of view, the authors compare the performance to reduce the running time for kidney exchange to match patients as fast as possible to help clinicians. Moreover, implementing binary particle swarm optimization in solving the kidney exchange problem is an effective method. The obtained results indicate that binary PSO outperforms other stochastic-based methods such as genetic algorithm, ant lion optimization, and efficient the number of resulting exchanges.