• Journal of Korean Society of Transportation
• /
• v.23 no.8 s.86
• /
• pp.7-17
• /
• 2005

Transportation is from an individual mobility. Various efforts to propose specific values or the individual mobility have been conducted in diverse transportation environment. However, mobility studies for multimodal public transportation are rare especially on not the range of line but area. This study propose a method to calculate transit mobility indices as expanding mobility analysis from point-to-point to area-to-area, considering access time to transit facility, running time and transfer time of passengers. To extract mobility indices, we included walking as a lowest category of mode and set passenger car as a competitive mode to transit mode. This study propose three public transportation mobility indices as 1) how competitive public transportation facility is offered against passenger car 2) how convenient transit mode including walking is provided against passenger car from origin to destination and 3) how many various paths are presented to support passenger's travel between regions. These indices are tested on the Seoul metropolitan area with 10 lines of urban rail and about 420 lines of bus. In addition, we proposed two political applications of proposed mobility indices to increase public transportation mobility between two regions and to maximize the mobility of study area when a line is added in the area.

• Journal of the Korea Society for Simulation
• /
• v.16 no.3
• /
• pp.1-9
• /
• 2007

Travel time between two points depends upon whether it is a rush hour or not in metropolitan area. It is true that there is big differences on the time required to get through the area whether going in busy morning or near noon. Another issue is that there exist many delivery points which closely located each other; so no need to consider traveling hours among these points. We designed an efficient procedure to reduce the complexity by considering closely located delivery points as one big delivery point. A computer simulation model is constructed for comparison purposes of the developed heuristic with the optimum solution.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.237-242
• /
• 2003

Ant Colony System (ACS) Algorithm is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP). In this paper, we introduce ACS of new method that adds reinforcement value for each edge that visit to Local/Global updating rule. and the performance results under various conditions are conducted, and the comparision between the original ACS and the proposed method is shown. It turns out that our proposed method can compete with tile original ACS in terms of solution quality and computation speed to these problem.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1347-1355
• /
• 2007

A sensor network is composed of a large number of tiny devices, scattered and deployed in a specified regions. Each sensing device has processing and wireless communication capabilities, which enable it to gather information from the sensing area and to transfer report messages to a base station. The energy-efficient routing paths are established when the base station requests a query, since each node has several characteristics such as low-power, constrained energy, and limited capacity. The established paths are recovered while minimizing the total transmit energy and maximizing the network lifetime when the paths are broken. In this paper, we propose a routing algorithm that each sensor node reports its adjacent link information to the sink node when a sink node broadcasts a query. The sink node manages the total topology and establishes routing paths. This algorithm has a benefit to find an alternative path by reducing the negotiating messages for establishing paths when the established paths are broken. To reduce the overhead of collection information, each node has a link information before reporting to the sink. Because the node recognizes which nodes are adjacent. The proposed algorithm reduces the number of required messages, because sensor nodes receive and report routing messages for establishment at the beginning of configuring routing paths, since each node keeps topology information to establish a routing path, which is useful to report sensing tasks in monitoring environments.

• Journal of the Korean association of regional geographers
• /
• v.21 no.3
• /
• pp.503-514
• /
• 2015

This study aims to analyze the relationship between transport infrastructure investment and rural development in Korea in a more systematic and empirical way. To do so, we formulate research framework to examine the multi-faceted relationship through extensive literature review and carry out a descriptive study on the spatial patterns of road investment and rural development in Korea. Finally, using the structural equation model, this study carries out the exploratory empirical analysis on the direct and indirect relationship between transport infrastructure investment and rural development. The study finds that the transport infrastructure investment in rural Korea impacts clearly on both the population base promotion and production and income growth through better accessibility. In addition, the investment has an indirect effects on the production and income growth through its influence on the population base promotion. This implies that the transport infrastructure investment in rural Korea so far exerts both long-term and short-term influences on rural development through various channels of impacts.

• Journal of the Korean Society for Railway
• /
• v.14 no.3
• /
• pp.276-284
• /
• 2011

In our study, we present a new LOGIT-based traffic assignment model applicable to intercity railway network. Most traffic assignment models have been developed for public transit assignment in urban area, so that they are known to produce unrealistic results in intercity railway demand analysis. Especially, since the introduction of KTX, more passengers are using a route including KTX service and the schedule becomes more compatible with transfer. Our study presents a new LOGIT-based traffic assignment model considering passenger transfer. To do so, we suggest a new route search algorithm to find K paths with non increasing order in the utility value.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1557-1560
• /
• 2004

무선 Ad-Hoc 네트워크를 위한 대부분의 라우팅 프로토콜들은 모든 링크가 양방향임을 가정하고 설계되었다. 그러나 현실적으로 Ad-Hoc 네트워크에 참여하는 노드들은 서로 다른 전송 파워를 가질 수 있고, 잡음 또는 간섭 등으로 인하여 지역적이고 일시적인 단 방향 링크를 야기시킬 수 있다. 기존 Ad-Hoc 라우팅 프로토콜 중의 하나인 AODV 프로토콜은 단 방향 링크 존재 시에 이를 경로에서 제거함으로써 양방향 링크만으로 구성된 경로를 다시 탐색하게 된다. 본 논문에서는 단방향 링크 존재 시에 야기될 수 있는 AODV 프로토콜의 문제점과 이를 해결하기 위한 기존 연구들을 소개하고, 나아가서 단?향 링크 존재 시에 적용할 수 있는 AODV 프로토콜을 변형한 라우팅 알고리즘을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.846-849
• /
• 2020

하이퍼파라미터(초매개변수) 최적화란 모델의 학습에 앞서 미리 설정해야 하는 값인 하이퍼파라미터의 최적값을 탐색하는 문제이다. 이때의 최적값은 학습을 끝낸 모델의 성능을 가능한 최대치로 높이게 하는 값이다. 한편, 최근 모바일 장치를 이용한 포지셔닝 데이터의 대량 수집이 가능해지면서 이를 활용하여 위치 기반 서비스(Location-Based Service)를 위한 데이터 분석 및 예측에 관한 연구가 활발히 이루어졌다. 그중 이동 경로를 이미지로 패턴화하여 국소 지역 내에서 다음 위치를 예측하는 CNN 모델에 대해서 하이퍼파라미터 튜닝을 진행하였다. 결과적으로 베이지안 최적화(Bayesian Optimization)를 통해 모델의 성능을 평균 3.7%, 최대 9.5%까지 개선할 수 있음을 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.216-219
• /
• 2020

본 논문은 폐기물 수거함 관리 프로그램을 구현하는 것을 통해 원격으로 생활 폐기물의 양을 측정, 관리함으로써 스마트 시티의 폐기물 관리 시스템을 구현하고자 하는 것을 목적으로 한다. 폐기물 수거함에 부착된 초음파 센서를 통해 폐기물의 양을 측정하고, 폐기물 수거 차량이 효과적으로 수거함을 방문할 수 있는 경로를 찾아 제시해줄 수 있도록 한다.

• Journal of the Korean Society for Railway
• /
• v.12 no.4
• /
• pp.488-498
• /
• 2009

The characteristics of intercity rail network are different from those of public transit network in urban area. In this paper, we proposed a new transit assignment model which is generalized form of deterministic assignment model by introducing line selection probability on route section. This model consider various characteristics of intercity rail and simplify network expansion for appling search algorithms developed in road assignment model. We showed the model availability by comparing with existing models using virtual networks. The tests on a small scale network show that this model is superior to existing models for predicting intercity rail demand.