银行运钞车线路规划.pdf

摘要
近年来，国内各大城市陆续建立了专业的金融押运企业，为银行网点的现钞
运送提供服务。为了实现运钞智能化，降低银行运营成本，需要对银行现钞运送
车辆路径规划提供决策支持。而银行运钞车路线规划问题是车辆路径规划的一个
实际应用。本文对银行运钞车路径规划设计了Petri网融合蚁群算法。
Petri网既有严谨的数学表达方式，又有直观的图形表达方式，能较好的描述并
发、顺序、异步、冲突等重要现象，现已成为强有力的系统建模和分析工具。蚁
群算法的蚂蚁觅食行为，通过信息素的正反馈机制使得蚂蚁找到全局最优的觅食
路径。
为了实现运钞车路径的全局优化，本文设计了 Petri 网融合蚁群算法。在着色
Petri 网的基础上，引入一种 TCPN（Timed Colored Petri nets:着色时间 Petri 网）模
型，并介绍了它的使能规则。引出动态托肯的概念，介绍了动态托肯的属性及其
在网络运行时的行为特征。对蚁群算法的概率选择规则进行了改进，在选择规则
中加入约束检验因子，对不符合约束的变迁以概率 0 将其排除。改变了禁忌表的
设置方式，以蚁群共享禁忌表替代传统禁忌表，既保证了对运钞车加钞路径的全
网遍历，又加快了问题的解算速度。通过 Petri 网融合蚁群算法与基本蚁群算法的
对比表明，用 Petri 网融合蚁群算法优化运钞车加钞路径问题，可快速有效地获得
问题的最优解。

关键词：运钞 TCPN 蚁群算法 路径规划
Abstract
In recent years, specialized financial escorting firms are found in major national
cities in succession, which provide service for bank cash transportation. In order to
intelligently transport cash and reduce bank operating costs, providing of
decision-making support is necessary. The routing and scheduling of a cash
transportation vehicle is a practical application of the vehicle routing problem. An
algorithm for the cash transportation vehicle routing and scheduling problem is
provided, which is a combined algorithm of Petri nets and ant colony.
Petri nets can be expressed by rigorous mathematical expressions and intuitive
graphs. With well description of concurrent, sequential, asynchronous, and conflict
event, Petri nets are powerful modeling and analysis tools. By utilizing information
pheromone the foraging behavior of ants provides a positive feedback mechanism.
Thereafter, the ants can find the global optimum foraging path.
By combing Petri nets and an ant colony, an algorithm is developed, which can
obtain the global optimization solution for the cash transportation vehicle routing