An Approach to Optimize the Departure Times of Transit Vehicles with Strict Capacity Constraints

Huimin Niu and Xiaopeng Tian

Mathematical Problems in Engineering, 2013, vol. 2013, 1-9

Abstract:

This paper focuses on an urban transit line which connects several residential areas and a workplace during the morning rush hours. The congestion is represented by some passengers who must wait for an extended duration and board the next or the third departure vehicles. This paper divides the time horizon equally into several small periods to measure the dynamic passenger demands. Under period-dependent demand conditions, a biobjective optimization model is developed to determine the departure times of transit vehicles at the start station with strict capacity constraints, in which a heuristic algorithm based on intelligent search and local improvement is designed to solve the model. The developed model can address the case in which more than two passengers arrive at a station simultaneously during one same period and calculate the number of boarded passengers. Finally, the model and algorithm have been successfully verified by a numerical example.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/471928.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/471928.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:471928

DOI: 10.1155/2013/471928

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().