• Title/Summary/Keyword: departure time based

Search Result 126, Processing Time 0.034 seconds

Forecasting of Motorway Path Travel Time by Using DSRC and TCS Information (DSRC와 TCS 정보를 이용한 고속도로 경로통행시간 예측)

  • Chang, Hyun-ho;Yoon, Byoung-jo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.37 no.6
    • /
    • pp.1033-1041
    • /
    • 2017
  • Path travel time based on departure time (PTTDP) is key information in advanced traveler information systems (ATIS). Despite the necessity, forecasting PTTDP is still one of challenges which should be successfully conquered in the forecasting area of intelligent transportation systems (ITS). To address this problem effectively, a methodology to dynamically predict PTTDP between motorway interchanges is proposed in this paper. The method was developed based on the relationships between traffic demands at motorway tollgates and PTTDPs between TGs in the motorway network. Two different data were used as the input of the model: traffic demand data and path travel time data are collected by toll collection system (TCS) and dedicated short range communication (DSRC), respectively. The proposed model was developed based on k-nearest neighbor, one of data mining techniques, in order for the real applications of motorway information systems. In a feasible test with real-world data, the proposed method performed effectively by means of prediction reliability and computational running time to the level of real application of current ATIS.

Progressive Iterative Forward and Backward (PIFAB) Search Method to Estimate Path-Travel Time on Freeways Using Toll Collection System Data (고속도로 경로통행시간 산출을 위한 전진반복 전후방탐색법(PIFAB)의 개발)

  • NamKoong, Seong
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.5 s.83
    • /
    • pp.147-155
    • /
    • 2005
  • The purpose of this paper is to develop a method for estimation of reliable path-travel time using data obtained from the toll collection system on freeways. The toll collection system records departure and arrival time stamps as well as the identification numbers of arrival and destination tollgates for all the individual vehicles traveling between tollgates on freeways. Two major issues reduce accuracy when estimating path-travel time between an origin and destination tollgate using transaction data collected by the toll collection system. First, travel time calculated by subtracting departure time from arrival time does not explain path-travel time from origin tollgate to destination tollgate when a variety of available paths exist between tollgates. Second, travel time may include extra time spent in service and/or rest areas. Moreover. ramp driving time is included because tollgates are installed before on-ramps and after off-ramps. This paper describes an algorithm that searches for arrival time when departure time is given between tollgates by a Progressive Iterative Forward and Backward (PIFAB) search method. The algorithm eventually produces actual path-travel times that exclude any time spent in service and/or rest areas as well as ramp driving time based on a link-based procedure.

Toward Stochastic Dynamic Traffic Assignment Model: Development and Application Experiences (Stochastic Dynamic Assignment 모형의 개발과 활용)

  • 이인원;정란희
    • Journal of Korean Society of Transportation
    • /
    • v.11 no.1
    • /
    • pp.67-86
    • /
    • 1993
  • A formulation of dynamic traffic assignment between multiple origins and single destination was first introduced in 1987 by Merchant and Nemhauser, and then expanded for multiple destination in the late 1980's (Carey, 1987). Based on behavioral choice theory which provides proper demand elasticities with respect to changes in policy variables, traffic phenomena can be analysed more realistically, especially in peak periods. However, algorithms for these models are not well developed so far(working with only small toy network) and solutions of these models are not unique. In this paper, a new model is developed which keeps the simplicity of static models, but provides the sensitivity of dynamic models with changes of O-D flows over time. It can be viewed as a joint departure time and route choice model, in the given time periods(6-7, 7-8, 8-9 and 9-10 am). Standard multinomial logit model has been used for simulating the choice behavior of destination, mode, route and departure time within a framework of the incremental network assignment model. The model developed is workable in a PC 386 with 175 traffic zones and 3581 links of Seoul and tested for evaluating the exclusive use of Namsan tunnel for HOV and the left-turn prohibition. Model's performance results and their statistical significance are also presented.

  • PDF

Effective simulation-based optimization algorithm for the aircraft runway scheduling problem

  • Wided, Ali;Fatima, Bouakkaz
    • Advances in aircraft and spacecraft science
    • /
    • v.9 no.4
    • /
    • pp.335-347
    • /
    • 2022
  • Airport operations are well-known as a bottleneck in the air traffic system, putting growing pressure on the world's busiest airports to schedule arrivals and departures as efficiently as possible. Effective planning and control are essential for increasing airport efficiency and reducing aircraft delays. Many algorithms for controlling the arrival/departure queuing area are handled, considering it as first in first out queues, where any available aircraft can take off regardless of its relative sequence with other aircraft. In the suggested system, this problem was compared to the problem of scheduling n tasks (plane takeoffs and landings) on a multiple machine (runways). The proposed technique decreases delays (via efficient runway allocation or allowing aircraft to be expedited to reach a scheduled time) to enhance runway capacity and decrease delays. The aircraft scheduling problem entails arranging aircraft on available runways and scheduling their landings and departures while considering any operational constraints. The topic of this work is the scheduling of aircraft landings and takeoffs on multiple runways. Each aircraft's takeoff and landing schedules have time windows, as well as minimum separation intervals between landings and takeoffs. We present and evaluate a variety of comprehensive concepts and solutions for scheduling aircraft arrival and departure times, intending to reduce delays relative to scheduled times. When compared to First Come First Serve scheduling algorithm, the suggested strategy is usually successful in reducing the average waiting time and average tardiness while optimizing runway use.

Evaluation of patient transportation and response intervals among emergency medical squads (구급대 환자이송과 반응시간의 평가)

  • Park, Sang-Kyu;Uhm, Tai-Hwan
    • The Korean Journal of Emergency Medical Services
    • /
    • v.22 no.3
    • /
    • pp.47-54
    • /
    • 2018
  • Purpose: The purpose of this study was to present evidence for quality management based on analysis of patient transportation and response intervals among emergency medical squads. Methods: The chi-square test was used to determine whether mental status and patient assessment affected direct medical control and hospital destination. One way analysis of variance was used to compare response intervals depending on mental status and patient assessment using data drawn from 1172 prehospital care reports. Results: There was a statistically significant relationship between mental status and direct medical control (p<.001); there was a statistically significant relationship between patient assessment and hospital destination (p=.011). However, there was no statistically significant relationship between mental status and hospital destination. The interval from arrival at the patient's side to departure from the scene showed a statistically significant difference (p<.001, p<.001), however, it took the longest time (16.8 minutes) in unresponsive patients. It showed a statistically significant difference (p<.001) in the interval from arrival at patient's side to departure from the scene depending on patient assessment; however, it took the longest time (9.6 minutes) in emergency patients. Conclusion: There was call for direct medical control based on patient assessment; however, patient transportation and response intervals were not appropriate.

Dynamic OD Estimation with Hybrid Discrete Choice of Traveler Behavior in Transportation Network (복합 통행행태모형을 이용한 동적 기.종점 통행량 추정)

  • Kim, Chae-Man;Jo, Jung-Rae
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.6 s.92
    • /
    • pp.89-102
    • /
    • 2006
  • The purpose of this paper is to develop a dynamic OD estimating model to overcome the limitation of depicting teal situations in dynamic simulation models based on static OD trip. To estimate dynamic OD matrix we used the hybrid discrete choice model(called the 'Demand Simulation Model'), which combines travel departure time with travel mode and travel path. Using this Demand Simulation Model, we deduced that the traveler chooses the departure time and mode simultaneously, and then choose his/her travel path over the given situation In this paper. we developed a hybrid simulation model by joining a demand simulation model and the supply simulation model (called LiCROSIM-P) which was Previously developed. We simulated the hybrid simulation model for dependent/independent networks which have two origins and one destination. The simulation results showed that AGtt(Average gap expected travel time and simulated travel time) did not converge, but average schedule delay gap converged to a stable state in transportation network consisted of multiple origins and destinations, multiple paths, freeways and some intersections controlled by signal. We present that the hybrid simulation model can estimate dynamic OD and analyze the effectiveness by changing the attributes or the traveler and networks. Thus, the hybrid simulation model can analyze the effectiveness that reflects changing departure times, travel modes and travel paths by demand management Policy, changing network facilities, traffic information supplies. and so on.

Estimating a Range of Lane Departure Allowance based on Road Alignment in an Autonomous Driving Vehicle (자율주행 차량의 도로 평면선형 기반 차로이탈 허용 범위 산정)

  • Kim, Youngmin;Kim, Hyoungsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.4
    • /
    • pp.81-90
    • /
    • 2016
  • As an autonomous driving vehicle (AV) need to cope with external road conditions by itself, its perception performance for road environment should be better than that of a human driver. A vision sensor, one of AV sensors, performs lane detection function to percept road environment for performing safe vehicle steering, which relates to define vehicle heading and lane departure prevention. Performance standards for a vision sensor in an ADAS(Advanced Driver Assistance System) focus on the function of 'driver assistance', not on the perception of 'independent situation'. So the performance requirements for a vision sensor in AV may different from those in an ADAS. In assuming that an AV keep previous steering due to lane detection failure, this study calculated lane departure distances between the AV location following curved road alignment and the other one driving to the straight in a curved section. We analysed lane departure distance and time with respect to the allowance of lane detection malfunction of an AV vision sensor. With the results, we found that an AV would encounter a critical lane departure situation if a vision sensor loses lane detection over 1 second. Therefore, it is concluded that the performance standards for an AV should contain more severe lane departure situations than those of an ADAS.

Planning A Customer Transportation System Operation using Simulation (시뮬레이션을 이용한 고객 수송 시스템 운영 방안 수립)

  • Lee, Y.J.;Kong, M.C.;Yoon, S.Y.;Jeon, T.B.
    • Journal of Industrial Technology
    • /
    • v.37 no.1
    • /
    • pp.5-11
    • /
    • 2017
  • The purpose of this research is to propose an efficient loop line operation plan for customer transportation in a new theme park. Based on the expected customer arrivals, customer loading/unloading methods, and scheduled/non-scheduled departure schemes, movement time between stations etc., we have performed indepth analyses and derived the best optimal policy. Our results show that, over all, the operation with separate loading/unloading doors and scheduled departure is preferred to the other options. We then derived the optimal number of trains and cars meeting minimal customer unsatisfaction with low cost for each season.

A Lane-Departure Identification Based on Linear Regression and Symmetry of Lane-Related Parameters (차선관련 파라미터의 대칭성과 선형회귀에 기반한 차선이탈 인식)

  • Yi Un-Kun;Lee Joon-Woong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.5
    • /
    • pp.435-444
    • /
    • 2005
  • This paper presents a lane-departure identification (LDI) algorithm for a traveling vehicle on a structured road. The algorithm makes up for the weak points of the former method based on EDF[1] by introducing a Lane Boundary Pixel Extractor (LBPE), the well known Hough transform, and liner regression. As a filter to extract pixels expected to be on lane boundaries, the LBPE plays an important role in enhancing the robustness of LDI. Utilizing the pixels from the LBPE the Hough transform provides the lane-related parameters composed of orientation and distance, which are used in the LDI. The proposed LDI is based on the fact the lane-related parameters of left and right lane boundaries are symmetrical as for as the optical axis of a camera mounted on a vehicle is coincident with the center of lane; as the axis deviates from the center of lane, the symmetrical property is correspondingly lessened. In addition, the LDI exploits a linear regression of the lane-related parameters of a series of successive images. It plays the key role of determining the trend of a vehicle's traveling direction and minimizing the noise effect. Except for the two lane-related parameters, the proposed algorithm does not use other information such as lane width, a curvature, time to lane crossing, and of feet between the center of a lane and the optical axis of a camera. The system performed successfully under various degrees of illumination and on various road types.