KR20200122146A - Server and method for searching path of mass transportation - Google Patents

Abstract

The present invention relates to a public transportation route search server comprising: a search information receiving unit for receiving search information including a departure point, a destination point, and a departure time; an operating schedule receiving unit for receiving operating time data of a public transportation available at the departure point and at least one transfer point existing on a route from the departure point to the destination point; a route calculation unit for calculating a plurality of recommended routes and expected arrival times to arrive at the destination by using a public transportation departing from the departure point at the departure time based on the search information and the operating time data; and a display unit for displaying the recommended routes and expected arrival times. According to the present invention, a more satisfactory movement using public transportation can be performed.

Description

Public transport route search server and method {SERVER AND METHOD FOR SEARCHING PATH OF MASS TRANSPORTATION}

The present invention relates to a public transport route search server and method.

In general, a route guidance service is a service that finds and provides a moving route between a departure point and a destination when a user provides information on a departure point (or current location) and a destination.

Current route guidance services provide a vehicle movement route for a vehicle driver or a public transportation route for a pedestrian.

Among them, the route guidance service for pedestrians provides a moving route targeting public transportation means selected by the user, or searches for one moving route judged to be optimal.

On the other hand, such a route guidance service mainly uses algorithms to search the moving route of a vehicle driver or pedestrian. Among them, the shortest route search algorithms for public transportation generally search for a route using graph theory, and as a data structure, stop A network consisting of a node representing a node and a link representing a connection between nodes is used, and costs such as travel time and travel distance are stored in each link. In addition, transfer resistance that affects route selection is also used as the cost of the link.

Also, in recent years, not only algorithms based on graph theory but also algorithms using public transportation timetables are being developed, and algorithms based on timetables are not the existing node-link data structure, but a unique data format that stores timetables for each route. It has the advantage that it uses faster operation speed than the path search method of graph theory.

However, most of the timetable-based algorithms use only the departure/arrival time of the stop according to the operation plan for route search, and thus, even if there are many transfers, if the physical travel time is minimal, the route is determined as the fastest arrival route. do.

However, public transport passengers tend not to prefer excessive transfers, so it is necessary to search for the shortest route considering transfer resistance.

In addition, in a public transport network with various means of transportation, it is also necessary to search for a plurality of alternative routes so as to broaden the range of individual route selection.

The present invention is to solve the problems of the above-described conventional techniques, by receiving input from the pedestrian the number of movement paths and preferences for each type of transfer, searching for a plurality of movement paths based on the timetable of public transportation, and providing them to the pedestrian, Provides a public transport route search server and method that makes it easier to select a moving route that fits the type of transfer you want without the need to indiscriminately check many moving routes, and thereby allows you to move using more satisfactory public transport. I want to.

However, the technical problem to be achieved by the present embodiment is not limited to the technical problems as described above, and other technical problems may exist.

As a technical means for achieving the above-described technical problem, an embodiment of the present invention relates to a public transport route search server, a search information receiving unit receiving search information including a departure place, an arrival place, and a departure time, the departure place, and A service schedule receiving unit for receiving operation time data of public transport available at at least one transfer point existing on the route from the departure point to the destination, based on the search information and the operation time data, at the departure time It may include a route calculator for calculating a plurality of recommended routes and expected arrival times to reach the destination by using public transportation from the departure point, and a display unit for expressing the plurality of recommended routes and expected arrival times.

Another embodiment of the present invention relates to a public transport route search method, the step of receiving input of search information including a departure point, an arrival point, and a departure time, and exist on a route reaching the destination from the departure point and the departure point. Receiving travel time data of public transport available for boarding at at least one transfer point, departing from the departure point at the departure time and arriving at the destination using public transportation based on the search information and the travel time data It may include calculating a plurality of recommended routes and expected arrival times, and displaying the plurality of recommended routes and expected arrival times.

Another embodiment of the present invention, when executed by a computing device as a computer program, receives search information including a departure point, a destination, and a departure time, and exists on the path from the departure point and the departure point to the destination. Receiving travel time data of public transportation available at at least one transfer point, and departing from the departure point at the departure time and arriving at the destination using public transportation based on the search information and the travel time data. A computer program stored in a medium including a sequence of commands for calculating a plurality of recommended routes and expected arrival times and expressing the plurality of recommended routes and expected arrival times may be provided.

