• Title/Summary/Keyword: Transportation Route

Search Result 635, Processing Time 0.021 seconds

Design of Public Transportation Route Guidance System for Wheelchair Users Utilizing Public Data of Seoul City

  • Geumbi, Lee;Humberto, Villalta;Seunghyun, Kim;Kisu, Kim;Jaehyeong, Go;Yongjoo, Jun;Kwang Sik, Kim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.97-112
    • /
    • 2023
  • The purpose of this study is to design and test a new way of public transportation route guidance system for persons with disabilities, including wheelchair users. The guidance system is smartphone app-based, using, routes that involve disabled-friendly facilities in the vicinity can be searched. A database that contains publicly available data on low-floor bus services, location and extent of disabled-friendly facilities, and suitable subways and stations, was developed for this purpose. The app uses the database to access and query the required information. A pilot study was conducted to test the effectiveness of the guidance system. It was found that the system was able to convey information about the disabled-friendly routes and related guidance information even inside subway stations, effectively. The performance of the system was compared with route guidance services that do not explicitly use data on disabled-friendly services. A notable difference was observed in the travel time estimated by this program and other guidance services. The difference was around 4 to 15 minutes. This is significant savings for persons with disabilities if they use the app and service. The study thus shows that exclusive use of disabled-friendly data in route guidance will bring more benefits for persons with disabilities.

A Genetic Algorithm for Route Guidance System in Intermodal Transportation Networks with Time - Schedule Constraints (서비스시간 제한이 있는 복합교통망에서의 경로안내 시스템을 위한 유전자 알고리듬)

  • Chang, In-Seong
    • 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.

  • PDF

An Solution Algorithm for A Multi-Class Dynamic Traffic Assignment Problem (다계층운전자를 고려한 동적통행배정모형의 해법)

  • Shin, Seong-Il;Kim, Jeong-Hyun;Baik, Nam-Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.6
    • /
    • pp.77-88
    • /
    • 2003
  • This paper proposes a solution algorithm for solving a multi-class analytical DTA model. In the DTA model, three traveler classes are classified according to different assumptions of traveler's route choice behavior: including fixed route, Stochastic Dynamic User Optimum(SDUO), and Dynamic User Optimum(DUO). To solve this DTA model, variables of link flow and exit flow are represented solely by inflow. The resulting Linear Program(LP) subproblem in the inner iteration is solved as a typical time-dependent shortest route problem over a physical network. Accordingly, the required time-space network expansion in solving DTA models is no longer needed.

The Architecture of an Intelligent Digital Twin for a Cyber-Physical Route-Finding System in Smart Cities

  • Habibnezhad, Mahmoud;Shayesteh, Shayan;Liu, Yizhi;Fardhosseini, Mohammad Sadra;Jebelli, Houtan
    • International conference on construction engineering and project management
    • /
    • 2020.12a
    • /
    • pp.510-519
    • /
    • 2020
  • Within an intelligent automated cyber-physical system, the realization of the autonomous mechanism for data collection, data integration, and data analysis plays a critical role in the design, development, operation, and maintenance of such a system. This construct is particularly vital for fault-tolerant route-finding systems that rely on the imprecise GPS location of the vehicles to properly operate, timely plan, and continuously produce informative feedback to the user. More essentially, the integration of digital twins with cyber-physical route-finding systems has been overlooked in intelligent transportation services with the capacity to construct the network routes solely from the locations of the operating vehicles. To address this limitation, the present study proposes a conceptual architecture that employs digital twin to autonomously maintain, update, and manage intelligent transportation systems. This virtual management simulation can improve the accuracy of time-of-arrival prediction based on auto-generated routes on which the vehicle's real-time location is mapped. To that end, first, an intelligent transportation system was developed based on two primary mechanisms: 1) an automated route finding process in which predictive data-driven models (i.e., regularized least-squares regression) can elicit the geometry and direction of the routes of the transportation network from the cloud of geotagged data points of the operating vehicles and 2) an intelligent mapping process capable of accurately locating the vehicles on the map whereby their arrival times to any point on the route can be estimated. Afterward, the digital representations of the physical entities (i.e., vehicles and routes) were simulated based on the auto-generated routes and the vehicles' locations in near-real-time. Finally, the feasibility and usability of the presented conceptual framework were evaluated through the comparison between the primary characteristics of the physical entities with their digital representations. The proposed architecture can be used by the vehicle-tracking applications dependent on geotagged data for digital mapping and location tracking of vehicles under a systematic comparison and simulation cyber-physical system.

  • PDF

