• 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.

• 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.

• Journal of Korean Society of Transportation
• /
• v.22 no.1 s.72
• /
• pp.43-62
• /
• 2004

Conventionally the estimation method of the origin-destination Matrix has been developed by implementing the expansion of sampled data obtained from roadside interview and household travel survey. In the survey process, the bigger the sample size is, the higher the level of limitation, due to taking time for an error test for a cost and a time. Estimating the O-D matrix from observed traffic count data has been applied as methods of over-coming this limitation, and a gradient model is known as one of the most popular techniques. However, in case of the gradient model, although it may be capable of minimizing the error between the observed and estimated traffic volumes, a prior O-D matrix structure cannot maintained exactly. That is to say, unwanted changes may be occurred. For this reason, this study adopts a conjugate gradient algorithm to take into account two factors: estimation of the O-D matrix from the conjugate gradient algorithm while reflecting the prior O-D matrix structure maintained. This development of the O-D matrix estimation model is to minimize the error between observed and estimated traffic volumes. This study validates the model using the simple network, and then applies it to a large scale network. There are several findings through the tests. First, as the consequence of consistency, it is apparent that the upper level of this model plays a key role by the internal relationship with lower level. Secondly, as the respect of estimation precision, the estimation error is lied within the tolerance interval. Furthermore, the structure of the estimated O-D matrix has not changed too much, and even still has conserved some attributes.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.135-150
• /
• 2002

The basic assumption of analytical Dynamic Traffic Assignment models is that traffic demand and network conditions are known as a priori and unchanging during the whole planning horizon. This assumption may not be realistic in the practical traffic situation because traffic demand and network conditions nay vary from time to time. The rolling horizon implementation recognizes a fact : The Prediction of origin-destination(OD) matrices and network conditions is usually more accurate in a short period of time, while further into the whole horizon there exists a substantial uncertainty. In the rolling horizon implementation, therefore, rather than assuming time-dependent OD matrices and network conditions are known at the beginning of the horizon, it is assumed that the deterministic information of OD and traffic conditions for a short period are possessed, whereas information beyond this short period will not be available until the time rolls forward. This paper introduces rolling horizon implementation to enable a multi-class analytical DTA model to respond operationally to dynamic variations of both traffic demand and network conditions. In the paper, implementation procedure is discussed in detail, and practical solutions for some raised issues of 1) unfinished trips and 2) rerouting strategy of these trips, are proposed. Computational examples and results are presented and analyzed.