현재 자가용의 대중화로 인해 버스 이용률이 급격히 감소하고 있다. 그러므로 버스이용률이 감소하는 이유를 이해하고 이를 개선할 필요가 있다. 버스 이용 시 불편을 겪는 가장 큰 이유는 노선 정보를 얻기가 매우 어렵다는 점이다.
이는 정기버스 이용에 불편을 초래하는 원인이 되고 있다. 승객 수 증가를 목표로 하는 버스 노선 검색 시스템 개발에 대해 설명합니다. 이것이 바로 우리가 웹에서 버스 네트워크의 경로 검색 시스템을 개발한 이유입니다.
우리의 경로 검색 방법은 버스 환승뿐만 아니라 도보도 고려합니다. 따라서 우리는 버스 특유의 유동성이 높은 특성을 처리할 수 있는 알고리즘을 제시하고자 했습니다.
Route Search System for Bus Transportation
Support System for Bus Route in Tottori City
Composition of the Thesis
As a result, the routes are very complicated and the distances between bus stops are generally quite short and, therefore, a passenger can get off the bus at one bus stop and walk to another bus stop on a different route to take a bus . The case is that a person moves from bus stop A to bus stop H in the example of Fig. There are 3 routes in this example bus stop A, B, C, D is one route, bus stop E, F, G, H is the other route and bus stop D, F is the other route.
If a passenger moves from bus stop A to H only by bus, the only available path is A->B->C->D->H. In addition, in some cases it can be taken into account that the fastest way to a destination is not necessarily the nearest bus stop to the destination. However, if the movement per step is considered, the route A->B->destination can be included in the target routes for searching.
In the same way, it should be considered that a passenger moves on foot to a bus stop other than the nearest one and takes the bus at the departure point. The departure station and the arrival bus station are certainly not closer than the departure point and the destination, because there are cases like Fig.
Dir ect Bus Ser vi ce
Contrary to the railway route search problem, in which only the paths between the stations are considered, routes between the actual starting point and the actual destination must be considered in the bus route search problem.
Plural Bus Stops Having the Same Name
- B u s s t o p t a b l e
- Connect information table
- Route table……………………………………………… … … … . 1 3
- Departure time of starting bus stop in a route …
The record of table is composed of "ID", "bus_stop_ID" indicating the bus stop to stop, "connect_ID$next" indicating the next connection information ID, "time". The record of table is composed of "ID", "name" indicating the name of route, "company" indicating the name of bus company and "connect_ID$first_bus_stop" indicating that the ID of connection information table is the starting point. In route table, to know the running order of all the bus stops in one running route, connection information of running route is managed.
A table entry consists of "ID", "connect_ID$first_bus_stop" indicating the ID of the connection information table that is the starting point, "school_closed" indicating the business day on which the school is closed, "school_open" indicating the business day on school opening , "sun" indicating a Sunday, "odd_sat" indicating an odd Saturday, "even_sat" indicating an even Saturday, and "rosen_ID" indicating the ID of the current route table including this separate route. The field indicating the execution day is [1] in case of execution and [0] in case of no execution. The start bus stop departure schedule manages the start bus stop and departure time.
The record of the table consists of “rosen_ID” which indicates the ID of an individual route table and “time” which indicates the departure time.
Landmark
Table design of landmark
Classification code table
Landmark classification table
Speci al runni ng day
Special running information table
The area is designed to find a virtual bus stop that is walkable from a given point. When creating the network, the positions of a specific imaginary bus station and the imaginary bus stations accessible within 5 minutes on foot in its nearby 8 zones are connected by zone. If the walking time to the nearest bus stop is denoted by 'n', only accessible bus stops within 5*(n/5 +1) are connected to the starting point or destination.
Therefore, it becomes easy to find a reachable bus stop on foot by making a "zone". To build the network, the area mentioned in the previous chapter is used to find a bus stop that is accessible from a specific bus stop within a 5-minute walk. Ta:b, the required walking time (minutes) from bus stop A to bus stop B is as follows.
If the walking time to the nearest bus stop is denoted by 'n', only accessible bus stops within 5*(n/5 +1) are associated with the starting position or destination. Walking from bus stop to bus stop on the same separate route is not allowed. The course of the case that the walking time from the starting position and the destination to the bus stop is limited to 20 minutes.
In the case of routes covered from 1, including movement during 5 minutes of walking from a starting position to the first bus stop and from the last bus stop to a destination, the courses whose movement on foot is within 5 minutes are displayed together, also though the required time is extended to a maximum of 30 minutes. These are the courses that have enough time to transfer or the time is shortened to move by walking etc. If the user chooses '分後' (what minutes after) and '○に出発する' ( departure), the desired course is searched for.
This system provides a map service for movements from the starting point to the first bus stop, and from the last bus stop to the destination on foot. And it also offers a mapping service for movements on foot between bus stops along the entire route. The results of those searches were done by using the second transfer condition that walking in the forward direction of the bus route is not allowed and by transferring on foot as much as possible.
Accordingly, we have developed the system that has the optimal bus route search function, data management function, landmark search function, walking map service and timetable service for the entire route of the bus. The ability to print the most practical route takes the shortest time by considering walking between bus stops in the search algorithm, and the transfer time is known to be much smaller by removing branch conditions.
