CN111060121A - Route selection method and device, storage medium and electronic device - Google Patents

Route selection method and device, storage medium and electronic device Download PDF

Info

Publication number
CN111060121A
CN111060121A CN201811210191.9A CN201811210191A CN111060121A CN 111060121 A CN111060121 A CN 111060121A CN 201811210191 A CN201811210191 A CN 201811210191A CN 111060121 A CN111060121 A CN 111060121A
Authority
CN
China
Prior art keywords
route
vehicles
target
routes
capacity information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201811210191.9A
Other languages
Chinese (zh)
Inventor
马建江
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Tencent Dadi Tongtu Beijing Technology Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Tencent Dadi Tongtu Beijing Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd, Tencent Dadi Tongtu Beijing Technology Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN201811210191.9A priority Critical patent/CN111060121A/en
Publication of CN111060121A publication Critical patent/CN111060121A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Navigation (AREA)

Abstract

The invention discloses a route selection method and device, a storage medium and an electronic device. Wherein, the method comprises the following steps: acquiring a route acquisition request transmitted by a terminal; in response to the route acquisition request, acquiring a plurality of routes planned for the route acquisition request; determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles and capacity information of each route, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route within preset time; and sending the target route to the terminal. According to the invention, the technical problem of branch congestion caused by dredging a large number of main road vehicles to the branches in order to avoid the main road congestion in the related art is solved, and the technical effect of improving the route selection efficiency is achieved.

Description

Route selection method and device, storage medium and electronic device
Technical Field
The present invention relates to the field of computers, and in particular, to a method and an apparatus for route selection, a storage medium, and an electronic apparatus.
Background
In the conventional peak-shifting navigation, when the navigation is congested in a main road, an optimal congestion avoiding scheme is recommended to a vehicle owner, but the situation is often met, a large number of vehicles diverted from the main road exceed the load of the branch road, and instead, the vehicles in the branch road consume longer time than the congestion on the main road, so that a daily user in the original branch road cannot normally go out.
In view of the above problems, no effective solution has been proposed.
Disclosure of Invention
Embodiments of the present invention provide a route selection method and apparatus, a storage medium, and an electronic apparatus, so as to at least solve a technical problem in the related art that a large number of main road vehicles are diverted to a branch road to avoid congestion of the main road, which results in branch road congestion.
According to an aspect of an embodiment of the present invention, there is provided a route selection method including: acquiring a route acquisition request transmitted by a terminal; in response to the route acquisition request, acquiring a plurality of routes planned for the route acquisition request; determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles and capacity information of each route, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route within preset time; and sending the target route to the terminal.
According to another aspect of the embodiments of the present invention, there is also provided a route selection device, including: the first acquisition unit is used for acquiring a route acquisition request transmitted by a terminal; a second obtaining unit configured to obtain, in response to the route obtaining request, a plurality of routes planned for the route obtaining request; the determining unit is used for determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles in each route, the number of predicted target vehicles entering and capacity information, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route in the plurality of routes within preset time; and the sending unit is used for sending the target route to the terminal.
According to a further aspect of the embodiments of the present invention, there is also provided a storage medium having a computer program stored therein, wherein the computer program is configured to perform the above method when executed.
According to another aspect of the embodiments of the present invention, there is also provided an electronic apparatus, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the method by the computer program.
In the embodiment of the invention, a route acquisition request transmitted by a terminal is acquired; in response to the route acquisition request, acquiring a plurality of routes planned for the route acquisition request; determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles and capacity information of each route, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route within preset time; and sending the target route to the terminal. That is to say, when selecting the target route, in addition to considering the traffic information of the route, the capacity information of the route and the number of the target vehicles predicted to enter are also considered, the adjacent route with the shortest transit time is selected from the whole through the three information, instead of blindly selecting the branch with the least current vehicle from the adjacent branches when the current main road is congested, the congestion of the branch is caused to be more serious than that of the main road, and the technical problem that a large number of main road vehicles are diverted to the branch to cause the congestion of the branch in order to avoid the congestion of the main road in the related art is solved, and the technical effect of improving the route selection efficiency is achieved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
FIG. 1 is a schematic diagram of an environment in which a routing method according to an embodiment of the present invention is applied;
FIG. 2 is a flow chart illustrating a routing method according to an embodiment of the present invention;
FIG. 3 is a flow chart diagram of an alternative routing method according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of an alternative routing device according to an embodiment of the present invention;
FIG. 5 is a block diagram of a routing device according to yet another alternative embodiment of the present invention;
fig. 6 is a schematic structural diagram of an alternative electronic device according to an embodiment of the invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
According to an aspect of an embodiment of the present invention, there is provided a route selection method. Alternatively, the above routing method may be applied, but not limited, to the application environment as shown in fig. 1. As shown in fig. 1, the user terminal 104 sends a route acquisition request to the server 102, the server 102 connects with the database and performs route selection, and returns a route selection result to the user terminal 104, and the user terminal 104 displays the route selection result on an interface, for example, a user inputs "lane change" on a navigation interface of the user terminal 104, and after performing route selection via the server 102, displays an adjacent route with the shortest transit time on the interface, and the like.
Optionally, in this embodiment, the user terminal 104 may include, but is not limited to, at least one of the following: mobile phones, tablet computers, vehicle-mounted computers, and the like. The manner in which the user terminal 104 sends the route obtaining request to the server 102 may include, but is not limited to, the user terminal 104 sending the route obtaining request to the server 102 through a wireless network, where the wireless network includes: bluetooth, WIFI, and other networks that enable wireless communication. The above is only an example, and the present embodiment is not limited to this.
Optionally, in this embodiment, as an optional implementation manner, as shown in fig. 2, the route selection method may include:
s202, acquiring a route acquisition request transmitted by a terminal;
s204, responding to the route acquisition request, and acquiring a plurality of routes planned for the route acquisition request;
s206, determining a target route with the shortest transit time in the plurality of routes according to the number of the existing vehicles in each route, the number of the predicted target vehicles entering and capacity information, wherein the capacity information is used for indicating the number of the vehicles which can be accommodated in each route in the plurality of routes within preset time;
s208, the target route is sent to the terminal.
Optionally, the route selection method may be, but is not limited to, a process of reselecting a route for avoiding congestion by navigation software.
For example, the navigation software may cause congestion on the current route navigated by the user, re-plan a route with a shorter transit time for the user, and so on. The above is merely an example, and this is not limited in this embodiment.
It should be noted that the navigation software may include various types, such as a map Application (APP), a map function nested in a search tool, and the like.
Optionally, in a process of reselecting a route for avoiding congestion by the navigation software, acquiring a plurality of routes planned for the route acquisition request; determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles and capacity information of each route, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route within preset time; and transmitting route information to the terminal, wherein the route information is used for requesting the terminal to update the current congestion route to the target route in navigation information.
That is to say, when selecting the target route, in addition to considering the number of existing vehicles in each route of the multiple routes, the capacity information of the multiple routes and the number of predicted target vehicles to drive in are also considered, and the adjacent route with the shortest transit time is selected integrally through the three information, instead of blindly selecting a branch with the least current vehicles from adjacent branches when the current main route is congested, the congestion of the branch is caused to be more serious than that of the main route, so that the technical problem that in the related art, in order to avoid the congestion of the main route, a large number of vehicles of the main route are diverted to the branch, and the congestion of the branch is caused is solved, and the technical effect of improving the route selection efficiency is achieved.
Optionally, in this embodiment, the basis for determining the target route includes, but is not limited to: and determining the target route with the shortest transit time according to the three information, namely the number of the existing vehicles, the capacity information and the estimated number of the target vehicles entering each route in the plurality of routes, and also according to the two information.
For example, the number and the capacity information of the existing vehicles on each of the plurality of routes, or the number of the existing vehicles and the number of the predicted target vehicles entering on each of the plurality of routes, etc. are merely examples, and this is not limited in this embodiment.
Optionally, when the basis for determining the target route is the number of existing vehicles, the capacity information, and the number of predicted target vehicles entering according to each of the plurality of routes, the method for determining the target route includes, but is not limited to: and determining the target route with the shortest transit time from the plurality of routes according to the relationship between the sum of the number of the existing vehicles and the estimated number of the target vehicles entering each route and the capacity information of each route. The above is merely an example, and this is not limited in this embodiment.
And if the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route exceeds the number of the vehicles indicated by the capacity information of the corresponding route in the preset time, determining the current congested route as the target route. The following exemplifies the relationship between the sum of the number of existing vehicles and the number of target vehicles in the plurality of routes and the capacity information, and determines a target route among the plurality of routes.
For example, if the number of existing vehicles in one of the routes is 50, the number of predicted target vehicles to enter is 20, and the capacity of the route is 60, then the current congested route is determined as the target route.
For another example, if the number of existing vehicles on the route is 50, the number of predicted target vehicles to enter is 20, and the capacity of the route is 80, the adjacent route is determined as the target route.
For another example, if the number of the existing vehicles on the first route is 50, the number of the predicted target vehicles to enter is 20, the capacity of the first route is 80, and the number of the existing vehicles on the second route is 50, the number of the predicted target vehicles to enter is 10, and the capacity of the second route is 80, the second route is preferably selected as the target route.
Optionally, in this embodiment, the manner of obtaining the number of predicted target vehicles entering the adjacent route includes, but is not limited to: judging whether the current congestion route is updated to the target route in navigation information by terminals except the terminal; if the judgment result is yes, determining the vehicle corresponding to the terminal except the terminal as the estimated target vehicle entering the route; and secondly, judging whether the driving route of the terminal except the terminal is the driving adjacent route or not, and if so, determining the vehicle corresponding to the terminal except the terminal as the estimated target vehicle and the like driving into the adjacent route. The above is merely an example, and this is not limited in this embodiment.
Optionally, obtaining capacity information of neighboring routes adjacent to the current congested route includes, but is not limited to: acquiring the capacity information according to the traffic coefficient and the route length of the adjacent route in a first mode; obtaining the capacity information according to the traffic coefficient of the adjacent route, the length of the route, the speed limit value of the route and the average traffic flow speed; in a third embodiment, the traffic factor of the adjacent route, the length of the route, the speed limit value of the route, etc. are only examples, and this is not limited in this embodiment.
The present embodiment will be described below with reference to specific examples.
The present example provides a route selection method, wherein the method is mainly used for solving the problem of branch overload caused by off-peak navigation in the prior art. According to the conventional peak-shifting navigation method, when navigation is congested in a main road, an optimal congestion avoiding scheme is recommended to a vehicle owner, but the situation is often met, a large number of vehicles diverted from the main road exceed the load of the branch, the vehicles consume longer time than congestion on the main road, and further, a daily user on the original branch cannot normally go out. Therefore, in order to avoid the phenomenon, when the avoidance congestion scheme is provided, planning can be performed based on the route capacity of each branch circuit besides real-time road condition information, and the avoidance scheduling information sent to the car owner in the cloud platform is fully utilized to calculate whether one branch circuit can bear more vehicles, when a user with fast full load is distributed to one branch circuit, another suboptimal branch circuit is dynamically distributed to the subsequent users, another branch circuit is newly distributed when the suboptimal load is fast full, and the like, and when no branch circuit can be distributed, the avoidance congestion is not performed. Therefore, the situation that the traffic of the branch road is greatly influenced by the congestion of the main road is integrally avoided.
That is, in the prior art, the current traffic real-time road conditions are mainly based, all decisions are based on track information acquired in real time, the current avoiding congestion scheme is not fully considered to affect the current traffic conditions, and even more serious congestion may be caused by a large number of vehicle owners adopting the avoiding congestion scheme. The route selection method provided in the example has the greatest characteristics of foresight, prevention and foreness, fully utilizes the current road condition information, fully utilizes the congestion avoidance information pushed by the cloud platform to the vehicle owner, and calculates whether the congested branch is in the load or not, so that the current and future directions of the whole route are controlled comprehensively and deeply, and the problem of branch congestion possibly caused by the prior art is avoided as much as possible.
In an optional embodiment, determining a target route among the plurality of routes according to each route of the plurality of routes, the capacity information, and the estimated number of target vehicles to be driven in comprises:
and step S21, determining a target route with the shortest transit time in the plurality of routes according to the relationship between the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route and the capacity information of each route.
Through the step S21, the target route is determined among the plurality of routes according to the relationship between the sum of the number of existing vehicles and the number of the target vehicles in each route and the capacity information, instead of blindly selecting a branch with the least number of current vehicles from adjacent branches when the current main road is congested, which causes the congestion of the branch to be more serious than that of the main road, thereby solving the technical problem of branch congestion caused by diverting a large number of main road vehicles to the branch in order to avoid the congestion of the main road in the related art, and achieving the technical effect of improving the route selection efficiency.
Optionally, determining a target route in the plurality of routes according to a relationship between the capacity information and a sum of the number of existing vehicles and the estimated number of target vehicles entering each route includes:
step S31, if the sum of the number of existing vehicles and the number of predicted target vehicles entering each route exceeds the number of vehicles indicated by the capacity information of the corresponding route within the predetermined time, determining the current congested route as the target route.
Or, according to the relationship between the sum of the number of existing vehicles and the number of the estimated target vehicles entering each route and the capacity information, determining the target route in the plurality of routes comprises the following steps:
and step S41, if the sum of the number of existing vehicles and the number of predicted target vehicles entering each route of the plurality of routes with partial routes does not exceed the number of vehicles indicated by the capacity information of the corresponding route, selecting one route from the partial routes to determine the partial route as the target route.
Optionally, in this embodiment, the predetermined time includes, but is not limited to: 1 minute, half minute, etc., and is not limited thereto.
The above step S31 and the above step S41 are exemplified below, respectively.
For example, if the number of existing vehicles in the route is 50, the number of predicted target vehicles to enter is 20, and the capacity of the route is 60, the current congestion route is determined as the target route.
For another example, if the number of existing vehicles on the route is 50, the number of predicted target vehicles to enter is 20, and the capacity of the route is 80, the route is determined to be the target route.
For another example, if the number of the existing vehicles on the first route is 50, the number of the predicted target vehicles to enter is 20, the capacity of the first route is 80, and the number of the existing vehicles on the second route is 50, the number of the predicted target vehicles to enter is 10, and the capacity of the second route is 80, the second route is preferably selected as the target route.
Through the step S31 or the step S41, the target route is determined from the multiple routes according to the relationship between the sum of the number of existing vehicles on the route and the number of predicted target vehicles entering the route and the capacity information, so that the technical problem of branch congestion caused by the fact that a large number of main road vehicles are diverted to branch roads to avoid main road congestion in the related art is further solved, and the technical effect of improving the route selection efficiency is achieved.
In an optional embodiment, selecting a route from the partial routes to determine the target route comprises:
step S51, acquiring the sum of the number of the existing vehicles and the number of the estimated target vehicles on each route in the partial routes to obtain a plurality of sum values;
and step S52, selecting a target sum value from the plurality of sum values, and determining the route corresponding to the target sum value as the target route, wherein the target sum value is the sum value with the largest difference after comparing each sum value of the plurality of sum values with the number of vehicles indicated by the capacity information of the route corresponding to each sum value.
Alternatively, in this embodiment, if the sum of the number of existing vehicles and the number of predicted target vehicles entering the partial route in the videos does not exceed the number of vehicles indicated by the capacity information of the partial route, an optimal route is selected from the partial route and determined as the target route.
For example, if the number of existing vehicles in the first adjacent route of the adjacent route indicated by the traffic information is 50, the number of predicted target vehicles entering the first adjacent route is 20, the capacity of the first adjacent route is 80, the number of predicted target vehicles entering the second adjacent route is 50, the number of predicted target vehicles entering the second adjacent route is 10, and the capacity of the second adjacent route is 80, the second adjacent route is preferentially selected as the target route.
For another example, if the number of existing vehicles in the first adjacent route of the adjacent route indicated by the traffic information is 50, the number of target vehicles predicted to enter the first adjacent route is 20, the capacity of the first adjacent route is 80, the number of existing vehicles in the second adjacent route is 50, the number of target vehicles predicted to enter the second adjacent route is 20, and the capacity of the second adjacent route is 100, the second adjacent route is preferentially selected as the target route.
For another example, if the number of existing vehicles on the first adjacent route is 50, the number of predicted target vehicles entering the first route is 20, the capacity of the first route is 80, the number of existing vehicles on the second route is 40, the number of predicted target vehicles entering the second route is 20, and the capacity of the second route is 80, the second route is preferentially selected as the target route
Through the steps S51 to S52, if the sum of the number of existing vehicles in the route and the number of target vehicles predicted to enter the route does not exceed the number of vehicles indicated by the capacity information of the route, an optimal route is selected from the route to be determined as a target route, so that the current and future directions of the whole route can be controlled in an all-round and deeper manner, and the problem of branch congestion possibly caused by the prior art is avoided as much as possible.
In an optional embodiment, the obtaining of the number of predicted-to-enter target vehicles comprises the following steps:
step S61, determining whether other terminals except the terminal update the current congested route to the target route;
and step S62, if the judgment result is yes, determining the vehicle corresponding to the other terminal except the terminal as the estimated target vehicle.
Through the steps S61 to S62, by determining whether the current congested route is updated to the target route in the navigation information by the terminal other than the terminal, the vehicle corresponding to the terminal other than the terminal is determined as the target vehicle predicted to enter the adjacent route, so that the number of the target vehicles predicted to enter the adjacent route can be accurately obtained, and a certain basis is provided for efficient route selection.
In an optional embodiment, obtaining the capacity information of each of the plurality of routes comprises:
step S71, obtaining the capacity information according to the traffic coefficient and the route length of each route in the plurality of routes; alternatively, the first and second electrodes may be,
step S72, obtaining the capacity information according to the traffic factor, the route length, the speed limit value and the average traffic speed of each of the plurality of routes.
Alternatively, the above step S71 may obtain the capacity information by the following formula:
Figure BDA0001832260280000111
wherein, αiIs the traffic factor of the ith route, liIs the length of the ith route, and L is the total length of the route.
Alternatively, the above step S72 may obtain the capacity information by the following formula:
Figure BDA0001832260280000112
wherein, αiIs the traffic factor of the ith route, liIs the length of the ith route, L is the total length of the route, v1Is the speed limit of the route, v2Is the average traffic speed, v0Reference speed, β1、β2And χ is an adjustment coefficient.
Through the above-described step S71 and the above-described step S72, various factors that affect the capacity are considered, so that the capacity of the route is estimated more accurately.
For example, to fully consider the influence of the congestion avoidance scheme on the branch, there is a point that must be considered, i.e., the capacity of the branch, the types of the branch (national/provincial/rural) may be currently acquired through road network data, and the capacity of the route is roughly calculated, a traffic capacity coefficient α is calculated according to different route types and width information, i.e., national road is 1.8, provincial road is 1, and rural road is 0.5.
Figure BDA0001832260280000113
Wherein, αiIs the traffic factor of the ith route, liIs the length of the ith route and L is the total length of the re-planned route.
In actual operation, if the capacity of the route can be estimated, the speed limit of the route, the average traffic flow speed and the like can be considered, so that the capacity of the route can be estimated more accurately.
Figure BDA0001832260280000121
Wherein v is1To limit speed of the route, v2For the average collected traffic speed, v0Reference speed, β1、β2And χ is an adjustment coefficient.
The present embodiment will be described below with reference to specific examples.
It should be noted that, in this example, the route selection method may be applied to a route selection process of a cloud platform, and specifically the following steps are performed:
when the cloud platform distributes the congestion avoiding information by using the current road condition information, historical congestion avoiding information pushed to a vehicle owner by the cloud platform is also needed, whether the vehicle owner adopts the opinions or not is judged from the running track of the vehicle owner to execute the congestion avoiding scheme, and therefore the vehicle flow information of the branch is accurately estimated.
After the route capacity per minute of a certain branch is calculated through the front route capacity, the cloud platform can calculate that when the traffic flow which is distributed and executed in the past 1 minute reaches the upper limit of the route capacity, the avoidance strategy distribution of the branch is stopped, and the distribution is changed into other branches or not. The capacity of the route is changed in real time in the whole process, and the cloud platform collects new information in real time for calculation.
Referring to fig. 3, a specific implementation process is shown in fig. 3, and includes the following steps:
step S302, a navigation terminal (corresponding to a terminal) triggers an avoiding congestion event;
step S304, the cloud (cloud platform) calculates a plurality of planning routes by adopting the old strategy and compares the predicted passing time;
step S306, the cloud end calculates the route capacity of each planned route according to the collected route information and traffic information;
step S308, calculating whether each assigned vehicle of the congestion-avoiding route is full load or not, and pushing the optimal route to the navigation terminal;
in step S310, if the navigation terminal enters the push optimal route, the navigation terminal counts the distributed vehicles of the route.
By the aid of the route selection method, the cloud end can acquire the dynamic information of the route in real time to calculate, the technical problem that in the related technology, in order to avoid congestion of the main route, a large number of vehicles of the main route are guided to the branch roads, so that the branch roads are congested is further solved, and the technical effect of improving the route selection efficiency is achieved.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present invention is not limited by the order of acts, as some steps may occur in other orders or concurrently in accordance with the invention. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required by the invention.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (such as a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
According to another aspect of the embodiments of the present invention, there is also provided a routing device in a scenario for implementing the routing method, optionally, the routing device may be applied, but not limited, to an application environment as shown in fig. 1. As shown in fig. 1, the user terminal 104 sends a route acquisition request to the server 102, the server 102 connects with the database and performs route selection, and returns a route selection result to the user terminal 104, and the user terminal 104 displays the route selection result on an interface, for example, a user inputs "lane change" on a navigation interface of the user terminal 104, and after performing route selection via the server 102, displays an adjacent route with the shortest transit time on the interface, and the like.
Optionally, in this embodiment, the user terminal 104 may include, but is not limited to, at least one of the following: mobile phones, tablet computers, vehicle-mounted computers, and the like. The manner in which the user terminal 104 sends the route obtaining request to the server 102 may include, but is not limited to, the user terminal 104 sending the route obtaining request to the server 102 through a wireless network, where the wireless network includes: bluetooth, WIFI, and other networks that enable wireless communication. The above is only an example, and the present embodiment is not limited to this.
The embodiment of the present invention can be applied to the hardware environment shown in fig. 1, and is not described herein again.
According to an aspect of an embodiment of the present invention, as shown in fig. 4, the route selecting device includes:
1) a first obtaining unit 42, configured to obtain a route obtaining request transmitted by a terminal;
2) a second obtaining unit 44, configured to obtain, in response to the route obtaining request, a plurality of routes planned for the route obtaining request;
3) a determining unit 46, configured to determine a target route with a shortest transit time among the plurality of routes according to the number of existing vehicles in each route of the plurality of routes, the number of predicted target vehicles entering, and capacity information, where the capacity information is used to indicate the number of vehicles that can be accommodated in each route of the plurality of routes within a predetermined time;
4) a transmission unit 48, configured to send the target route to the terminal.
Alternatively, the route selection device can be, but is not limited to, a process of reselecting the route for avoiding congestion by navigation software.
For example, the navigation software may cause congestion on the current route navigated by the user, re-plan a route with a shorter transit time for the user, and so on. The above is merely an example, and this is not limited in this embodiment.
It should be noted that the navigation software may include various types, such as a map Application (APP), a map function nested in a search tool, and the like.
Optionally, in the process of reselecting the route for avoiding congestion by the navigation software, a route acquisition request transmitted by the terminal is acquired; in response to the route acquisition request, acquiring a plurality of routes planned for the route acquisition request; and determining the target route with the shortest transit time in the plurality of routes according to the number of the existing vehicles, the number of the predicted target vehicles entering and the capacity information of each route.
That is to say, when selecting the target route, in addition to considering traffic information of a plurality of routes adjacent to the current congested route, capacity information of the plurality of routes and the number of predicted target vehicles entering are also considered, and the adjacent route with the shortest transit time is selected integrally through the three information, instead of blindly selecting a branch with the least current vehicle from adjacent branches when the current main route is congested, the congestion of the branch is caused to be more serious than that of the main route, so that the technical problem that the congestion of the branch is caused by diverting a large number of main route vehicles to the branch to avoid the congestion of the main route in the related art is solved, and the technical effect of improving the route selection efficiency is achieved.
Optionally, in this embodiment, the basis for determining the target route includes, but is not limited to: according to the three information of the traffic information, the capacity information and the estimated number of the target vehicles entering the road, the target route can be determined according to two information.
For example, the above is only an example according to the traffic information and the capacity information of the plurality of routes, or the traffic information and the number of predicted target vehicles to enter according to the plurality of routes, and the like, and this is not limited in this embodiment.
Optionally, when the basis for determining the target route is the traffic information, the capacity information and the number of predicted target vehicles entering according to each of the plurality of routes, the method for determining the target route includes, but is not limited to: determining a target route in the plurality of routes according to the relationship between the sum of the number of the existing vehicles and the number of the target vehicles in each route in the plurality of routes and the capacity information; or respectively comparing the traffic information, the capacity information and the estimated number of the target vehicles entering each route of the plurality of routes with a corresponding first preset threshold, a second preset threshold and a third preset threshold, and determining the target route in the plurality of routes according to the comparison result. The above is merely an example, and this is not limited in this embodiment.
The following exemplifies the determination of the target route among the plurality of routes according to the relationship between the sum of the number of existing vehicles and the number of the target vehicles for each of the plurality of routes and the capacity information.
For example, if the number of existing vehicles in the route is 50, the number of predicted target vehicles to enter is 20, and the capacity of the route is 60, the current congestion route is determined as the target route.
For another example, if the number of existing vehicles on the route is 50, the number of predicted target vehicles to enter is 20, and the capacity of the route is 80, the route is determined to be the target route.
For another example, if the number of the existing vehicles on the first route is 50, the number of the predicted target vehicles to enter is 20, and the capacity of the first route is 80, and the number of the existing vehicles on the second route is 50, the number of the predicted target vehicles to enter the second route is 10, and the capacity of the second route is 80, the second route is preferentially selected as the target route.
Optionally, in this embodiment, the manner of acquiring the number of predicted target vehicles includes, but is not limited to: judging whether the current congestion route is updated to the target route in navigation information by terminals except the terminal; if the judgment result is yes, determining the vehicle corresponding to the terminal except the terminal as the estimated target vehicle; and secondly, judging whether the driving route of the terminal except the terminal is the driving adjacent route or not, and if so, determining the vehicle corresponding to the terminal except the terminal as the estimated target vehicle and the like driving into the adjacent route. The above is merely an example, and this is not limited in this embodiment.
Optionally, obtaining the capacity information associated with each of the plurality of routes includes, but is not limited to: the method comprises the steps of firstly, acquiring the capacity information according to the traffic coefficient and the route length of each route in the plurality of routes; obtaining the capacity information according to the traffic coefficient, the length of the route, the speed limit value of the route and the average traffic flow speed of each route in the plurality of routes; in a third way, the traffic factor, the length of the route, the speed limit value of the route, etc. of each of the plurality of routes are only examples, and this is not limited in this embodiment.
The present embodiment will be described below with reference to specific examples.
The present example provides a route selection method, wherein the method is mainly used for solving the problem of branch overload caused by off-peak navigation in the prior art. According to the conventional peak-shifting navigation method, when navigation is congested in a main road, an optimal congestion avoiding scheme is recommended to a vehicle owner, but the situation is often met, a large number of vehicles diverted from the main road exceed the load of the branch, the vehicles consume longer time than congestion on the main road, and further, a daily user on the original branch cannot normally go out. Therefore, in order to avoid the phenomenon, when the avoidance congestion scheme is provided, planning can be performed based on the route capacity of each branch circuit besides real-time road condition information, and the avoidance scheduling information sent to the car owner in the cloud platform is fully utilized to calculate whether one branch circuit can bear more vehicles, when a user with fast full load is distributed to one branch circuit, another suboptimal branch circuit is dynamically distributed to the subsequent users, another branch circuit is newly distributed when the suboptimal load is fast full, and the like, and when no branch circuit can be distributed, the avoidance congestion is not performed. Therefore, the situation that the traffic of the branch road is greatly influenced by the congestion of the main road is integrally avoided.
That is, in the prior art, the current traffic real-time road conditions are mainly based, all decisions are based on track information acquired in real time, the current avoiding congestion scheme is not fully considered to affect the current traffic conditions, and even more serious congestion may be caused by a large number of vehicle owners adopting the avoiding congestion scheme. The route selection method provided in the example has the greatest characteristics of foresight, prevention and foreness, fully utilizes the current road condition information, fully utilizes the congestion avoidance information pushed by the cloud platform to the vehicle owner, and calculates whether the congested branch is in the load or not, so that the current and future directions of the whole route are controlled comprehensively and deeply, and the problem of branch congestion possibly caused by the prior art is avoided as much as possible.
In an alternative implementation, fig. 5 is a block diagram (a) of a route selection device according to another alternative embodiment of the present invention, and as shown in fig. 5, the determining unit 46 includes:
1) and the determining module 52 is configured to determine, according to a relationship between the sum of the number of existing vehicles and the number of predicted target vehicles entering each route and the capacity information of each route, a target route with the shortest transit time among the plurality of routes.
Through the device shown in fig. 5, according to the relationship between the sum of the number of existing vehicles and the number of predicted target vehicles entering each of the plurality of routes and the capacity information, a target route is determined among the plurality of routes, instead of blindly selecting a branch with the least number of current vehicles from adjacent branches when a current main road is congested, so that the branch is congested more seriously than the main road, the technical problem that the branch is congested due to the fact that a large number of main road vehicles are diverted to the branch in order to avoid the main road congestion in the related art is solved, and the technical effect of improving the route selection efficiency is achieved.
In an optional embodiment, the determining module 52 is further configured to determine the current congested route as the target route when the sum of the number of existing vehicles of each route in the adjacent routes and the number of target vehicles predicted to enter each route exceeds the number of vehicles indicated by the capacity information of each route within a predetermined time.
Optionally, the determining module 52 is further configured to determine the current congested route as the target route if the sum of the number of existing vehicles in each route and the number of predicted target vehicles entering exceeds the number of vehicles indicated by the capacity information of the corresponding route in the predetermined time.
Optionally, in this embodiment, the predetermined time includes, but is not limited to: 1 minute, half minute, etc., and is not limited thereto.
The determination modules 52 are exemplified below.
For example, if the number of existing vehicles in the route is 50, the number of predicted target vehicles to enter is 20, and the capacity of the route is 60, the current congestion route is determined as the target route.
For another example, if the number of existing vehicles on the route is 50, the number of predicted target vehicles to enter is 20, and the capacity of the route is 80, the route is determined to be the target route.
For another example, if the number of the existing vehicles on the first route is 50, the number of the predicted target vehicles to enter is 20, the capacity of the first route is 80, and the number of the existing vehicles on the second route is 50, the number of the predicted target vehicles to enter is 10, and the capacity of the second route is 80, the second route is preferably selected as the target route.
Through the determining module 52, the target route is determined in the plurality of routes according to the relationship between the sum of the number of existing vehicles and the number of the target vehicles in each route in the plurality of routes and the capacity information, so that the technical problem of branch congestion caused by dredging a large number of main road vehicles to branch roads in order to avoid main road congestion in the related art is further solved, and the technical effect of improving the route selection efficiency is achieved.
Optionally, the determining module 52 is further configured to select one route from the partial routes to determine the route as the target route if the sum of the number of existing vehicles and the number of predicted target vehicles entering each route in which the partial routes exist does not exceed the number of vehicles indicated by the capacity information of the corresponding route within the predetermined time.
Alternatively, in this embodiment, if the sum of the number of existing vehicles in the plurality of routes in which a partial route exists and the number of target vehicles predicted to enter the partial route does not exceed the number of vehicles indicated by the capacity information of the partial route, an optimal route is selected from the partial route and determined as the target route.
For example, if the number of the existing vehicles on the first route is 50, the number of the predicted target vehicles to enter is 20, and the capacity of the first route is 80, and if the number of the existing vehicles on the second route is 50, the number of the predicted target vehicles to enter is 10, and the capacity of the second route is 80, the second route is preferably selected as the target route.
For another example, if the number of the existing vehicles on the first route is 50, the number of the predicted target vehicles to enter is 20, and the capacity of the first route is 80, and the number of the existing vehicles on the second route is 50, the number of the predicted target vehicles to enter is 20, and the capacity of the second route is 100, the second route is preferably selected as the target route.
For another example, if the number of existing vehicles on the first route is 50, the number of predicted target vehicles to enter is 20, the capacity of the first route is 80, and the number of existing vehicles on the second route is 40, the number of predicted target vehicles to enter is 20, and the capacity of the second route is 80, the second route is preferably selected as the target route
Through the determining module 52, if the sum of the number of the existing vehicles in the part of routes and the number of the target vehicles predicted to enter the part of routes does not exceed the number of the vehicles indicated by the capacity information of the part of routes, an optimal route is selected from the part of routes to be determined as the target route, the current and future directions of the whole route can be controlled in an all-round and deeper manner, and the problem of branch congestion possibly caused by the prior art is avoided as much as possible.
In an optional embodiment, the second obtaining unit 44 is further configured to determine whether other terminals than the terminal update the current congested route to the target route; and if the judgment result is yes, determining the vehicles corresponding to other terminals except the terminal as the predicted target vehicle.
By the second obtaining unit 44, it is determined whether the current congested route is updated to the target route in the navigation information by the terminal other than the terminal, and the vehicle corresponding to the terminal other than the terminal is determined as the estimated target vehicle, so that the number of estimated target vehicles can be accurately obtained, and a certain basis is provided for efficient route selection.
In an optional embodiment, the second obtaining unit 44 is further configured to obtain the capacity information according to a traffic factor and a route length of each of the plurality of routes; or acquiring the capacity information according to the traffic coefficient, the length, the speed limit value and the average traffic flow speed of each route in the plurality of routes.
Optionally, the obtaining the capacity information according to the traffic coefficients and the route lengths of the plurality of routes includes:
the capacity information is obtained by the following formula:
Figure BDA0001832260280000201
wherein, αiIs the traffic factor of the ith route, liIs the length of the ith route, and L is the total length of the route.
Optionally, the obtaining the capacity information according to the traffic factor of the adjacent route, the length of the route, the speed limit value of the route, and the average traffic flow speed includes:
the capacity information is obtained by the following formula:
Figure BDA0001832260280000202
wherein, αiIs the traffic factor of the ith route, liIs the length of the ith route, L is the total length of the route, v1Is the speed limit of the route, v2Is the average traffic speed, v0Reference speed, β1、β2And χ is an adjustment coefficient.
By the above-described second acquisition unit 44, various factors affecting the capacity are considered, so that the route capacity is estimated more accurately.
For example, to fully consider the influence of the congestion avoidance scheme on the branch, there is a point that must be considered, i.e., the capacity of the branch, the types of the branch (national/provincial/rural) may be currently acquired through road network data, and the capacity of the route is roughly calculated, a traffic capacity coefficient α is calculated according to different route types and width information, i.e., national road is 1.8, provincial road is 1, and rural road is 0.5.
Figure BDA0001832260280000211
Wherein, αiIs the traffic factor of the ith route, liIs the length of the ith route and L is the total length of the re-planned route.
In actual operation, if the capacity can be collected, the speed limit of the route, the average traffic flow speed and the like can be considered, so that the capacity of the route can be estimated more accurately.
Figure BDA0001832260280000212
Wherein v is1To limit speed of the route, v2For the average collected traffic speed, v0Reference speed, β1、β2And χ is an adjustment coefficient.
According to a further aspect of embodiments of the present invention, there is also provided a storage medium having a computer program stored therein, wherein the computer program is arranged to perform the steps of any of the above-mentioned method embodiments when executed.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
s1, acquiring a route acquisition request transmitted by the terminal;
s2, in response to the route acquisition request, acquiring a plurality of routes planned for the route acquisition request;
s3, determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles and capacity information of each route, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route in the plurality of routes within preset time;
s4, sending the target route to the terminal.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
and S1, determining the target route with the shortest transit time in the plurality of routes according to the relationship between the sum of the number of the existing vehicles and the estimated number of the target vehicles entering each route and the capacity information of each route.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
and S1, if the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route exceeds the number of the vehicles indicated by the capacity information of the corresponding route in the preset time, determining the current congestion route as the target route.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
and S1, if the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route of the plurality of routes in which the partial routes exist does not exceed the number of the vehicles indicated by the capacity information of the corresponding route, selecting one route from the partial routes to determine the partial routes as the target route.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
s1, acquiring the sum of the number of the existing vehicles and the number of the estimated target vehicles in each route in the partial routes to obtain a plurality of sum values;
and S2, selecting a target sum value from the plurality of sum values, and determining the route corresponding to the target sum value as the target route, wherein the target sum value is the sum value with the largest difference after each sum value in the plurality of sum values is compared with the number of vehicles indicated by the capacity information of the route corresponding to each sum value.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
s1, judging whether other terminals except the terminal update the current congestion route to the target route;
and S2, if the judgment result is yes, determining the vehicle corresponding to the other terminal except the terminal as the estimated target vehicle.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
s1, obtaining the capacity information according to the traffic coefficient and the route length of each route in the plurality of routes;
and S2, acquiring the capacity information according to the traffic coefficient, the route length, the speed limit value and the average traffic flow speed of each route in the plurality of routes.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
s1, obtaining the capacity information by the following formula:
Figure BDA0001832260280000231
wherein, αiIs the traffic factor of the ith route, liIs the length of the ith route, and L is the total length of the route.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
s2, obtaining the capacity information by the following formula:
Figure BDA0001832260280000241
wherein, αiIs the traffic factor of the ith route, liIs the length of the ith route, L is the routeTotal length of (v)1Is the speed limit of the route, v2Is the average traffic speed, v0Reference speed, β1、β2And χ is an adjustment coefficient.
Alternatively, in this embodiment, a person skilled in the art may understand that all or part of the steps in the methods of the foregoing embodiments may be implemented by a program instructing hardware associated with the terminal device, where the program may be stored in a computer-readable storage medium, and the storage medium may include: flash disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
According to yet another aspect of the embodiments of the present invention, there is also provided an electronic device for implementing the routing method, as shown in fig. 6, the electronic device includes a memory 602 and a processor 604, the memory 602 stores therein a computer program, and the processor 604 is configured to execute the steps in any one of the method embodiments by the computer program.
Optionally, in this embodiment, the electronic apparatus may be located in at least one network device of a plurality of network devices of a computer network.
Optionally, in this embodiment, the processor may be configured to execute the following steps by a computer program:
s1, acquiring a route acquisition request transmitted by the terminal;
s2, in response to the route acquisition request, acquiring a plurality of routes planned for the route acquisition request;
s3, determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles and capacity information of each route, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route in the plurality of routes within preset time;
s4, sending the target route to the terminal.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
and S1, determining the target route with the shortest transit time in the plurality of routes according to the relationship between the sum of the number of the existing vehicles and the estimated number of the target vehicles entering each route and the capacity information of each route.
Alternatively, in this embodiment, the processor may be configured to store a computer program for executing the following steps:
and S1, if the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route exceeds the number of the vehicles indicated by the capacity information of the corresponding route in the preset time, determining the current congestion route as the target route.
Alternatively, in this embodiment, the processor may be configured to store a computer program for executing the following steps:
and S1, if the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route of the plurality of routes in which the partial routes exist does not exceed the number of the vehicles indicated by the capacity information of the corresponding route, selecting one route from the partial routes to determine the partial routes as the target route.
Alternatively, in this embodiment, the processor may be configured to store a computer program for executing the following steps:
s1, acquiring the sum of the number of the existing vehicles and the number of the estimated target vehicles in each route in the partial routes to obtain a plurality of sum values;
and S2, selecting a target sum value from the plurality of sum values, and determining the route corresponding to the target sum value as the target route, wherein the target sum value is the sum value with the largest difference after each sum value in the plurality of sum values is compared with the number of vehicles indicated by the capacity information of the route corresponding to each sum value.
Alternatively, in this embodiment, the processor may be configured to store a computer program for executing the following steps:
s1, judging whether other terminals except the terminal update the current congestion route to the target route;
and S2, if the judgment result is yes, determining the vehicle corresponding to the other terminal except the terminal as the estimated target vehicle.
Alternatively, in this embodiment, the processor may be configured to store a computer program for executing the following steps:
s1, obtaining the capacity information according to the traffic coefficient and the route length of each route in the plurality of routes;
and S2, acquiring the capacity information according to the traffic coefficient, the route length, the speed limit value and the average traffic flow speed of each route in the plurality of routes.
Alternatively, it can be understood by those skilled in the art that the structure shown in fig. 6 is only an illustration, and the electronic device may also be a terminal device such as a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palmtop computer, and a Mobile Internet Device (MID), a PAD, and the like. Fig. 6 is a diagram illustrating a structure of the electronic device. For example, the electronic device may also include more or fewer components (e.g., network interfaces, display devices, etc.) than shown in FIG. 6, or have a different configuration than shown in FIG. 6.
The memory 604 may be used to store software programs and modules, such as program instructions/modules corresponding to the routing method and apparatus in the embodiments of the present invention, and the processor 602 executes various functional applications and data processing by running the software programs and modules stored in the memory 604, so as to implement the routing method. The memory 604 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 604 may further include memory located remotely from the processor 602, which may be connected to the terminal over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof. The memory 602 may be, but is not limited to, specifically configured to store information such as a routing procedure. As an example, as shown in fig. 6, the memory 602 may include, but is not limited to, the first obtaining unit 42, the second obtaining unit 44, the determining unit 46, and the transmitting unit 48 in the routing device. In addition, the routing device may further include, but is not limited to, other module units in the routing device, which is not described in this example again.
Optionally, the transmission device 610 is used for receiving or sending data via a network. Examples of the network may include a wired network and a wireless network. In one example, the transmission device 610 includes a Network adapter (NIC) that can be connected to a router via a Network cable and other Network devices to communicate with the internet or a local area Network. In one example, the transmission device 1610 is a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
In addition, the electronic device further includes: a display 608 for displaying the result of the above-mentioned route selection; and a connection bus 610 for connecting the respective module parts in the above-described electronic apparatus.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
The integrated unit in the above embodiments, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in the above computer-readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing one or more computer devices (which may be personal computers, servers, network devices, etc.) to execute all or part of the steps of the method according to the embodiments of the present invention.
In the above embodiments of the present invention, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed client may be implemented in other manners. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.

