İnsani Yardım Lojistiği: Ankara’nın Çankaya İlçesindeki Mahallelere Covıd-19 Aşısının Dağıtılması

View/ Open
Date
2023Author
Sümer, Eylül
xmlui.dri2xhtml.METS-1.0.item-emb
Acik erisimxmlui.mirage2.itemSummaryView.MetaData
Show full item recordAbstract
Since November 2019, there has been a pandemic that has affected the whole world and has caused crises that will take time to repair both economically and socially internationally. Since the moment the Corona Virus started to spread, it has been on the agenda of the whole world, and vaccination studies are carried out by countries with great care in order to end this pandemic in which many people have lost their lives, more have managed to overcome but everyone in the world has been affected in some way. As a result of studies that lasted a year, Sinovac (China), Pfizer / Biontech (Germany), AstraZeneca (England), Sputnik V (Russia) and Moderna (USA) vaccines have proved to be successful at high rates.
With this development, countries are in the queue of vaccination and are aware of the importance of effective vaccination planning in terms of both economy and time savings in order to accelerate the normalization process.
In this study, three integer programming models that will deliver the vaccines from the Ministry of Health to the headman's offices in Çankaya in the shortest distance for people waiting for their turn to be vaccinated in the Çankaya district of Ankara were examined and compared. In the models, 115 neighborhoods of Çankaya Municipality were determined and the Ministry of Health was determined as the starting point. In the study, mathematical problems of Traveling Salesman Problem (GSP), Vehicle Routing Problem (ARP) and Cluster Decomposition (CA) were solved at 116 points and their results were compared. While solving the Vehicle Routing Problem, Clark-Wright Algorithm was applied and randomness and iteration improvements were used. The problem was solved with two different capacity vehicles and the effect of improvements and capacity on the solution was observed. In the Cluster Decomposition Problem, the problem is divided into different number of clusters and solved in 5 scenarios. MTZ Algorithm has been applied in the solution.