需求可拆分的应急物资调度问题的蚁群算法

应急物资调度问题是个典型的需求可拆分的车辆路径问题,区别于传统的车辆路径问题,将每个需求节点只能由一辆车访问的约束去除,允许需求节点由多辆车进行访问。针对应急物资调度问题的特点,建立相应的多目标车辆路径数学规划模型(SDVRP),并根据模型特点设计改进蚁群优化算法。最后,进行相应的算例分析,验证了该模型和算法的有效性。

Ant Colony Optimization Algorithm for Split Routing Problem of Dispatching Emergency Materials

The routing problem of dispatching emergency materials is a typical split delivery vehicle routing problem (SDVRP), which relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer demand. This paper provides a mathematical multi-objective model of SDVRP while dispatching emergency materials, and a corresponding improved ant colony optimization algorithm based on characteristic of the problem is designed to solve the problem. Eventually, a numeric example is provided to demonstrate the validity and feasibility of this proposed model and algorithm.