A practical tool to optimise transit schedule timing points and slack times: An ant algorithm application

Mazloumi, E, Currie, G, Rose, G, Ceder, A and Moridpour, S 2011, 'A practical tool to optimise transit schedule timing points and slack times: An ant algorithm application', in The 90th Transportation Research Board Annual Meeting, Washington, DC, United States, 23-27 January 2011, pp. 1-18.


Document type: Conference Paper
Collection: Conference Papers

Title A practical tool to optimise transit schedule timing points and slack times: An ant algorithm application
Author(s) Mazloumi, E
Currie, G
Rose, G
Ceder, A
Moridpour, S
Year 2011
Conference name The 90th Transportation Research Board Annual Meeting
Conference location Washington, DC, United States
Conference dates 23-27 January 2011
Proceedings title The 90th Transportation Research Board Annual Meeting
Publisher Transportation Research Board
Place of publication Washington, DC, United States
Start page 1
End page 18
Total pages 18
Abstract Transit Schedule Design (TSD) in this work is defined as selecting the location of timing points and the slack times associated with them. The selection of these variables affects several cost components such as waiting time cost of boarding passengers, in-vehicle waiting time cost of through passengers and the operational cost of transit vehicles. To make a balance between these cost components, the TSD problem must be treated as an optimization problem where the objective is to select a set of timing points and corresponding slack times such that a generalized cost function is minimized. However, this problem takes a considerable amount of time to solve when there are numerous timing point/slack time options. This paper designs a practical algorithm based on the Ant algorithm optimization technique to find an optimal TSD. To check the performance of the algorithm, it is calibrated using the generated data from micro-simulation modelling of a bus route in Melbourne, Australia. The results demonstrate the ability of the developed algorithm to solve the problem for the modelled bus route in a manageable processing time. When the problem becomes more complex, i.e. more feasible schedule designs, the algorithm examines a lower portion of the feasible designs to reach the solution. The paper presents a range of practical benefits of the algorithm in bus route planning.
Subjects Transport Engineering
Keyword(s) Algorithms
bus routes
cost functions
Melbourne (Australia)
optimisation
public transit
schedules and scheduling
slack time
traffic signal timing
transit vehicle operations
Versions
Version Filter Type
Access Statistics: 178 Abstract Views  -  Detailed Statistics
Created: Mon, 09 Jul 2012, 07:36:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us