• Title/Summary/Keyword: Travel route

Search Result 255, Processing Time 0.025 seconds

Combined Traffic Signal Control and Traffic Assignment : Algorithms, Implementation and Numerical Results

  • Lee, Chung-Won
    • Proceedings of the KOR-KST Conference
    • /
    • 2000.02a
    • /
    • pp.89-115
    • /
    • 2000
  • Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

  • PDF

Indoor Moving and Implementation of a Mobile Robot Using Hall Sensor and Dijkstra Algorithm (홀 센서와 Dijkstra 알고리즘을 이용한 로봇의 실내 주행과 구현)

  • Choi, Jung-Hae;Choi, Byung-Jae
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.3
    • /
    • pp.151-156
    • /
    • 2019
  • According to recent advances in technology, major robot technologies that have been developed and commercialized for industrial use are being applied to various fields in our everyday life such as guide robots and cleaning robots. Among them, the navigation based on the self localization has become an essential element technology of the robot. In the case of indoor environment, many high-priced sensors are used, which makes it difficult to activate the robot industry. In this paper, we propose a robotic platform and a moving algorithm that can travel by using Dijkstra algorithm. The proposed system can find a short route to the destination with its own position. Also, its performance is discussed through the experimentation of an actual robot.

DECISION SUPPORT SYSTEM FOR OPTIMAL SELECTION OF HAUL ROUTES BASED ON TIME SLOTS IN EARTHMOVING OPERATION

  • Sang-Hyeok Kang;Kyeong-Geun Baik;Hyun-Gi Baek;Hyeong-Gi Park;Jong-Won Seo
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.1134-1139
    • /
    • 2009
  • Haul routes for earthmoving operation need to be carefully selected because the decision on the haul routes could make a significant difference in the project's cost and time. This paper proposes a decision support system for improving productivity of earthmoving operation that helps construction managers choose the best haul routes of trucks based on time slots. Also, a methodology for optimal selection of haul routes considering traffic conditions and topographic conditions of the routes is explained. Raster data model is used to find an available shortest path based on cost weighted distance. A system was developed on a geographic information system environment for efficient database management and easy manipulation of graphical data. A real-world case study was conducted to verify the applicability of the proposed system.

  • PDF

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.

Algorithm Development for Extract O/D of Air Passenger via Mobile Telecommunication Bigdata (모바일 통신 빅데이터 기반 항공교통이용자 O/D 추출 알고리즘 연구)

  • Bumchul Cho;Kihun Kwon
    • The Journal of Bigdata
    • /
    • v.8 no.2
    • /
    • pp.1-13
    • /
    • 2023
  • Current analysis of air passengers mainly relies on statistical methods, but there are limitations in analyzing detailed aspects such as travel routes, number of regional passengers and airport access times. However, with the advancement of big data technology and revised three data acts, big data-based transportation analysis has become more active. Mobile communication data, which can precisely track the location of mobile phone terminals, can serve as valuable analytical data for transportation analysis. In this paper, we propose a air passenger Origin/Destination (O/D) extraction algorithm based on mobile communication data that overcomes the limitations of existing air transportation user analysis methods. The algorithm involves setting airport signal detection zones at each airport and extracting air passenger based on their base station connection history within these zones. By analyzing the base station connection data along the passenger's origin-destination paths, we estimate the entire travel route. For this paper, we extracted O/D information for both domestic and international air passengers at all domestic airports from January 2019 to December 2020. To compensate for errors caused by mobile communication service provider market shares, we applied a adjustment to correct the travel volume at a nationwide citizen level. Furthermore correlation analysis was performed on O/D data and aviation statistics data for air traffic users based on mobile communication data to verify the extracted data. Through this, there is a difference in the total amount (4.1 for domestic and 4.6 for international), but the correlation is high at 0.99, which is judged to be useful. The proposed algorithm in this paper enables a comprehensive and detailed analysis of air transportation users' travel behavior, regional/age group ratios, and can be utilized in various fields such as formulating airport-related policies and conducting regional market analysis.

