KR20000030462A - Knowledge-base for total guidance of public transport and generating method thereof - Google Patents

Abstract

PURPOSE: A mass traffic comprehensive guide knowledge base and a method for generating the same are provided to find easily a user's own destination by using a mass traffic comprehensive guide service. CONSTITUTION: A mass traffic comprehensive guide knowledge base and a method for generating the same comprises a path information OC0(10), one time transfer path information OD1(11), a two times transfer path information OD2(12), and a three times transfer path information OD3(13). The path information OC0 comprises information about the shortest path between a starting point and a destination. The one time transfer path information OD1 comprises information about one time transfer path. The two times transfer path information OD2 comprises information about two times transfer path. The three times transfer path information OD3 comprises information about three times transfer path.

Description

Knowledge base and total guidance of public transport and generating method

The present invention relates to a traffic information retrieval system, by forming a knowledge base of route information for each transfer number of stops of public transportation means to present various routes to users when using public transportation so that the user can select and use the most suitable route. It relates to a public transport comprehensive guide knowledge base and knowledge base generation method.

Path finding in complex structures, such as public transport, takes quite a long time to get results as a solution to common network problems. Determination of search speed is related to knowledge base modeling, but how to construct a network and which search algorithm to apply is also very important.

In particular, domestic and foreign companies can design and implement a large-scale traffic information knowledge base and algorithm, which is the core of the technology field of Intelligent Transport Systems (hereinafter referred to as "ITS"), to conveniently provide various types of traffic information to those who want it. Although there have been many studies, it is only in the early stage of commercialization. The factors that have not been successful so far can be summarized as follows.

First, the traffic information service is a business that can be activated only when a communication means such as the Internet or a mobile phone that can provide the information is widely distributed.

Second, there should be confidence in the traffic information, but the service level, accuracy, and speed, which are factors of trust, are not diverse, and there is a lack of sufficient understanding of network characteristics and knowledge base that affect algorithms or speed,

Third, there are no items and commercialization strategies to be connected to profits by commercializing the ITS field.

The present invention has been made to solve the above problems, by using a communication means such as the Internet to read the data stored in the database according to a predetermined algorithm to quickly obtain the information generated for the necessary part and through the database The purpose of this paper is to provide a public transportation guide information base and knowledge base creation method that can be connected to commercialization by inducing users to join by using the processed knowledge base.

In order to achieve the above object, the present invention provides a route information OD0 which does not transfer even once among all the routes between the departure point and the arrival point, and the one-time transfer route information OD1 which passes through the route between the departure point and the departure point. 2 transfer route information OD2 passing through 2 times of route between origin and destination, 3 transfer route information OD3 passing through 3 times of route between all origin and destination and X times of route between all origin and destination It is characterized by consisting of X times (multiple times) transfer route information ODX passing through (multiple times).

In addition, to achieve the above object, the present invention comprises the steps of generating information on the route to go without a transfer between the starting point and the target point using a Floyd algorithm; Inputting a transit route number between stops of the generated route information without the transfer; Generating one-time transfer route information about a route to be changed once using the generated route information without the transfer; Generating two transfer route information using the one transfer route information and the route information without the transfer; And generating three transfer route information by using the two transfer route information and the route information without the transfer.

With reference to the accompanying drawings, a public transport comprehensive guide knowledge base and a knowledge base generating method according to an embodiment of the present invention will be described in detail.

1 is a flowchart illustrating a process of forming a knowledge base of a comprehensive public transportation system according to an embodiment of the present invention;

2 is a flowchart illustrating a process of forming information on a route going from a starting point to a target point of a public transportation comprehensive guide system according to an embodiment of the present invention;

3 is a flowchart illustrating a process of forming transfer information for a transfer section of a public transportation comprehensive guide system according to an embodiment of the present invention;

4 is a flowchart illustrating a process of generating route information as the number of transfers of the public transportation comprehensive guide system according to an embodiment of the present invention increases.

Explanation of symbols on the main parts of the drawings

10: OD0 11: OD1

12: OD2 13: OD3

20: Transfer Information 30: ODX View Table

31: ODX

First, before describing the multipath generation algorithm corresponding to the main subject of the present invention, the Floyd Algorithm, which is a reference of the multipath generation algorithm, will be described.

The Floyd algorithm is an algorithm that calculates all paths between all origins and destinations at once, and is known to be the most efficient in algorithms that simultaneously calculate multiple routes.

In other words, if there are n locations, the number of calculated paths calculates n * (n-1) paths simultaneously.

