• Title/Summary/Keyword: Travel path model

Search Result 90, Processing Time 0.032 seconds

A Development of Preprocessing Models of Toll Collection System Data for Travel Time Estimation (통행시간 추정을 위한 TCS 데이터의 전처리 모형 개발)

  • Lee, Hyun-Seok;NamKoong, Seong J.
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.5
    • /
    • pp.1-11
    • /
    • 2009
  • TCS Data imply characteristics of traffic conditions. However, there are outliers in TCS data, which can not represent the travel time of the pertinent section, if these outliers are not eliminated, travel time may be distorted owing to these outliers. Various travel time can be distributed under the same section and time because the variation of the travel time is increase as the section distance is increase, which make difficult to calculate the representative of travel time. Accordingly, it is important to grasp travel time characteristics in order to compute the representative of travel time using TCS Data. In this study, after analyzing the variation ratio of the travel time according to the link distance and the level of congestion, the outlier elimination model and the smoothing model for TCS data were proposed. The results show that the proposed model can be utilized for estimating a reliable travel time for a long-distance path in which there are a variation of travel times from the same departure time, the intervals are large and the change in the representative travel time is irregular for a short period.

  • PDF

Searching optimal path using genetic algorithm (유전 알고리즘을 이용한 최적 경로 탐색)

  • Kim, Kyungnam;cho, Minseok;Lee, Hyunkyung
    • Proceeding of EDISON Challenge
    • /
    • 2015.03a
    • /
    • pp.479-483
    • /
    • 2015
  • In case of the big city, choosing the adequate root of which we can reach the destination can affect the driver's condition and driving time. so it is quite important to find the optimal routes for arriving the destination as considering the factors, such as driving conditions or travel time and so on. In this paper, we develop route choice model with considering driving conditions and travel time, and it can search the optimal path which make drivers reduce their fatigues using genetic algorithm.

  • PDF

Path Control Algorithm for AGV Using Right of Path Occupation (경로 점유권을 이용한 AGV의 경로 제어 알고리즘)

  • Joo, Young-Hoon;Kim, Jong-Seon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.592-598
    • /
    • 2008
  • This paper presents collision prediction and avoidance method for AGVS (Automatic Guide Vehicle System). Also, we propose the PO(Right of Path Occupying) with decentralized delay time for collision avoidance. Classified essential element of AGV's working environment is modeled in this paper. Using this model, we propose a new shortest path algorithm using A* search algorithm and obtain the information on AGVs travel time, coordinates and rotation vector. Finally, we use the AGVs information data as input for simulation program. The simulation practice is used in order to evaluate a collision prediction and avoidance, and it has been presented to demonstrate the applicability of the minimize delay time.

A Study on the Behavior of the User according to the Distribution Development of Online Travel Agency

  • MIN, So-Ra;LEE, Sun-Mi
    • Journal of Distribution Science
    • /
    • v.18 no.6
    • /
    • pp.25-35
    • /
    • 2020
  • Purpose:Travel agencies have use digital tools in order to shift the paradigm in how business is conducted. Online travel agencies provide the same services as a normal travel agency, including hotels, transportation, guided tours, reservations, and related services, but using an "online platform. Travelers planning a trip can use a lot of forms to collect information and have access to a larger amount of information, so the factors that influence the user's behavioral intention are very important. This research has the conducted to find what factors lead to the attitudes of consumers in using OTA using the UTAUT model. Research design, data and methodology: The object of this study were respondents of a google survey using convenient sample extraction method, chosen among consumers who gathered information, or purchased a product. A total of 217 of the 235 questionnaires Google survey answered were used in the final analysis, excluding insincere responses. Using PSS v.21 and AMOS v.21, frequency analysis, feasibility and reliability analysis, path analysis was performed. Results: UTAUT affects OTA use satisfaction and trust, and OTA satisfaction and trust affect behavior intention. Conclusions: Research was conducted using the UTAUT model to explore factors that affect the attitudes of users of online travel agencies (OTA).

A Real Time Traffic Flow Model Based on Deep Learning

  • Zhang, Shuai;Pei, Cai Y.;Liu, Wen Y.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2473-2489
    • /
    • 2022
  • Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

