苏州A银行运钞车路径问题的研究
发布时间：2018-11-28 19:03
【摘要】：随着城市化进程的加速,城市的规模日益变大,银行为了方便人民的存取款业务要求,纷纷增加办理网点。然而由于金融行业的特殊性,网点一般不设置金库,现金和票据需要每天按时有效的进行专门投送和收取。网点数量多和分散性,导致运钞车运行路径规划难度的加大。运钞车路径优化问题是一个NP-Hard问题,遗传算法对其近似最优解的求取有很好的效果。
[Abstract]:With the acceleration of the urbanization process, the scale of the city is becoming larger and larger. In order to facilitate the people's deposit and withdrawal business, banks have increased the processing network. However, due to the particularity of the financial industry, the network does not generally set up a vault, cash and bills need to be delivered and received on time and on time. The number and dispersion of dot points lead to the increase of difficulty in route planning of cash truck. The route optimization problem of cash truck is a NP-Hard problem. Genetic algorithm has a good effect on finding the approximate optimal solution.
【学位授予单位】：苏州大学
【学位级别】：硕士
【学位授予年份】：2013
【分类号】：F832.3;F252
本文编号：2363986
[Abstract]:With the acceleration of the urbanization process, the scale of the city is becoming larger and larger. In order to facilitate the people's deposit and withdrawal business, banks have increased the processing network. However, due to the particularity of the financial industry, the network does not generally set up a vault, cash and bills need to be delivered and received on time and on time. The number and dispersion of dot points lead to the increase of difficulty in route planning of cash truck. The route optimization problem of cash truck is a NP-Hard problem. Genetic algorithm has a good effect on finding the approximate optimal solution.
【学位授予单位】：苏州大学
【学位级别】：硕士
【学位授予年份】：2013
【分类号】：F832.3;F252
【参考文献】
相关期刊论文 前1条
1 李天龙;吕勇哉;;基于自组织优化算法的一类多旅行商问题[J];计算机应用;2010年02期
，本文编号：2363986
本文链接：https://www.wllwen.com/guanlilunwen/bankxd/2363986.html
