The establishment of an optimal migration model for refugees Based on Dijkstra algorithm

In recent years, the problem of large-scale migration of refugees has not only become an international hotspot that has plagued many countries around the world. More than a million migrants and refugees crossed into Europe in 2015, sparking a crisis as countries struggle to cope with the influx, and creating division in the EU over how best to deal with resettling people [1]. Because of the limited choice of refugees, and limited capacity of the recipient countries, the first step is to deal with the allocation of refugees in various routes to different countries. In the second step, a lot of external events will be added to interfere. At this point, it is needed to test whether the model can maintain stability under the interference of certain dynamic factors. Therefore, the basic model needs to meet the conditions of dynamic planning, and Dijkstra algorithm is chosen to optimize the migration route for the refugees. Its advantage is that when the dynamic interference occurs, only some parameters are adjusted slightly, and the basic model is still applicable. Bayes statistical model is used to predict the rate of refugees leaving the transit countries. And the proportion of leaving refugees at each point of action can be obtained. Then, the optimal allocation of the refugees can be calculated based on integer programming.