• Journal of Korean Society of Transportation
• /
• v.26 no.3
• /
• pp.75-84
• /
• 2008

In 2002, the 5-day workweek policy was effective in Korea. As we have expected, the 5-day workweek policy has changed people's travel behavior during weekdays and weekends. Several studies have been done to understand these changes and impacts on transportation systems. However, these studies have only focused on travel pattern changes without considering spatial factors. Said in another way, although individual travel pattern changes are usually investigated, indices adopted cannot describe travel pattern changes in a proper way due to lack of the spatial distribution measure. This study aims to analyze travel change since the 5-day work week policy in effect using a new index (i.e. Travel Vector Index) developed in this study, which can explain travel pattern changes in terms of magnitude and spatial point of views. The new index uses a GIS technology and TCS (Toll Collection System) databases in Korea. The results in this study show that the index is very useful and reliable to measure the travel patterns changes. They are applied to TCS data set and the results show that the 5-day workweek policy significantly affects on travel behaviors.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.7-15
• /
• 2005

The objective of this study is to estimate highway trip demand functions in Korea. In order to estimate them, I propose various socio-economic variables that affect the highway trip demand functions. I use the unit root test for each variable and the cointegration test to and the relationships among variables. Finally, I use the vector error correction model, to get the highway trip demand functions. The implication which I derive from the estimation is that real GDP and highway tolls have positive and negative effects, respectively. on the highway trip demand.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.599-617
• /
• 2006

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 the non-linear objective functions with the linear constraints. In the model, the flow-conservation constraints of the network are utilized to restrict the solution space and to force the link flows meet the traffic counts. The objective of the model is to minimize the discrepancies between the link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links and the link flows estimated through the traffic assignment using the path flow estimator in the legit-based SUE. In the proposed GA, a chromosome is defined as a vector representing a set of Origin-Destination Matrix (ODM), link flows and travel-cost coefficient. Each chromosome is evaluated from the corresponding discrepancy, and 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 is applied during the crossover and mutation.

• The Journal of Society for e-Business Studies
• /
• v.27 no.2
• /
• pp.193-204
• /
• 2022

Smart card data is representative mobility data and can be used for policy development by analyzing public transportation usage behavior. This paper deals with the problem of classifying metro stations using metro usage patterns as one of these studies. Since the previous papers dealing with clustering of metro stations only considered traffic among usage behaviors, this paper proposes clustering considering traffic time as one of the complementary methods. Passengers at each station were classified into passengers arriving at work time, arriving at quitting time, leaving at work time, and leaving at quitting time, and then the estimated shape parameter was defined as the characteristic value of the station by modeling each transit time to Weibull distribution. And the characteristic vectors were clustered using the K-means clustering technique. As a result of the experiment, it was observed that station clustering considering pass time is not only similar to the clustering results of previous studies, but also enables more granular clustering.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.810-813
• /
• 2016

기존 IoT 스마트 가로등은 모션 감지 센서를 이용하여 보행자를 감지하고, 가로등의 밝기를 조정하는 형태로 구성된다. 하지만 이러한 방법은 보행자가 나아갈 길을 미리 예측하여 밝혀주지 않는다. 특히 기존 방법은 보행자 현재 위치만 밝힐 뿐, 나아갈 길은 어두운 상태이기 때문에 통행에 불편함을 겪고 있다. 본 논문에서는 보행자 경로를 미리 파악하여 가로등 밝기를 조절하는 방식을 소개한다. 보행자의 현재 위치를 파악하기 위해 모션 감지 센서를 이용하며, 보행자 경로 예측은 모션 벡터를 사용하여 가로등 밝기를 조절한다. 이러한 개선을 통하여 보행자의 편의 증대와 범죄 예방 등 긍정적인 효과를 기대 할 수 있다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.1
• /
• pp.219-232
• /
• 2023

