• Title/Summary/Keyword: Origin-Destination Matrix

Search Result 36, Processing Time 0.024 seconds

Selection of the Optimal Traffic Counting Links using Integer Program Method for Improving the Estimation of Origin Destination Matrix (기종점 OD행렬의 추정력 향상을 위한 교통량 관측구간 선정)

  • Lee, Heon-Ju;Lee, Seung-Jae;Park, Yong-Kil
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.57-66
    • /
    • 2004
  • When we estimate an origin-destination matrix from traffic counts. origin-destination matrix estimation from traffic counts according to the selected optimal traffic counting links is method for improving the results of origin-destinaation matrix estimation and for increasing economic efficiency. This paper proposed model of selecting traffic counting links using integer program technique, and selected a traffic counting links using this model, and estimated and origin-destingtion matrix from traffic counts according to the selected optimal traffic counting links. Also, we compared a result of estimating origin-destination matrix from the selected optimal traffic counting links using this model to a result of estimating origin-destination matrix from the randomly selected traffic counting links. The error analysis result was more improved a result of origin-destination matrix estimation using this model than a result of randomly selected links.

Development of a quasi-dynamic origin/destination matrix estimation model by using PDA and its application (통행 단말기 정보를 이용한 동적 기종점 통행량 추정모형 개발 및 적용에 관한 연구)

  • Lim, Yong-Taek;Choo, Sang-Ho;Kang, Min-Gu
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.6
    • /
    • pp.123-132
    • /
    • 2008
  • Dynamic origin-destination (OD) trip matrix has been widely used for transportation fields such as dynamic traffic assignment, traffic operation and travel demand management, which needs precise OD trip matrix to be collected. This paper presents a quasi-dynamic OD matrix estimation model and applies it to real road network for collecting the dynamic OD matrix. The estimation model combined with dynamic traffic assignment program, DYNASMART-P, is based on GPS embedded in PDA, which developed for collecting sample dynamic OD matrix. The sample OD matrix should be expanded by the value of optimal sampling ratio calculated from minimization program. From application to real network of Jeju, we confirm that the model and its algorithm produce a reasonable solution.

Prediction of Volumes and Estimation of Real-time Origin-Destination Parameters on Urban Freeways via The Kalman Filtering Approach (칼만필터를 이용한 도시고속도로 교통량예측 및 실시간O-D 추정)

  • 강정규
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.7-26
    • /
    • 1996
  • The estimation of real-time Origin-Destination(O-D) parameters, which gives travel demand between combinations of origin and destination points on a urban freeway network, from on-line surveillance traffic data is essential in developing an efficient ATMS strategy. On this need a real-time O-D parameter estimation model is formulated as a parameter adaptive filtering model based on the extended Kalman Filter. A Monte Carlo test have shown that the estimation of time-varying O-D parameter is possible using only traffic counts. Tests with field data produced the interesting finding that off-ramp volume predictions generated using a constant freeway O-D matrix was replaced by real-time estimates generated using the parameter adaptive filter.

  • PDF

Analysis on the Spatial Accessibility of Mental Health Institutions Using GIS in Gangwon-Do (GIS를 이용한 정신의료기관의 공간적 접근성 분석 - 강원도지역을 대상으로)

  • Park, Ju Hyun;Park, Young Yong;Lee, Kwang-Soo
    • Korea Journal of Hospital Management
    • /
    • v.23 no.2
    • /
    • pp.28-41
    • /
    • 2018
  • Purpose: This study purposed to analyze the spatial accessibility of mental health institutions in Ganwon-Do using Geographic Information System and to suggest policy implications. Methodology: Network analysis was applied to assess the spatial accessibility of mental health institutions in Gangwon-Do. To perform the network analysis, network data set was built using administrative district map, road network, address of mental health institutions in Gangwon-Do. After building network data set, Two network analysis methods, 1) Service area analysis, 2) Origin Destination cost matrix were applied. Service area analysis calculated accessive areas that were within specified time. And using Origin Destination cost matrix, travel time and road travel distance were calculated between centroids of Eup, Myeon, Dong and the nearest mental health institutions. Result: After the service area analysis, it is estimated that 19.63% of the total areas in Gangwon-Do takes more than 60 minutes to get to clinic institutions. For hospital institutions, 23.08% of the total areas takes more than 60 minutes to get there. And 59.96% of Gangwon-do takes more than 30 minutes to get to general hospitals. The result of Origin-Destination cost matrix showed that most Eup Myeon Dong in Gangwon-Do was connected to the institutions in Wonju-si, Chuncheon-si, Gangneung-si. And it showed that there were large regional variation in time and distance to reach the institutions. Implication: Results showed that there were regional variations of spatial accessibility to the mental health institutions in Gangwon-Do. To solve this problem, Several policy interventions could be applied such as mental health resources allocation plan, telemedicine, providing more closely coordinated services between mental health institutions and community mental health centers to enhance the accessibility.

