In this project, I have used MPI for parallelising Red deer algorithm (RDA) for solving Travelling salesman problem (TSP). RDA is a meta-heuristic algorithm inspired by the unique mating process of scottish red deers.
For detailed description of the project, kindly refer to DOCUMENTATION.pdf.
Parallel code using MPI: RDA_MPI.py
Sequential Code: RDA.py
References:
Lawrence V. Snyder, Mark S. Daskin, A random-key genetic algorithm for the generalized traveling salesman problem, European Journal of Operational Research, Volume 174, Issue 1, 2006, Pages 38-53, ISSN 0377-2217, https://doi.org/10.1016/j.ejor.2004.09.057.
R. Guha, B. Chatterjee, K. H. Sk, S. Ahmed, T. Bhattacharya, R. Sarkar, “Py_FS: A Python Package for Feature Selection using Meta-heuristic Optimization Algorithms”, accepted for publication in Springer AISC series of 3rd International Conference on Computational Intelligence in Pattern Recognition (CIPR-2021) to be held on 24-25 April, 2021, Kolkata, India.
Fathollahi-Fard, A.M., Hajiaghaei-Keshteli, M. & Tavakkoli-Moghaddam, R. Red deer algorithm (RDA): a new nature-inspired meta-heuristic. Soft Comput 24, 14637–14665 (2020). https://doi.org/10.1007/s00500-020-04812-z