有时间窗的开放式车辆路径问题及其遗传算法  

Study on Open Vehicle Routing Problem with Time Windows Limits and its Genetic Algorithm

作　　者：钟石泉[1] 杜纲[1] 贺国光[1] 

机构地区：[1]天津大学管理学院,天津300072

出　　处：《计算机工程与应用》2006年第34期201-204,共4页Computer Engineering and Applications

摘　　要：针对物流配送中的开放式车辆路径问题提出了OVRP的处理方法,并且根据容量和时间窗约束的特点设计了GA算法,设计了动态染色体,采用改进的交叉变异过程,利用随机参数的波动来协调容量约束和时间窗约束,并且加入了内部和外部扰动操作来跳出局部收敛点。通过试验,表明用GA在优化有容量和时间窗约束的OVRP的有效性。A method is presented to the open vehicle routing problem（OVRP）.Based on the feature of the limits,an improved genetic algorithm（GA） is proposed to optimize the OVRP with weight and time windows llmits.In the algorithm, some techniques such as dynamic chromosome,lmproved crossover and mutation,inside perturbation and outside perturbation are used.A random coefficient is designed to modulate the weight and time windows limits because of the difference between them.The experiment indicates the validity of the improved GA to the OVRP with weight and time windows limits.

关 键 词：开放式车辆路径问题 容量约束 时间窗约束 遗传算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]