带时间窗的配送车辆路径问题模型及算法

An Algorithm to Solve VRP with Time Window of Distribution Process

针对传统带有时间窗的配送车辆路径问题,在传统的运距及容量等限制下,增加车辆在客户点的服务时间,以惩罚、配送总成本最低为目标,构建出带有时间窗的配送车辆路径问题的整数规划模型。并引入优良基因及最优个体保护策略改进遗传算法,设计了带时间窗的配送车辆路径问题的改进遗传算法,最后用实例证明了模型及遗传算法的有效性。

In this paper, in view of the traditional solution of the vehicle routing problem with time window Of the distribution process and under the traditional constraints such as transportation distance and capacity, we added in the service time of the vehicles at the customer locations, then with the minimal total penalty and distribution costs as the objective, established the integer programming model of the distribution vehicle routing problem with time window, improved it by introducing in the superior gene and optimal individual protection strategy, and at the end proved the validity of the model and the improved algorithm through an empirical case.