CN112729325A - Route planning method, device, system, server and storage medium - Google Patents
Route planning method, device, system, server and storage medium Download PDFInfo
- Publication number
- CN112729325A CN112729325A CN202011382835.XA CN202011382835A CN112729325A CN 112729325 A CN112729325 A CN 112729325A CN 202011382835 A CN202011382835 A CN 202011382835A CN 112729325 A CN112729325 A CN 112729325A
- Authority
- CN
- China
- Prior art keywords
- route
- line
- candidate
- determining
- candidate line
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 239000013598 vector Substances 0.000 claims description 54
- 238000004590 computer program Methods 0.000 claims description 20
- 230000008569 process Effects 0.000 abstract description 15
- 230000006870 function Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 238000013500 data storage Methods 0.000 description 4
- 230000004044 response Effects 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
-
- 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/3461—Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries
-
- 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/3469—Fuel consumption; Energy use; Emission aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- General Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Navigation (AREA)
Abstract
The application is applicable to the technical field of computers, and provides a line planning method, a line planning device, a server and a storage medium. The route planning method comprises the steps of obtaining a starting place and a destination, determining at least one candidate route matched with the starting place and the destination, obtaining operation time consumption, operation cost and route length of each candidate route, wherein the operation cost comprises oil consumption and charging information of a toll station, determining the candidate route with the shortest operation time consumption according to the operation time consumption of each candidate route, determining the candidate route with the lowest operation cost according to the operation cost of each candidate route, determining the candidate route with the shortest route length according to the route length of each candidate route, outputting the candidate route with the shortest operation time consumption, the candidate route with the lowest operation cost and the candidate route with the shortest route length, and enabling a user to select any one output route according to self requirements, wherein the output route meets the actual operation cost in the vehicle driving process.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, a system, a server, and a storage medium for route planning.
Background
The freight is taken as an important component of the transportation industry, the expenses such as road tolls and oil consumption in the transportation process account for most of the cost expenses of the freight, but the actual cost in the vehicle driving process is not fully considered in the existing route planning scheme, and the actual requirements of users cannot be met.
Disclosure of Invention
In view of this, embodiments of the present application provide a method, an apparatus, a system, a server, and a storage medium for route planning, which can meet actual requirements of users.
A first aspect of an embodiment of the present application provides a method for route planning, including:
acquiring a departure place and a destination;
determining at least one candidate route matching the departure place and the destination;
acquiring the running time, running cost and line length of each candidate line, wherein the running cost comprises oil consumption and charging information of a toll station;
determining a candidate line with the shortest running time according to the running time of each candidate line, determining a candidate line with the lowest running cost according to the running cost of each candidate line, and determining a candidate line with the shortest line length according to the line length of each candidate line;
and outputting the candidate line with the shortest operation time, the candidate line with the lowest operation cost and the candidate line with the shortest line length.
In one possible implementation, before the obtaining the departure place and the destination, the route planning method further includes:
acquiring a historical driving route of a vehicle;
and determining the running time, running cost and line length of each candidate line according to the line information corresponding to the historical running line.
In one possible implementation manner, the determining the operation cost of each candidate route according to the route information corresponding to the historical travel routes includes:
dividing the historical driving route into at least one sub-route according to toll stations, wherein the starting point and the end point of one sub-route respectively correspond to one toll station;
determining sub-lines included by each candidate line and the average oil consumption of each sub-line;
and respectively determining the running cost of each candidate line according to the average oil consumption of all sub-lines included in each candidate line and the fee charged by the toll station.
In one possible implementation, after determining at least one candidate route matching the origin and destination, the route planning method further includes:
determining a feature vector of the historical driving route and a feature vector of each candidate route;
calculating the similarity between the feature vector of each candidate line and the feature vector of the historical driving line;
and taking the candidate line corresponding to the maximum similarity as a similar line, and outputting the similar line.
In one possible implementation manner, the determining the feature vector of the historical travel route includes:
obtaining a line selection habit of a user;
determining a historical driving route according with the route selection habit according to the route selection habit, and taking the historical driving route according with the route selection habit as a target route;
and taking the feature vector of the target route as the feature vector of the historical driving route.
In one possible implementation manner, the determining the feature vector of the historical travel route includes:
and determining the characteristic vector of the historical driving route according to the average oil consumption and the driving speed of the at least one sub-route.
A second aspect of the embodiments of the present application provides a line planning apparatus, including:
the first acquisition module is used for acquiring a departure place and a destination;
the matching module is used for determining at least one candidate route matched with the departure place and the destination;
the second acquisition module is used for acquiring the operation time consumption, the operation cost and the line length of each candidate line, wherein the operation cost comprises the oil consumption and the charging information of a toll station;
the determining module is used for determining the candidate line with the shortest running time according to the running time of each candidate line, determining the candidate line with the lowest running cost according to the running cost of each candidate line, and determining the candidate line with the shortest line length according to the line length of each candidate line;
and the output module is used for outputting the candidate line with the shortest operation time consumption, the candidate line with the lowest operation cost and the candidate line with the shortest line length.
In a possible implementation manner, the first obtaining module is further configured to:
acquiring a historical driving route of a vehicle;
and determining the running time, running cost and line length of each candidate line according to the line information corresponding to the historical running line.
In a possible implementation manner, the first obtaining module is further configured to:
dividing the historical driving route into at least one sub-route according to toll stations, wherein the starting point and the end point of one sub-route respectively correspond to one toll station;
determining sub-lines included by each candidate line and the average oil consumption of each sub-line;
and respectively determining the running cost of each candidate line according to the average oil consumption of all sub-lines included in each candidate line and the fee charged by the toll station.
In one possible implementation, the output module is further configured to:
determining a feature vector of the historical driving route and a feature vector of each candidate route;
calculating the similarity between the feature vector of each candidate line and the feature vector of the historical driving line;
and taking the candidate line corresponding to the maximum similarity as a similar line, and outputting the similar line.
In one possible implementation, the output module is further configured to:
obtaining a line selection habit of a user;
determining a historical driving route according with the route selection habit according to the route selection habit, and taking the historical driving route according with the route selection habit as a target route;
and taking the feature vector of the target route as the feature vector of the historical driving route.
In one possible implementation, the output module is further configured to:
and determining the characteristic vector of the historical driving route according to the average oil consumption and the driving speed of the at least one sub-route.
A third aspect of embodiments of the present application provides a server, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor, when executing the computer program, implements the route planning method according to the first aspect.
A fourth aspect of the embodiments of the present application provides a route planning system, including terminal device, vehicle-mounted terminal, ETC, third party platform and the above-mentioned third aspect the server, terminal device is used for sending the place of departure and the destination of user input to the server, the server is used for receiving the vehicle-mounted terminal the data that ETC and third party platform sent, the operation of confirming every candidate route is consuming time, running cost and circuit length according to the data received.
A fifth aspect of embodiments of the present application provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the route planning method according to the first aspect.
A sixth aspect of embodiments of the present application provides a computer program product, which, when run on an electronic device, causes the electronic device to perform the method for route planning according to the first aspect.
Compared with the prior art, the embodiment of the application has the advantages that: the method comprises the steps of determining at least one candidate line matched with a starting place and a destination by obtaining the starting place and the destination, obtaining operation time consumption, operation cost and line length of each candidate line, wherein the operation cost comprises oil consumption and charging information of a toll station, determining the candidate line with the shortest operation time consumption according to the operation time consumption of each candidate line, and determining the candidate line with the lowest operation cost according to the operation cost of each candidate line. The candidate line with the shortest line length is determined according to the line length of each candidate line, the candidate line with the shortest operation time consumption, the candidate line with the shortest operation cost and the candidate line with the shortest line length are output, a user can select any one output line according to the requirement of the user, and the operation cost comprises oil consumption and charging information of a toll station, so that the output line meets the actual operation cost in the vehicle driving process.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings used in the embodiments or the description of the prior art will be briefly described below.
Fig. 1 is a schematic diagram of a route planning system provided in an embodiment of the present application;
fig. 2 is a schematic flow chart illustrating an implementation of a route planning method according to an embodiment of the present application;
fig. 3 is a schematic diagram of a route planning apparatus according to an embodiment of the present application;
fig. 4 is a schematic diagram of a server provided in an embodiment of the present application.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.
In order to explain the technical solution described in the present application, the following description will be given by way of specific examples.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the present application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of the present application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to a determination" or "in response to a detection". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".
The existing route planning scheme does not fully consider the actual cost in the vehicle running process and cannot meet the actual requirements of users.
Therefore, the embodiment of the application provides a route planning method, which can output a candidate route with the shortest operation time, a candidate route with the lowest operation cost and a candidate route with the shortest route length, a user can select any one output route according to the self requirement, and the operation cost comprises oil consumption and charging information of a toll station, so that the output route meets the actual operation cost in the vehicle driving process.
The following describes an exemplary route planning method provided by the present application.
The route planning method provided by the embodiment of the application is applied to a route planning system, and as shown in fig. 1, the route planning system provided by the embodiment of the application includes a server 1, a terminal device 2, a vehicle-mounted terminal 3, an Electronic Toll Collection (ETC) 4 and a third party platform 5. The server 1 is configured to receive data transmitted by the in-vehicle terminal 3, the ETC4, and the third party platform 5, and store the data by using an Extract-Transform-Load (ETL) technology. The user inputs a departure place and a destination through the terminal device 2 or a client application installed on the terminal device 2, the terminal device 2 transmits the departure place and the destination input by the user to the server 1, and the server 1 is used for determining a candidate route according to the departure place, the destination and stored data.
Specifically, the route planning system collects basic information of a driver and a vehicle and sends the basic information to the server 1, the server 1 determines speed, oil consumption and charging information of a toll station when the vehicle runs on a candidate route according to the basic information of the driver and the vehicle, and the basic information of the vehicle comprises information such as length, width, axle number, mass and load of the vehicle. The server 1 is further configured to obtain speed limit and traffic control information of each candidate line from a third party platform (e.g., a highway management platform) 5, determine an operation cost of each candidate line according to the oil consumption and the charging information, and determine an operation time consumption of each candidate line according to the speed limit, the traffic control information and the speed information.
In another possible implementation manner, the server 1 obtains Global Positioning System (GPS) data, oil consumption, running time consumption, speed and video information of a historical driving route of the vehicle, which are collected by the vehicle-mounted terminal 3, and the server 1 also obtains charging information sent by the ETC of each toll station when the vehicle drives in the historical driving route, and simultaneously filters the obtained charging information, oil consumption and GPS data to remove repeated data, abnormal data and offset GPS data. And determining the running time consumption, the oil consumption and the charging information of the vehicle when the vehicle runs on the candidate route according to the filtered data, and determining the running cost of each candidate route according to the charging information and the oil consumption.
After determining the operation time consumption, the operation cost and the line length of each candidate line, the server determines the candidate line with the minimum operation cost according to the operation cost of each candidate line, determines the candidate line with the shortest operation time consumption according to the operation time consumption of each candidate line, and determines the candidate line with the shortest line length according to the line length of each candidate line; and finally, outputting the candidate line with the shortest operation time, the candidate line with the shortest operation cost and the candidate line with the shortest line length to the terminal device 2.
With continued reference to fig. 1, in a possible implementation manner, the server 1 includes a data storage layer 110 and a circuit planning algorithm engine 120, where the data storage layer 110 includes a Distributed File System (HDFS), an Hbase, a relational database, and a File, and the data storage layer 110 is configured to store data sent by the vehicle-mounted terminal 3, an Electronic Toll Collection (ETC) System 4, and a third party platform 5 in the HDFS, the Hbase, the relational database, and the File in a classified manner, for example, store data in a classified manner according to a data reporting frequency and a data life cycle, and store data (for example, basic information of a vehicle) with a low reporting frequency and a fixed value into the relational database; and storing data (such as information of vehicle speed, oil consumption and the like) which is high in reporting frequency and changes at any time into the HDFS, the Hbase and the file. The route planning algorithm engine 120 is configured to obtain data stored in the data storage layer, obtain information such as a departure place and a destination sent by the terminal device 2, and output the determined candidate route with the shortest operation time, the candidate route with the lowest operation cost, and the candidate route with the shortest route length to the terminal device 2.
Referring to fig. 2, a method for planning a route according to an embodiment of the present application includes:
s101: a departure place and a destination are obtained.
For example, the user input originates in Guangzhou and is destined for Beijing.
In another possible implementation, the user inputs the route point in addition to the origin and the destination, for example, the user inputs the origin in Guangzhou, the destination in Beijing, and the route point in Wuhan and Tianjin.
S102: and determining at least one candidate route matched with the starting place and the destination.
Specifically, if the user inputs only the departure place and the destination, all routes which can reach the destination from the departure place are taken as candidate routes; when the user inputs the departure place, the destination and the route point, all the routes which can reach the destination from the departure place and pass through the route point are taken as candidate routes.
S103: and acquiring the running time, the running cost and the line length of each candidate line, wherein the running cost comprises the oil consumption and the charging information of the toll station.
In a possible implementation manner, the server determines the line length according to the position information of each station stored in advance; determining the speed of the vehicle in each candidate line according to the basic information of the vehicle, the speed limit information and the road condition information sent by the third-party platform, and determining the running time consumption of each candidate line according to the line length and the speed; the method comprises the steps of determining oil consumption according to basic information and speed of a vehicle, obtaining charging information of each toll station in candidate lines from a third-party platform, and determining the running cost of each candidate line according to the oil consumption and the charging information, so that the calculated running cost accords with the actual running cost of the vehicle during running, and the reasonable line can be conveniently planned subsequently.
In another possible implementation manner, the server obtains a historical driving route of the vehicle, and determines the operation time consumption, the operation cost and the route length of each candidate route according to route information corresponding to the historical driving route, that is, according to historical record information of the vehicle. The running cost of the candidate route is determined according to the historical running route, and the accuracy of the calculated running cost is improved.
S104: determining the candidate line with the shortest running time according to the running time of each candidate line, determining the candidate line with the lowest running cost according to the running cost of each candidate line, and determining the candidate line with the shortest line length according to the line length of each candidate line.
S105: and outputting the candidate line with the shortest operation time, the candidate line with the lowest operation cost and the candidate line with the shortest line length.
In the above embodiment, by acquiring the departure place and the destination, determining at least one candidate route matching the departure place and the destination, acquiring the operation time consumption, the operation cost and the route length of each candidate route, wherein the operation cost includes the oil consumption and the charging information of the toll station, determining a candidate line with the shortest operation time according to the operation time of each candidate line, determining a candidate line with the lowest operation cost according to the operation cost of each candidate line, determining the candidate line with the shortest line length according to the line length of each candidate line, outputting the candidate line with the shortest operation time consumption, the candidate line with the shortest operation cost and the candidate line with the shortest line length, enabling a user to select any one output line according to the self requirement, and the running cost comprises the oil consumption and the charging information of the toll station, so that the output route conforms to the actual running cost in the running process of the vehicle.
In one possible implementation manner, the specific implementation method for determining the operation cost of each candidate route by the server according to the route information corresponding to the historical travel route of the vehicle is as follows.
The historical driving route is divided into at least one sub-route according to toll stations, and the starting point and the ending point of one sub-route respectively correspond to one toll station. For each sub-line, the sub-line is divided into a plurality of sections according to Global Positioning System (GPS) data uploaded by the vehicle-mounted device from a starting point according to a set length, wherein the set length may be 200 meters, 300 meters or 500 meters. And after the sub-routes are divided into the sections, determining the oil consumption of each section according to the oil consumption sent by the vehicle-mounted terminal when the vehicle runs on the historical running route, wherein the oil consumption of the section is defined as the ratio of the oil consumption actually reported by the vehicle-mounted equipment when the vehicle runs on the corresponding section to the oil consumption when the vehicle runs on the sub-routes. In order to improve the accuracy of the acquired oil consumption of each road section, the server also acquires video information acquired by the vehicle-mounted terminal, analyzes the flatness of the road surface according to the video information, and determines whether the acquired oil consumption is accurate or not according to the flatness of the road surface. And after the oil consumption of each road section is determined, determining the average oil consumption of the sub-line according to the oil consumption of all the road sections of the sub-line.
And after the average oil consumption of each sub-line is determined, the sub-lines included by the candidate lines are determined, and the running cost of each candidate line is respectively determined according to the average oil consumption of all the sub-lines included by each candidate line and the fee charged by the toll station.
In a possible implementation manner, after calculating the average oil consumption of each sub-line, the server further determines the feature vectors of the sub-lines according to the average oil consumption of the sub-lines and the corresponding running speed, takes the combination of the feature vectors of all the sub-lines corresponding to the historical running lines as the feature vector of the historical running line, and takes the combination of the feature vectors of all the sub-lines corresponding to the candidate line as the feature vector of the candidate line. After the feature vector of the historical driving route and the feature vector of each candidate route are obtained, the similarity between the feature vector of each candidate route and the feature vector of the historical driving route is calculated, the candidate route corresponding to the maximum similarity is used as the similar route, and the similar route is output. That is, the server outputs the candidate line with the shortest operation time, the candidate line with the lowest operation cost, the candidate line with the shortest line length and the similar line to the terminal device at the same time, and the user can select a proper line according to actual requirements. The starting point and the destination of the historical travel route and the candidate route may be the same or different. After the user selects the candidate route to drive, the route driven by the user is used as the historical driving route for the next route planning, so that the historical driving route can be updated in real time, and the route planning accuracy is improved.
In one possible implementation, a pearson similarity calculation method may be used to calculate the similarity between the feature vector of the candidate route and the feature vector of the historical travel route.
In one possible implementation manner, the feature vector of the sub-line includes an average speed, a proportion of high-fuel-consumption road sections, a line length, a time consumed by running the line, a road condition, and the like during the driving process of the vehicle. The high-oil-consumption road section occupation ratio refers to the ratio of the road sections with oil consumption exceeding a preset value to the total road section in the sub-roads, and can also be defined as the proportion of the high-oil-consumption road sections within 100 kilometers. The road condition is obtained by performing characteristic marking on each road section according to the flatness and the oil consumption of the road surface, for example, each road section is marked as an uneven high-oil-consumption road section, a long downhill high-oil-consumption road section, a long uphill high-oil-consumption road section, a fast downhill low-oil-consumption road section, a flat normal-oil-consumption road section or a flat low-oil-consumption road section, and the combination of the characteristic marks of all the road sections included in the sub-road is used as the road condition of the sub-road.
In one possible implementation mode, during the driving process of the vehicle, the server determines and stores the characteristic vectors of all the sub-roads according to the collected data. For example, the server stores a sub-line feature vector as shown in table 1.
TABLE 1
| Field(s) | Value taking |
| Sub-line identification | 1 |
| Departure place | A |
| Destination | B |
| The fee charged by the toll station | 100 |
| Average speed (KM/h) | 80 |
| Average oil consumption (L/KM) | 200 |
| High oil consumption |
12％ |
| Line length (km) | 200 |
| Time consuming |
5 |
Accordingly, the storage manner of the historical travel route is as shown in table 2.
TABLE 2
| Departure place | A |
| Destination | B |
| Historical driving route 1 | Subline 1-subline 2- |
| Historical driving lineRoad 2 | Subline 1-subline 4- |
| |
Sub-line 5-sub-line 2-sub-line 6 |
And obtaining the characteristic vector of the historical driving route according to the characteristic vectors of all the sub-routes included in the historical driving route. For example, for the historical travel route 1, the fee charged by the toll station is the sum of the fees charged by the toll station for the sub-line 1, the sub-line 2, and the sub-line 3; the average speed is the average of the average speeds of sub-line 1, sub-line 2 and sub-line 3; the average oil consumption is the average value of the average oil consumption of the sub-line 1, the sub-line 2 and the sub-line 3; the high-oil-consumption road section ratio is the average value of the high-oil-consumption road section ratios of the sub-line 1, the sub-line 2 and the sub-line 3; the line length is the sum of the line lengths of sub-line 1, sub-line 2 and sub-line 3; the line running time is the sum of the line running times of sub-line 1, sub-line 2 and sub-line 3.
In one possible implementation manner, before calculating the feature vector of the historical travel route, the server determines the route selection habit of the user according to the historical travel route, selects the historical travel route according to the route selection habit, takes the historical travel route according to the route selection habit as the target route, and takes the feature vector of the target route as the feature vector of the historical travel route. And then, the similarity between the feature vector of the candidate route and the feature vector of the historical driving route is further calculated, so that a similar route which accords with the route selection habit of the user can be output.
In one possible implementation, the route selection habits of the user are determined according to the feature vectors of the historical driving routes. Specifically, the number of times that the user selects the route with the lowest running cost, the number of times that the user consumes the shortest route, and the number of times that the user selects the route with the shortest route length among all the historical travel routes are counted, and the category with the highest number of times is used as the route selection habit of the user. For example, the user travels 100 times in the historical travel route, the number of times that the user selects the route with the lowest running cost, the number of times that the user consumes the shortest route, and the number of times that the user selects the route with the shortest route length are calculated, and if the number of times that the user selects the route with the shortest route consumption is the largest, the shortest route consumption is used as the route selection habit of the user.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
Fig. 3 shows a block diagram of a circuit planning apparatus provided in the embodiment of the present application, which corresponds to the circuit planning method described in the foregoing embodiment, and only shows portions related to the embodiment of the present application for convenience of description.
As shown in fig. 3, the route planning apparatus includes,
a first obtaining module 10, configured to obtain a departure place and a destination;
a matching module 20, configured to determine at least one candidate route matching the departure place and the destination;
a second obtaining module 30, configured to obtain operation time consumption, operation cost, and line length of each candidate line, where the operation cost includes oil consumption and charging information of a toll station;
a determining module 40, configured to determine a candidate line with the shortest operation time according to the operation time of each candidate line, determine a candidate line with the lowest operation cost according to the operation cost of each candidate line, and determine a candidate line with the shortest line length according to the line length of each candidate line;
and an output module 50, configured to output the candidate line with the shortest operation time, the candidate line with the lowest operation cost, and the candidate line with the shortest line length.
In a possible implementation manner, the first obtaining module 10 is further configured to:
acquiring a historical driving route of a vehicle;
and determining the running time, running cost and line length of each candidate line according to the line information corresponding to the historical running line.
In a possible implementation manner, the first obtaining module 10 is further configured to:
dividing the historical driving route into at least one sub-route according to toll stations, wherein the starting point and the end point of one sub-route respectively correspond to one toll station;
determining sub-lines included by each candidate line and the average oil consumption of each sub-line;
and respectively determining the running cost of each candidate line according to the average oil consumption of all sub-lines included in each candidate line and the fee charged by the toll station.
In one possible implementation, the output module 50 is further configured to:
determining a feature vector of the historical driving route and a feature vector of each candidate route;
calculating the similarity between the feature vector of each candidate line and the feature vector of the historical driving line;
and taking the candidate line corresponding to the maximum similarity as a similar line, and outputting the similar line.
In one possible implementation, the output module 50 is further configured to:
obtaining a line selection habit of a user;
determining a historical driving route according with the route selection habit according to the route selection habit, and taking the historical driving route according with the route selection habit as a target route;
and taking the feature vector of the target route as the feature vector of the historical driving route.
In one possible implementation, the output module 50 is further configured to:
and determining the characteristic vector of the historical driving route according to the average oil consumption and the driving speed of the at least one sub-route.
It should be noted that, for the information interaction, execution process, and other contents between the above-mentioned devices/units, the specific functions and technical effects thereof are based on the same concept as those of the embodiment of the method of the present application, and specific reference may be made to the part of the embodiment of the method, which is not described herein again.
Fig. 4 is a schematic diagram of a server provided in an embodiment of the present application. As shown in fig. 4, the server of this embodiment includes: a processor 11, a memory 12 and a computer program 13 stored in said memory 12 and executable on said processor 11. The processor 11, when executing the computer program 13, implements the steps in the above-described embodiment of the route planning method, such as the steps S101 to S105 shown in fig. 2. Alternatively, the processor 11, when executing the computer program 13, implements the functions of each module/unit in the above-mentioned device embodiments, such as the functions of the first obtaining module 10 to the output module 50 shown in fig. 3.
Illustratively, the computer program 13 may be partitioned into one or more modules/units, which are stored in the memory 12 and executed by the processor 11 to accomplish the present application. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution process of the computer program 13 in the server.
Those skilled in the art will appreciate that fig. 4 is merely an example of a server and is not intended to be limiting and may include more or fewer components than those shown, or some components may be combined, or different components, e.g., the server may also include input-output devices, network access devices, buses, etc.
The Processor 11 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, a discrete hardware component, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The storage 12 may be an internal storage unit of the server, such as a hard disk or a memory of the server. The memory 12 may also be an external storage device of the server, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the electronic device. Further, the memory 12 may also include both an internal storage unit of the server and an external storage device. The memory 12 is used for storing the computer program and other programs and data required by the server. The memory 12 may also be used to temporarily store data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus/electronic device and method may be implemented in other ways. For example, the above-described apparatus/electronic device embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or 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, devices or units, and may be in an electrical, mechanical 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 application 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 integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow in the method of the embodiments described above can be realized by a computer program, which can be stored in a computer-readable storage medium and can realize the steps of the embodiments of the methods described above when the computer program is executed by a processor. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.
Claims (10)
1. A method of route planning, comprising:
acquiring a departure place and a destination;
determining at least one candidate route matching the departure place and the destination;
acquiring the running time, running cost and line length of each candidate line, wherein the running cost comprises oil consumption and charging information of a toll station;
determining a candidate line with the shortest running time according to the running time of each candidate line, determining a candidate line with the lowest running cost according to the running cost of each candidate line, and determining a candidate line with the shortest line length according to the line length of each candidate line;
and outputting the candidate line with the shortest operation time, the candidate line with the lowest operation cost and the candidate line with the shortest line length.
2. The route planning method according to claim 1, wherein before the acquiring the departure place and the destination, the route planning method further comprises:
acquiring a historical driving route of a vehicle;
and determining the running time, running cost and line length of each candidate line according to the line information corresponding to the historical running line.
3. The route planning method according to claim 2, wherein the determining the operation cost of each candidate route according to the route information corresponding to the historical driving route comprises:
dividing the historical driving route into at least one sub-route according to toll stations, wherein the starting point and the end point of one sub-route respectively correspond to one toll station;
determining sub-lines included by each candidate line and the average oil consumption of each sub-line;
and respectively determining the running cost of each candidate line according to the average oil consumption of all sub-lines included in each candidate line and the fee charged by the toll station.
4. The route planning method according to claim 3, wherein after determining at least one candidate route matching the origin and destination, the route planning method further comprises:
determining a feature vector of the historical driving route and a feature vector of each candidate route;
calculating the similarity between the feature vector of each candidate line and the feature vector of the historical driving line;
and taking the candidate line corresponding to the maximum similarity as a similar line, and outputting the similar line.
5. The route planning method according to claim 4, wherein the determining the feature vector of the historical travel route comprises:
obtaining a line selection habit of a user;
determining a historical driving route according with the route selection habit according to the route selection habit, and taking the historical driving route according with the route selection habit as a target route;
and taking the feature vector of the target route as the feature vector of the historical driving route.
6. The route planning method according to claim 4, wherein the determining the feature vector of the historical travel route comprises:
and determining the characteristic vector of the historical driving route according to the average oil consumption and the driving speed of the at least one sub-route.
7. A line planning apparatus, comprising:
the first acquisition module is used for acquiring a departure place and a destination;
the matching module is used for determining at least one candidate route matched with the departure place and the destination;
the second acquisition module is used for acquiring the operation time consumption, the operation cost and the line length of each candidate line, wherein the operation cost comprises the oil consumption and the charging information of a toll station;
the determining module is used for determining the candidate line with the shortest running time according to the running time of each candidate line, determining the candidate line with the lowest running cost according to the running cost of each candidate line, and determining the candidate line with the shortest line length according to the line length of each candidate line;
and the output module is used for outputting the candidate line with the shortest operation time consumption, the candidate line with the lowest operation cost and the candidate line with the shortest line length.
8. A server comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the route planning method according to any one of claims 1 to 6 when executing the computer program.
9. A route planning system, comprising a terminal device, a vehicle-mounted terminal, an ETC, a third party platform, and the server according to claim 8, wherein the terminal device is configured to transmit a departure place and a destination input by a user to the server, and the server is configured to receive data transmitted by the vehicle-mounted terminal, the ETC, and the third party platform, and determine an operation time, an operation cost, and a route length of each candidate route according to the received data.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out a method of route planning according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011382835.XA CN112729325B (en) | 2020-12-01 | 2020-12-01 | Route planning method, device, system, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011382835.XA CN112729325B (en) | 2020-12-01 | 2020-12-01 | Route planning method, device, system, server and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112729325A true CN112729325A (en) | 2021-04-30 |
| CN112729325B CN112729325B (en) | 2024-05-24 |
Family
ID=75598043
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011382835.XA Active CN112729325B (en) | 2020-12-01 | 2020-12-01 | Route planning method, device, system, server and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112729325B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003049703A (en) * | 2001-08-07 | 2003-02-21 | Mazda Motor Corp | Vehicle development data acquiring server, vehicle development data acquiring method and vehicle development data acquiring program |
| JP2008101977A (en) * | 2006-10-18 | 2008-05-01 | Pioneer Electronic Corp | Route search device, route search method, and route search program |
| CN101881623A (en) * | 2009-05-08 | 2010-11-10 | 联发科技（新加坡）私人有限公司 | Navigation path determining method and equipment thereof |
| CN102538807A (en) * | 2010-12-27 | 2012-07-04 | 宇达电脑（上海）有限公司 | Method and device for planning navigation paths |
| JP2017009513A (en) * | 2015-06-25 | 2017-01-12 | アイシン・エィ・ダブリュ株式会社 | Route search system, method, and program |
| CN107270923A (en) * | 2017-06-16 | 2017-10-20 | 广东欧珀移动通信有限公司 | Method, terminal and storage medium that a kind of route is pushed |
| CN107560619A (en) * | 2017-08-22 | 2018-01-09 | 北京小米移动软件有限公司 | Recommend method and apparatus in path |
| CN107945557A (en) * | 2017-12-21 | 2018-04-20 | 江西爱驰亿维实业有限公司 | Real-time road display methods, device, computing device and computer-readable storage medium |
| CN109726868A (en) * | 2018-12-28 | 2019-05-07 | 腾讯科技（深圳）有限公司 | Paths planning method, device and storage medium |
| CN111462484A (en) * | 2020-03-31 | 2020-07-28 | 腾讯科技（深圳）有限公司 | Congestion state determination method, device, equipment and computer readable storage medium |
| CN111859167A (en) * | 2019-04-29 | 2020-10-30 | 北京四维图新科技股份有限公司 | Path acquisition method, device, system and storage medium |
-
2020
- 2020-12-01 CN CN202011382835.XA patent/CN112729325B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003049703A (en) * | 2001-08-07 | 2003-02-21 | Mazda Motor Corp | Vehicle development data acquiring server, vehicle development data acquiring method and vehicle development data acquiring program |
| JP2008101977A (en) * | 2006-10-18 | 2008-05-01 | Pioneer Electronic Corp | Route search device, route search method, and route search program |
| CN101881623A (en) * | 2009-05-08 | 2010-11-10 | 联发科技（新加坡）私人有限公司 | Navigation path determining method and equipment thereof |
| CN102538807A (en) * | 2010-12-27 | 2012-07-04 | 宇达电脑（上海）有限公司 | Method and device for planning navigation paths |
| JP2017009513A (en) * | 2015-06-25 | 2017-01-12 | アイシン・エィ・ダブリュ株式会社 | Route search system, method, and program |
| CN107270923A (en) * | 2017-06-16 | 2017-10-20 | 广东欧珀移动通信有限公司 | Method, terminal and storage medium that a kind of route is pushed |
| CN107560619A (en) * | 2017-08-22 | 2018-01-09 | 北京小米移动软件有限公司 | Recommend method and apparatus in path |
| CN107945557A (en) * | 2017-12-21 | 2018-04-20 | 江西爱驰亿维实业有限公司 | Real-time road display methods, device, computing device and computer-readable storage medium |
| CN109726868A (en) * | 2018-12-28 | 2019-05-07 | 腾讯科技（深圳）有限公司 | Paths planning method, device and storage medium |
| CN111859167A (en) * | 2019-04-29 | 2020-10-30 | 北京四维图新科技股份有限公司 | Path acquisition method, device, system and storage medium |
| CN111462484A (en) * | 2020-03-31 | 2020-07-28 | 腾讯科技（深圳）有限公司 | Congestion state determination method, device, equipment and computer readable storage medium |
Non-Patent Citations (2)
| Title |
|---|
| SHUANG HONG ZHANG等: "Practical Framework Model for Estimating Fuel Consumption and Emissions in Urban Networks Based on Multi-Source Data", 《 CICTP 2015. EFFICIENT, SAFE AND GREEN MULTIMODAL TRANSPORTATION. 15TH COTA INTERNATIONAL CONFERENCE OF TRANSPORTATION PROFESSIONALS. PROCEEDINGS》, 1 October 2015 (2015-10-01) * |
| 廖军;安毅生;张绍阳;赵祥模;马天山;: "路段动态交通安全综合评价模型", 交通运输工程学报, no. 04, 31 August 2009 (2009-08-31) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112729325B (en) | 2024-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9519875B2 (en) | Method for determining an expected consumption value of a motor vehicle | |
| US20210081907A1 (en) | Method and system to improve driver information and vehicle maintenance | |
| CN111932886B (en) | Estimated arrival time estimation method and device, computer equipment and storage medium | |
| CN113263993B (en) | Fault early warning method, device, communication equipment and storage medium | |
| CN112629524A (en) | Travel path recommendation management method and device and electronic equipment | |
| CN112734956A (en) | ETC portal determination method and device and storage medium | |
| CN115655301A (en) | Vehicle navigation route selection method and device, electronic equipment and medium | |
| JP2014066655A (en) | Route search device and route search method | |
| CN112750219B (en) | Vehicle travel expense calculation method and system | |
| CN114281086A (en) | Method, system, platform, medium and equipment for planning commercial vehicle path | |
| CN111369790B (en) | Vehicle passing record correction method, device, equipment and storage medium | |
| JP2005091304A (en) | Method of estimating traveling route, and center device and program in traveling route estimation system | |
| CN112633812A (en) | Track segmentation method, device, equipment and storage medium for freight vehicle | |
| CN112729325B (en) | Route planning method, device, system, server and storage medium | |
| CN116664025A (en) | Loading and unloading position point generation method, device and equipment | |
| CN110017842B (en) | Freight vehicle navigation method, terminal device and storage medium | |
| CN107657814B (en) | Road condition information generation method and device | |
| CN114049757B (en) | Regular bus arrival time estimation method and device, computer equipment and storage medium | |
| CN115839721A (en) | Method and device for predicting driving route, vehicle-mounted terminal and medium | |
| CN102795171B (en) | Vehicle-mounted assistant system | |
| CN113282638B (en) | Urban construction vehicle identification method and device | |
| CN107481520B (en) | Road transport vehicle overrun information identification method based on floating car technology | |
| CN111311065A (en) | Station selection method and device for gas station, electronic equipment and storage medium | |
| CN106781470B (en) | Method and device for processing running speed of urban road | |
| CN114461933B (en) | Vehicle recommendation method, device and equipment based on periphery search and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |