Optimizing Train-Stop Positions Along a Platform to Distribute the Passenger Load More Evenly Across Individual Cars
- Authors
- Sohn, Keemin
- Issue Date
- Jun-2013
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Loading diversity; metro crowding; public transport; train-stop location
- Citation
- IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, v.14, no.2, pp 994 - 1002
- Pages
- 9
- Journal Title
- IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
- Volume
- 14
- Number
- 2
- Start Page
- 994
- End Page
- 1002
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/14595
- DOI
- 10.1109/TITS.2013.2252166
- ISSN
- 1524-9050
1558-0016
- Abstract
- Crowding in metro trains is a major factor in determining both the passenger service level and the operator supply level. An uneven distribution in passenger load across individual cars of a train exacerbates the overall capacity loading of a metro transit system. A loading diversity factor has been adopted to adjust the effect when computing the capacity of a metro train. The passenger preference for a specific car of a train was found to depend upon minimizing the walking distance at destination stations. This paper is focused on the possibility that a passenger load could be more evenly dispersed by varying train-stop positions. This paper proposes a mathematical programming model to find the optimal train-stop position at each station of a hypothesized metro line. The objective function is set to minimize the discrepancies in passenger loading across individual cars. After applying a genetic algorithm to solve the proposed model, differentiating train-stop positions considerably improved the distribution of passenger loading.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/14595)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.