• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

计算机工程与科学

• 计算机网络与信息安全 • 上一篇    下一篇

基于动态DCVS网络模型的流量分析及规划方法

吴博1,王彬1,薛洁2,刘辉1,熊新1   

  1. (1.昆明理工大学信息工程与自动化学院,云南 昆明 650504;2.云南警官学院信息网络安全学院,云南 昆明 650223)
  • 收稿日期:2017-07-08 修回日期:2018-11-29 出版日期:2018-12-25 发布日期:2018-12-25
  • 基金资助:

    国家自然科学基金(61263017)

A flow analysis and planning method
based on dynamic DCVS network model

WU Bo1,WANG Bin1,XUE Jie2,LIU Hui1,XIONG Xin1   

  1. (1.Faculty of Information Engineering &Automation,Kunming University of Science & Technology,Kunming 650504;
    2.Faculty of Information Network Security,Yunnan Police College,Kunming 650223,China)
  • Received:2017-07-08 Revised:2018-11-29 Online:2018-12-25 Published:2018-12-25

摘要:

针对目前机场远端行李运输目的地编码车系统未对流量进行规划而造成的资源浪费现状,提出了一种基于动态DCVS网络模型的流量分析及规划方法。该方法首先基于图论建立了DCVS静态网络模型,接着根据系统在特定时间段的流量需求,采用最大流最小时间动态流量分析和规划算法对DCVS资源进行动态调度。实验结果显示,该方法可以在很短的时间内完成对DCVS流量的整体分析和规划,实现远端行李运输任务的可行性预测,从而为DCVS资源的控制提供有效的参考依据。

关键词: 机场行李运输, 目的地编码车, 流量分析与规划, 最大流最小时间

Abstract:

In order to solve the resource waste problem caused by lack of flow planning in the destination coded vehicle system (DCVS), we present a flow analysis and planning method based on dynamic DCVS network model. Firstly, we build a static DCVS network model using graph theory. Then, according to the package flow demands during a particular time period the flow analysis and planning method based on minimum time and maximum flow algorithm is applied to realize the dynamic DCVS resources scheduling. Experimental results show that this method can accomplish the overall flow analysis and planning of DCVS in a very short period, and achieve a reliable prediction for remote airport baggage transportation, thus providing an effective reference for DCVS resource control.
 

Key words: airport baggage transportation, destination coded vehicle, flow analysis and planning;maximum flow and minimum time