The Optimization Design of Emergency Logistics Distribution Path Based on Ant Colony Algorithm

The paper presents an improved ant colony optimization algorithm to solve the emergency logistics vehicle routing problem. Based on reasonable assumptions, the paper constructs emergency logistics vehicle routing problem with multi-objective mathematical model, by introducing the "emergency security breach cost" to achieve time binding of emergency logistics through the time window constraints penalty coefficient. It made the vehicle costs and the costs of emergency security breach smallest as the objective function to achieve the optimal model of the problem. The proposed algorithm can effectively solve the model, showing a good performance, to be able to make optimal decisions related personnel to provide a reference.