Prioritize Sustainable Development Goals using TOPSIS and Dijkstra Algorithm

The United Nations’ Sustainable Development Goals (SDGs) are all crucial to solving global problems. To make rapid improvements with limited resources and special funds, we ranked the 17 SDGs based on factors such as cost and feasibility, as well as interaction effects of SDGs. In this paper, we propose a dynamic scoring mechanism for SDGs based on graph theory, employing the Technique for Order of Preference by Similarity to the Ideal Solution (TOPSIS) algorithm and Dijkstra shortest path algorithm. By incorporating the evolving nature of SDGs, the correlation network among the goals is affected, consequently influencing the updated scoring results. The calculation results show that the highest initial score was 11, 12, 13 in SDGs, which are Sustainable Cities and Communities, Sustainable Consumption and Production, and Climate Action. Furthermore, this paper analyzes the influence of reasonable changes in SDGs on the scoring results.