基于遗传算法的带时间窗邮政车辆路径问题研究  

Researches on post VRPTW based on genetic algorithm

作　　者：吕雄伟[1] 廖涛[1] 

机构地区：[1]西南交通大学经济管理学院,四川成都610031

出　　处：《山东大学学报（理学版）》2009年第6期46-50,共5页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(70271022);高等学校博士学科专项科研基金资助项目(20030613016)

摘　　要：针对带时间窗约束的邮政车辆路径问题,建立了带时间窗约束的最小车辆运输费用模型,考虑了车辆装载容量、时间窗、往返货物归集等约束条件,针对四川邮政11个市局的实际邮路安排问题,利用遗传算法对模型进行了求解计算和优化对比分析。优化结果表明,在目前邮路安排的基础上可以节约派车数、降低总费用、缩短实际邮运里程。The model of minimum freight cost with time windows has been built for the post VRP with time windows. It has been computed and comparatively analyzed by use of genetic algorithm on the real arrangements of eleven post paths among the Sicuan Province Post, which considered the restrict conditions such as vehicle loading capacity, time windows, and round-trip collection. The optimization results show that not only the total cost and the vehicle quantity are reduced, but also the real post transport mileages are shortened.

关 键 词：车辆路径问题 遗传算法 邮政 时间窗 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]