计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (26): 217-222.

• 工程与应用 • 上一篇    下一篇

MDVRPTW问题多阶段迭代启发式算法

洪联系1,2,董绍华1   

  1. 1.北京科技大学 机械工程学院,北京 100083
    2.集美大学 计算机工程学院,福建 厦门 361021
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-09-11 发布日期:2007-09-11
  • 通讯作者: 洪联系

Multi-phase iterative heuristic approach for solving MDVRPTW

HONG Lian-xi1,2,DONG Shao-hua1   

  1. 1.University of Science and Technology Beijing,Beijing 100083,China
    2.Jimei University,Xiamen,Fujian 361021,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-09-11 Published:2007-09-11
  • Contact: HONG Lian-xi

摘要: 提出一个求解多车库VRPTW问题的聚类和迭代混合遗传算法。该算法采用三阶段过程:客户聚类分配、路径规划和路径改进,与以往两阶段算法不同,该算法采用混合遗传算法进行路径规划,采用竞争-插入进行路径改进,且路径规划与路径改进有机结合形成迭代路径规划过程。用Cordeau等人提出的算例实验表明该算法能够在可以接受的计算时间内得到可接受的好解。

关键词: MDVRPTW, 混合遗传算法, 聚类

Abstract: The paper proposes a iterative hybrid genetic algorithm based on nodes clustering for solving multi-depot vehicle routing problem with time windows.The approach adopts three phases procedure:customers clustering assignment,routing and routes improvement.Differing from two phases’ algorithm,the algorithm adopts the hybrid genetic algorithm for routing,adopts competition-insertion for improvement routes,and combines the routing with improvement routes to form an iterative routing procedure.The computation results of the instances that are proposed by Cordeau et al. show that the algorithm can gain acceptable good solutions in the reasonable time.

Key words: Multi-Depot Vehicle Routing Problem with Time Windows(MDVRPTW), hybrid genetic algorithm, clustering