Online rescue vehicle scheduling problem of emergency logistics

Emergency logistics of natural disaster plays an important role in effectively controlling the casualties and reducing various disaster losses. The paper proposes k-rescue vehicles scheduling problem and considers this problem with two-stage algorithm based on online method. First stage, the paper proposes online rescue vehicle allocation strategies which include the reposition strategy, the lie over strategy and the mix strategy, and then analyzes their competitive ratio. Second stage, this paper designs selection strategies of online path which include the reposition strategy and the greedy strategy, and then analyzes their competitive ratio. Finally, based on the analysis and calculation of an example, the results indicate that the above models and methods are effective.