• Title/Summary/Keyword: Travel path model

Search Result 92, Processing Time 0.023 seconds

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.

A User Optimer Traffic Assignment Model Reflecting Route Perceived Cost (경로인지비용을 반영한 사용자최적통행배정모형)

  • Lee, Mi-Yeong;Baek, Nam-Cheol;Mun, Byeong-Seop;Gang, Won-Ui
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.2
    • /
    • pp.117-130
    • /
    • 2005
  • In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

Development of a Path Generation and Tracking Algorithm for a Korean Auto-guidance Tillage Tractor

  • Han, Xiong-Zhe;Kim, Hak-Jin;Moon, Hee-Chang;Woo, Hoon-Je;Kim, Jung-Hun;Kim, Young-Joo
    • Journal of Biosystems Engineering
    • /
    • v.38 no.1
    • /
    • pp.1-8
    • /
    • 2013
  • Purpose: Path planning and tracking algorithms applicable to various agricultural operations, such as tillage, planting, and spraying, are needed to generate steering angles for auto-guidance tractors to track a point ahead on the path. An optimal coverage path algorithm can enable a vehicle to effectively travel across a field by following a sequence of parallel paths with fixed spacing. This study proposes a path generation and tracking algorithm for an auto-guided Korean tractor with a tillage implement that generates a path with C-type turns and follows the generated path in a paddy field. A mathematical model was developed to generate a waypoint path for a tractor in a field. This waypoint path generation model was based on minimum tractor turning radius, waypoint intervals and LBOs (Limit of Boundary Offsets). At each location, the steering angle was calculated by comparing the waypoint angle and heading angle of the tractor. A path following program was developed with Labview-CVI to automatically read the waypoints and generate steering angles for the tractor to proceed to the next waypoint. A feasibility test of the developed program for real-time path tracking was performed with a mobile platform traveling on flat ground. The test results showed that the developed algorithm generated the desired path and steering angles with acceptable accuracy.

A STUDY ON SELECTING OPTIMAL HAUL ROUTES OF EARTHMOVING MACHINE

  • Han-Seong Gwak;Chang-Yong Yi;Chang-Baek Son;Dong-Eun Lee
    • International conference on construction engineering and project management
    • /
    • 2013.01a
    • /
    • pp.513-516
    • /
    • 2013
  • Earthmoving equipment's haul-route has a great influence on the productivity of the earth work operation. Haul-route grade is a critical factor in selecting the haul-route. The route that has low grade resistance contributes to increase machine travel speed and production. This study presents a mathematical model called "Hauling-Unit Optimal Routes Selecting system" (HUORS). The system identifies optimal path that maximize the earth-work productivity. It consists of 3 modules, i.e., (1) Module 1 which inputs site characteristic data and computes site location and elevation using GIS(Geographical Information System); (2) Module 2 which calculates haul time; (3) Module 3 which displays an optimum haul-route by considering the haul-route's gradient resistances (i.e., from the departure to the destination) and hauling time. This paper presents the system prototype in detail. A case study is presented to demonstrate the system and verifies the validity of the model.

  • PDF

Motion Analysis of Power Tiller for Stability Improvement (III) -Verification of a Mathematical Model of Motion for Power Tiller-Trailer System- (동력경운기(動力耕耘機)의 안정성(安定性) 향상(向上)을 위한 주행(走行) 및 선회(旋回)에 관(關)한 연구(硏究) (III) -동력경운기(動力耕耘機)-트레일러 시스템 운동(運動)모델의 검증(檢證)-)

  • Park, K.J.;Ryu, K.H.;Chung, C.J.;Kim, K.U.;Yoo, S.N.
    • Journal of Biosystems Engineering
    • /
    • v.13 no.2
    • /
    • pp.1-8
    • /
    • 1988
  • A scale model of power tiller-trailer system with the same kinematic characteristics was constructed one eighth of the actual size to validate the effectiveness of mathematical model of motion. The parameters for the scale model of power tiller-trailer system were measured by a series of laboratory experiments. Validation tests for the: scale model was conducted under several ground and operating conditions. The tests were performed on artificial ground surfaces with several kind, of slope and obstacle. The travel path of the scale model was photographed successively in three directions. The travel paths obtained from both the film analysis and the simulation model appeared to be consistent with each other. It was concluded that the simulation model could be used to predict the motion of actual power tiller-trailer system if the parameters for actual power tiller and trailer are provided.

  • PDF

Transoceanic Propagation of 2011 East Japan Earthquake Tsunami

  • Choi, Byung Ho;Kim, Kyeong Ok;Min, Byung Il;Pelinovsky, Efim
    • Ocean and Polar Research
    • /
    • v.36 no.3
    • /
    • pp.225-234
    • /
    • 2014
  • The 2011 Tohoku earthquake triggered extremely destructive tsunami waves which propagated over the Pacific Ocean, Atlantic Ocean through Drake Passage and Indian Ocean respectively. A total of 10 tide-gauge records collected from the UNESCO/IOC site were analyzed through a band-pass digital filtering device to examine the observed tsunami characteristics. The ray tracing method and finite-difference model with GEBCO 30 arc second bathymetry were also applied to compare the travel times of the Tohoku-originated tsunami, particularly at Rodrigues in the Indian Ocean and King Edward Point in the Atlantic Ocean with observation-based estimates. At both locations the finite-difference model produced the shortest arrival times, while the ray method produced the longest arrival times. Values of the travel time difference however appear to be within tolerable ranges, considering the propagation distance of the tsunami waves. The observed tsunami at Rodrigues, Mauritius in the west of the Madagascar was found to take a clockwise travel path around Australia and New Zealand, while the observed tsunami at King Edward Point in the southern Atlantic Ocean was found to traverse the Pacific Ocean and then passed into the Atlantic Ocean through the Drake Strait. The formation of icebergs captured by satellite images in Sulzberger in the Antarctica also supports the long-range propagation of the Tohoku-originated tsunami.

