摘要
针对已有求解带硬时间窗车辆路径问题时插入启发式算法结构复杂、参数多、求解效率不高的缺点,提出了求解该问题的时差插入启发式算法。该算法引入时差的概念,将时差作为启发规则的评价指标。相比已有求解该问题的经典启发式算法,该算法有参数个数少、算法结构简单等特点。应用标准测试算例测试表明,所提算法的求解质量优于Solomon的插入启发式算法和Potvin的平行插入启发式算法。
The Vehicle Routing Problem with Hard Time Window（VRPHTW） is a kind of Vehicle Routing Problem（VRP） which has a lot of applications.The existing heuristics of this problem hold shortcomings such as complex structure,lots of parameters and low efficiency.Therefore,Time Difference Insertion Heuristics（TDIH） for VRPHTW was proposed.The algorithm introduced the concept of Time Difference（TD）,and took TD as a heuristic rule evaluation indicator.Compared to other classic heuristics,the algorithm was characterized with fewer parameters and simpler structure.The computational results on the benchmark problems show that the algorithm is better than the Solomon＇s insertion heuristics and Potvin＇s parallel insertion heuristics.
出处
《计算机应用》
CSCD
北大核心
2012年第11期3042-3043,3070,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目(70671108)
湖南省教育厅资助项目(10C0558)
关键词
车辆路径问题
时间窗
时差
插入启发式
Vehicle Routing Problem（VRP）
time window
Time Difference（TD）
insertion heuristics
