Schematic Transit Network Design using Minimum Spanning Tree Algorithm
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김익기 | - |
dc.date.accessioned | 2021-06-22T12:02:20Z | - |
dc.date.available | 2021-06-22T12:02:20Z | - |
dc.date.created | 2021-02-18 | - |
dc.date.issued | 2018-04 | - |
dc.identifier.issn | 18811124 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/6319 | - |
dc.description.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. | - |
dc.publisher | Eastern Asia Society for Transportation Studies | - |
dc.title | Schematic Transit Network Design using Minimum Spanning Tree Algorithm | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 김익기 | - |
dc.identifier.doi | 10.11175/easts.12.1299 | - |
dc.identifier.bibliographicCitation | Journal of the Eastern Asia Society for Transportation Studies, v.12, pp.1299 - 1310 | - |
dc.relation.isPartOf | Journal of the Eastern Asia Society for Transportation Studies | - |
dc.citation.title | Journal of the Eastern Asia Society for Transportation Studies | - |
dc.citation.volume | 12 | - |
dc.citation.startPage | 1299 | - |
dc.citation.endPage | 1310 | - |
dc.type.rims | ART | - |
dc.description.journalClass | 3 | - |
dc.subject.keywordAuthor | Bus Rapid Transit | - |
dc.subject.keywordAuthor | Decision Making | - |
dc.subject.keywordAuthor | Minimum Spanning Tree | - |
dc.subject.keywordAuthor | Prim&apos | - |
dc.subject.keywordAuthor | s Algorithm | - |
dc.subject.keywordAuthor | Greedy Method | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.