The above-described problem solving means are merely exemplary and should not be construed as limiting the present invention. In addition to the above-described exemplary embodiments, there may be additional embodiments described in the drawings and detailed description of the invention.

According to any one of the above-described problem solving means of the present invention, the present invention receives the number of moving routes and transfer preferences from the pedestrians, searches for a plurality of moving routes based on the timetable of public transportation, and provides them to the pedestrians, , A public transport route search server and method that makes it easier to select a travel route tailored to the type of transfer you want without the need to indiscriminately check many travel routes, and thereby enable a more satisfactory movement using public transportation. Can provide.

In addition, the present invention provides a pedestrian by searching for a moving path, but by calculating and providing the time for each movement path based on the walking speed of the pedestrian, the pedestrian checks the exact travel time according to the movement path and provides a plurality of movement paths. By allowing any one of them to be selected, a public transport route search server and method that enables more accurate movement using public transport can be provided.

1 is a block diagram of a public transport route search server according to the present invention.
2 is a diagram illustrating an interface of a discovery information receiving unit and a display unit according to an embodiment of the present invention.
3 is a diagram illustrating a node-link type path search algorithm.
4 is a diagram illustrating a route search method using a public transportation timetable according to the present invention.
5 is a diagram illustrating a process of calculating the arrival time of the public transportation route search server according to the present invention.
6 is a diagram illustrating a path exclusion criterion of a path calculation unit according to an embodiment of the present invention.
7 is a flowchart illustrating a method for searching a public transport route according to the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those of ordinary skill in the art can easily implement the present invention. However, the present invention may be implemented in various different forms and is not limited to the embodiments described herein. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and similar reference numerals are assigned to similar parts throughout the specification.

Throughout the specification, when a part is said to be "connected" to another part, this includes not only "directly connected" but also "electrically connected" with another element in the middle. . In addition, when a part "includes" a certain component, it means that other components may be further included rather than excluding other components unless specifically stated to the contrary.

In the present specification, the term "unit" includes a unit realized by hardware, a unit realized by software, and a unit realized using both. Further, one unit may be realized using two or more hardware, or two or more units may be realized using one hardware.

In the present specification, some of the operations or functions described as being performed by the terminal or device may be performed instead by a server connected to the terminal or device. Likewise, some of the operations or functions described as being performed by the server may also be performed by a terminal or device connected to the server.

Hereinafter, with reference to the accompanying configuration diagram or processing flow chart, specific details for the implementation of the present invention will be described.

First, a public transport route search server according to the present invention will be described with reference to FIG. 1.

1 is a block diagram of a public transport route search server according to the present invention.

Referring to FIG. 1, the public transport route search server 100 according to the present invention may include a search information receiving unit 110, a driving schedule receiving unit 130, a route calculating unit 150, and a display unit 170. .

First, the search information receiving unit 110 may receive search information including a departure place, a destination place, and a departure time from a user.

Here, the search information receiving unit 110 may include a global positioning system (GPS) unit (not shown), and may receive a user's departure point through the GPS unit.

Meanwhile, the search information receiving unit 110 may display an interface screen including a plurality of input fields through a display unit 170 to be described later for receiving search information including a departure place, an arrival place, and a departure time from the user. This will be described in more detail with reference to FIG. 2 below.

In addition, the received search information may further include the number of routes, which is the limit number of the plurality of recommended routes. That is, when the search information receiving unit 110 receives the number of routes from the user, the user can receive as many recommended routes as he or she desires.

In addition, the inputted search information may further include transfer preferences for public transport by type or by route. Specifically, the transfer preference may further include a transfer preference for each type, which is a value obtained by quantifying the preference for each transfer type transferring to another type or public transportation of a different route. That is, the transfer preference for each type may be a preference for a transfer from a bus to a bus, transfer from a subway to a subway, or transfer between a bus and a subway.

In addition, the received search information may further include a walking speed coefficient that is a value corresponding to the walking movement speed. That is, when the search information receiving unit 110 receives the user's walking speed coefficient, the user may be provided with an expected arrival time for each route according to his or her walking speed.

The operation schedule receiving unit 130 may receive operation time data of public transport available for boarding at a departure point and at least one transfer point existing on a route from the departure point to the destination. This will be described in more detail with reference to FIG. 5 below.

Meanwhile, public transportation described in the present specification may include buses and subways.

The route calculation unit 150 may calculate a plurality of recommended routes and predicted arrival times that depart from the departure point at the departure time and reach the destination using public transportation, based on the search information and the driving time data.

Here, the route calculation unit 150 excludes the route to board the public transport of the same type as the public transport at the transfer point from the recommended route, and also, the first type of first public transport (for example, bus number XX). In the case where there are multiple routes for transferring to the second type of second public transportation (for example, YY subway), a route with a fast expected arrival time may be calculated as a recommended route. This will be described in more detail with reference to FIG. 6 below.

In addition, the route calculation unit 150 may calculate as many recommended routes as the number of routes input by the user. For example, when the number of routes input by the user is two, the route calculation unit 150 may calculate two recommended routes based on at least one of a shortest time, a shortest route, and a transfer preference.

In addition, the route calculation unit 150 may calculate a recommended route and an expected arrival time by reflecting the transfer time corresponding to the transfer preference. For example, when the transfer preference for each type input by the user is the highest between the bus and the subway, the route calculator 150 may calculate the recommended route and the expected arrival time by reflecting the transfer time between the bus and the subway.

In addition, the route calculation unit 150 may calculate a recommended route and an expected arrival time based on the walking speed coefficient. That is, the route calculation unit 150 further calculates the recommended route and the expected arrival time based on the walking speed coefficient, so that the user may be provided with the expected arrival time for each route according to his or her walking speed.

The display unit 170 may display a plurality of recommended routes and expected arrival times.

Here, the display unit 170 may display each recommended route and an expected arrival time corresponding thereto in the form of text on the form of a map. This will be described in more detail with reference to FIG. 2 below.

2 is a diagram illustrating an interface of a discovery information receiving unit and a display unit according to an embodiment of the present invention.

Referring to FIG. 2, the search information receiving unit 110 may provide an input interface 210 including an input box through which a user can input a departure time, a departure place, an arrival place, a walking speed coefficient, and a transfer preference, respectively. Departure time, departure place, destination, walking speed coefficient, and transfer preference may be input through respective input fields included in the interface 210.

In addition, the display unit 170 departs from the departure point at the departure time calculated based on at least one of the departure time, the departure place, the destination, the walking speed coefficient and the transfer preference input from the user, and reaches the destination using public transportation. An expression interface 230 including a plurality of recommended routes and expected arrival times may be displayed.

Here, as shown in FIG. 2, in the display interface 230, a plurality of pieces of information corresponding to the recommended route, such as an expected arrival time, number of transfers, and route name, may be displayed in the form of text.

Next, a route search method using a public transportation timetable according to the present invention will be described in comparison with the node-link method with reference to FIGS. 3 and 4.

3 is a diagram illustrating a node-link type path search algorithm.

First, referring to FIG. 3A, the node-link route search algorithm may represent a stop as a node and a route between each stop as a link (310). Here, the moving time included in each link may be stored as a plurality of different values according to the departure time. For example, despite the travel time included in the same link as the first link 311 and the second link 313, a different time may be applied according to the departure time.

In addition, referring to (b) of FIG. 3, the path search algorithm of the node-link method stores a plurality of searched paths in the database 330, and the path requested by the user is previously stored in the database 330. In this case, the path stored from the database 330 can be retrieved and provided to the user. In this method, the required database 330 has a very large size, and the path is provided only under predetermined conditions. Furthermore, when there is a change in the public transportation operation schedule, the node-link structure or the database 330 must be updated again.

Meanwhile, FIG. 4 is a diagram illustrating a route search method using a public transportation timetable according to the present invention.

Referring to FIG. 4, the operation schedule receiving unit 130 according to the present invention may receive operation time data of public transportation at a transfer point, and the route calculation unit 150 is based on the received operation time data, The route can be searched by selecting the fastest route among a plurality of routes available from the departure point to the destination.

For example, the operation schedule receiving unit 130 may receive operation time data of buses No. 51, No. 52, No. 83 passing through the departure point, and in this case, the route calculation unit 150 is based on the received operation time data. In the meantime, you can search for a route by selecting bus 51, the fastest route.

The route search method using the public transportation timetable may provide a search result faster than the node-link method route search algorithm described above, and may provide a search result in real time rather than a predetermined value. In addition, in the route search method using the public transportation timetable according to the present invention, a plurality of routes can be calculated without overlapping, and the number of routes, transfer preferences, and walking speed coefficients can be set by the user.

Next, a process of calculating the arrival time of the public transport route search server according to the present invention will be described with reference to FIG. 5.

5 is a diagram illustrating a process of calculating the arrival time of the public transportation route search server according to the present invention.

Referring to FIG. 5, when a user moves from a stop B to a stop G, in step S510, the route calculator 150 selects a route passing through both stops. For example, as shown in FIG. 5, the route calculation unit 150 may select routes R1 and R3 from among a plurality of routes passing through each of the stops B and G.

In step S530, the route calculation unit 150 searches for the order of the corresponding stops in the selected route using each stop ID. For example, as shown in FIG. 5, the route calculation unit 150 may search for an order of a stop B and a stop G in the R1 route, which is one of the two routes.

Here, the stop ID may mean an identification number assigned to each public transportation stop.

In step S550, the operation schedule receiving unit 130 receives operation time data of the searched public transport, and the route calculation unit 150 can board the currently selected route most quickly using the stop order and the departure time input from the user. Search the departure time and arrival time of public transportation. For example, as shown in FIG. 5, the route calculation unit 150 may search for a departure time and an arrival time of public transportation that can be boarded most quickly based on the operation time data of the R1 route.

In step S570, the route calculation unit 150 calculates an arrival time based on the searched travel time data of public transportation, and provides information such as the calculated arrival time to the user.

Next, a path exclusion criterion of the path calculation unit according to an embodiment of the present invention will be described with reference to FIG. 6.

6 is a diagram illustrating a path exclusion criterion of a path calculation unit according to an embodiment of the present invention. More specifically, FIG. 6(a) is a diagram showing a situation in which a user boards public transportation R1 from the left stop and moves to the right stop, and FIG. 6(b) shows the user changing from the R1 route to the R2 route. It is a diagram showing the situation of transferring at different transfer stops A, B, and C. Here, R1 and R2 are public transports of the same kind, respectively, and may be buses or subways of the same line.

Referring to FIG. 6A, the route of getting on R1 and going to the arrival stop at once, and the route of getting on R1, getting off at the intermediate stop, and reboarding on the same kind of public transport R1 at the same stop. Is stored as a different route because the arrival time to the arrival stop is different.

However, such a route has a problem in that it can be viewed as substantially the same route when searching for a route, so that the route calculation unit 250 according to the present invention re-boards on the route previously used at the stop where you got off so as not to store it in duplicate You can avoid it.

That is, the route calculation unit 150 according to the present invention may exclude a route on the public transport of the same route as the public transport at the transfer point from the recommended route.

Next, referring to (b) of FIG. 6, the route calculator 150 may store an order for each route and then compare and update only the minimum arrival time for routes using the same route order.

For example, in the case of (b) of FIG. 6, the travel time may vary slightly depending on where the user transfers from A, B, or C, but the route used is consistent.

In this case, if the route sequence is R1 (first type of first public transportation) → R2 (second type of second public transportation) has already been stored, the route calculation unit 150 By comparing the arrival times of and updating the early arrival times, it is possible not to store duplicate routes using the same route sequence.

Accordingly, in the case of overlapping routes, the route calculation unit 150 may provide a route with a shorter travel time to the user more quickly.

Next, a method of searching for a public transport route according to the present invention will be described with reference to FIG. 7.

7 is a flowchart illustrating a method for searching a public transport route according to the present invention.

Referring to FIG. 7, in step S710, the search information receiving unit 110 may receive search information including a departure location, a destination location, and a departure time from a user.

In step S730, the operation schedule receiving unit 130 may receive operation time data of public transport available for boarding at the departure point and at least one transfer point existing on a route from the departure point to the destination.

In step S750, the route calculation unit 150 may calculate a plurality of recommended routes and expected arrival times that depart from the departure point at the departure time and reach the destination using public transportation, based on the search information and the driving time data.

