Multilevel programming model for multiple depots capacitated vehicle routing problem with urban hazmat Transportation

Hazardous materials accidents during the process of transportation have caused enormous danger and loss to life and environment in recent years. Especially in an urban area, high population density, heavy traffic congestion and link closures face the complex and changeable situations. In this study, a multilevel programming model is formulated to minimize the total risk and time for non-fixed destination multiple depot capacitated vehicle routing problem (non-fixed destination MDCVRP) with many factors. For obtaining the optimal solution to the proposed model, an improved biogeography-based algorithms (improved BBO) and Pareto optimization are designed. The results are compared to biogeographybased algorithms (BBO). Illustrative example demonstrates the effectiveness of the proposed model and algorithm.