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.
Emergency Logistics Online Problem Vehicle Scheduling Competitive Ratio
ZENG Mingang YU Gaohui
School of Business Administration South China University of Technology Guangzhou, 510640, China
国际会议
北京
英文
322-325
2011-08-08（万方平台首次上网日期，不代表论文的发表时间）