In step S770, the display unit 170 may display a plurality of recommended routes and expected arrival times.

In the above description, steps S710 to S770 may be further divided into additional steps or combined into fewer steps, according to an embodiment of the present invention. In addition, some steps may be omitted as necessary, and the order between steps may be changed.

An embodiment of the present invention may also be implemented in the form of a recording medium including instructions executable by a computer, such as a program module executed by a computer. Computer-readable media can be any available media that can be accessed by a computer, and includes both volatile and nonvolatile media, removable and non-removable media. Further, the computer-readable medium may include all computer storage media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.

The above description of the present invention is for illustrative purposes only, and those of ordinary skill in the art to which the present invention pertains will be able to understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are illustrative in all respects and not limiting. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as being distributed may also be implemented in a combined form.

The scope of the present invention is indicated by the claims to be described later rather than by the detailed description, and all changes or modified forms derived from the meaning and scope of the claims and their equivalent concepts should be construed as being included in the scope of the present invention.

100: transit route search server.
110: search information receiver
130: operation schedule receiver
150: path calculation unit
170: expression

Claims (12)

In the public transport route search server,
A search information receiving unit receiving search information including a departure place, a destination place, and a departure time;
A service schedule receiver configured to receive operation time data of public transport available at the departure point and at least one transfer point present on a route from the departure point to the destination;
A route calculator configured to calculate a plurality of recommended routes and predicted arrival times to reach the destination by using public transportation from the departure point at the departure time based on the search information and the driving time data; And
Public transportation route search server including a display unit for expressing the plurality of recommended routes and expected arrival times.
The method of claim 1,
The path calculation unit,
Routes on public transportation of the same route as the public transportation that got off at the transfer point are excluded from the recommended route,
When there are a plurality of routes for transferring from the first type of first public transportation to the second type of public transportation, a route having the early expected arrival time is calculated as the recommended route.
The method of claim 2,
The received search information further includes the number of routes,
The route calculation unit calculates the recommended route as many as the number of routes.
The method of claim 1,
The inputted search information further includes transfer preferences for public transportation by type or by route,
The route calculation unit further calculates the recommended route and the expected arrival time based on the transfer preference.
The method of claim 4,
The public transportation includes buses and subways,
The transfer preference is a public transport route search server, characterized in that it includes transfer preferences for each type of transfer from bus to bus, transfer from subway to subway, transfer between bus and subway.
The method of claim 1,
The inputted search information further includes a walking speed coefficient that is a value corresponding to the walking movement speed,
The route calculation unit further calculates the recommended route and the expected arrival time based on the walking speed coefficient.
In the public transport route search method,
Receiving search information including a departure location, a destination location and a departure time;
Receiving operation time data of public transport available at the departure point and at least one transfer point existing on a route from the departure point to the destination;
Calculating a plurality of recommended routes and expected arrival times to reach the destination by using public transportation from the departure point at the departure time based on the search information and the driving time data; And
Public transportation route search method comprising the step of expressing the plurality of recommended routes and expected arrival times.
The method of claim 7,
The step of calculating the plurality of recommended routes and expected arrival times,
Routes for boarding public transportation of the same type as the public transportation that got off at the transfer point are excluded from the recommended route,
When there are a plurality of routes for transferring from a first type of first public transportation to a second type of second public transportation, a route having the early expected arrival time is calculated as the recommended route.
The method of claim 8,
The received search information further includes the number of routes,
The calculating of the plurality of recommended routes and expected arrival times comprises calculating the recommended routes as many as the number of routes.
The method of claim 7,
The inputted search information further includes transfer preferences for public transportation by type or by route,
The calculating of the plurality of recommended routes and expected arrival times comprises calculating the recommended routes and expected arrival times further based on the transfer preference.
The method of claim 10,
The public transportation includes buses and subways,
The transfer preference is a public transport route search method including transfer preferences for each type of transfer from bus to bus, transfer from subway to subway, and transfer between bus and subway.
The method of claim 7,
The inputted search information further includes a walking speed coefficient that is a value corresponding to the walking movement speed,
The calculating of the plurality of recommended routes and expected arrival times comprises calculating the recommended routes and expected arrival times further based on the walking speed coefficient.

Images