CONSTRUCTION OF REALISTIC ROUTE CHOICE SETS USING MULTI-LABEL VINE-BUILDING FOR REAL-TIME TRAVELER INFORMATION PROVISION
- Authors
- KIM, Ikki; YU, Jeong Whon; Sohn, Keemin
- Issue Date
- 2005
- Publisher
- Eastern Asia Society for Transportation Studies
- Keywords
- alternative path set; shortest path; ATIS
- Citation
- Journal of the Eastern Asia Society for Transportation Studies, v.6, pp 2688 - 2701
- Pages
- 14
- Journal Title
- Journal of the Eastern Asia Society for Transportation Studies
- Volume
- 6
- Start Page
- 2688
- End Page
- 2701
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59017
- DOI
- 10.11175/easts.6.2688
- ISSN
- 1341-8521
1881-1124
- Abstract
- This paper proposes an algorithm to identify multiple alternative routes with the multi-label vine-building shortest path algorithm while incorporating turning penalties and prohibitions. The used shortest path algorithm keeps several node labels through the vine search and improves the backward tracing method by excluding all illogical movements at intersections. It also adopts the concept of the rational upper boundary in evaluating the realism of alterative routes considered. The multiple node labels used in the algorithm can foster more effectiveness of the routing advisories and information through analyzing alternative route characteristics in various ways. A simple network is used to analyze the applicability of the proposed algorithm to generate realistic route choice sets. The results show that the proposed algorithm is capable of incorporating various driver behavior classes. The reasonable multiple paths could be effectively used especially in application of ATIS operation which requires sophisticated alternative paths for each traveler.
- 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/59017)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.