Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (35): 212-215.DOI: 10.3778/j.issn.1002-8331.2009.35.064

• 工程与应用 • Previous Articles     Next Articles

Study on grain logistics Vehicle Routing Problem with Time Windows

GE Hong-Yi,ZHEN Tong,JIANG Yu-Ying   

  1. College of Information Science and Engineering,Henan University of Technology,Zhengzhou 450001,China
  • Received:2008-12-23 Revised:2009-02-27 Online:2009-12-11 Published:2009-12-11
  • Contact: GE Hong-Yi


葛宏义,甄 彤,蒋玉英   

  1. 河南工业大学 信息科学与工程学院,郑州 450001
  • 通讯作者: 葛宏义

Abstract: Grain logistics Vehicle Routing Problem with Time Windows(VRPTM) is a typical NP-hard problem.According to the large batch and multi-point to multi-point transportation of grain logistics,a model of grain logistics VRPTM is built,and an algorithm of PSO(Particle Swarm Optimization) is proposed in solving VRPTW.Experiments are made to compare the algorithm with GA on solving this problem.The experimental results show that algorithm of PSO can solve grain logistics VRPTM quickly and efficiently,and reduce the cost of distribution.

摘要: 带时间窗的粮食物流车辆路径问题是一个典型的NP—难问题。针对粮食物流批量大、多点对多点等特点,建立了带时间窗的粮食物流车辆路径问题(Vehicle Routing Problem with Time Windows,VRPTM)的数学模型,进一步构造粒子群算法(Particle Swarm Optimization,PSO)用于问题求解,并将求解结果与遗传算法进行比较。结果表明,粒子群算法可以快速、有效地求得带时间窗的粮食物流车辆路径问题的优化解,降低配送成本。

CLC Number: