Model and algorithm of relief materials dynamic scheduling without sufficient vehicle quantity
This paper focused on relief materials dynamic scheduling after large emergency.We quantified the loss of victims in terms of unmet needs,and formulated a mixed integer programming model in order to minimize victims' loss and vehicle scheduling expense.The main decisions were determining the delivery routes and allocating the relief supplies from relief distribution center (RDC) to save points without sufficient vehicle quantity.We used the hierarchical thinking to reduce solution space,improved the coding method and designed the genetic algorithm for this problem.Finally,experimental results show the dynamic scheduling scheme under different vehicle quantity,and determine the optimal vehicle quantity in RDC through comparative analysis,the validity of this model and algorithm is verified combining with realistic distribution scheme.
large emergencyinsufficient vehicle quantitydynamic schedulingoptimal vehicle quantity
NETL
NSTL
万方数据
维普
