KR102125472B1 - Recommended route guidance system and method for reducing tolerance time - Google Patents

Abstract

The present invention relates to a recommended route guidance system and method for reducing tolerance time, wherein the location constructing unit configures a national standard node link to generate map data including latitude and longitude coordinates (a); Step (b) of the branch selection section to set the zone by dividing the map data into a predetermined size, and select nodes as the representative point by selecting nodes having an average number of passengers on average by day/time zone within the set zone; And step (c) of determining the priority for passing through each of the representative points by deriving profit values obtained by quantifying the possibility of meeting with the passengers and the possibility of boarding passengers at each node selected by the route setting unit as a representative point (c). Includes.
According to the present invention as described above, there is an effect of reducing the tolerance time by guiding a taxi to an area where a lot of passengers board.

Description

Recommended route guidance system and method for reducing tolerance time{RECOMMENDED ROUTE GUIDANCE SYSTEM AND METHOD FOR REDUCING TOLERANCE TIME}

The present invention relates to a recommended route guidance system and method for reducing the tolerance time, and more specifically, to move to a certain route (order and road) from the location of a taxi in operation to a destination where a lot of passengers board as a destination. It is about the technology that guides whether you can board a passenger effectively.

Since 2000, taxi performance in Seoul has been continuously deteriorating. In fact, compared to 10.4% in 1996, taxi passenger traffic in 2009 fell to 6.2%.

These phenomena may include dissemination of surrogate driving externally, increased use of taxis and high-capacity private vehicles, and improvement of public transportation use environments such as bus central lanes. Internally, deterioration of working conditions due to deteriorating taxi business, These include the company's job shortages, reduced utilization rates, and basic qualities of taxi drivers.

As this situation continued, the taxi business fell into a vicious cycle leading to worsening of business, worsening of working conditions for drivers, and deterioration of drivers' qualities, which ultimately led to a decrease in the net income of taxi drivers.

Indeed, comparing the incomes of private taxis and corporate taxis in 2005 and 2010 in [Table 1] below, the deterioration of business conditions is well seen.

This deterioration in profitability was attempted to be compensated through the increase in taxi service hours. In the case of corporate taxis, taxi drivers are shifted for an average of 20 hours or more. However, during these operating hours, an average maximum tolerance time of around 3 hours occurs.

This can be inferred that there are quite a lot of tolerances when taxis are operated when combined with the actual rate of taxis in Seoul, where the majority of times that the Ministry of Land, Infrastructure and Transport cannot achieve 50%.

Korean Patent Publication No. 2017-0036570

An object of the present invention, based on the taxi call data, node link data, and average speed data for each road, updates the priority of a point to be passed by a vehicle on a periodic basis, and increases the number of passengers boarding at an adjacent location based on the current location of the vehicle. The goal is to reduce the tolerance time by guiding taxis to areas where passengers board a lot by recommending a route to a destination.

One embodiment of the present invention for achieving such a technical problem is a recommended route guidance system for reducing the tolerance time, and includes a latitude and longitude coordinates by assigning a link ID to each preset point based on the vehicle's location coordinates and the national standard node link. A location constructing unit generating map data; A branch selection unit that divides the map data into a predetermined size to set an area, selects nodes with an average number of passengers above the average for each day/time zone within the set area, and selects them as representative points; And a route for establishing a movement route by determining the priority for each of the selected representative points by deriving a profit value that quantifies the likelihood of meeting passengers at each node selected as a representative point and a profit value that quantifies the possibility of passenger boarding. Characterized in that it comprises a setting unit.

Preferably, the route setting unit searches for a route from a departure node to an arrival node by setting a destination to a point having the highest number of passengers based on the current position of the vehicle, but remembers the route by attaching a label to the route that the vehicle has passed. It is characterized in that the profit value with the highest score is derived as a moving path by performing back-tracking to back-calculate the route corresponding to the remembered name tag.

The recommended route guidance method for reducing the tolerance time according to an embodiment of the present invention based on the above-described system, the location component configures a national standard node link to generate map data including latitude and longitude coordinates (a) step; Step (b) of the branch selection section to set the zone by dividing the map data into a predetermined size, and selecting a node having an average number of passengers above the average by day/time zone within the set zone; And step (c) of determining the priority for passing through each of the representative points by deriving profit values obtained by quantifying the possibility of meeting with the passengers and the possibility of boarding passengers at each node selected by the route setting unit as a representative point (c). Includes.

Preferably, step (c) comprises: (c-1) deriving a profit value that quantifies the likelihood of meeting a passenger at each node where the route setting unit is selected as a representative point; Deriving (c-2) a profit value obtained by quantifying the possibility of boarding a passenger at each node selected by the route setting unit as a representative point; (C-3) searching for a route from a departure node to an arrival node by setting a destination to a point having the highest number of boarding points based on the current position of the vehicle for setting a route; A step (c-4) of the route setting unit storing a route by attaching a label to a route that the vehicle has passed; And (c-5) deriving the profit value with the highest score as a moving path by performing back-tracking to back-calculate the route corresponding to the name tag stored by the route setting unit.

According to the present invention as described above, based on the taxi call data, node link data and the average speed data for each road, the priority of the point to be passed by the vehicle is updated on a periodic basis, and passengers board at an adjacent location based on the current location of the vehicle. By recommending the point where the number was high as a destination and guiding the corresponding route, there is an effect of reducing the tolerance time by guiding a taxi to an area where a lot of passengers board.

1 is a block diagram showing a recommended route guidance system for reducing tolerance time according to an embodiment of the present invention.
Figure 2 is an exemplary view showing the map data generated by the recommended route guidance system for reducing the tolerance time according to an embodiment of the present invention.
Figure 3 is an exemplary view showing that the number of passengers boarding is less than or equal to a preset value when selecting a representative point of the recommended route guidance system for reducing the tolerance time according to an embodiment of the present invention.
FIG. 4 is a diagram illustrating a procedure for a route setting unit of a recommended route guidance system for reducing tolerance time according to an embodiment of the present invention to perform route search and back tracking.
FIG. 5 is an exemplary view showing a movement route derived by a route setting unit of a recommended route guidance system for reducing tolerance time according to an embodiment of the present invention according to route search and back-tracking performance.
6 is an exemplary view showing a process of recommending a route of a recommendation route guidance system for reducing a tolerance time according to an embodiment of the present invention.
7 is an exemplary view showing a process for selecting a destination of a recommendation route guidance system for reducing a tolerance time according to an embodiment of the present invention.
8 is a flowchart illustrating a recommended route guidance method for reducing tolerance time according to an embodiment of the present invention.
9 is a flowchart illustrating a detailed process of step S100 of the recommended route guidance method for reducing the tolerance time according to an embodiment of the present invention.
10 is a flowchart illustrating a detailed process of step S200 of the recommended route guidance method for reducing tolerance time according to an embodiment of the present invention.
11 is a flowchart illustrating a detailed process of step S300 of the recommended route guidance method for reducing tolerance time according to an embodiment of the present invention.
12 is a flowchart illustrating a process after step S300 of the recommended route guidance method for reducing tolerance time according to an embodiment of the present invention.

The specific features and advantages of the present invention will become more apparent from the following detailed description based on the accompanying drawings. Prior to this, the terms or words used in the specification and claims are based on the principle that the inventor can appropriately define the concept of terms in order to best describe his or her invention in the technical spirit of the present invention. It should be interpreted as a matching meaning and concept. In addition, it should be noted that when it is determined that the detailed description of the known functions and configurations related to the present invention may unnecessarily obscure the subject matter of the present invention, the detailed description is omitted.

1 is a configuration diagram showing a recommended route guidance system (S) for reducing the tolerance time according to an embodiment of the present invention.

As shown in Figure 1, the recommended route guidance system (S) for reducing the tolerance time according to an embodiment of the present invention, the location configuration unit 100, the branch selection unit 200 and the route setting unit 300 It is configured to include.

The location configuration unit 100 configures the vehicle's location coordinates and the national standard node link with ArcGIS to generate link data for each preset point, generates map data including latitude and longitude coordinates, and projects the vehicle's current location on the map data. do.

At this time, the map data is generated as shown in FIG. 2, and excludes a node link corresponding to a road other than the node link that the taxi actually moves to board the passenger.

This is because, due to the nature of the taxi operation, since it mainly operates on the main road to board passengers, it does not move to the back road like an alleyway to board passengers, except that it operates as a destination for unloading passengers.

Therefore, the location configuring unit 100 is configured to exclude node links corresponding to roads other than the main road from all node links from the map data when generating the map data.

In addition, in the recommended route guidance system S for reducing tolerance time according to an embodiment of the present invention, map data generation and representative point selection are limited to Seoul, but this is to help understanding of the present invention. One embodiment is not limited to this.

On the other hand, the branch selection unit 200 sets the zone by dividing the city, county, or district unit area included in the map data by grid size, and selects the nodes with the average number of passengers on average by day/time zone within the set zone. Select a representative branch.

At this time, the branch selection unit 200 excludes a node selected from the location coordinates of the vehicle within a preset radius among the nodes selected as a representative location, as shown in FIG. 3, wherein the number of passengers boarding is less than or equal to a preset value.

In addition, the grid size has a size of 2.6km x 1.58km, the diagonal may be configured to a size of 3.04km, the preset radius may be set to 2km to 3km, preferably 2.6km, but one embodiment of the present invention Examples are not limited to this size.

The reason for setting the size of 2.6km x 1.58km in one embodiment of the present invention is that when the length of the diagonal of the grid is about 3km, the maximum distance is the most congested when moving from section to next section (10~20km/h) ) Even if it moves, because it can satisfy the movement within 15 minutes, which is a preset restriction condition, there are a total of 111 selected points.

However, when one point was selected within the section, many points were selected because it was concentrated in a specific area, and further processing was performed. Through the comparison of the number of boarding points between selected points, 64 points were selected from all over the city of Seoul as a result of the final selection of points except those with low values within a radius of 2.6 km.

The route setting unit 300 derives a profit value that quantifies the possibility of meeting the passenger at each node selected as a representative point and a profit value that quantifies the possibility of passenger boarding, and determines the priority for passing through each of the selected representative points. Set the movement path.

First, the route setting unit 300 calculates the profit value, which quantifies the possibility of meeting with a passenger, to determine the priority, and divides the travel time of the entered road and the travel time of the entered road as shown in [Equation 1]. The profit value obtained by quantifying the possibility of passenger boarding is derived by performing a division operation on the number of taxi tolerances on the entered road and the number of taxis on the entered road as shown in [Equation 2].

At this time, the priority is updated every predetermined time according to the change in the travel time between regions and the distribution of customers according to the time zone, and the optimal route is searched for 2 hours based on the change in profit value in 30 minutes increments, but the priority condition is 1) Search the order of moving regions for 2 hours, 2) profit value and time required are updated in 30 minute increments, 3) the upper limit for the moving time between regions is 20 minutes, and detailed conditions for prioritization are shown in [Table 2]. ] And [Table 3].

[Table 2] discloses the objectives, assumptions and variables for prioritization, and [Table 3] assumes the objective function and constraints.

In addition, the route setting unit 300 searches for a route from the departure node to the arrival node by setting a destination to the point where the number of boardings was the highest based on the current position of the vehicle to set the moving route, but the name tag (Label ) To remember the route, and back-tracking to recalculate the route corresponding to the stored name tag to derive the profit value with the highest score as a moving route.

At this time, the value stored in correspondence with the name tag includes the route that the vehicle has passed, the travel time, and the profit value derived while moving the route.

In addition, the recommended route guidance system S for reducing the tolerance time according to an embodiment of the present invention is to be searched among the previous nodes stored in the name tag of the current node from the movement route derived by the route setting unit 300 It further comprises a node filter unit 400 for discarding the name tag corresponding to the overlapping node.

At this time, the node filter unit 400 is configured to compare the *X of the current node with **Y of the next light-scheduled node to reduce unnecessary search, and to skip the search when the profit value of Y is higher and the travel time is shorter. The details of *X and **Y are shown in [Table 4] below.

That is, according to an embodiment of the present invention, when both the current node and the best combination, the travel time from the next node to the next node, and the value of both Profit are considered, compared with the worst combination of the next node, if the state is bad, the next node This is because the best value cannot be guaranteed even if you move and search.

Accordingly, by configuring the node filter unit 400 according to an embodiment of the present invention, among the name tags of the node, the Profit value is small, but the combination of all name tags having a long travel time is filtered based on the maximum Profit value and the minimum travel time. By taking out and deleting, it is possible to prevent unnecessary path searching and storage of name tags in advance, thereby reducing the operation speed.

Hereinafter, referring to FIGS. 4 and 5, a process of inserting a label for each node through the path setting unit 300 of the recommended route guidance system S for reducing the tolerance time according to an embodiment of the present invention and The results are as follows.

4 is a diagram illustrating a procedure in which the route setting unit 300 of the recommended route guidance system S for reducing the tolerance time according to an embodiment of the present invention performs route search and back-tracking.

First, the starting point (s) is set in the route search process and s is added to the set of nodes to be searched (Labeled).

Subsequently, it is determined whether the set of nodes to be searched forward (Labeled) is 0, and if the set of nodes to be searched forward (Labeled) is 0, it moves to the Back-Tracking process to derive Cur_Val = optimal profit value, and Cur_time = Set to the time paired with the optimal profit value.

Then, the node immediately before the optimal combination is added to the path and stored as Cur_node.

Subsequently, the moved profit of Cur_node and the current node is removed from Cur_Val.

Subsequently, the moved time of Cur_node and the current node c is removed from Cur_time.

Subsequently, it is determined whether the Cur_Val value is 0, and if the Cur_Val value is 0, a clean path is output.

On the other hand, if the set of nodes to be searched forward in the path search process is not 0, i is updated in the set of nodes to be searched forward (Labeled) through FIFO.

Subsequently, it is determined whether or not the i value is equal to the arrival point (t), and when i = t, the process of updating i through a first-in, first-out (FIFO) process in the previous set of nodes to be searched (Labeled) Do it again.

On the other hand, if i = t is not the value extracted from the set of nodes to be searched in the future (Labeled), i -> j path search is executed and the value is updated.

Subsequently, it is determined whether there is a change in the search result, and if there is a change in the search result, i -> j path search is performed with the value extracted from the previous set of nodes to be searched (Labeled) and the value is updated. Perform the process again.

On the other hand, if there is no change in the search result, it is determined whether a j value exists in a set of nodes to be searched forward (Labeled), and if a j value is present, a set of nodes to be searched forward (Labeled) in the previous step. The process of determining whether j value exists in the process is performed again.

On the other hand, if a j value exists in a set of nodes to be searched forward, the j value is added to a set of nodes to be searched forward.

FIG. 5 is an exemplary diagram showing a movement route derived by the route setting unit 300 of the recommended route guidance system S for reducing the tolerance time according to an embodiment of the present invention according to route search and back-tracking. .

As shown in FIG. 5, according to an embodiment of the present invention, when departing from the same starting point (near Hanti Station, Seoul), the movement path is derived by reflecting profits that vary depending on the time zone, that is, the recommendation path presentation is changed. .

Hereinafter, referring to FIG. 6, a process for recommending a movement route of the recommendation route guidance system S for reducing the tolerance time according to an embodiment of the present invention will be described.

First, based on the past boarding data of Seungtaek, which has changed over time, it indicates in what order to visit the three representative spots near the current location.

Thereafter, a route to which the destination should be moved is presented through the labeling algorithm mentioned above with reference to FIG. 4.

In summary, the process of recommending a route is 1) determining the order of visits by branch, 2) searching for a route by branch, 3) outputting the node location used for route configuration, and 4) confirming the node location. It is configured to show the path to.

Hereinafter, referring to FIG. 7, a process for selecting a destination of the recommended route guidance system S for reducing tolerance time according to an embodiment of the present invention will be described.

When a movement path other than the movement path derived according to the movement path recommendation process of FIG. 6 is desired, the user directly displays a movement path to the destination through a function of selecting one of the representative points.

In summary, the destination selection recommendation process is configured to: 1) search for a movement path for each branch, 2) output a node location used for path configuration, and 3) display a path on a map when confirming the node location.

Hereinafter, referring to FIG. 8, a method for guiding a recommended route for reducing the tolerance time according to an embodiment of the present invention will be described.

First, the location configuring unit 100 constructs a national standard node link to generate map data including latitude and longitude coordinates (S100).

Subsequently, the branch selection unit 200 sets the zone by dividing the map data into a predetermined size, and selects a node having an average number of passengers above the average for each day/time zone within the set zone (S200).

Then, the route setting unit 300 derives a profit value quantifying the possibility of meeting with the passenger and the possibility of boarding the passenger at each node selected as the representative point, and determines the priority for passing through each of the representative points to set the moving route. (S300).

Hereinafter, referring to FIG. 9, the step S100 of the recommended route guidance method for reducing the tolerance time according to an embodiment of the present invention is as follows.

First, the location configuration unit 100 configures the vehicle's location coordinates and the national standard node link to ArcGIS (S102).

Subsequently, the location configuration unit 100 generates a map data including a latitude and longitude coordinate by assigning a link ID to each predetermined point (S104).

Subsequently, the location configuration unit 100 excludes the node link corresponding to the road other than the main road from the entire node link from the map data from the map data (S106).

Then, the position configuring unit 100 projects the current position indicator of the vehicle onto the map data (S108).

Hereinafter, a detailed process of step S200 of the recommended route guidance method for reducing the tolerance time according to an embodiment of the present invention will be described with reference to FIG. 10 as follows.

After the step S100, the branch selection unit 200 sets an area by dividing the city, county, or district unit area on the map data by the grid size (S202).

Subsequently, a node in which the number of passengers having an average number of passengers is greater than or equal to each day/time zone within the area set by the branch selection unit 200 is selected as a representative point (S204).

Then, among the nodes selected by the branch selection unit 200 as a representative location, nodes having a number of passengers boarding less than or equal to a preset radius from a vehicle's location coordinates are excluded (S206).

Hereinafter, a detailed process of step S300 of the recommended route guidance method for reducing the tolerance time according to an embodiment of the present invention will be described with reference to FIG. 11 as follows.

After the step S200, the route setting unit 300 derives a profit value that quantifies the possibility of meeting the passenger at each node selected as a representative point (S302).

Subsequently, the route setting unit 300 derives a profit value that quantifies the possibility of passenger boarding at each node selected as a representative point (S304 ).

Subsequently, the route setting unit 300 searches for a route from the departure node to the arrival node by setting the destination to the point with the highest number of boardings based on the current position of the vehicle to set the moving route (S306).

Subsequently, the route setting unit 300 stores the route by attaching a label to the route that the vehicle has passed (S308).

Then, the path setting unit 300 performs back-tracking to back-calculate the route corresponding to the name tag stored, and derives a profit value obtained with the highest score as a movement route (S310).

Hereinafter, with reference to FIG. 12, the process after step S300 of the recommended route guidance method for reducing the tolerance time according to an embodiment of the present invention is as follows.

After the step S300, the node filter unit 400 excludes the name label (Label) corresponding to the node that overlaps with the node to be searched among the previous nodes stored in the name label (Label) of the current node from the movement path (S400).

According to an embodiment of the present invention as described above, by guiding the corresponding route by recommending a point where the passenger's boarding number was high at an adjacent location based on the current location of the vehicle as a destination, the taxi is guided to an area where many passengers board. The tolerance time can be reduced.

As described above, the present invention has been described and illustrated in connection with a preferred embodiment for illustrating the technical idea of the present invention, but the present invention is not limited to the configuration and operation as illustrated and described, and deviates from the scope of the technical idea. It will be understood by those skilled in the art that many changes and modifications to the present invention are possible without. Accordingly, all such suitable modifications and modifications and equivalents should be considered as falling within the scope of the present invention.

S: Recommended route guidance system for reducing tolerance time
100: location component
200: branch selection
300: path setting unit
400: node filter unit

Claims (4)

A location configuration unit for generating map data including latitude and longitude coordinates by assigning a link ID to each preset point based on the vehicle's location coordinates and a national standard node link;
A branch selection unit that sets the zone by dividing the map data into a predetermined size and selects a node having an average number of passengers above the average for each day/time zone within the designated zone as a representative point;
Routes are set by determining the priority for each of the selected representative points by deriving the profit value that quantifies the likelihood of meeting passengers at each node selected as the representative point and the profit value that quantifies the possibility of boarding passengers part; And
A node filter unit for discarding a name tag corresponding to a node overlapping with a node to be searched among the previous nodes stored in the name tag of the current node from the movement path,
The node filter unit,
To reduce unnecessary search, compare *X of the current node (the best combination of the current node to the next node plus Profit) and **Y (the worst combination of the next node) of the node to be searched for next Y If the profit value is higher and the travel time is shorter, the recommended route guidance system for reducing tolerance time, characterized in that the corresponding search is omitted. According to claim 1,
The route setting unit,
Set the destination to the point with the highest number of boardings based on the current location of the vehicle to search for a route from the departure node to the destination node.
A label is attached to the virtual route searched to the destination node to remember the route, and back-tracking is performed to back-calculate the route corresponding to the remembered name tag, and the representative point corresponding to the profit value with the highest score Recommended path guidance system for reducing the tolerance time, characterized in that to derive the path. (a) generating a map data including latitude and longitude coordinates by configuring the national standard node link by the location configuring unit;
(b) the branch selection section sets the zone by dividing the map data into a predetermined size, and selects a node having an average number of passengers above the average by day/time zone within the set zone and selecting it as a representative point;
(c) deriving a profit value obtained by quantifying a possibility of meeting with a passenger and a possibility of boarding a passenger at each node selected by the route setting unit as a representative point, and determining a priority for passing through each of the representative points to establish a moving route; And
(d) the node filter unit includes a step of discarding the name tag corresponding to the node that overlaps with the node to be searched among the previous nodes stored in the name tag of the current node from the movement path,
Step (c) is,
(c-1) deriving a profit value that quantifies the likelihood of meeting a passenger at each node selected by the route setting unit as a representative point;
(c-2) deriving a profit value that quantifies the possibility of passenger boarding at each node selected by the route setting unit as a representative point;
(c-3) a route setting unit searching for a route from a departure node to an arrival node by setting a destination to a point having the highest number of boarding points based on the current position of the vehicle for setting a moving route;
(c-4) a path setting unit storing a path by adding a label to a virtual path searched to the destination node; And
(c-5) Back-tracking to calculate the route corresponding to the name tag remembered by the route setting unit and deriving a representative point corresponding to the profit value with the highest score as a moving route.
Featured route guidance method for reducing the tolerance time, characterized in that it comprises. delete

Images