• Korean Journal of Environment and Ecology
• /
• v.11 no.4
• /
• pp.480-485
• /
• 1998

The annual increasing rate of visitors was 3 percent in Soraksan National Park form 1990 to 1997. Secenty nine percent of total visitors in Soraksan National Park has visited Oysorak district due to convenient access and facilities. Approximately, 6~17 percent of visitors passing through Sorakdong ticket office at Oysorak district has climbed up Taech'ongbong(peak), the others have visited Ulsanbawi, Pisondae and Madungnyong close at hand. Climbers from Osekyaksu to Taech'ongbong(peak)were more in autumn than in summer. Visiting pattern in Soraksan National Park showed differences by districts, seasons and days of the week.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.49-59
• /
• 2001

In the transportation planning process, origin and destination(O-D) trip matrix is one of the most important elements. There have been developments and applications of the methodology to adjust old matrices using link traffic counts. Commonly, the accuracy of an adjusted O-D matrix depends very much on the reliability of the input data such as the numbers and locations of traffic counting points in the road network. In the real application of the methodology, decisions on the numbers and locations of traffic counting points are one of the difficult problems, because usually as networks become bigger, the numbers of traffic counting points are required more. Therefore, this paper investigates these issues as an experiment using a nationwide network in Korea. We have compared and contrasted the set of link flows assigned by the old and the adjusted O-D matrices with the set of observed link flows. It has been analyzed by increasing the number of the traffic counting points on the experimental road network. As a result of these analyses, we can see an optimal set of the number of counting links through statistical analysis, which are approximately ten percentages of the total link numbers. In addition, the results show that the discrepancies between the old and the adjusted matrices in terms of the trip length frequency distributions and the assigned and the counted link flows are minimized using the optimal set of the counted links.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.115-131
• /
• 2001

The Purpose of this study is to develop a simulation model for large-scale network with interrupted flow as well as uninterrupted flow. The Cell Transmission(CT) theory is used to simulate traffic flow. Flow transition rules have been newly developed to simulate traffic flows at merging and diverging sections, and signalized intersections. In the model, it is assumed that dynamic OD table is exogenously given. Simulation results for toy network shows that the model can explain queue dynamics not only in signalized intersections of urban arterials, but also in merging and diverging sections of freeway. In case study, the model successfully simulated traffic flows of 145,000 vehicles on CBD network of city of Seoul with 74 traffic zones, 133 signalized intersections among 395 nodes and 1110 links.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.1
• /
• pp.56-73
• /
• 2019

Probe-based systems have been gaining popularity in advanced traveler information systems. However, the high possibility of providing inaccurate travel-time information due to the inherent time-lag phenomenon is still an important issue to be resolved. To mitigate the time-lag problem, different prediction techniques have been applied, but the techniques are generally regarded as less effective for travel times with high variability. For this reason, current 5-min aggregated data have been commonly used for real-time travel-time provision on highways with high travel-time fluctuation. However, the 5-min aggregation interval itself can further increase the time-lags in the real-time travel-time information equivalent to 5 minutes. In this study, a new scheme that uses both individual probe and 5-min aggregated travel times is suggested to provide reliable real-time travel-time information. The scheme utilizes individual probe data under congested conditions and 5-min aggregated data under uncongested conditions, respectively. As a result of an evaluation with field data, the proposed scheme showed the best performance, with a maximum reduction in travel-time error of 18%.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.5
• /
• pp.1-11
• /
• 2009

TCS Data imply characteristics of traffic conditions. However, there are outliers in TCS data, which can not represent the travel time of the pertinent section, if these outliers are not eliminated, travel time may be distorted owing to these outliers. Various travel time can be distributed under the same section and time because the variation of the travel time is increase as the section distance is increase, which make difficult to calculate the representative of travel time. Accordingly, it is important to grasp travel time characteristics in order to compute the representative of travel time using TCS Data. In this study, after analyzing the variation ratio of the travel time according to the link distance and the level of congestion, the outlier elimination model and the smoothing model for TCS data were proposed. The results show that the proposed model can be utilized for estimating a reliable travel time for a long-distance path in which there are a variation of travel times from the same departure time, the intervals are large and the change in the representative travel time is irregular for a short period.

• Journal of Korean Society of Transportation
• /
• v.30 no.5
• /
• pp.71-82
• /
• 2012

Some previous studies adopted a method statistically based on the observed traffic volumes and travel times to estimate the parameters. Others tried to find an optimal set of parameters to minimize the gap between the observed and estimated traffic volumes using, for instance, a combined optimization model with a traffic assignment model. The latter is frequently used in a large-scale network that has a capability to find a set of optimal parameter values, but its appropriateness has never been demonstrated. Thus, we developed a methodology to estimate a set of parameter values of BPR(Bureau of Public Road) function using Harmony Search (HS) method. HS was developed in early 2000, and is a global search method proven to be superior to other global search methods (e.g. Genetic Algorithm or Tabu search). However, it has rarely been adopted in transportation research arena yet. The HS based transportation network calibration algorithm developed in this study is tested using a grid network, and its outcomes are compared to those from incremental method (Incre) and Golden Section (GS) method. It is found that the HS algorithm outperforms Incre and GS for copying the given observed link traffic counts, and it is also pointed out that the popular optimal network calibration techniques based on an objective function of traffic volume replication are lacking the capability to find appropriate free flow travel speed and ${\alpha}$ value.

• 한국도로학회:학술대회논문집
• /
• 2009.11a
• /
• pp.285-290
• /
• 2009

• Proceedings of the KOR-KST Conference
• /
• 2007.11a
• /
• pp.77-86
• /
• 2007

• Proceedings of the Korean Society of Environment and Ecology Conference
• /
• 2000.04a
• /
• pp.128-131
• /
• 2000

• Transportation Technology and Policy
• /
• v.7 no.4
• /
• pp.67-74
• /
• 2010