Vehicle Routing for Medical Supplies with Multi-Depots in Large-Scale Emergencies
In this paper, we consider a vehicle routing probleM with multi-depots and time windows, and delivery can be split. Each depot has limited supplies and a fleet of vehicles, while each demand node has an expected deadline for its requirement In fact, the deadline may be exceeded and equity is also considered. Our objective is to minimize the total weighted time delay and the maximum unsatisfied rate. An important application of the presented model is to distribute medical supplies to response to large-scale emergencies, such as natural disasters, decease outbreaks in which the supplies must be sent to cover all demands in the recommended response time. We formulate a new model that describes the vehicle routing problem for large-scale emergency scenario. a quick heuristic algorithm is designed to obtain a fleet dispatching plan. This algorithm can be very useful for emergency responder to best use the available vehicles in case of emergencies.
Vehicle Routing Problem multi-depots Large-Scale Emergency
Jianming Zhu Wenguo Yang Jun Huang Degang Liu Jiye Han
College of Engineering, Graduate University of Chinese Academy of Sciences, Beijing 100049, P.R. Chi Institute of Applied Mathematics, Academy of Mathematics and Systems Science, CAS,Beijing 100080, P.
国际会议
The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)
长沙
英文
321-326
2009-06-01（万方平台首次上网日期，不代表论文的发表时间）