Development of Near Optimal Simulation Technique for the Postal Routing Decision (우편물 운송 경로설정을 위한 준 최적화 시뮬레이션 기술 개발)

  • 김의창
    • The Journal of Information Systems
    • /
    • v.9 no.1
    • /
    • pp.235-255
    • /
    • 2000
  • Facing in very rapidly changing environments via information technologies, we need to study and develop new information technologies in postal delivery service in korea. We study to find the near optimal route for the better postal service between the collection centers. Optimal routing decision for the postal delivery is NP-Hard. The main purpose of this paper is to develop the near optimal simulation technique for the postal routing decision We consider the distance between collection centers, and the quantity of post articles in the collection center to obtain the near optimal route. We use the heuristic algorithm to obtain the near optimal solution for the transportation route of postal articles. Also, we try to show the transportation route by using the map after deciding the near optimal route.

  • PDF

Development of Near Optimal Simulation Technique for the Postal Routing Decision (우편물 운송 경로설정을 위한 준 최적화 시뮬레이션 기술 개발)

  • 김의창
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 2000.11a
    • /
    • pp.45-63
    • /
    • 2000
  • Facing in very repidly changing environments via information technologies, we need to study and develop new information technologies in postal delivery service in Korea. We study to find the near optimal route for the better postal service between the collection centers. Optimal routing decision for the postal delivery is NP-Hard. The main purpose of this paper is to develop the near optimal simulation technique for the postal routing decision. We consider the distance between collection centers, and the quantity of post articles in the collection center to obtain the near optimal route. We use the heuristic algorithm to obtain the near optimal solution for the transportation route of postal articles. Also, we try to show the transportation route by using the map after deciding the near optimal route.

  • PDF

Using Genetic-Fuzzy Methods To Develop User-preference Optimal Route Search Algorithm

  • Choi, Gyoo-Seok;Park, Jong-jin
    • The Journal of Information Technology and Database
    • /
    • v.7 no.1
    • /
    • pp.42-53
    • /
    • 2000
  • The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.

  • PDF

A Study on the Economic Validity of TSR Connecting TKR (TKR과 연계한 TSR의 경제적 타당성에 관한 연구)

  • Choi, Kyoung-Hoon;Park, Gyei-Kark;Lee, Roman R.;Yoon, Dae-Gwun
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.18 no.4
    • /
    • pp.345-351
    • /
    • 2012
  • The major trade area of the South Korea is divided into Asia, America and Europe. Generally, marine transportation is the main method of mass cargo transportation, but unlike others, rail transportation is available in the Europe area. Also, as a result of China's growth, South Korea's position as northeast Asia logistics hub has weakened. That is the reason why we need to pay attention to rail transportation, an alternative competitive structure. In accordance with this background, this study focuses on analyzing economic feasibility comparing transportation routes to Europe using Trans-Korea Railway and Trans-Siberia Railway. Factors of analysis are transportation distance, period, cost and additional cost As the result, considering economic feasibility, TKR-TSR route(Route1) is the best transportation approach for six routes. Therefore, using TKR-TSR railway will be the best way to increase nation's competitiveness, in response to Russia government's far-east development strategy.

A Study on the Determination of Optimum L.R.T Route from the Viewpoint of Revenue Maimization Principles (수익성을 감안한 경전철의 최적노선 결정방법에 관한 연구)

  • 원제무;박창호;이성모
    • Journal of Korean Society of Transportation
    • /
    • v.12 no.3
    • /
    • pp.29-47
    • /
    • 1994
  • Although subway system continues to be the backbone of transportation systems in a city like Seoul, there will still be areas across the city where subway services are not avaliable. Interest has steadily grown to fill this missing routes in overall urban transportation system. Light Rail Transit (L.R.T) system has been recently thought to be an appropriate mode of transportation by businessmen, professionals and transportation industry. In this regards, the purpose of this study is to explore whether L.R.T can be a feasible form of urban rail mode in the context of Seoul. First, the study develops the mathematical models to derive optimum route networks and stations. Integer Programming is employed to determine whether alternative routes are financially viable from the viewpoint of revenue maximization principles. Second, mathematical models developed are applied to Yoido area in order to examine the validity of model structures. The models constructed turns out be capable of handling alternative routes and stations. Application of models are successfully carried out to derive financially feasible set of routes and stations.

  • PDF

A Development of an Optimal Feeder-Bus Service Area (연계버스 서비스권역 결정에 관한 연구)

  • Rhee, Sung-Mo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.3 no.2 s.6
    • /
    • pp.199-211
    • /
    • 1995
  • Bus, Which is together with subway the main part of public transportation modes in the city, is reviewed for the development of an optimal feeder-bus service area. Based on the IDRISI of GIS package, and taking into account of the convenience of downtown-oriented public transportation users at peak time, a model for the development of feeder-bus service area and a solution and introduced. Major result in this study is as follows: Development is given to a model that is designed to overcome the shortage of the existing models, which has limits in simulating the real situation; Variables were used in combination so that bus and subway route, station spacing, and operating frequency can be determined simultaneously, which enables to elucidate the mutual relationship and the structure in public transportation system. A model for feeder-bus area development is also given applied to determination and opening of subway and urban express bus route and new transportation systems. The model developed in this paper is useful in the case of extension and opening of subway and urban express bus route and new transportation Systems.

  • PDF