• Title, Summary, Keyword: PA기반 목적통행

Search Result 2, Processing Time 0.025 seconds

A Study on the Modal Split Model Using Zonal Data (존 데이터 기반 수단분담모형에 관한 연구)

  • Ryu, Si-Kyun;Rho, Jeong-Hyun;Kim, Ji-Eun
    • Journal of Korean Society of Transportation
    • /
    • v.30 no.1
    • /
    • pp.113-123
    • /
    • 2012
  • This study introduces a new type of a modal split model that use zonal data instead of cost data as independent variables. It has been indicated that the ones using cost data have deficiencies in the multicollinearity of travel time and cost variables and unpredictability of independent variables. The zonal data employed in this study include (1) socioeconomic data, (2) land use data and (3) transportation system data. The test results showed that the proposed modal split model using zonal data performs better than the other does.

Development of One-to-One Shortest Path Algorithm Based on Link Flow Speeds on Urban Networks (도시부 가로망에서의 링크 통행속도 기반 One-to-One 최단시간 경로탐색 알고리즘 개발)

  • Kim, Taehyeong;Kim, Taehyung;Park, Bum-Jin;Kim, Hyoungsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.5
    • /
    • pp.38-45
    • /
    • 2012
  • Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.