The present invention relates to a flexible bus route system, which is a system for operating a bus by determining a route based on a destination determined by a passenger. When the passenger determines a point of departure and the destination, the route is calculated 30 minutes before departure. The passenger who is not satisfied with the arrival time can modify the arrival time, and pay an additional fee or receive a refund. All buses connect the city with the city. For example, after all passengers have boarded in the city of Pyeongtaek City, the passengers will be sequentially departed to the destination of Gangnam-gu determined by the passengers along the calculated route.
본 발명은 유동적 버스 노선 시스템에 관한 것으로 승객이 정한 목적지를 기반으로 노선을 정해 버스를 운행하는 시스템이다. 승객이 출발지와 목적지를 정하게 되면 출발 30분 전에 노선을 계산하게 된다. 도착 시간에 만족하지 못한 승객은 도착시간을 수정하고 추가요금을 결제하거나 환불받을 수 있다. 모든 버스는 도시와 도시를 잇는다. 예를 들어 평택시의 시내에서 모든 승객이 승차한 뒤 계산된 노선을 따라 승객이 정한 강남구의 목적지에 순차적으로 하차한다.
Flexible Bus Routing System with Shortest Path Search Algorithm
최단경로 탐색 알고리즘을 통한 유동적 버스 노선 시스템
2020-03-06
Patent
Elektronische Ressource
Koreanisch
IPC: | G08G Anlagen zur Steuerung, Regelung oder Überwachung des Verkehrs , TRAFFIC CONTROL SYSTEMS / G06Q Datenverarbeitungssysteme oder -verfahren, besonders angepasst an verwaltungstechnische, geschäftliche, finanzielle oder betriebswirtschaftliche Zwecke, sowie an geschäftsbezogene Überwachungs- oder Voraussagezwecke , DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES |
A Distributed Shortest-Path Routing Algorithm for Transportation Systems
British Library Conference Proceedings | 2010
|A Multiple Pairs Shortest Path Algorithm
British Library Online Contents | 2005
|Shortest path using detour heuristic algorithm
Tema Archiv | 1999
|A Multiple Pairs Shortest Path Algorithm
Online Contents | 2005
|