However, since the Floyd algorithm derives only one optimal (shortest) distance between the selected starting point and the destination as a result, the Floyd algorithm cannot present various routes to the user.

Therefore, if you define a multipath generation algorithm by slightly modifying the Floyd algorithm, the definition is as follows.

First, the multi-path generation algorithm does not transfer the route information according to the number of times to transfer the route information OD0 (10), one transfer route information OD1 (11), two transfer route information OD2 (12), three transfer route information It is divided into OD3 (13).

The OD0 (10) is the path information for the case of not changing once, the OD1 (11) is the path information for the case of changing once, the OD2 (12) the route information for the case of changing twice, and the OD3 (13) Route information for the third transfer.

Changing four or more times is not covered in the embodiments of the present invention, but if necessary, it is possible to continuously generate OD4, OD5 ... based on OD3.

Returning to the multipath generation algorithm of the present invention, in order to provide the path information from OD0 to 0D3, the solutions for all the paths must be calculated in advance, and the paths are provided in real time in the pre-calculated state. .

First, in the case of OD0 (10), which does not change once, it needs a method of calculating a path that can go to the shortest distance without changing once, and it is preferable to apply the existing Floyd algorithm as it is.

If you change more than once, use a view table to get all possible paths between origin and destination and store them in the DB.

In this case, paths that may be alternative paths among a plurality of paths may be designated.

It also filters the searched paths and stores only those in the OD table that are reasonable as alternatives.

Therefore, hardware constraints can be reduced by using a view table that virtually exists without information about a plurality of paths.

The reason for using the view table for the case of changing more than one time is that it is necessary to calculate a plurality of paths, so if all the paths are considered, memory and storage are needed when the algorithm is executed. Because.

In other words, since a large amount of data must be controlled in order to reduce the time that occurs in the DB input / output unit, there is a problem that it takes time to input / output when the database is read and processed by the program and stored in the database. Therefore, the algorithm is implemented by using a view table and a stored procedure stored in the database to minimize the time required for input / output.

And the view table does not have all the data at once, but temporarily has a workspace. In terms of pages, only the size of the buffer defined in the database system is created and calculated temporarily.

The database built-in function is a function existing in the knowledge base. Since this function can be added by a user, the database built-in function implements an algorithm for processing and storing a view table.

Views are simply data, and algorithms are built into database built-in functions.

When the calculation is finished, it moves to the next page and clears the current buffer and stores the next value in the buffer. Based on the path retrieved from the view table, the optimal path and the corresponding alternative path are filtered and stored in the knowledge base.

Unlike the view table, the stored data is stored in a table having real memory. When the calculation of all the paths is completed, the algorithm is terminated and the completion of the algorithm is signaled.

When the request from the service user, i.e., the search for the movement route from the starting point to the destination in the above state is completed, the request is accepted by the interface process and the process of accessing the knowledge base through the search process is requested. It is called processing.

The above process will be described in detail with reference to FIGS. 1 to 4 as follows.

First of all, the structure (type) of the knowledge base is the route information OD0 (10) which goes without any transit between all departures and destinations, and the one-time transfer route information OD1 (11) that passes through once among all the departure and arrival routes. ), Two transit route information OD2 (12), which is transited twice in the route between all departures and destinations, and three transit route information OD3 (13) which is transited three times in the route between all origins and arrivals; In addition, X route (multiple times) transit route information ODX (31) passing through X times (multiple times) of the route between all departure and destination.

The route information OD0 (10) without going through the transfer is generated by using the Floyd algorithm of calculating the shortest distance by calculating all the routes between all the departures and all the arrivals at once, and the route information to be transferred more than once OD1, OD2, OD3, ... ODX (11,12, 13,31) filters out and replaces all searched paths by embedding a view table that exists virtually in the knowledge base to reduce the time spent in knowledge base I / O. Store only what is appropriate as a path in the knowledge base.

The knowledge base (OD) generation method (S10) comprises the steps of generating route information OD0 (10) without going through the route between the starting point and the target point by using the Floyd algorithm (S11); Inputting a transit route number between respective stops of the generated route information OD0 10 without transferring (S12); Generating one-time transfer route information OD1 (11) regarding a route to be changed once using the generated route information OD0 (10) without the transfer (S13); Generating two transfer route information OD2 (12) using the first transfer route information OD1 (11) and the non-transferring route information OD0 (10) (S14); In step S15, the third transfer route information OD3 13 is generated using the two transfer route information OD2 12 and the non-transfer route information OD0 10.

