J4 ›› 2009, Vol. 44 ›› Issue (6): 46-50.
• 论文 • 上一篇 下一篇
吕雄伟,廖涛
收稿日期:
发布日期:
作者简介:
基金资助:
国家自然科学基金资助项目(70271022);高等学校博士学科专项科研基金
资助项目(20030613016)
Li Xiongwei, LIAO Tao
Received:
Published:
摘要:
针对带时间窗约束的邮政车辆路径问题,建立了带时间窗约束的最小车辆运输费用模型,考虑了车辆装载容量、时间窗、往返货物归集等约束条件,针对四川邮政11个市局的实际邮路安排问题,利用遗传算法对模型进行了求解计算和优化对比分析。优化结果表明,在目前邮路安排的基础上可以节约派车数、降低总费用、缩短实际邮运里程。
关键词: 车辆路径问题;遗传算法;邮政;时间窗
Abstract:
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 roundtrip 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.
Key words: vehicle routing problems(VRP); genetic algorithms; post; time windows
中图分类号:
. 基于遗传算法的带时间窗邮政车辆路径问题研究[J]. J4, 2009, 44(6): 46-50.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: http://lxbwk.njournal.sdu.edu.cn/CN/
http://lxbwk.njournal.sdu.edu.cn/CN/Y2009/V44/I6/46
Cited