• Management Science and Financial Engineering
• /
• v.10 no.1
• /
• pp.53-75
• /
• 2004

Most existing studies on time-dependent networks have been focused on finding a minimum delay path given a departure time at the origin. There, however, frequently happens a situation where users can select any departure time in a certain time interval and want to spend as little time as possible on traveling the networks. In that case. the delay spent on traveling networks depends on not only paths but also the actual departure time at the origin. In this paper, we propose a new problem in time-dependent networks whose objective is to find an optimal departure time given possible departure time interval at the origin. From the optimal departure time, we can obtain a path with minimum delay among all paths for possible departure times at the origin. In addition, we present an algorithm for finding an optimal departure time by enumerating trees which remain shortest path tree for a certain time interval.

• 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.

• The Journal of Natural Sciences
• /
• v.7
• /
• pp.75-82
• /
• 1995

We obtain the departure process of a D-BMAP/Geo/1/K queue. We also study the burstiness and correlation of the departure process. We have observed that the autocorrelation coefficients of the interdeparture time(correlogram) of the departure process may oscillated.

• The Journal of Natural Sciences
• /
• v.8 no.2
• /
• pp.83-91
• /
• 1996

We first obtain the departure process of a D-BMAP/Geo/1/K queue. The departure process is then exactly characterized by a k-state MMBP in order to capture the burstiness and correlation of the departure process.

• 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 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.13 no.4
• /
• pp.105-115
• /
• 1995

This paper deals with an operation concept of "time-transfer of buses", in which buses arrive a transfer center at the same time and allow passengers to transfer to other bus lines, so that passengerscan go anywhere all the timed-transfere buses operate with only one transfer. This timed-transfer bus system is known as an efficient operating technique which can be adopted in an area with sparsely distrubuted bus demand. A model of timed-transfer is estabilished in terms of vaious factors such as the expected(or average) arrival time, distribution of arrival time, timed-transfer cycle, shceduled departure time, etc. It is assumed that the objective of timed-transfer bus system is to minimize the total transfer waiting time. The optimal schedualed arrival time or buffer time(time required to arrive ealy in consideration of delay) is analyzed for a general case and various speicial cases. It was found that the optiaml buffer time is an inverse funcion of the timed-transfer cycl and increases with the cycle time, assumin g that there is a fixed scheduled departure time at the transfer cetner regardless of whether one or more buses fail to arrive before the scheduled departure time. If buses are to wait uhtil all the buses arrive at the transfer center, that is, the transfer departure time is vairable, the optimal scheduled arrival times can be obtained by a mathmatical programming.

• 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 Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.140-149
• /
• 2001

The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes 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, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.

• The KIPS Transactions:PartB
• /
• v.16B no.1
• /
• pp.35-46
• /
• 2009

Lane extraction and lane departure warning algorithms using the image sensor attached in the vehicle are addressed. With the research about intelligent automobile, there have been many algorithms about lane recognition and lane departure warning system. However, since these algorithms require to detect 2 lanes, the high time complexity and the low recognition rate under various driving circumstances are critical problems. In this paper, we present a lane departure warning algorithm using single lane extraction and center point analysis that achieves the fast processing time and high detection rate. From the geometry between camera and objects, the region of interest (ROI) is determined and splitted into two parts. Hough transform detects the part of the lane. After the detected lane is restored to have a pre-determined size, lane departure is estimated by calculating the distance from the center point. On real driving environments, the presented algorithm is compared with previous algorithms. Experiment results support that the presented algorithm is fast and accurate.