Step (S11) of generating the route information OD0 (10) without going to the transfer step of entering a pass line number between each stop (S110); Inputting a passing time between each stop (S111); Comprising the step S112 is calculated by using the Floyd algorithm to store the entire section in the allocated route information OD0 (10) without the transfer.

And it further comprises the step (S20) of inputting the information on the transfer time and route information for each transfer stop in the transfer information route information (20).

And step S31 of obtaining route information from the view table 30 of each transfer route information ODX 31 generated in the order of shortest elapsed time; Comparing whether the alternative route with respect to the read route information is included within 5 or less (S32); Comparing and determining whether the alternative path is less than or equal to 5 than the optimum path (S33); Storing the OD information in the route information ODX 31 for each transfer since the alternative route is less than 5 and within a specific value than the optimum route (S34); If the alternative route is not included in 5 or less, or not included within a specific value than the optimal route, it is determined that the alternative route is not a valid route and is returned without being stored in the transfer information ODX 31 for each transfer; Comprising a step (S35) to compare whether all the OD has been processed.

In step S32, determining whether the alternative route is included in 5 or less is to determine whether the grade of the alternative route is included in the grade 5.

In the step S33, it is determined that the passage time is too long when compared with the optimum route to determine the route that does not need to be used, and is returned without storing it in the transit route information ODX in step S33.

The public transport comprehensive guide knowledge base and the knowledge base generating method according to the present invention are applied to all public transportation means such as trains, buses, intercity public transport, and flights.

As described above, by using the public transport comprehensive guide service according to the present invention, the user can easily arrive at his / her destination in the most convenient way, and the route information base on the traffic information is provided according to the result. By designing and building and calculating the information, the user can select and use the desired route from the starting point to the destination, thus providing convenience for the user. It is a useful invention.

Claims (7)

OD0 (10), the route information without transfer, which stores each stop information on the shortest distance between all departures and arrivals, One-time transfer route information OD1 (11) passing through once among all routes between departure and arrival places, 2 transfer route information OD2 (12), which transfers twice between all departure and arrival routes, 3 transfer route information OD3 (13) passing through 3 transfers among all departure and arrival routes, Comprehensive Traffic Information Knowledge Base, characterized in that it consists of X (multiple) transit route information ODX (31) transit through X (multiple) transit routes between all departures and destinations. The method of claim 1, wherein the route information OD0 (10) going without the transfer is Comprehensive traffic information knowledge base, characterized in that it is generated using the Floyd algorithm of calculating the shortest distance by calculating all the paths between all departures and all arrivals at once. The route information OD1, OD2, OD3, ... ODX (11, 12, 13, 31) which transfers more than once To reduce the time that occurs in the knowledge base I / O, it embeds a view table that exists virtually in the knowledge base, and filters all the searched paths and stores only what is reasonable as an alternative path in the knowledge base. Guided Knowledge Base. Generating information OD0 about a route going without a transfer between the starting point and the target point using the Floyd algorithm; Inputting a transit route number between stops of the generated route information OD0 without the transfer; Generating one-time transfer route information OD1 about a route to be changed once using the generated route information OD0 without the transfer; Generating two transfer route information OD2 using the one transfer route information OD1 and the non-transfer route information OD0; And generating three transfer route information OD3 using the two transfer route information OD2 and the non-transfer route information OD0. The method of claim 4, wherein the generating of the route information OD0 without going through Inputting a transit route number between each stop; Inputting a transit time between each stop; Comprising a step of calculating the entire section using the Floyd algorithm and storing in the allocated route information OD0 without the transfer, characterized in that it further comprises a traffic information synthesis guide knowledge base generation method. 5. The method as claimed in claim 4, further comprising the step of inputting information about transfer time and route information into transfer information data (20) for each transfer stop. 5. The method of claim 4, further comprising: retrieving route information from the previously generated view table of each transfer route information ODX in order of shortest elapsed time; Comparing whether the alternative route for the read route information is included within 5 or less; Comparing alternative paths to less than or equal to the optimal path when the alternative path is less than or equal to 5; Storing the OD information in each transit route information ODX since the alternative route is less than 5 and within a specific value than the optimum route; If the alternative route is not included below 5 or less than a specific value than the optimum route, it is determined that the alternative route is not a valid route and is returned without storing in the transfer information ODX for each transfer; Comprising a step of comparing whether all the OD has been processed further comprising the method of creating a comprehensive information guide information base.