Finding the Nearest Blood Donors using Dijkstra Algorithm

Md. Sabir Hossain, Nayan Das, Muhammad Kamrul Hossain, Md. Al-Hasan


Now-a-days frequent mishaps like the road accident or other life-risking accident leading to operational emergencies are increasing day by day and the blood donor for such victims or patients are very hard to find in a short period. Sometimes it is really tough to collect the blood of the same group from the relatives of a patient in dying moments. The main objective of this work is to make a connection with these two groups who are in need of blood and who are willing to donate. We have determined the shortest distance between blood seeker and blood donors using the Dijkstra Algorithm. Anybody can contact the nearest blood donor of any group in a particular area quickly. By implementing this idea, the harassment of the victim can be lessened and so many lives can be saved.


Blood donor, Blood Seeker, Dijkstra’s algorithm, Shortest path, Nearest Donor

Full Text:



Thomas H. Cormen, Charles E. Leiserson, Ronald L. RIvest and Clifford Stein, “Introduction to Algorithms”, 1990, page no. 595

Robert Sedgewick and Kevin Wayne, “Algorithms”, Addison-Wesley, 2011, page no. 638

Wikipedia: Aug 5,2017: Available at

Dijkstra’s shortest path algorithm: Aug 5,2017, Available at

Risald, Antonio E. Mirino and Suyoto, “Best routes selection using Dijkstra and Floyd-Warshall algorithm”, Information & Communication Technology and System (ICTS), 2017 11th International Conference on 31-31 Oct. 2017.

Haijing Wang, Fangfang Zhang and Peng Cui, “A parking lot induction method based on Dijkstra algorithm”, Chinese Automation Congress (CAC), 2017.

Alican Bozyiğit, Gazihan Alankuş and Efendi Nasiboğlu, “Public transport route planning: Modified Dijkstra’s algorithm”, Computer Science and Engineering (UBMK), 2017 International Conference on 5-8 Oct. 2017.

Aram M. Ahmed, Sarkar Hasan Ahmed and Omed Hassan Ahmed, “Dijkstra algorithm applied: Design and implementation of a framework to find nearest hotels and booking systems in Iraqi”, Current Research in Computer Science and Information Technology (ICCIT), 2017 International Conference on 26-27 April 2017.

Said Broumi, Mohamed Talea, Assia Bakali and Florentin Smarandache, “Application of Dijkstra algorithm for solving interval valued neutrosophic shortest path problem”, Computational Intelligence (SSCI), 2016 IEEE Symposium Series on 6-9 Dec. 2016.

Yong Zhu, Xiaohuan Liu and Xiaohong Yu, “An optimal path algorithm of high security based on Dijkstra algorithm”, Sensor Network Security Technology and Privacy

Communication System (SNS & PCS), 2013 International Conference on 18-19 May 2013.

Mayur Parulekar, Viraj Padte, Talkien Shah, Kalind Shroff and Rahul Shetty, “Automatic vehicle navigation using Dijkstra's Algorithm”, Advances in Technology and Engineering (ICATE), 2013 International Conference on 23-25 Jan. 2013.

Yan Zhang and Jun Zhang, “Dijkstra's algorithm based robust optimization to airline network planning”, 2010 International Conference on Mechanic Automation and Control Engineering.

Yuqiang Li and Qianxing Xiong, “Dijkstra Algorithm Implementing Services Composing Way Selection”, Intelligent Systems and Applications (ISA), 2010 2nd International Workshop on 22-23 May 2010.

Stèphano M. M. Gonçalves, Leomar S. da Rosa and Felipe de S. Marques, “A survey of path search algorithms for VLSI detailed routing”, Circuits and Systems (ISCAS), 2017 IEEE International Symposium on 28-31 May 2017.

Jing Zhang, Jia Yu, Xiangju Qu and Yu Wu, “Path planning for carrier aircraft based on geometry and Dijkstra’s algorithm”, Control Science and Systems Engineering (ICCSSE), 2017 3rd IEEE International Conference on 17-19 Aug. 2017.



  • There are currently no refbacks.

SISFORMA: Journal of Information Systems | p-ISSN: 2355-8253 | e-ISSN: 2442-7888 | View My Stats

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.