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

Computer Engineering & Science

Previous Articles     Next Articles

Optimization of urban rail transit
scheduling based on BFO algorithm

LI Jin1,WANG Lian-guo2   

  1. (1.College of Engineering,Gansu Agricultural University,Lanzhou  730070;
    2.College of Information Science and Technology,Gansu Agricultural University,Lanzhou 730070,China)
  • Received:2015-10-12 Revised:2015-12-21 Online:2017-03-25 Published:2017-03-25

Abstract:

In order to formulate  a reasonable and effective dispatching scheme of urban rail transit and realize the optimal allocation of passengers flow and vehicles times, we propose an optimal urban rail transit scheduling based on the bacteria foraging optimization (BFO) algorithm. Taking into consideration the benefits of both enterprises and passengers and with departure interval as the variable, we establish an optimal model of dispatching and analyze the process of calculation and the solution to the model using the bacteria foraging optimization algorithm. The optimal targets are the shortest waiting time of passengers  and a minimum quantity of dispatching vehicles. Stimulation experiments on the actual operation data of the No.1 rail transit in a city show that the BFO algorithm and the dispatching model can solve the problem of urban rail transit optimization effectively.
 

Key words: intelligent optimization algorithm, bacteria foraging optimization (BFO), urban rail transit scheduling, scheduling optimization model, departure interval