遗传算法下带软时间窗的异构车辆路径优化

Heterogeneous Vehicle Routing Optimization with Soft Time Window Based on Genetic Algorithm

目前研究的车辆配送路径问题一般采用单类型车辆进行配送,为贴合实际,在此基础上研究了带软时间窗约束的异构车辆配送路径问题。根据异构车辆的固定成本、运距成本、惩罚成本和其特有的约束条件,建立了异构车辆配送路径最小成本模型,采用遗传算法进行规划求解。同时建立带软时间窗的单类型车辆配送路径最小成本模型作为对比实验,通过对前后实验方案进行对照,结果显示,异构车辆配送方案可以有效降低配送成本,证实了算法的有效性和选用异构车辆配送方案的科学性。

In this paper,we studied the heterogeneous vehicle routing problem(HVRP)with soft time window constraint.In light of the fixed cost,haul distance cost,and penalty cost of heterogeneous vehicles,as well as their unique constraint conditions,we established the heterogeneous vehicle distribution route model with minimum cost,and used the genetic algorithm to solve it.At the same time,we built a homogeneous vehicle distribution route minimum cost model with soft time window constraint and used it as a control in a comparative experiment,according to the result of which,the heterogeneous vehicle distribution solution could effectively reduce distribution cost,confirming the effectiveness of the model and the algorithm.