• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.157-168
• /
• 2006

Spatial detection system such as AVI, GPS, and Beacon etc. can provide spatial travel time only after a vehicle Passes through a road section. In this context, majority of the existing studies on the link travel time estimation area has focused on the arrival time-based link travel time estimation. rather than departure time-based link travel time estimation. Even if some of the researches on this area have developed departure time-based link travel time estimation algorithms, they are limited in that they are not applicable in a real-time mode. The objective of this study is to develop an departure time-based link travel time estimation algorithm which is applicable in a real-tine mode. Firstly, this study discussed the tradeoff between accuracy and timeliness of the departure time-based on-line link travel time estimates. Secondly, this study developed an departure time-based on-line link travel time estimation algorithm which utilizes the Baysian inference logic. It was found that the proposed approach could estimate departure time-based link travel times in a real-time context with an acceptable accuracy and timeliness.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.26 no.2
• /
• pp.39-46
• /
• 2018

Departure Manager (DMAN) is a tool to optimize the departure sequence and to suggest appropriate take-off time and off-block time of each departure aircraft to the air traffic controllers. To that end, Variable Taxi Time (VTT), which is time duration of the aircraft from the stand to the runway, should be estimated. In this paper, a study for development of VTT prediction algorithm based on machine learning techniques is presented. The factors affecting aircraft taxi speeds were identified through the analysis of historical traffic data on the airport surface. The prediction model suggested in this study consists of several sub-models that reflect different types of surface maneuvers based on the analysis result. The prediction performance of the proposed method was evaluated using the actual operational data.

• Journal of Korean Society of Transportation
• /
• v.24 no.3 s.89
• /
• pp.167-176
• /
• 2006

An minimum path algorithm for integrated networks with departure time constraints require considering arrival time of arriving mode, transfer time. waiting time, and departure time of next mode. Integrated network with diverse modes commonly include departure time constraints. Because public mode suck as train and airplane have fixed service schedule which provide passengers. This study developed the k-path algorithm in integrated network with time varying conditions and departure time constraints. We proposed the extended method based on entire path deletion method, and examined the application of the proposed algorithm through case study.

• Journal of the Korea Convergence Society
• /
• v.9 no.5
• /
• pp.7-14
• /
• 2018

The purpose of this study is to analyze the effect of commuter's departure time on transportation system in future traffic system operated autonomous vehicle using agent based model. Various scenarios have been set up, such as when all passenger choose a similar departure time, or if the passenger chooses a different departure time. Also, this study tried to analyze the effect of road capacity. It was found that although many of the scenarios had been completed in a stable manner, many commuters were significantly coordinated at the desired departure time. In particular, in the case of a reduction in road capacity or in certain scenarios, it has been shown that, despite excessive schedule adjustments, many passengers are unable to commute before 9 o'clock. As a result, it is suggested that traffic management and pricing policies are different from current ones in the era of autonomous car operation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.9
• /
• pp.766-772
• /
• 2016

Recent advances in networking and computers, especially internet of things (IoT) technologies, have improved the quality of home life and industrial sites. However, the security vulnerability of IoT technologies causes life-threatening issues and information leakage concerns. Studies regarding security algorithms are being conducted. In this paper, we proposed SEED algorithms based on one time passwords (OTPs). The specified server sent time data to the client every 10 seconds. The client changed the security key using time data and generated a ciphertext by combining the changed security key and the matrix. We applied the SEED algorithms with enhanced security to Linux-based embedded boards and android smart phones, then conducted a door lock control experiment (door lock & unlock). In this process, the power consumed for decryption was measured. The power consumption of the OTP-based algorithm was measured as 0.405-0.465W. The OTP-based algorithm didn't show any difference from the existing SEED algorithms, but showed a better performance than the existing algorithms.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.143-155
• /
• 2009

A dynamic traffic assignment (DTA) has recently been implemented in many practical projects. The core of dynamic model is the inclusion of time scale. If excluding the time dimension from a DTA model, the framework of a DTA model is similar to that of static model. Similar to static model, with given exogenous travel demand, a DTA model loads vehicles on the network and finds an optimal solution satisfying a pre-defined route choice rule. In most DTA models, the departure pattern of given travel demand is predefined and assumed as a fixed pattern, although the departure pattern of driver is changeable depending on a network traffic condition. Especially, for morning peak commute where most drivers have their preferred arrival time, the departure time, therefore, should be modeled as an endogenous variable. In this paper, the authors point out some shortcomings of current DTA model and propose an alternative approach which could overcome the shortcomings of current DTA model. The authors substitute a traditional definition for time-dependent OD table by a new definition in which the time-dependent OD table is defined as arrival time-based one. In addition, the authors develop a new DTA model which is capable of finding an equilibrium departure pattern without the use of schedule delay functions. Three types of objective function for a new DTA framework are proposed, and the solution algorithms for the three objective functions are also explained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.783-792
• /
• 2003

We consider a finite-buffer discrete-time queueing system with fixed-size bulk-service discipline: Geo/ $G^{B}$1/K＋B. The main purpose of this paper is to present a performance analysis of this system that has a wide range of applications in Asynchronous Transfer Mode (ATM) and other related telecommunication systems. For this purpose, we first derive the departure-epoch probabilities based on the embedded Markov chain method. Next, based on simple rate in and rate out argument, we present stable relationships for the steady-state probabilities of the queue length at different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of number of packets in the system at three different epochs and the loss probability. The numerical results are presented for a deterministic service-time distribution - a case that has gained importance in recent years.s.

• Journal of Korean Society of Transportation
• /
• v.25 no.2 s.95
• /
• pp.145-155
• /
• 2007

The objectives of this study aye to develop an on-line departure time-based travel time estimation method and to determine an optimal link length for the estimation. This study developed a link-based rolling horizon logic as the travel time estimation method. In order to determine an optimal link length, the information error of the travel time provision from the user's perspective was defined and employed as a selection criterion. It was found that, when the travel time aggregation size was set as five minutes, a link length of four kilometers gave the most accurate result.

• International Journal of Highway Engineering
• /
• v.10 no.1
• /
• pp.145-154
• /
• 2008

The purpose of this study is to evaluate the quality of on-line departure time-based link travel time estimates. For this, accuracy (i.e. estimation error) and timeliness (i.e. degree of time lag) are proposed as MOE of the quality of on-line link travel time estimates. Then the relationship between quality of link travel time estimates and link length and level of congestion is analyzed. It was found that there is trade-off between the accuracy and timeliness of link travel time estimates. The estimation error was modeled to consist of two components: one is systematic error and the other is mean square error which reflects level of congestion. further, time lag was again segmented into three parts for the analysis purpose. There are minimum one, congestion-related one, and update interval-related one. From the real-world data using AVI system, it was revealed that regardless of the link length and level of congestion, 10 minutes of time lag occurs in general.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.24 no.4
• /
• pp.44-52
• /
• 2016

The departure flow management is the planning tool to optimize the schedule of the departure aircraft and allows them to join smoothly into the overhead traffic flow. To that end, the arrival time prediction to the merge point for the cruising aircraft is necessary to determined. This paper proposes a trajectory prediction model for the cruising aircraft based on the machine learning approach. The proposed method includes the trajectory vectored from the procedural route and is applied to the historical data to evaluate the prediction performances.