计算机应用 ›› 2011, Vol. 31 ›› Issue (04): 1121-1124.DOI: 10.3724/SP.J.1087.2011.01121

• 人工智能 • 上一篇    下一篇

运钞车车辆路径规划策略

刘晓翀1,2,戴敏1,2,郑刚1,2,黄庆军1,2   

  1. 1. 天津理工大学 生物信号与智能处理实验室，天津 300384
    2. 天津理工大学 天津市智能计算与软件新技术重点实验室，天津 300384
  • 收稿日期:2010-09-16 修回日期:2010-11-20 发布日期:2011-04-08 出版日期:2011-04-01
  • 通讯作者: 黄庆军
  • 作者简介:刘晓翀(1987-),女,山西大同人，硕士研究生,主要研究方向:数据挖掘;
    戴敏(1972-),女（回族）,天津人,教授,主要研究方向:智能信息处理;
    郑刚(1970-),男,天津人,教授,主要研究方向：智能信息处理;
    黄庆军(1985-),男,河南开封人,硕士研究生,主要研究方向:数据挖掘。
  • 基金资助:
    天津市自然科学基金资助项目(10JCYBJC00700);天津市教委科技发展基金资助项目(SB20080052)

Vehicle Route Planning Study for Cash Transport Van

Xiao-chong LIU1,2,Min DAI1,2,Gang ZHENG1,2,Qing-jun HUANG1,2   

  1. 1. Laboratory of Biological Signal and Intelligent Processing, Tianjin University of Technology, Tianjin 300384, China
    2. Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384, China
  • Received:2010-09-16 Revised:2010-11-20 Online:2011-04-08 Published:2011-04-01
  • Contact: Qing-jun HUANG

PDF

摘要： 针对实际运钞网点数每天动态变化问题，提出一种先划分、再优化的动态运钞车路线规划策略。第一阶段先采用Dijkstra算法求出两点之间的最短路径，再利用最近邻算法和均衡工作量因子求出动态需求车辆的车辆数和每条路径上的网点；第二阶段利用前置交叉的改进遗传算法，分别优化每条路径并求出每条路径上的网点顺序，获得距离最短和时间最少的路径。实验结果表明，该策略能有效解决车辆数目和路径根据需求动态变化的问题，达到节约和合理利用资源的目的。

关键词: 车辆路径问题, 均衡工作量因子, 线路划分, 路径优化

Abstract: Since the real node number in cash transport network changes dynamically, a route planning strategy for dynamic cash transport routing was proposed. The strategy did partitioning and optimizing in sequence. Firstly, Dijkstra algorithm was adopted to compute the shortest route between two nodes, and then vehicle number and node on each route were gotten by nearest neighbor algorithm and workload balancing factor. Secondly, the pre-cross genetic algorithm was adopted to optimize each route and get node sequence on the route, which could get the route with shortest distance and minimum time consumption. The experimental results show that the proposed strategy can meet the requirements of dynamic vehicle number and route, and achieve the purpose of saving resources.

Key words: Vehicle Routing Problem (VRP), workload balancing factor, route partitioning, path optimization

中图分类号: 

版权所有 © 2021 四川计算机应用杂志社有限公司
蜀ICP备 05010208 号-3　新出网证(川)字026号
技术支持：北京玛格泰克科技发展有限公司
访问总数：
今日访问：