中文核心期刊
CSCD来源期刊
中国科技核心期刊
RCCSE中国核心学术期刊

重庆交通大学学报(自然科学版) ›› 2018, Vol. 37 ›› Issue (09): 79-86.DOI: 10.3969/j.issn.1674-0696.2018.09.13

• 交通运输工程 • 上一篇    下一篇

改进混合遗传算法在MTVRPTW中的建模与优化

宋强   

  1. (广东理工学院 信息工程系,广东 肇庆 526100)
  • 收稿日期:2017-02-13 修回日期:2017-05-06 出版日期:2018-09-10 发布日期:2018-09-10
  • 作者简介:宋强(1971—),男,河南安阳人,副教授,主要从事计算机控制技术及算法优化方面的工作。E-mail:aysq168@163.com。
  • 基金资助:
    广东省普通高校特色创新项目(2016KTSCX165);河南省重点科技攻关项目(14210221023);广东理工学院校基金(GKJ201801)

Application of Improved Hybrid Genetic Algorithm in the Modeling and Optimization of Multi-trip Vehicle Routing Problem with Time Windows

SONG Qiang   

  1. (Department of Information Engineering, Guangdong Polytechnic College, Zhaoqing 526100, Guangdong, P. R. China)
  • Received:2017-02-13 Revised:2017-05-06 Online:2018-09-10 Published:2018-09-10

摘要: 重点讨论了城市物流背景下带时间窗和发货时间的多行程车辆路径问题。即物流车辆把货物送到位于城市郊区的仓库,在工作日内,货物不断被送达仓库后并进行最终的分配。介绍了和货物相关的发货时间的概念,提出了一种基于新的辅助分割过程的改进混合遗传算法来解决这个问题,在时间窗和发货时间的限制条件下,结合给出的一组实例,通过和相关文献中的多种路径优化算法等进行比较,仿真实验证明这种算法具有较高的效率。

关键词: 交通运输工程, 混合遗传算法, 多行程车辆路径问题, 辅助分割, 时间窗, 发货时间

Abstract: The multi-trip vehicle routing problem with time windows and delivery time was discussed under the background of urban logistics. In the urban logistics context, trucks delivered merchandise to depots located in the outskirts of the city, and the goods were delivered to the warehouse continuously and the final allocation was made in the working days. The concept of delivery time associated with merchandise was introduced, and an improved hybrid genetic algorithm based on the new auxiliary segmentation process was proposed to solve this problem. Under the restriction of the time window and the delivery time, combined with a set of examples, the simulation experiments show that the proposed algorithm has high efficiency by comparing with the multi-trip optimization algorithms in the related literature.

Key words: traffic and transportation engineering, hybrid genetic algorithm, multi-trip vehicle routing problem, auxiliary partition, time windows, delivery time

中图分类号: