Medical emergency supplies dispatching vehicle path optimization based on demand urgency

Abstract

In recent years, the frequency of disasters, natural disasters, and other emergencies has been increasing worldwide. When an emergency occurs, effective rescue measures must be taken promptly to minimize the loss of life and property. In the process of rescuing casualties, a large amount of medical emergency supplies are urgently needed. Therefore, it is of great practical significance to study the vehicle path problem in medical emergency supplies dispatching. In this paper, we take the vehicle path optimization problem of medical emergency supplies dispatching considering the demand urgency as the research object, design the improved cuckoo-ant colony hybrid algorithm to solve the model based on the urgency analysis, and compare it with the ant colony algorithm and cuckoo algorithm to verify the efficiency of the designed algorithm. The results show that compared with the vehicle path scheme without considering the demand urgency, the path optimization scheme considering the demand urgency is more expensive and requires a small increase in time, but improves the efficiency and rationality of medical emergency supplies dispatching. The study of the emergency vehicle path problem can improve the weaknesses in the current emergency rescue decision-making, so that the emergency rescue work can be done quickly, economically, and reasonably, and provide a theoretical basis and suggestions for the emergency management department when making decisions.

Keywords

• tightness analysis
• vehicle scheduling
• path optimization
• cuckoo algorithm
• ant colony algorithm
• 65d15