Design of Refugee Migration Routes Based on Dijkstra Algorithm
Abstract
The migration route of refugees and comparison of factors are studied in this paper. According to that, there is a migration control scheme with the aim of maximum survivors during the migration. In this scheme, the risk coefficient has been abstract to quantify the different conditions of routes. Combined Dijkstra algorithm with integer programming, the model that aims at reduction mortality is set up for the main migration stage. During the external event jamming, we use cell automation to re-plan new routes and imitate the moving of refugees.
Keywords
Migration for Refugees, Integer Programming, Dijkstra Algorithm
DOI
10.12783/dtssehs/mess2016/9720
10.12783/dtssehs/mess2016/9720