基于改进的动态聚类算法的配送车辆调度研究

研究了物流配送车辆调度优化问题,建立了以所需车辆数最少为第一目标,以车辆总行程最短为第2目标的双目标优化模型.把问题分成2阶段进行求解,第1阶段用改进的动态聚类算法分派车辆的配送任务,第2阶段用动态规划方法求出车辆的行车路线;实例证明,算法有效降低问题的复杂性,使问题在合理的时间内得到满意解,模型和算法均具有较大的推广意义.

Research on vehicle distribution problem based on advanced dynamic clustering algorithm

The vehicle distribution problem is considered,and the double-object optimal model with the minimization of total number of vehicles as the first object and the minimization of the total vehicle routes as the second object is established. The model is worked out by two steps: the first is allocating tasks for each vehicle by the advanced dynamic clustering algorithm;the second is finding out the route of each vehicle by dynamic programming. The practical application shows that the presented approach can reduce the complexity of the problem and the satisfactory solution can be obtained in reasonable time. Both the model and the approach may be applied widely.