摘要
带时间窗的多车场车辆路径问题在基本车辆路径问题的基础上增加了"多车场"与"时间窗"两个约束条件,是一个典型的NP难解问题。将粒子群算法应用于带时间窗的多车场车辆路径优化问题,构造了一种适用于求解车辆路径问题的粒子编码方法,建立了相应的数学模型,在此基础上设计了相应的算法。算例通过和遗传算法、蚁群算法进行比较,证明了其搜索速度和寻优能力的优越性。
Multi-depot vehicle routing problem with time windows is a variation of the vehicle routing problem con- strained by multi-depot and time windows, which is a typical NP-hard problem. Particle swarm optimization with a particle coding method is designed to solve the problem. The mathematic mode is established and the solution algo- rithm is developed. The simulation results of example indicate that the algorithm has faster search speed and stron- ger optimization ability than the GA and ACO.
出处
《计算机工程与应用》
CSCD
2012年第27期27-30,共4页
Computer Engineering and Applications
基金
甘肃省教育厅科研项目(No.1118B-03)
西北民族大学中央高校基本业务费专项资金项目(No.ZYZ2011080)
关键词
时间窗
多车场
车辆路径优化
粒子群算法
time windows
multi-depot
vehicle routing problem
Particle Swarm Optimization（PSO）
