A Heuristic Algoritm For Planning Operating Strategies On Urban Bus Transit


Creative Commons License

Yardım M. S.

WCTR 04-10th World Conference On Transport Research, İstanbul, Turkey, 4 - 08 July 2004, vol.1, pp.656-657

  • Publication Type: Conference Paper / Summary Text
  • Volume: 1
  • City: İstanbul
  • Country: Turkey
  • Page Numbers: pp.656-657

Abstract

The aim of this study, developing a mathematical model for planning bus operating (express and/or all stop operation) strategies at a branched transit network with known characteristics. Inputs and outputs of the systems are defined, the decision process is described. In this study a mathematical model was formulated which satisfying a specific objective function for determining a group of lines with different lengths. It has been searched that for a bus operation some line configurations that included some specific operating types which minimized total passenger time and total operator cost at a bus transportation network. It is a hard task that make minimum operator cost and user cost simultaneously. For harmonizing these two controversial elements a solution method recommended that utilizes “total system cost” notion. 

After introducing the derivation of the mathematical model, an objective function for the minimization of the total system cost is generated. The combinatorial structure of the problem is shown and a heuristic solution method algorithm is proposed. By the end of this, the model is tested using some hypothetical and numerical examples and thus total system cost is significantly reduced compared with the initial solution. Especially, when the demand structure converges from many-to-many stations to one-to-one, a better improvement in cost is determined.

Keywords: Urban transportation network, bus transit, transportation cost, heuristic algorithm