Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Korean Society of Transportation
Journal Basic Information
Journal DOI :
Korean Society of Transportation
Editor in Chief :
Volume & Issues
Volume 18, Issue 6 - Dec 2000
Volume 18, Issue 5 - Oct 2000
Volume 18, Issue 4 - Aug 2000
Volume 18, Issue 3 - Jun 2000
Volume 18, Issue 2 - Apr 2000
Volume 18, Issue 1 - Feb 2000
Selecting the target year
Implementing Special Transportation Management Zone System for Dongdaemoon Garment District
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 7~17
The Purpose of this study is to test the effectiveness of Special Transportation Management Zone system (TZ) when it is applied to Dongdaemoon commercial zone located in downtown Seoul. The study consists of two Parts ; the legal components of TZ and the case study on Dongdaemoon district. The case study includes the analysis of current traffic situation on the study zone, the design of implemention alternative for each component of TZ, the framework of impact analysis system, and the analysis results. The study finds, if 2,000 won mandatory parking fee on drivers parking in the buildings only with over 10 parking spaces and over 3.000
in floor area, strong illegal parking enforcement, and Pro-hibition of parking passenger cars whose last digit plate number matches with the last digit of date, are implemented in the zone simultaneously, the traffic speed increases to 20.56km/h which is above the target set in the zone. In conclusion, we find that TZ2 can be an effective tool relieving traffic congestion in Seoul, and that it is necessary for introducing TZ in Seoul that relevant laws should be revised and expecting problems should be overcome.
Base Critical Gaps and Follow-Up Times by Traffic Movements for Four-Legged Unsignalized Intersections in Suburban of Seoul, Korea
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 19~32
Presently, unsignalized intersections are the prevalent type of intersections to control traffic flows in suburban cities in Korea. While usages of the intersections are increasing, the standardized analytical method is not defined let in Korea. Currently, capacity and level of service analyses of the unsignalized intersections follow the Procedures in Highway Capacity Manual (HCM) in the 1994 version in the United States. However, direct usage of the Procedure may Provide the dubious and incorrect results in capacity and level of service analyses due to different operation conditions and drivers\` behaviors. Even though inherent Problems, few research has been conducted for the unsignalized intersections in Korea. The objectives of the study are firstly to refine operating conditions of the unsignalized intersections, secondly, suggest the critical gaps and follow-up times, the most important and determinant factors in analyzing unsignalized intersection, based on observed data in Korea. Eleven four-legged un signalized intersections are selected to collect traffic data in small cities in Korea. In field surveys, accepted gaps, rejected gaps, and follow-up times of individual vehicles are taped by video camera for one and half hours. Then, the critical gaps and follow-up times of each movement are estimated by Maximum Likelihood Method. The comparisons of the values with respect to the types of vehicles and movements through analysis of variance method. The results shows that critical gaps and follow-up times are lower than those in US HCM. While the critical gapes are not affected by types of vehicle but by the movements, follow-up times are different by types of vehicles
Impacts of traffic of residential street on the social interactions among urban residents
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 33~43
Residential streets play an important role not only as a Place for moving but also as a place for social interactions among urban residents. Social interactions among urban residents are critical factor to draw sense of confidence and communality, and community spirit from the residents. Social interactions among community residents, however, are getting restricted severely by automobile traffic in the residential area. This study shows that the level of social interactions among the residents decreases substantially as traffic volume increases in the area. Other daily activities such as relaxing. playing with children, exercising, and doing small works in the street which can caused social interactions among the residents are also decreased as the volume of automobile traffic increases. Residents living in the area of heavier traffic volume perceive more strongly that automobile traffic is the major reason which deters them from interacting socially each other.
Estimation of A Car-following Model for Microscopic Simulation Model Based on GM 5th Model
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 47~61
The objective of this study is to estimate a set of parameters of GM 5th car following model which can be applied on the micro simulation model for urban signalized intersections. To estimate the set of parameters, microscopic data were collected from real traffic. Continuous vehicle trajectories were then prepared using non-linear curve fitting algorithm to obtain instantaneous speed and acceleration characteristics of individual vehicles. In this study, different set of parameters were estimated on acceleration and deceleration regimes. The performance of the Proposed model was evaluated on the test network The result from advancing several vehicles using the proposed model shows that following vehicles well follow leading vehicles without any collision.
Dynamic Model Considering the Biases in SP Panel data
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 63~75
Stated Preference (SP) data has been regarded as more useful than Revealed Preference (RP) data, because researchers can investigate the respondents\` Preference and attitude for a traffic condition or a new traffic system by using the SP data. However, the SP data has two bias: the first one is the bias inherent in SP data and the latter one is the attrition bias in SP panel data. If the biases do not corrected, the choice model using SP data may predict a erroneous future demand. In this Paper, six route choice models are constructed to deal with the SP biases, and. these six models are classified into cross-sectional models (model I∼IH) and dynamic models (model IV∼VI) From the six models. some remarkable results are obtained. The cross-sectional model that incorporate RP choice results of responders with SP cross-sectional model can correct the biases inherent in SP data, and also the dynamic models can consider the temporal variations of the effectiveness of state dependence in SP responses by assuming a simple exponential function of the state dependence. WESML method that use the estimated attrition probability is also adopted to correct the attrition bias in SP Panel data. The results can be contributed to the dynamic modeling of SP Panel data and also useful to predict more exact demand.
Development of a Path-Based Trip Assignment Model under Toll Imposition
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 77~88
Accuracy of trip assignment model which describes traveller\`s route choice behavior can affect transportation planning considerably. Travel time and travel tolls are the most important criteria in traveller\`s route choice. But tolls are imposed according to traveller\`s Path travel distance in various way so it is difficult to find out actual travel tolls in existing assignment models and application of the travel demand forecasting results is limited because the solutions of trip assignment models are oriented in link-based not in path-based. In this dissertation, Path-based trip assignment model is formulated. And in the model actual travel tolls can be set according to Path travel distance. Gradient Projection(GP) a1gorithm is adopted to obtain Path-based solutions and for computational efficiency, MPS(Minimal Path Search) algorithm is used to find the shortest Path among the K-shortest path algorithms. The model formulated in this dissertation improves accuracy of trip assign menu by reflecting realistic travel tolls and is groved to converge much faster than the existing assignment models. Given the path solutions reflecting travel tolls, objective function can be specified from the relationship between travel toll and travel distance and its measure of effectiveness can be easily measured. Therefore this model can not only describe the situation more realistically but also overcome the limited analysis of effectiveness, which makes this model applicable more widely
OD trip matrix estimation from urban link traffic counts (comparison with GA and SAB algorithm)
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 89~99
To cope with the limits of conventional O-D trip matrix collecting methods, several approaches have been developed. One of them is bilevel Programming method Proposed by Yang(1995), which uses Sensitivity Analysis Based(SAB) algorithm to solve Generalized Least Square(GLS) problem. However, the SAB a1gorithm has revealed two critical short-comings. The first is that when there exists a significant difference between target O-D matrix and true O-D matrix, SAB algorithm may not produce correct solution. This stems from the heavy dependance on the historical O-D information, in special when gravel Patterns are dramatically changed. The second is the assumption of iterative linear approximation to original Problem. Because of the approximation, SAB algorithm has difficulty in converging to Perfect Stackelberg game condition. So as to avoid the Problems. we need a more robust and stable solution method. The main purpose of this Paper is to show the problem of the dependency of Previous models and to Propose an alternative solution method to handle it. The Problem of O-D matrix estimation is intrinsically nonlinear and nonconvex. thus it has multiple solutions. Therefore it is necessary to require a method for searching globa1 solution. In this paper, we develop a solution algorithm combined with genetic algorithm(GA) , which is widely used as probabilistic global searching method To compare the efficiency of the algorithm, SAB algorithm suggested by Yang et al. (1992,1995) is used. From the results of numerical example, the Proposed algorithm is superior to SAB algorithm irrespective of travel patterns.
A theoretical Review on the Relationship between Stimulus-Patterns of Marking on the Road-Surface and Driving-Behavior (Aiming at developing a suitable Model related)
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 101~110
We raise the phenomenon as a problem that our markings on road-surface show a general tendency of continuous increase and reinforcement with reference to their intensity, patterns and frequency. The Purpose of this study is aimed at considering various psychological theories concerning the markings on road-surface affecting the drivers\` driving behavior and also in this context developing an adequate model which reveals their relational characteristics. In this model Prevention of accidents and safety-driving are considered more easily Possible in a traffic environment that is realized through the necessary minimum-level of stimulation of markings on road-surface. In order to analyse human behavior totally and effectively, theoretical aspects of general Psychology and tropical behaviorism are considered very insufficient. In contrast to this Position, those of gestalt Psychology and field-theory are revealed relatively satisfied. So far as too much marking-patterns effect stress, information overload and too excessive Psychological arousal-state in drivers, they are also becoming focus of interest in environmental Psychology. If the theoretical foundation of marking-Patterns on road-surface lies on our affective-cognitive human aspects and also that Position is right, as presented in the two-aspects model of marking shaping, they are suggested to be remained for the best states at a necessary minimum level. For right drivers\` driving behavior, namely behavior Protecting traffic laws seems to be more firmly habituated only through effective traffic education and real awareness-reform of drivers by means of consolidated detection and severe Punishment measures than various stimulative reinforcement measures in aspects of marking-shaping. In the future it is expected to carry out further Provable research fur finding out whether this model will be found fruitful or not.
A Link-Based Shortest Path Algorithm for the Urban Intermodal Transportation Network with Time-Schedule Constraints
Journal of Korean Society of Transportation, volume 18, issue 6, 2000, Pages 111~124
The Problem considered in this Paper is to find the Origin-Destination(O-D) shortest Path in the urban intermodal transportation network with time-schedule constraints. The time-schedule constraint is a more realistic representation of the urban internodal transportation network, but it is difficult for the traditional and existing shortest path algorithms to deal with. The time-schedule constraint requires that the transfer departure time to travel from a transfer station to another node take place only at one of Pre-specified departure times. The scheduled departure times at the transfer station are the times when the Passengers are allowed to leave the station to another node using the relative transportation modality Therefore, when the time-schedule constraint is considered, the total time includes traveling time and transfer waiting time. The length of the transfer waiting time at a transfer station is dependent on the arrival time of the passenger and the next departure time of the transfer car. In this Paper, a link-based shortest Path a1gorithm is developed to deal with this Problem. In the traditional approach such as Dijkstra\`s algorithm, the earliest reaching time is used to label the nodes. In the proposed algorithm, both the earliest reaching time and the earliest leaving time are used to label the links. Stepwise procedure of the algorithms illustrated with an example