A Study on the Stochastic User Equilibrium Assignment (확솔적 이용자 평형통행 배분에 관한 연구)

  • 이승재;전경수;임강원
    • Journal of Korean Society of Transportation
    • /
    • v.8 no.1
    • /
    • pp.55-71
    • /
    • 1990
  • The behavioral mechanism underlying the traffic assignment model is a choice, or decision-making process of traveling paths between origins and destinations. The deterministic approach to traffic assignment assumes that travelers choose shortest path from their origin-destination pair. Although this assumption seems reasonable, it presumes that all travelers have perfect information regarding travel time, that they make consistently correct decision, and that they all behave in identical fashion. Stochastic user equilibrium assignment relaxes these presumptions by including a random component in traveler's perception of travel time. The objective of this study is to compare "A Model of Deterministic User Equilibrium Assignment" with "Models of Stochastic User Equilibrium Assignment" in the theoretical and practical aspects. Specifically, SUE models are developed to logit and probit based models according to discrete choice functions. The models were applied to sioux Falls net ork consisting of 24 zones, 24 nodes and 76 links. The distribution of perceived travel time was obtained by using the relationship between speed and traffic flow.

  • PDF

Development of a Motion Control Algorithm for the Automatic Operation System of Overhead Cranes (천장크레인의 무인운전 시스템을 위한 운동제어 알고리즘 개발)

  • Lee, Jong-Kyu;Park, Young-Jo;Lee, Sang-Ryong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.10
    • /
    • pp.3160-3172
    • /
    • 1996
  • A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

Accuracy Improvement of the Transport Index in AFC Data of the Seoul Metropolitan Subway Network (AFC기반 수도권 지하철 네트워크 통행지표 정확도 향상 방안)

  • Lee, Mee-Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.41 no.3
    • /
    • pp.247-255
    • /
    • 2021
  • Individual passenger transfer information is not included in Seoul metropolitan subway Automatic Fare Collection (AFC) data. Currently, basic data such as travel time and distance are allocated based on the TagIn terminal ID data records of AFC data. As such, knowledge of the actual path taken by passengers is constrained by the fact that transfers are not applied, resulting in overestimation of the transport index. This research proposes a method by which a transit path that connects the TagIn and TagOut terminal IDs in AFC data is determined and applied to the transit index. The method embodies the concept that a passenger's line of travel also accounts for transfers, and can be applied to the transit index. The path selection model for the passenger calculates the line of transit based on travel time minimization, with in-vehicle time, transfer walking time, and vehicle intervals all incorporated into the travel time. Since the proposed method can take into account estimated passenger movement trajectories, transport-related data of each subway organization included in the trajectories can be accurately explained. The research results in a calculation of 1.47 times the values recorded, and this can be evaluated directly in its ability to better represent the transportation policy index.

Correlated damage probabilities of bridges in seismic risk assessment of transportation networks: Case study, Tehran

  • Shahin Borzoo;Morteza Bastami;Afshin Fallah;Alireza Garakaninezhad;Morteza Abbasnejadfard
    • Earthquakes and Structures
    • /
    • v.26 no.2
    • /
    • pp.87-96
    • /
    • 2024
  • This paper proposes a logistic multinomial regression approach to model the spatial cross-correlation of damage probabilities among different damage states in an expanded transportation network. Utilizing Bayesian theory and the multinomial logistic model, we analyze the damage states and probabilities of bridges while incorporating damage correlation. This correlation is considered both between bridges in a network and within each bridge's damage states. The correlation model of damage probabilities is applied to the seismic assessment of a portion of Tehran's transportation network, encompassing 26 bridges. Additionally, we introduce extra daily traffic time (EDTT) as an operational parameter of the transportation network and employ the shortest path algorithm to determine the path between two nodes. Our results demonstrate that incorporating the correlation of damage probabilities reduces the travel time of the selected network. The average decrease in travel time for the correlated case compared to the uncorrelated case, using two selected EDTT models, is 53% and 71%, respectively.

Solution Algorithms for Logit Stochastic User Equilibrium Assignment Model (확률적 로짓 통행배정모형의 해석 알고리듬)

  • 임용택
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.2
    • /
    • pp.95-105
    • /
    • 2003
  • Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.