Research on an aristocratic officer's travels in the mid Chosun Korea by analysing Yu Hee-chun's diary (일기(日記)를 이용한 조선중기 양반관료의 여행 연구)

  • Jung, Chi-Young
    • Journal of Korean Historical Folklife
    • /
    • no.26
    • /
    • pp.71-106
    • /
    • 2008
  • The objective of this research is to reconstruct an aristocratic officer's travels by analysing Yu, hee-chun's diary, Miamilgi. Yu had kept his diary for eighty three months, from October 1567 to May 1577, and there were twenty six times of travel logs which are analysed in this research. As a result of the analysis, his travels can be divided into official travels and private travels. Sixteen times of official travels were comprised of inspection tours for parishes as a superintendent of Jeonra province, trips to supervise maintenance works of royal tombs and to worship the tombs, to carry out the sanjae (rituals in the mountains) as a second minister of the ministry of rites. It was difficult for him to have private travels as he continually served as a royal officer. He had got only 10 times of private travels during the eighty three months for maintaining the ancestor's tomb and worshiping the ancestors, for recuperating himself and his wife, and for constructing his new house. All of these travels were long-distance ones. In terms of his travel routes, he frequently used royal main trunks, e.g. 'Haenamro' (from Seoul to Damyang), which were maintained by the royal government. The main reason of his frequent using of trunk lines was that convenience facilities such as the royal post stations (Yeok) and royal inns (Won) were equipped well in these roads so it was easy to get horse change services and lodging and boarding. The fact that main trunks were chiefly straight lines and the shortest way was rather secondary reason. On the other hand, when he was a superintendent of Junra province, he had four times of round inspection on all parishes of Junra province, following the tour routs covering all over the province. As he was incumbent royal officer, he started his travel by getting a permission from the king. Simultaneously, he made ready some travel items. Among the items, horse was most important one for the journey. After finishing all the preparing processes before the departure, he had special farewell ceremony for the King, Sookbae, and had a small party with his friends called Jeonbeul. Main transportation means for his travel was horse, and many kinds of horses such as royal government's horse, Yeokma, local government's horse, Swema, as well as his private one were used. Additionally, he used a palanquin while he was doing inspection trip as a superintendent of Junra province. Yu was incumbent officer so he mostly lodged in local government guest houses. If he could not find out any local guest house, he was lodged in royal inn, and in his relatives houses or irregularly in buddhist temples. Most meals were supplied by local royal governments. The activities in his journeys were varied on his travel objectives. In his private journey, it was the main activities that maintaining ancestor's tombs and having a memorial service. During the trip, he visited his relatives. His official trips, on the other hand, had a regularity. Main activities were dealing with public works, and visiting Hyanggyo (country public school). However in the midway, he visited his relatives and had a journey to scenic places.

A Study on the Transport Mode Choice for Asian Highway No.6 Route (아시안하이웨이 6번 노선의 국제여객 교통수단선택에 관한 연구)

  • Lee, Back Jin;Lee, Se Hong;Lee, Yun Seok;Lee, Deok Hwan
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.35 no.4
    • /
    • pp.875-886
    • /
    • 2015
  • By promoting the international transportation and the improvement of advanced exchange between South and North Korea, the Asian Highway plan was expected to make considerable economical effects in the North-East Asian region. This study focuses on a part of AH6 route (i.e., South Korea-North Korea-China-Far East Russia) and aims to analyze the behavioral change of international passenger transport around the Korean Peninsula by assuming the non-existent North Korea land transport network connectivity. The study was performed using two main methods. First, a stated preference survey was performed to derive the actual modal share of each travel mode. Second, a disaggregate analysis was performed to develop possible mode-choice models for international passenger travel and find out the suitable choice. Based on the results of the model estimation, it is found that over 90% of the international passenger transport would be converted to land transport (rail+highway). In addition, international railroad modal share rate would be increased from 62.8% to 66.1% and international bus would be decreased from 29.6% to 21.9% as the distance lengthened (903km~1,631km).

K-th Path Search Algorithms with the Link Label Correcting (링크표지갱신 다수경로탐색 알고리즘)

  • Lee, Mee-Young;Baik, Nam-Cheol;Choi, Dae-Soon;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.2 s.73
    • /
    • pp.131-143
    • /
    • 2004
  • Given a path represented by a sequence of link numbers in a graph, the vine is differentiated from the loop in a sense that any link number can be visited in the path no more than once, while more than once in the loop. The vine provides a proper idea on complicated travel patterns such as U-turn and P-turn witnessed near intersections in urban transportation networks. Application of the link label method(LLM) to the shortest Path algorithms(SPA) enables to take into account these vine travel features. This study aims at expanding the LLM to a K-th path search algorithm (KPSA), which adopts the node-based-label correcting method to find a group of K number of paths. The paths including the vine type of travels are conceptualized as drivers reasonable route choice behaviors(RRCB) based on non-repetition of the same link in the paths, and the link-label-based MPSA is proposed on the basis of the RRCB. The small-scaled network test shows that the algorithm sequence works correctly producing multiple paths satisfying the RRCB. The large-scaled network study detects the solution degeneration (SD) problem in case the number of paths (K) is not sufficient enough, and the (K-1) dimension algorithm is developed to prevent the SD from the 1st path of each link, so that it may be applied as reasonable alternative route information tool, an important requirement of which is if it can generate small number of distinct alternative paths.

Long-Term Arrival Time Estimation Model Based on Service Time (버스의 정차시간을 고려한 장기 도착시간 예측 모델)

  • Park, Chul Young;Kim, Hong Geun;Shin, Chang Sun;Cho, Yong Yun;Park, Jang Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.7
    • /
    • pp.297-306
    • /
    • 2017
  • Citizens want more accurate forecast information using Bus Information System. However, most bus information systems that use an average based short-term prediction algorithm include many errors because they do not consider the effects of the traffic flow, signal period, and halting time. In this paper, we try to improve the precision of forecast information by analyzing the influencing factors of the error, thereby making the convenience of the citizens. We analyzed the influence factors of the error using BIS data. It is shown in the analyzed data that the effects of the time characteristics and geographical conditions are mixed, and that effects on halting time and passes speed is different. Therefore, the halt time is constructed using Generalized Additive Model with explanatory variable such as hour, GPS coordinate and number of routes, and we used Hidden Markov Model to construct a pattern considering the influence of traffic flow on the unit section. As a result of the pattern construction, accurate real-time forecasting and long-term prediction of route travel time were possible. Finally, it is shown that this model is suitable for travel time prediction through statistical test between observed data and predicted data. As a result of this paper, we can provide more precise forecast information to the citizens, and we think that long-term forecasting can play an important role in decision making such as route scheduling.

A Review about the Need for Modelling Toll Road with Different Value of Travel Time (유료도로의 교통수요분석에 있어서 통행시간가치 차등화 필요성 검토)

  • Kim, Jae-Yeong;Son, Ui-Yeong;Jeong, Chang-Yong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.4
    • /
    • pp.31-40
    • /
    • 2009
  • Some road charges toll to finance the cost or to manage traffic congestion. With a growth of PPI projects, toll roads would be increase continuously. Tolls have a considerable influence on user's route choice, and sometimes can affect to the departure time and even to mode choice. For modelling toll roads, user's WTP or VOT has an important role and it is general that VOT is equivalent to the wages of workers. The current way of modelling technique yields various toll price elasticity from low to high. When there exist few alternative routes, unrealistic result that all traffic assigned to some shortest path may occur. The toll price elasticity can be influenced by alternative route and congestion level, but some result shows nearly unrealistic patterns. The model to forecast more realistic toll road demand is very essential for estimating toll revenue, choice of optimal toll level & collecting location and establishing toll charge strategy. This paper reviewed some literatures about toll road modelling and tested case study about the assignment technique with different VOT. The case study shows that using different VOT yields more realistic result than the use of single VOT.