Mobility services need to change according to the regional characteristics of the target service area. Accordingly, analysis of mobility patterns and characteristics based on Origin-Destination (OD) data that reflect travel behaviors in the target service area is required. However, since conventional methods construct the OD data obtained from the administrative district-based zone system, it is hard to ensure spatial homogeneity. Hence, there are limitations in analyzing the inherent travel patterns of each mobility service, particularly for new mobility service like Demand Responsive Transit (DRT). Unlike the conventional approach, this study applies a data-driven clustering technique to conduct spatial analyses on OD travel patterns of regional mobility services based on reconstructed OD data derived from re-aggregation for original OD distributions. Based on the reconstructed OD data that contains information on the inherent feature vectors of the original OD data, the proposed method enables analysis of the spatial characteristics of regional mobility services, including public transit bus, taxi and DRT.

• Journal of Korean Society of Transportation
• /
• v.23 no.1
• /
• pp.103-114
• /
• 2005

The transit fare resulted from the renovation of public transit system in Seoul is basically determined based on the distance-based fare policy (DFP). In DFP, the total fare a passenger has to pay for is calculated by the basic-transfer-premium fare decision rule. The fixed amount of the basic fare is first imposed when a passenger get on a mode and it lasts within the basic travel distance. The transfer fare is additionally imposed when a passenger switches from one mode to another and the fare of the latter mode is higher than the former. The premium fare is also another and the fare of the latter begins to exceed the basic travel distance and increases at the proportion of the premium fare distance. The purpose of this study is to propose an algorithm for finding K number of paths, paths that are sequentially sorted based on total amount of transit fare, under DFP of the idstance-based fare policy. For this purpose, the link mode expansion technique is proposed in order to save notations associated with the travel modes. Thus the existing K shortest path algorithms adaptable for uni-modal network analysis are applicable to the analysis for inter-modal transportation networks. An optimality condition for finding the K shortest fare routes is derived and a corresponding algorithms is developed. The case studies demonstrate that the proposed algorithm may play an important role to provide diverse public transit information considering fare, travel distance, travel time, and number of transfer.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1098-1105
• /
• 1999

The caches in distributed shared memory systems enhance the performance by reducing memory access latency and communication overhead, but they must solve the cache coherence problem. This paper proposes a new directory protocol to solve the cache coherence problem and to improve the system performance in distributed shared memory systems. To maintain the cache coherence of shared data, processors within a limited distance reduce the communication overhead by using a bit-vector like the full directory scheme. Processors over a limited distance store pointers in a directory pool. Since the bit-vector and the directory pool remove the unnecessary cache invalidations, the proposed scheme reduces the communication traffic and improves the system performance. The dynamic limited directory scheme reduces the communication traffic up to 66 percents compared with the limited directory scheme and the number of directory access up to 27 percents compared with the dynamic pointer allocation scheme.

• Proceedings of the Korean Society of Disaster Information Conference
• /
• 2023.11a
• /
• pp.73-74
• /
• 2023

본 논문에서는 음향센서를 기반으로 한 지하시설물 화재 위험감지 방법을 제안하였다. 음향센서는 진동이나 광센서처럼 접촉식이 아니기 때문에 결로가 발생하고 있는 취약구간에 설치하여 보다 효율적으로 활용이 가능하고 지하시설물 내부에 설치된 기기나 장비들과 상호작용하거나 간섭하지 않기 때문에 안전하게 관리가 가능하다. 이러한 특징으로 지하 시설물에서 내 통행이 불편하여 관리하기 힘든 구간이나 결로가 많아 화재안전에 주의가 필요한 곳에 설치하여 전기스파크 발생 감지를통해 재난이 발생하기 이전 화재위험을 감지하는 방법론 중 하나가 될 수 있다. 제안하는 방법은 음향 센서를 통해 지하공동구 안에서 발생하는 소리들을 수집하고 일정한 길이의 시간 단위 프레임들로 분할한 후 분석하여 전기스파크의 특징 벡터를 도출한다. 전기스파크 감지 모델로는 전기스파크 신호의 지역적 특성을 포착할 수 있도록 2D-CNN 구조를 사용하며 모델에서 출력된 전기 스파크 발생 예측확률을 분할된 단위 프레임 따라 계산하여 융합한다. 이로 인해 높은 정확도의 전기스파크 감지 정밀도를 얻을 수 있으며, 이는 전기 스파크에 의한 화재 이벤트 감지 있어서 효과적인 센싱 기술임을 알 수 있다.