Claims (14)

1. A method of route selection, comprising:
acquiring a route acquisition request transmitted by a terminal;
in response to the route acquisition request, acquiring a plurality of routes planned for the route acquisition request;
determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles and capacity information of each route, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route within preset time;
and sending the target route to the terminal.
2. The method of claim 1, wherein determining the target route with the shortest transit time among the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles entering, and the capacity information of each of the plurality of routes comprises:
and determining a target route with the shortest transit time in the plurality of routes according to the relationship between the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route and the capacity information of each route.
3. The method according to claim 2, wherein determining the target route having the shortest transit time among the plurality of routes according to a relationship between the sum of the number of existing vehicles and the number of predicted target vehicles entering each route and the capacity information of each route comprises:
and if the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route exceeds the number of the vehicles indicated by the capacity information of the corresponding route in the preset time, determining the current congested route as the target route.
4. The method according to claim 2, wherein determining the target route having the shortest transit time among the plurality of routes according to a relationship between the sum of the number of existing vehicles and the number of predicted target vehicles entering each route and the capacity information of each route comprises:
and if the sum of the number of the existing vehicles in each route with a part of routes and the number of the predicted target vehicles to enter in the plurality of routes does not exceed the number of the vehicles indicated by the capacity information of the corresponding route within the preset time, selecting one route from the part of routes to determine as the target route.
5. The method of claim 4, wherein selecting a route from the partial routes to determine the target route comprises:
acquiring the sum of the number of the existing vehicles and the number of the estimated target vehicles in each route in the partial routes to obtain a plurality of sum values;
and selecting a target sum value from the plurality of sum values, and determining the route corresponding to the target sum value as the target route, wherein the target sum value is the sum value with the largest difference after each sum value in the plurality of sum values is respectively compared with the number of vehicles indicated by the capacity information of the route corresponding to each sum value.
6. The method of claim 1, further comprising, before determining a target route with the shortest transit time among the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles entering, and the capacity information of each of the plurality of routes:
acquiring the number of predicted target vehicles entering each route in the plurality of routes; acquiring the number of predicted target vehicles entering each route in the plurality of routes: judging whether other terminals except the terminal update the current congestion route to the target route; if the judgment result is yes, determining vehicles corresponding to other terminals except the terminal as predicted target vehicles;
and acquiring the number of predicted target vehicles entering each route in the plurality of routes.
7. The method of claim 1, further comprising, before determining a target route with the shortest transit time among the plurality of routes according to the number of existing vehicles, the number of predicted target vehicles entering, and the capacity information of each of the plurality of routes:
acquiring capacity information of each route in the plurality of routes according to the traffic coefficient and the route length of each route in the plurality of routes; or
And acquiring the capacity information of each route in the plurality of routes according to the traffic coefficient, the route length, the speed limit value and the average traffic flow speed of each route in the plurality of routes.
8. A routing device, comprising:
the first acquisition unit is used for acquiring a route acquisition request transmitted by a terminal;
a second acquisition unit configured to acquire, in response to the route acquisition request, a plurality of routes planned for the route acquisition request;
the determining unit is used for determining a target route with the shortest transit time in the plurality of routes according to the number of existing vehicles in each route, the number of predicted target vehicles entering and capacity information, wherein the capacity information is used for indicating the number of vehicles which can be accommodated in each route in the plurality of routes within preset time;
and the sending unit is used for sending the target route to the terminal.
9. The apparatus of claim 8, wherein the determining unit comprises:
and the determining module is used for determining the target route with the shortest transit time in the plurality of routes according to the relationship between the sum of the number of the existing vehicles and the number of the predicted target vehicles entering each route and the capacity information of each route.
10. The apparatus of claim 9, wherein the determining module is further configured to determine the current congested route as the target route if the sum of the number of existing vehicles and the number of predicted target vehicles for each route exceeds the number of vehicles indicated by the capacity information of the corresponding route in the predetermined time.
11. The apparatus according to claim 9, wherein the determining module is further configured to select one route from the plurality of routes as the target route if the sum of the number of existing vehicles and the number of predicted target vehicles entering each route in which a partial route exists does not exceed the number of vehicles indicated by the capacity information of the corresponding route within the predetermined time.
12. The apparatus of claim 11, wherein the determining module comprises:
the first obtaining submodule is used for obtaining the sum of the number of the existing vehicles and the number of the estimated target vehicles entering each route in the partial routes to obtain a plurality of sum values;
and the second obtaining submodule is used for selecting a target sum value from the plurality of sum values and determining the route corresponding to the target sum value as the target route, wherein the target sum value is the sum value with the largest difference after each sum value in the plurality of sum values is respectively compared with the number of vehicles indicated by the capacity information of the route corresponding to each sum value.
13. A storage medium, in which a computer program is stored, wherein the computer program is arranged to perform the method of any of claims 1 to 7 when executed.
14. An electronic device comprising a memory and a processor, characterized in that the memory has stored therein a computer program, the processor being arranged to execute the method of any of claims 1 to 7 by means of the computer program.
CN201811210191.9A 2018-10-17 2018-10-17 Route selection method and device, storage medium and electronic device Pending CN111060121A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811210191.9A CN111060121A (en) 2018-10-17 2018-10-17 Route selection method and device, storage medium and electronic device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811210191.9A CN111060121A (en) 2018-10-17 2018-10-17 Route selection method and device, storage medium and electronic device

Publications (1)

Publication Number Publication Date
CN111060121A true CN111060121A (en) 2020-04-24

Family

ID=70297059

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811210191.9A Pending CN111060121A (en) 2018-10-17 2018-10-17 Route selection method and device, storage medium and electronic device

Country Status (1)

Country Link
CN (1) CN111060121A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112414420A (en) * 2020-08-13 2021-02-26 腾讯科技（深圳）有限公司 Navigation method based on traffic flow and related device

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104121918A (en) * 2013-04-25 2014-10-29 北京搜狗信息服务有限公司 Real-time path planning method and system
US20150170310A1 (en) * 2013-12-18 2015-06-18 At&T Intellectual Property I, L.P. Method and apparatus for controlling a roadway source
CN105788335A (en) * 2016-04-05 2016-07-20 广东欧珀移动通信有限公司 Navigation method and terminal
CN107144286A (en) * 2016-03-01 2017-09-08 阿里巴巴集团控股有限公司 Air navigation aid and device
CN107782326A (en) * 2016-08-31 2018-03-09 百度在线网络技术（北京）有限公司 Method, apparatus and equipment for automobile navigation
CN109840632A (en) * 2019-01-23 2019-06-04 中国联合网络通信集团有限公司 A kind of traffic route assessment method and device for planning

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104121918A (en) * 2013-04-25 2014-10-29 北京搜狗信息服务有限公司 Real-time path planning method and system
US20150170310A1 (en) * 2013-12-18 2015-06-18 At&T Intellectual Property I, L.P. Method and apparatus for controlling a roadway source
CN107144286A (en) * 2016-03-01 2017-09-08 阿里巴巴集团控股有限公司 Air navigation aid and device
CN105788335A (en) * 2016-04-05 2016-07-20 广东欧珀移动通信有限公司 Navigation method and terminal
CN107782326A (en) * 2016-08-31 2018-03-09 百度在线网络技术（北京）有限公司 Method, apparatus and equipment for automobile navigation
CN109840632A (en) * 2019-01-23 2019-06-04 中国联合网络通信集团有限公司 A kind of traffic route assessment method and device for planning

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112414420A (en) * 2020-08-13 2021-02-26 腾讯科技（深圳）有限公司 Navigation method based on traffic flow and related device

