A Hybrid Heuristic Algorithm for Solving MDVRPTW

摘要：

The most efficient algorithms for solving the multidepot routing problems with time windows (MDVRPTW) are the VNS and TS algorithms so far. But the computational time of those algorithms is too long to apply to the actual application,especially for large-scale cases. Some multi-phase approaches had shorter computational time than other algorithms, but the quality of their solutions is poor. The paper presents a novel hybrid heuristic for solving the MDVRPTW. The approach includes clustering, routing, and tour adjustment of three phases.Different from above algorithms, the approach adopts the repeated process of the three phases until the terminate condition is satisfied. The computational results show that the algorithm can obtain the acceptable optimum solutions in the reasonable time.

关键词： MDVRPTW heuristics local search algorithm, clustering

作者: HONG Lianxi DONG Shaohua HOU Wenying

作者单位: Machine Engineering College University of Science and Technology Beijing Beijing 100083, China;Compu Machine Engineering College University of Science and Technology Beijing Beijing 100083, China

会议类型: 国际会议

会议名称: 第二届国际计算机新科技与教育学术会议(Proceedings of the Second International Conference on Computer Science & Education ICCSE2007)

会议地点: 武汉

会议语种:英文

页码: 249-254

在线出版日期: 2007-07-25（万方平台首次上网日期，不代表论文的发表时间）