Search for an Optimal-Path Considering Various Attributes (다양한 경로속성을 고려한 최적경로 탐색)

  • Hahn, Jin-Seok;Chon, Kyung-Soo
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.1
    • /
    • pp.145-153
    • /
    • 2008
  • Existing shortest-path algorithms mainly consider a single attribute. But traveler actually chooses a route considering not single attribute but various attributes which are synthesized travel time, route length, personal preference, etc. Therefore, to search the optimal path, these attributes are considered synthetically. In this study route searching algorithm which selects the maximum utility route using discrete choice model has developed in order to consider various attributes. Six elements which affect route choice are chosen for the route choice model and parameters of the models are estimated using survey data. A multinomial logit models are developed to design the function of route choice model. As a result, the model which has route length, delay time, the number of turning as parameter is selected based on the significance test. We use existing shortest path algorithm, which can reflect urban transportation network such as u-turn or p-turn, and apply it to the real network.

A Study on Link Travel Time Prediction by Short Term Simulation Based on CA (CA모형을 이용한 단기 구간통행시간 예측에 관한 연구)

  • 이승재;장현호
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.1
    • /
    • pp.91-102
    • /
    • 2003
  • There are two goals in this paper. The one is development of existing CA(Cellular Automata) model to explain more realistic deceleration process to stop. The other is the application of the updated CA model to forecasting simulation to predict short term link travel time that takes a key rule in finding the shortest path of route guidance system of ITS. Car following theory of CA models don't makes not response to leading vehicle's velocity but gap or distance between leading vehicles and following vehicles. So a following vehicle running at free flow speed must meet steeply sudden deceleration to avoid back collision within unrealistic braking distance. To tackle above unrealistic deceleration rule, “Slow-to-stop” rule is integrated into NaSch model. For application to interrupted traffic flow, this paper applies “Slow-to-stop” rule to both normal traffic light and random traffic light. And vehicle packet method is used to simulate a large-scale network on the desktop. Generally, time series data analysis methods such as neural network, ARIMA, and Kalman filtering are used for short term link travel time prediction that is crucial to find an optimal dynamic shortest path. But those methods have time-lag problems and are hard to capture traffic flow mechanism such as spill over and spill back etc. To address above problems. the CA model built in this study is used for forecasting simulation to predict short term link travel time in Kangnam district network And it's turned out that short term prediction simulation method generates novel results, taking a crack of time lag problems and considering interrupted traffic flow mechanism.

Development a scheduling model for AGV dispatching of automated container terminals (자동화 컨테이너 터미널의 AGV 배차 스케줄링 모형 개발)

  • Jae-Yeong Shin;Ji-Yong Kwon;Su-Bin Lee
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2023.05a
    • /
    • pp.59-60
    • /
    • 2023
  • The automation of container terminals is an important factor that determines port competitiveness, and global advanced ports tend to strengthen their competitiveness through container terminal automation. The operational efficiency of the AGV, which is an essential transport equipment of the automated terminal, can improve the productivity of the automated terminal. The operation of AGVs in automated container terminals differs from that of conventional container terminals, as it is based on an automated system in which AGVs travel along designated paths and operate according to assigned tasks, requiring consideration of factors such as workload, congestion, and collisions. To prevent such problems and improve the efficiency of AGV operations, a more sophisticated model is necessary. Thus, this paper proposes an AGV scheduling model that takes into account the AGV travel path and task assignment within the terminal The model prevent the problem of deadlock and. various cases are generated by changing AGV algebra and number of tasks to create AGV driving situations and evaluate the proposed algorithm through algorithm and optimization analysis.

  • PDF

A Pedestrian Network Assignment Model Considering Space Syntax (공간구문론(Space Syntax)을 고려한 통합보행네트워크 통행배정모형)

  • Lee, Mee Young;Kim, Jong Hyung;Kim, Eun Jung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.6
    • /
    • pp.37-49
    • /
    • 2015
  • In Space Syntax, the greater the degree of integration between separate links, the greater the links' accessibility from the target network. As such, planning pedestrian walks so that links with high degrees of integration are connected, or else inducing high integration value land use are both valid options. The travel distribution model reflects how walking demand, or more specifically, the pedestrian, partakes in route choosing behavior that minimizes select criteria, notably level of discomfort, as measured using travel distance and time. The model thus demonstrates travel patterns associated with demand pertaining to minimization of discomfort experienced by the pedestrian. This research introduces a method that integrates Space Syntax and the pedestrian travel distribution model. The integrated model will determine whether regions with high degrees of integration are actually being used as pivots for pedestrian demand movement, as well as to explain whether the degree of integration is sustained at an appropriate level while considering actual movement demand. As a means to develop the integrated model, a method that combines display of the visibility of the space syntax network and road-divided links is proposed. The pedestrian travel distribution model also includes an alternative path finding mechanism between origin and destination, which allows for uniform allocation of demand.