装卸混合的软时间窗VRP问题混合算法研究

Study on Mixed Algorithm for Vehicle Routing Problem with Soft Time Windows about Backhauls

考虑了配送车辆在客户点会同时发生卸货和装货的情况,构建了装卸混合的软时间窗VRP模型,并通过遗传禁忌混合算法求解。通过实例说明,该混合遗传算法能很好地解决装卸货混合VRPTW问题,获得较好的优化效果。

Considering the delivery and pickup by vehicles at each customer, this paper builds a mathematical model about vehicle routing problem with soft time windows about backhauls, designs a mixed algorithm based on genetic algorithm and tabu algorithm to solve this problem. The experiment results shows, this mixed algorithm can commendably solve vehicle routing problem with soft time windows about backhauls, and have a good effect of optimization.