基于膜计算的VRPTW启发式算法研究

Research on the Heuristic Algorithm of VRPTW Based on Membrane Computing

使用传统的启发式算法求解带时间窗的车辆路径问题(VRPTW)所得解的质量不高。本研究受计算机领域膜计算思想的启发,设计出了将蚁群系统和禁忌搜索算法有效结合的改进算法,即VRPTW-ECP系统。最后使用算例分析来验证算法有效性,实验结果表明,该算法在计算效率与结果质量上均优于其它启发式算法。

The qualities of the solutions to the vehicle routing problem with time windows （VRPTW） solving via tradi- tional heuristic algorithms are not good enough. Inspired by the membrane computing, an improved algorithm containing the ant colony system and tabu search was designed,and it was named VRPTW-ECP system. The validity and efficiency of the algorithm has been testified by the experiments. The results show that our algorithm is better than other heuristic algorithms concerning the computing efficiency and qulities of the solutions.