The Estimation of an Origin-Destination Matrix from Traffic Counts using Conjugate Gradient Method in Nationwide Networks (관측교통량 기반 기종점 OD행렬 추정모형의 대규모 가로망에 적용(CG모형 적용을 중심으로))

  • Lee, Heon-Ju;Lee, Seung-Jae
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.61-71
    • /
    • 2005
  • We evaluated the availability of Origin-Destination Matrix from traffic counts Using conjugate gradient method to large scale networks by applying it to the networks in 246 zones. As a result of the analysis of the consistency of the model on Nationwide Networks, the upper and lower levels in model had the systematic relationship internally. From the analysis of the estimable power or the model according to the number of traffic counting links, the error in traffic volume had the estimable power in the range of permissible error. In addition, the estimable power of estimation of an Origin-Destination Matrix was more satisfactory than that of existing methods. We conclude that conjugate gradient method cab be applied to nationwide networks if we can make sure that the algorithm of the developed model is reliable by doing various kinds of experiment.

Estimation of Sodium Hydroxide Waste Origin-Destination Matrices for Preventing Hazardous Material Transportation Disasters

  • Kim, Geun-Young;Jung, Tae-Hwa;Kim, Sang-Won
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.9 no.1
    • /
    • pp.73-79
    • /
    • 2009
  • Hazardous materials (HazMats) are substances that are flammable, explosive, toxic, or harmful, if released into the environment. Since the transportation of HazMats increases in many developed countries, HazMat transportation has the key function in the process of HazMat usage to trace information of production, storage, shipment, usage, and waste disposal. The Korean Ministry of Environment (KMOE) and the National Emergency Management Agency (NEMA) have developed many laws, regulations, and standards for hazardous materials. However, the Korean HazMat laws, regulations, and standards do not guarantee accurate information of HazMat origin-destination (O-D) shipments, though the HazMat O-D movement is the critical information in safety and security of HazMat transportation. The objectives of this research are: (1) to investigate emerging and recurrent issues in Korean HazMat transportation, and (2) to develop the estimation method of O-D matrices for hazardous materials under limited data sets. The sodium hydroxide waste shipment among forty candidate HazMats is selected as the sample research case. The growth-factor method is applied to estimate the 2005 O-D matrix of sodium-hydroxide waste shipment. The column-and-row factoring process is used to calibrate the estimated sodium-hydroxide O-D matrix. The result shows the applicability of the O-D estimation process for hazardous materials. The Sodium Hydroxide Waste Origin-Destination Matrix is obtained to trace routes and paths of the Sodium Hydroxide transportation.

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium

  • Sung, Ki-Seok;Rakha, Hesham
    • Management Science and Financial Engineering
    • /
    • v.15 no.1
    • /
    • pp.51-69
    • /
    • 2009
  • A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

