首页 | 官方网站   微博 | 高级检索  
     

带时间窗和货物权重的车辆路径问题的研究
引用本文:朱才华,何渝.带时间窗和货物权重的车辆路径问题的研究[J].北京工商大学学报(自然科学版),2009,27(4):61-64,69.
作者姓名:朱才华  何渝
作者单位:北京工商大学,计算机与信息工程学院,北京,100048
摘    要:提出了带货物权重及时间窗的车辆路径问题在车辆数不确定条件下的一个新的求解算法.通过利用轮盘赌选择策略,既能使最优个体进入下一代,又避免了个体之间因为适应度不同而被选择进入下一代的机会相差很大,从而保证了下一代的多样性并提高了算法的收敛速度.选用cx交叉算子有效避开遗传算法的"早熟收敛",同时对路径划分算法进行优化,从而达到VRPTWW车辆数与路径双重优化.数值实验结果表明,此算法可以有效求得车辆路径问题的优化解或近似优化解,是求解车辆路径问题的一个较好的方案.

关 键 词:车辆路径问题  货物权重  时间窗  遗传算法

INVESTIGATE VRP PROBLEM WITH TIME WINDOW CONSTRAINTS AND MERCHANDISE WEIGHT COEFFICIENTS
ZHU Cai-hua,HE Yu.INVESTIGATE VRP PROBLEM WITH TIME WINDOW CONSTRAINTS AND MERCHANDISE WEIGHT COEFFICIENTS[J].Journal of Beijing Technology and Business University:Natural Science Edition,2009,27(4):61-64,69.
Authors:ZHU Cai-hua  HE Yu
Affiliation:College of Computer Science and Information Engineering;Beijing Technology and Business University;Beijing 100048;China
Abstract:This paper proposed a new genetic algorithm for solving vehicle routing problem with time window and weight under the uncertain vehicle number.Using the roulette wheel strategy the optimal individual can be selected into next generation.The phenomenon,which is there are significant differences between the opportunity to individuals selected into next generation according to their fitness,is also escaped.As a result,the next generation is more diversity and convergence rate is improved.The premature converge...
Keywords:vehicle routing problem  merchandise weight  time window  genetic algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号