Schematic Transit Network Design using Minimum Spanning Tree Algorithm
- Authors
- 김익기
- Issue Date
- Apr-2018
- Publisher
- Eastern Asia Society for Transportation Studies
- Keywords
- Bus Rapid Transit; Decision Making; Minimum Spanning Tree; Prim' s Algorithm; Greedy Method
- Citation
- Journal of the Eastern Asia Society for Transportation Studies, v.12, pp.1299 - 1310
- Journal Title
- Journal of the Eastern Asia Society for Transportation Studies
- Volume
- 12
- Start Page
- 1299
- End Page
- 1310
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/6319
- DOI
- 10.11175/easts.12.1299
- ISSN
- 18811124
- Abstract
- This study is focused on exploring the public transportation routes. Exploration of the alternative routes of the public transportation needs a simultaneous reflection of the locational connectivity, demand for the public transportation, operating costs of the public transportation routes, etc. This study proposes an exploration methodology of the alternative routes of the public transportation using the minimum spanning tree algorithm. Prim’s Algorithm was used to form the minimum spanning tree. Also, this study shows, as an example, that the explored alternative routes of the public transportation can change depending on the focus of the policy direction of the public transportation from the supply and demand perspective.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > DEPARTMENT OF TRANSPORTATION AND LOGISTICS ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/6319)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.