The Spatial Accessibility of Women in Childbearing Age for Delivery Services in Gangwon-do (강원도 지역 가임기 여성의 분만서비스 접근성 분석)

  • Choi, Soyoung;Lee, Kwang-Soo
    • Health Policy and Management
    • /
    • v.27 no.3
    • /
    • pp.229-240
    • /
    • 2017
  • Background: This study purposed to analyze the spatial accessibility of women in childbearing age to the healthcare organizations (HCOs) providing delivery services in Gangwon-do. Methods: Network analysis was applied to assess the spatial accessibility based on the travel time and road travel distance. Travel time and travel distance were measured between the location of HCOs and the centroid of the smallest administrative areas, eup, myeon, and dong in Gangwon-do. Korean Transport Database Center provided road network GIS (Geographic Information System) Database in 2015 and it was used to build the network dataset. Two types of network analysis, service area analysis and origin-destination (OD)-cost matrix analysis, applied to the created network dataset. Service area analysis defined all-accessible areas that are within a specified time, and OD-cost matrix analysis measured the least-cost paths from the HCOs to the centroids. The visualization of the number of the HCOs and the number of women in childbearing age on the Ganwon-do map and network analysis were performed with ArcGIS ver. 10.0 (ESRI, Redlands, CA, USA). Results: Twenty HCOs were providing delivery services in Gangwon-do in 2016. Over 50% of the women in childbearing age were aged more than 35 years. Service area analysis found that 89.56% of Gangwon-do area took less than 60 minutes to reach any types of HCOs. For tertiary hospitals, about 74.37% of Gangwon-do area took more than 60 minutes. Except Wonju-si and Hoengseong-gun, other regions took more than 60 minutes to reach the tertiary hospital. Especially, Goseong-gun, Donghae-si, Samcheok-si, Sokcho-si, Yanggu-gun, Cheorwon-gun, and Taebaek-si took more than 100 minutes to the tertiary hospital. Conclusion: This study provided that the accessibility toward the tertiary hospital was limited and it may cause problems in high-risk delivery patients such as over 35 years. Health policy makers will need to handle the obstetric accessibility issues in Gangwon-do.

Assessment on the Spatial Accessibility of Medical Institutions Providing National Gastric Cancer Screening Service using a geographic information system - Focused on the Area of Gangwon-do - (지리정보시스템을 이용한 국가 위암검진서비스 제공 의료기관에 대한 공간적 접근성 평가 - 강원도 지역을 중심으로 -)

  • Park, Young-Yong;Park, Ju-Hyun;Park, Yu-Hyun;Lee, Kwang-Soo
    • The Korean Journal of Health Service Management
    • /
    • v.13 no.1
    • /
    • pp.15-30
    • /
    • 2019
  • Objectives: This study aimed to analyze people's accessibility to medical institutions providing national gastric cancer screening services in Gangwon-do using a geographic information system(GIS). Methods: To assess the spatial accessibility, network analysis was applied. Two types of network analysis-Service area analysis and origin-destination cost matrix(OD-cost matrix)-were applied to create network dataset. Results: The results of the analysis of the service area revealed that it took more than 60 minutes each to reach tertiary hospitals and general hospitals from 74.4% and 9.6% of Gangwon-do areas, respectively. Similarly, it took more than 60 minutes each to reach hospitals and clinics from 4.2% and 3.4% of Gangwon-do areas, respectively. The results of the OD-cost revealed that there were large regional variations in distance and time taken to reach the medical institutions. Conclusions: there were regional variations of spatial accessibility between Si and Gun in Gangwon-do.

A Study on the Compression and Major Pattern Extraction Method of Origin-Destination Data with Principal Component Analysis (주성분분석을 이용한 기종점 데이터의 압축 및 주요 패턴 도출에 관한 연구)

  • Kim, Jeongyun;Tak, Sehyun;Yoon, Jinwon;Yeo, Hwasoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.19 no.4
    • /
    • pp.81-99
    • /
    • 2020
  • Origin-destination data have been collected and utilized for demand analysis and service design in various fields such as public transportation and traffic operation. As the utilization of big data becomes important, there are increasing needs to store raw origin-destination data for big data analysis. However, it is not practical to store and analyze the raw data for a long period of time since the size of the data increases by the power of the number of the collection points. To overcome this storage limitation and long-period pattern analysis, this study proposes a methodology for compression and origin-destination data analysis with the compressed data. The proposed methodology is applied to public transit data of Sejong and Seoul. We first measure the reconstruction error and the data size for each truncated matrix. Then, to determine a range of principal components for removing random data, we measure the level of the regularity based on covariance coefficients of the demand data reconstructed with each range of principal components. Based on the distribution of the covariance coefficients, we found the range of principal components that covers the regular demand. The ranges are determined as 1~60 and 1~80 for Sejong and Seoul respectively.