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

Computer Engineering & Science

Previous Articles     Next Articles

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

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