190 0

Schematic Transit Network Design using Minimum Spanning Tree Algorithm

Title
Schematic Transit Network Design using Minimum Spanning Tree Algorithm
Author
김익기
Keywords
Bus Rapid Transit; Decision Making; Minimum Spanning Tree; Prim's Algorithm; Greedy Method
Issue Date
2018-04
Publisher
Eastern Asia Society for Transportation Studies
Citation
Journal of the Eastern Asia Society for Transportation Studies, v. 12, Page. 1299-1310
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.
URI
https://www.jstage.jst.go.jp/article/easts/12/0/12_1299/_article/-char/ja/https://repository.hanyang.ac.kr/handle/20.500.11754/105456
ISSN
1881-1124
DOI
10.11175/easts.12.1299
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > TRANSPORTATION AND LOGISTICS ENGINEERING(교통·물류공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE