带硬时间窗的共同配送车辆调度问题研究

针对带硬时间窗的共同配送车辆调度问题,提出Sweep算法和PMX算子相结合的遗传算法。以长株潭城市群生鲜食品共同配送中心区域内的配送数据作为实验对象,采用组合遗传算法进行分析,在客户要求的时间范围内,合理安排车辆的行驶路线,使共同配送总费用最低。最后,将本算法与启发式算法、遗传算法进行比较,分析结果表明,本算法得到的共同配送车辆调度方案更优。

On the Joint Distribution Vehicle Scheduling with Hard Time Windows

A genetic algorithm, with the sweep algorithm combined with PMX operators, has been introduced to solve the problem of the joint distribution vehicle scheduling with hard time windows. With the distribution data of fresh produce joint distribution center in the Greater Changsha Metropolitan Region a test subject, the genetic algorithm has been introduced to make an analysis of a proper vehicle routing arranged for the clients, with a minimum total distribution cost, according to their deadline requirements. The result of a comparison made between this algorithm, the heuristic algorithm and the genetic algorithm shows that this algorithm provides a better solution to the joint distribution vehicle scheduling.