Similar Documents

Publication Publication Date Title
CN104165634B (en) Path planning method based on user use habit
CN108133619B (en) Parking lot parking prediction method and device, storage medium and terminal equipment
CN110210813B (en) Method and device for determining distribution range, electronic equipment and storage medium
CN106781669A (en) Recommend method and device in a kind of parking stall
US20180288502A1 (en) Information collection system and information collection apparatus
CN107430561A (en) Content delivering system, content distributing server, car-mounted terminal, content distribution method
CN107240254A (en) Traffic Forecasting Methodology and terminal device
CN106529896B (en) The method and Claims Resolution server surveyed based on Claims Resolution
KR20230029993A (en) Path determination method and apparatus, device, and medium
CN107169398A (en) Signal processing method and device
CN104581640A (en) Cloud server, system and method for realizing Internet of Vehicles pickup function
CN102737518A (en) Real-time interactive system and method for multi-media road condition information
CN110954118A (en) Service recommendation method and system for vehicle machine
JP2017096636A (en) Recommended scheduled route acquisition system, method, and program
JP6771559B2 (en) Mobile communication device, mobile communication method, and mobile communication program
CN113422727A (en) Service processing method and device and electronic equipment
KR101373175B1 (en) Real time monitoring system and method for street based on push type communication
CN111060121A (en) Route selection method and device, storage medium and electronic device
CN105654761A (en) Driving route monitoring method, terminal, server and system
JP5513360B2 (en) Traffic jam information generating apparatus, traffic jam information generating method, and program
CN109979211A (en) Car networking system, transportation planning method, device, mist calculate equipment and medium
CN113947940B (en) Parking space recommendation method for roadside parking and related equipment
CN112325889B (en) Navigation prompt information determination method and device, storage medium and electronic equipment
CN114882720B (en) Intelligent road network pushing method, intelligent road network pushing device and vehicle
CN108270672A (en) A kind of method and device for calculating circuit routing

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 40022007

Country of ref document: HK

SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination