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 22, Issue 7 - Dec 2004
Volume 22, Issue 4 - Aug 2004
Volume 22, Issue 3 - Jun 2004
Volume 22, Issue 2 - Apr 2004
Volume 22, Issue 1 - Feb 2004
Volume 22, Issue 6 - Jan 2004
Volume 22, Issue 5 - Jan 2004
Selecting the target year
The Price Elasticity in the Parcel Service Market by Benefit Segmentation
Kim, Geun-Sub ; Kwak, Kyu-Seok ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 7~18
This study aims to present the establishment and necessity of the proper market segmentation by customer preference. In this study, benefit segmentation method was employed using conjoint analysis to measure price elasticity by segmented groups. It presents that the price elasticity is different by characteristic of customers using parcel service in this result. Benefit segmentation, therefore, may use some useful marketing tool when a parcel service company segments the market to provide better service.
Development of a Transportation Demand Analysis Model
Shim, Dae-Young ; Cho, Joong-Rae ; Kim, Dong-Hyo ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 19~26
AllWayS(AWS, Satongpaldal in Korean) is the first comprehensive computer software in Korea that is developed for the transportation demand modeling. The original DOS version software was recently receded for Windows environment. Traditional 4-step transportation demand forecasting process is incorporated in the software under graphical user interface environment. AWS is able to compose or edit graphic transportation networks data by each scenario which could be the subject of an analysis. Besides, it use database structure that can handle every data of a scenario such as networks, O/D, and socio-economic data, etc. We expect this integrated process could provide each analyst with efficient and easy to use tool for their analysis. Each models in this software is based on traditional algorithms and the results were compared to existing software, EMME/2 and it showed similar results.
Evaluating the Policy of Transfer System to Promote a Use of the Busan Subway
Jung, Hun-Young ; Choi, Chi-Gook ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 27~39
The purpose of this paper presents realistic policy alternative about recent tendency to decrease of subway-users and diminution of use efficiency which are serious problems of Busan Subway. Several policy alternatives have been studied until now, such as subway transfer impedance solution plan, introduction of subway to transfer fare discounting policy, and etc.. But, those policy alternatives are difficult to carried out, because they are less effective and overburden to financial aspect. Therefore, I made use of research on subway utilization to presuppose service improvement, as an alternative, in the transfer fare discounting system between bus and subway which might be powerful influence over subway-users. To verify this proposed study, I took advantage of Stated Preference(SP) where I estimated fare revenue and effects on fluctuation of subway-users with nested logit model based on research results. Suitable alternatives are as follows: First, If municipal government carries out transfer fare discounting policy without shortening in-vehicle time and out-of-vehicle time transfer fare, it is reasonable to discount transfer fare 50% off on the assumption of financial support as much as \6.700 million annually. Secondly, in case of application of multi-factors at a time, transfer fare discounting and in & out vehicle time, it is preferred to have no charge for transfer option with financial support as much as expected income-loss \5,600 million.
Incorporating Genetic Operators into Optimizing Highway Alignments
Kim, Eung-Cheol ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 43~54
This study analyzes characteristics and applicability of genetic algorithms and genetic operators to optimize highway alignments. Genetic algorithms, one of artificial intelligence techniques, are fast and efficient search algorithms for generating, evaluation and finding optimal highway alignment alternatives. The performance of genetic algorithms as an optimal search tool highly depends on genetic operators that are designed as a problem-specific. This study adopts low mutation operators(uniform mutation operator, straight mutation operator, non-uniform mutation operator whole non-uniform mutation operator) to explore whole search spaces, and four crossover operators(simple crossover operator, two-point crossover operator, arithmetic crossover operator, heuristic crossover operator) to exploit food characteristics of the best chromosome in previous generations. A case study and a sensitivity analysis have shown that the eight problem-specific operators developed for optimizing highway alignments enhance the search performance of genetic algorithms, and find good solutions(highway alignment alternatives). It has been also found that a mixed and well-combined use of mutation and crossover operators is very important to balance between pre-matured solutions when employing more crossover operators and more computation time when adopting more mutation operators.
Determination of Design Hour Rank Considering Design Level of Service
Moon, Mi-Kyung ; Chang, Myung-Soon ; Kang, Jai-Soo ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 55~63
Current design hour rank(DHR) uses an inexact qualitative standard expressed as the slow-down point of ranked hourly volume curve. It makes a problem that it cannot address two important factors in highway design, traffic congestion and economic inefficiency, effectively. In addition, different results may be produced from different analysts. The current design hourly volume(DHV) takes the 30th-highest volume, as in the USA, despite that there may be much differences in highway traffic condition between Korea and the USA. For instance, in Korea the traffic is highly concentrated on Sol(traditional New Year's Day by lunar calendar) or Chusok(traditional harvest holidays in lunar August). If, therefore, we design the highway based on the 30th-highest volume, we will get the over-estimated design volume with high holiday portion of the volume, 74.1%, and low maximum hourly volume capacity ratio, 85.2%. The study is to build a more reasonable DHR standard which can address both of traffic congestion and economic efficiency of the highway. In the study, design hour rank(DHR) was defined as one that maximum hourly volume through the year reaches the capacity, and by the analysis the 150th-highest volume was selected as a reasonable DHR considering traffic congestion and economic efficiency of the highway. With the 150th-highest volume DHR standard, it was analyzed that holiday portion of the volume would be 60.3%, decreasing by 13.8% from the case of existing standard, and maximum hourly volume capacity ratio would be 101.2%, increasing by 16.0%.
Development of a Continuous Network Design Model Based on Sensitivity Analysis
Lim, Yong-Taek ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 65~76
Network design problem(NDP) is to determine a design parameter, which leads the road network to an optimal state. NDP includes traffic signal control traffic information provision, congestion charge, new transportation mode as well as road expansion. In general NDP can be formulated as a bi-level problem such as upper level problem and lower level one. Since it has been difficult in solving the problem as Stackelberg game, most of conventional NDP models have been formulated as a Nash game, assuming that the upper level problem and lower level problem are not cooperative each other. But there exist a cooperative relationship between them in real road network system, thus the design variables of upper level problem should be specified under such circumstance, or Stackelberg game condition. This paper formulates the NDP as a Stackelberg game, which exist a leader and a follower, and allows an errors of travellers' behavior in choosing their routes, which can be described by stochastic traffic assignment. In order to solve the model we suggest a solution algorithm, which adopt a sensitivity of link flow with respect to design parameter. the developed model will be applied to 2 example road networks for evaluating it.
Design and Implementation of Travel Mode Choice Model Using the Bayesian Networks of Data Mining
Kim, Hyun-Gi ; Kim, Kang-Soo ; Lee, Sang-Min ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 77~86
In this study, we applied the Bayesian Network for the case of the mode choice models using the Seoul metropolitan area's house trip survey Data. Sex and age were used lot the independent variables for the explanation or the mode choice, and the relationships between the mode choice and the travellers' social characteristics were identified by the Bayesian Network. Furthermore, trip and mode's characteristics such as time and fare were also used for independent variables and the mode choice models were developed. It was found that the Bayesian Network were useful tool to overcome the problems which were in the traditional mode choice models. In particular, the various transport policies could be evaluated in the very short time by the established relation-ships. It is expected that the Bayesian Network will be utilized as the important tools for the transport analysis.
A Study on Characteristics of Highway Segments for Recreational Trips Using Principal Analysis
Kim, Young-Il ; Chung, Jin-Hyuk ; Kum, Ki-Jung ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 87~93
A five-day work week has a great impact on the life styles of employed persons and their families. At the same time, the changes also impact on the transportation system because travel patterns, demand, and pattern of congestion change during weekends. The negative impacts on the transportation system should be examined in order to conceive measures to maintain dependable levels of service during weekends. The first step to pursue the issue is to identify the road segments heavily affected by augmented leisure trips. In this study, characteristics of highway segments are engineered by principal analysis using data from TCS database. Scores from principal analysis are employed to distinguish highway segments for leisure trips from total 197 segments considered in this study. In addition, indexes from principal analysis are proposed to identify highway segments for leisure trips.
Development of an Interface Module with a Microscopic Simulation Model for COSMOS Evaluation
Song, Sung-Ju ; Lee, Seung-Hwan ; Lee, Sang-Soo ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 95~102
The COSMOS is an adaptive traffic control systems that can adjust signal timing parameters in response to various traffic conditions. To evaluate the performance of the COSMOS systems, the field study is only practical option because any evaluation tools are not available. To overcome this limitation, a newly integrated interfacing simulator between a microscopic simulation program and COSMOS was developed. In this paper, a detector module and a signal timing module as well as general feature of the simulator were described. A validation test was performed to verify the accuracy of the data flow within the simulator. It was shown that the accuracy level of information from the simulator was high enough for real application. Several practical comments on further studies were also included to enhance the functional specifications of the simulator.
Passing Behavior of Vehicles in Signalized Intersection (Focused on Vehicles Driven by Offensive Drivers)
Hwang, Kyung-Soo ; Hwang, Zun-Hwan ; Kim, Jum-San ; Rhee, Sung-Mo ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 103~108
The motivation of this study comes from the problem recognition that the headway of passing vehicle in signalized intersections can not be merely determined by departing sequence. Traffic speed and headway data of passing vehicles in signalized intersection have been obtained by using magnetic detectors(NC 97) and detecting program, and the data was analyzed. Without special treatment, the model established on passing behavior of vehicles was meaningless from statistical view point. Hence, special treatments such as filtering (upper 85% offensive driver driven vehicle's) and log scaling of data were carried on. With this new data, meaningful model (where coefficient of determination is 0.91) was established. This model explained the fact that vehicle headway in signalized intersection is affected by speed and headway of previous vehicle and speed of itself.
Study and Evaluation of Sub Area Linkage Algorithm in COSMOS
Lee, Young-Ihn ; Kim, Sang-Yoon ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 109~119
In COSMOS, an area for signal coordination is divided into subareas composed of several signalized intersections that share a common cycle time. Each subarea contains only one critical intersection having heavy traffic load. Subarea is a basic unit of control. The performance of COSMOS is highly dependent on the linkage rule between adjacent subareas. The purpose of this study is to provide an appropriate subarea linkage rule in COSMOS. This study developed a control strategy for Critical Intersection and Sub Area linkage. Critical Intersections calculate the Offset Pattern both East-West Axis and North-South Axis, and the coordination direction either East-West Axis or North-South Axis. Subarea can be combined with other one in all directions. The performance of the suggested linkage rule was evaluated on the real network in Gangnam-Gu. The result was that travel time was reduced by the suggested linkage rule.
Generating Multiple Paths by Using Multi-label Vine-building Shortest Path Algorithm
Kim, Ik-Ki ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 121~130
In these days, multiple-path generation method is highly demanded in practice and research areas, which can represents realistically travelers behavior in choosing possible alternative paths. The multiple-path generation algorithm is one of the key components for policy analysis related to ATIS, DRGS and ATMS in ITS. This study suggested a method to generate multiple Possible paths from an origin to a destination. The approach of the suggested method is different from an other existing methods(K-shortest path algorithm) such as link elimination approach, link penalty approach and simulation approach. The result of the multi-label vine-building shortest path algorithm(MVA) by Kim (1998) and Kim(2001) was used to generate multiple reasonable possible paths with the concept of the rational upper boundary. Because the MVA algorithm records the cost, back-node and back-back node of the minimum path from the origin to the concerned node(intersection) for each direction to the node, many potential possible paths can be generated by tracing back. Among such large number of the potential possible paths, the algorithm distinguishes reasonable alternative paths from the unrealistic potential possible paths by using the concept of the rational upper boundary. The study also shows the very simple network examples to help the concept of the suggested path generation algorithm.
K-th Path Search Algorithms with the Link Label Correcting
Lee, Mee-Young ; Baik, Nam-Cheol ; Choi, Dae-Soon ; Shin, Seong-Il ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 131~143
Given a path represented by a sequence of link numbers in a graph, the vine is differentiated from the loop in a sense that any link number can be visited in the path no more than once, while more than once in the loop. The vine provides a proper idea on complicated travel patterns such as U-turn and P-turn witnessed near intersections in urban transportation networks. Application of the link label method(LLM) to the shortest Path algorithms(SPA) enables to take into account these vine travel features. This study aims at expanding the LLM to a K-th path search algorithm (KPSA), which adopts the node-based-label correcting method to find a group of K number of paths. The paths including the vine type of travels are conceptualized as drivers reasonable route choice behaviors(RRCB) based on non-repetition of the same link in the paths, and the link-label-based MPSA is proposed on the basis of the RRCB. The small-scaled network test shows that the algorithm sequence works correctly producing multiple paths satisfying the RRCB. The large-scaled network study detects the solution degeneration (SD) problem in case the number of paths (K) is not sufficient enough, and the (K-1) dimension algorithm is developed to prevent the SD from the 1st path of each link, so that it may be applied as reasonable alternative route information tool, an important requirement of which is if it can generate small number of distinct alternative paths.
Two-phases Hybrid Approaches and Partitioning Strategy to Solve Dynamic Commercial Fleet Management Problem Using Real-time Information
Kim, Yong-Jin ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 145~154
The growing demand for customer-responsive, made-to-order manufacturing is stimulating the need for improved dynamic decision-making processes in commercial fleet operations. Moreover, the rapid growth of electronic commerce through the internet is also requiring advanced and precise real-time operation of vehicle fleets. Accompanying these demand side developments/pressures, the growing availability of technologies such as AVL(Automatic Vehicle Location) systems and continuous two-way communication devices is driving developments on the supply side. These technologies enable the dispatcher to identify the current location of trucks and to communicate with drivers in real time affording the carrier fleet dispatcher the opportunity to dynamically respond to changes in demand, driver and vehicle availability, as well as traffic network conditions. This research investigates key aspects of real time dynamic routing and scheduling problems in fleet operation particularly in a truckload pickup-and-delivery problem under various settings, in which information of stochastic demands is revealed on a continuous basis, i.e., as the scheduled routes are executed. The most promising solution strategies for dealing with this real-time problem are analyzed and integrated. Furthermore, this research develops. analyzes, and implements hybrid algorithms for solving them, which combine fast local heuristic approach with an optimization-based approach. In addition, various partitioning algorithms being able to deal with large fleet of vehicles are developed based on 'divided & conquer' technique. Simulation experiments are developed and conducted to evaluate the performance of these algorithms.
Implementing Advanced Traffic Information System Using Dedicated Short Range Communication (Case Study of Daejeon)
O, Gi-Do ; Park, Eun-Mi ; Kim, So-Yeon ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 165~175
The Study on the Situations and Analysis of Rail Freight in Japan and Policy Implication
Lee, Yong-Sang ;
Journal of Korean Society of Transportation, volume 22, issue 2, 2004, Pages 177~193