ATIS에서 기종점의 경로인지특성을 반영한 경로정보제공방안
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 조종석 | - |
dc.contributor.author | 손기민 | - |
dc.contributor.author | 신성일 | - |
dc.date.accessioned | 2022-11-14T01:40:07Z | - |
dc.date.available | 2022-11-14T01:40:07Z | - |
dc.date.issued | 2005-12 | - |
dc.identifier.issn | 1738-0774 | - |
dc.identifier.issn | 2384-1729 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59016 | - |
dc.description.abstract | 교통망에서 경로의 총 통행비용은 통행비용과 인지비용으로 구분된다. 출발지와 도착지간에 상이하게 인지되는 비용을 고려하여 경로를 탐색하는 것은 전체경로를 열거해야 하는 문제 때문에 현실 적용에 한계가 있다. 따라서 현재 활용되고 있는 첨단교통정보체계(ATIS)에서 경로정보를 제공할 때 통행비용 만을 고려하여 경로를 탐색하는 기법을 적용하는 것이 일반적이다. 본 연구는 경로열거문제 없이 상이한 링크인지비용을 반영하는 최적 및 K 경로탐색기법을 제안한다. 이를 위해 링크를 경로의 최소단위로 정의하고, 따라서 두 링크의 비교가 경로의 비교로 확대되는 링크표지기반경로탐색기법을 활용하며, 도착지를 기반으로 후방향 최적링크인지경로트리를 구축한 후 출발지기반으로 전방향 최적의 링크총비용 경로트리를 구축하는 수식과 알고리즘을 제안한다. | - |
dc.description.abstract | Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm. | - |
dc.format.extent | 14 | - |
dc.language | 한국어 | - |
dc.language.iso | KOR | - |
dc.publisher | 한국ITS학회 | - |
dc.title | ATIS에서 기종점의 경로인지특성을 반영한 경로정보제공방안 | - |
dc.title.alternative | A Route Information Provision Strategy in ATIS Considering User's Route Perception of Origin and Destination | - |
dc.type | Article | - |
dc.identifier.bibliographicCitation | 한국ITS학회 논문지, v.4, no.3, pp 9 - 22 | - |
dc.description.isOpenAccess | N | - |
dc.citation.endPage | 22 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 9 | - |
dc.citation.title | 한국ITS학회 논문지 | - |
dc.citation.volume | 4 | - |
dc.identifier.url | https://koreascience.kr/article/JAKO200519129121362.page | - |
dc.publisher.location | 대한민국 | - |
dc.subject.keywordAuthor | Route Perception | - |
dc.subject.keywordAuthor | Link Label | - |
dc.subject.keywordAuthor | Optimal Path | - |
dc.subject.keywordAuthor | K Shortest Cost Path | - |
dc.subject.keywordAuthor | Entire Path Deletion | - |
dc.description.journalRegisteredClass | domestic | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang 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.