CN114862299A

CN114862299A - Transportation route planning method and device

Info

Publication number: CN114862299A
Application number: CN202210332838.5A
Authority: CN
Inventors: 李超贤; 王轶轩; 王中强; 章鹏; 房磊; 张军
Original assignee: Hema China Co Ltd
Current assignee: Hema China Co Ltd
Priority date: 2022-03-31
Filing date: 2022-03-31
Publication date: 2022-08-05

Abstract

The embodiment of the specification provides a transportation route planning method and a transportation route planning device, wherein the transportation route planning method comprises the following steps: receiving a transportation task of a target object in a target time period, wherein the transportation task comprises target space-time information of each cargo to be transported; acquiring historical transportation data according to the target space-time information of each cargo to be transported, and counting the cargo transportation amount of each target station; and determining the transportation route of the target object in the target time period according to the historical transportation data and the freight transportation amount of each destination station. The method can improve the efficiency and accuracy of the transportation route planning.

Description

Transportation route planning method and device

Technical Field

The embodiment of the specification relates to the technical field of computers, in particular to a transportation route planning method.

Background

With the development of market economy and the improvement of the specialized level of logistics, the transportation task is rapidly developed. In order to improve the transportation efficiency and ensure the relative balance of the transportation task on cost and timeliness, vehicle scheduling is required.

In the prior art, the transportation route is mainly planned manually, but the method has low intelligent level and has the problems of unreasonable transportation route arrangement and serious transportation capacity resource waste. Therefore, an effective solution to solve the above problems is needed.

Disclosure of Invention

In view of this, the present specification provides a transportation route planning method. One or more embodiments of the present disclosure also relate to a transportation route planning apparatus, a computing device, a computer-readable storage medium, and a computer program, so as to solve the technical drawbacks of the prior art.

According to a first aspect of embodiments herein, there is provided a transportation route planning method, comprising:

receiving a transportation task of a target object in a target time period, wherein the transportation task comprises target space-time information of each cargo to be transported;

acquiring historical transportation data according to the target space-time information of each cargo to be transported, and counting the cargo transportation amount of each target station;

and determining the transportation route of the target object in the target time period according to the historical transportation data and the freight transportation amount of each destination station.

According to a second aspect of embodiments herein, there is provided a transportation route planning apparatus comprising:

the system comprises a receiving module, a processing module and a processing module, wherein the receiving module is configured to receive a transportation task of a target object in a target time period, and the transportation task comprises target space-time information of each cargo to be transported;

the statistical module is configured to acquire historical transportation data according to the target space-time information of each cargo to be transported and count the cargo transportation amount of each target station;

a determining module configured to determine a transportation route of the target object within the target time period according to the historical transportation data and the freight transportation amount of each destination station.

According to a third aspect of embodiments herein, there is provided a computing device comprising:

a memory and a processor;

the memory is configured to store computer-executable instructions and the processor is configured to execute the computer-executable instructions, which when executed by the processor, implement the steps of the transportation route planning method described above.

According to a fourth aspect of embodiments herein, there is provided a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the transportation route planning method described above.

According to a fifth aspect of embodiments herein, there is provided a computer program, wherein the computer program, when executed in a computer, causes the computer to perform the steps of the transportation route planning method described above.

The transportation route planning method provided by the specification receives a transportation task of a target object in a target time period, wherein the transportation task comprises target space-time information of each cargo to be transported; acquiring historical transportation data according to the target space-time information of each cargo to be transported, and counting the cargo transportation amount of each target station; and determining the transportation route of the target object in the target time period according to the historical transportation data and the freight transportation amount of each destination station. The target transportation route corresponding to the target object in the target time period is determined according to the historical transportation data and the cargo transportation amount of each target station, so that the difference caused by manual wiring is avoided, the efficiency and the accuracy of transportation route planning can be effectively improved, and the transportation route can be accurately determined according to the historical transportation data.

Drawings

Fig. 1 is a flow chart of a transportation route planning method provided in an embodiment of the present description;

fig. 2A is a schematic processing diagram of a transportation route planning platform in a transportation route planning method according to an embodiment of the present disclosure;

fig. 2B is a schematic processing diagram of another transportation route planning method provided in an embodiment of the present disclosure;

fig. 2C is a schematic diagram illustrating an effect of a transportation route planning method according to an embodiment of the present disclosure;

fig. 2D is a schematic view of a transportation route planning platform processing procedure in another transportation route planning method provided in an embodiment of the present disclosure;

fig. 2E is a diagram illustrating a comparison between a resculed route and a transportation route in a transportation route planning method according to an embodiment of the present disclosure;

FIG. 3 is a process flow diagram of a transportation route planning method provided in one embodiment of the present disclosure;

fig. 4 is a schematic structural diagram of a transportation route planning device provided in an embodiment of the present specification;

fig. 5 is a block diagram of a computing device according to an embodiment of the present disclosure.

Detailed Description

In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present description. This description may be embodied in many different forms and should not be construed as limited to the embodiments set forth herein, as those skilled in the art will be able to make and use the present disclosure without departing from the spirit and scope of the present disclosure.

The terminology used in the description of the one or more embodiments is for the purpose of describing the particular embodiments only and is not intended to be limiting of the description of the one or more embodiments. As used in one or more embodiments of the present specification 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 also be understood that the term "and/or" as used in one or more embodiments of the present specification refers to and encompasses any and all possible combinations of one or more of the associated listed items.

It will be understood that, although the terms first, second, etc. may be used herein in one or more embodiments to describe various information, these information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, a first can also be referred to as a second and, similarly, a second can also be referred to as a first without departing from the scope of one or more embodiments of the present description. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.

First, the noun terms to which one or more embodiments of the present specification relate are explained.

The stations, i.e. the logistics stations, mainly include processing centers, stores, distribution stations and warehouses, wherein the warehouses from the processing centers to the fresh processing centers can be B2C (Bus access-to-Consumer) warehouses, normal temperature warehouses, cold chain warehouses and the like.

Intelligent scheduling: scheduling in the traditional sense refers to manually arranging the sequence of stations driven by a driver according to experience. The intelligent scheduling means that an algorithm is called according to different parameters, and a better solution is output.

Next, a brief description will be given of a transportation route planning method provided in this specification.

With the development of market economy and the improvement of the specialized level of logistics, the transportation task is rapidly developed. In order to improve the transportation efficiency and ensure that the transportation task is relatively balanced in cost and timeliness, vehicle scheduling is required. Namely truck dispatching, is to help the dispatcher plan and dispatch the transportation task, guarantee that the transportation is done in cost and ageing relatively balanced. When the dispatcher generates the dispatch plan, it is necessary to give priority to time efficiency and cost in consideration of the project scenario. In some scenarios, such as the B2C or NB (self-service) links, it is desirable to prioritize transit timelines and ensure delivery before customer delivery time. And the B2B (Business-to-Business) link has no great requirement on timeliness and only needs to be delivered within a fixed time period, so that the transportation cost is preferably considered, and the transportation loading rate needs to be improved.

In the prior art, the transportation route is mainly planned manually, for example, the wire arrangement is directly carried out by using a manual scheduling mode; if a locator is installed on the vehicle, real-time on-road information of the vehicle, information of a driver of the vehicle and the like are acquired by calling an interface of a locator provider in real time, and the acquired information is displayed on a map; meanwhile, decoupling of a third-party map provider can be called, information such as the current vehicle speed of the vehicle is obtained and displayed on the map, and visual vehicle monitoring of the transport vehicle is achieved.

However, when a large amount of transportation needs need to be met, a large amount of manpower is consumed for manually stringing points, and after the number of points reaches a certain magnitude, a worker cannot complete tasks, for example, in store transportation, the number of stations in a city is not more than 50, the number of stations is small and fixed, the quantity of goods is stable, a route can be arranged manually according to experience to obtain a better solution, but in a certain self-service state scene, the number of stations needing to be distributed in a warehouse reaches hundreds and thousands, the number of stations needing to be distributed each time is not fixed, the quantity of goods is unstable, and the wire arrangement work cannot be completed by the worker; in addition, the method is low in intelligence level and too dependent on the experience of a dispatcher, the difference between the guarantee of timeliness and the control of cost is large between an excellent dispatcher and a general dispatcher, for example, the dispatching experience cannot be fallen on a system by a manual cable, the accuracy rate of departure of the dispatcher and the cost fluctuation are not controllable, when the excellent dispatcher sees the cargo quantity, the time required by how many vehicles are needed and how many vehicles are needed for transporting to several stations can be roughly estimated, and the estimation of the general dispatcher is not accurate. Namely, the problems of unreasonable transportation route arrangement and serious transportation capacity resource waste exist.

Therefore, the present specification provides a transportation route planning method, which receives a transportation task of a target object within a target time period, wherein the transportation task includes destination spatiotemporal information of each cargo to be transported; acquiring historical transportation data according to the target space-time information of each cargo to be transported, and counting the cargo transportation amount of each target station; and determining the transportation route of the target object in the target time period according to the historical transportation data and the freight transportation amount of each destination station. The target transportation route corresponding to the target object in the target time period is determined according to the historical transportation data and the cargo transportation amount of each target station, so that the difference caused by manual wiring is avoided, the efficiency and the accuracy of transportation route planning can be effectively improved, and the target transportation route can be accurately determined according to the historical transportation data.

In the present specification, a transportation route planning method is provided, and the present specification relates to a transportation route planning apparatus, a computing device, and a computer-readable storage medium, which are described in detail one by one in the following embodiments.

Referring to fig. 1, fig. 1 shows a flowchart of a transportation route planning method provided in an embodiment of the present specification, which specifically includes the following steps.

Step 102: and receiving a transportation task of the target object in a target time period, wherein the transportation task comprises target space-time information of each cargo to be transported.

The executing body for implementing the transportation route planning method can be a computing device with a transportation route planning function, such as a server, a terminal and the like with the transportation route planning function.

Specifically, the target object refers to an object for transporting goods, and may be a transport person, a transport vehicle, a cargo airplane, and the like, which is not limited in this specification; the target time period refers to a pre-specified time period, such as a future day, a future week, etc.; the transportation task refers to a task generated by a user, a company or an organization purchasing or reserving goods or returning goods when the user or the company or the organization has a demand for the goods, and needing to deliver the goods, for example, the user purchases clothes through a shopping platform, and for example, the user delivers files through a leg running platform; the destination space-time information refers to at least one of a transportation starting point, a transportation destination, a predicted delivery time (arrival time), a predicted delivery time, a station identifier and the like corresponding to the transportation task.

In practical applications, there are various ways to receive the transportation task of the target object in the target time period, for example, the method may be that an operator sends an instruction for planning a transportation route to the execution main body, or sends and receives an instruction for receiving the transportation task of the target object in the target time period, and accordingly, the execution main body starts to perform the transportation task of the target object in the target time period after receiving the instruction; the server may also automatically acquire the transportation tasks of the target object in the target time period every preset time period, for example, after the preset time period, the server with the transportation route planning function automatically acquires the transportation tasks of the target object in the specified access area in the target time period; or after the preset time, the terminal with the transportation route planning function automatically acquires the transportation tasks of the locally stored target objects in the target time period. The present specification does not set any limit to the manner of receiving the transportation task of the target object within the target time period.

It should be noted that the transportation task includes the destination space-time information of each cargo to be transported, for example, the transportation task includes 2 trousers and 3 pairs of socks, and the destination space-time information of 2 trousers and 3 pairs of socks is sent from place a to place B on day 13 of 3 months.

Step 104: and acquiring historical transportation data according to the target space-time information of each cargo to be transported, and counting the cargo transportation amount of each target station.

Specifically, the historical transportation data refers to data corresponding to the target object when executing a previous transportation task; the station refers to a starting point, a terminal point and a transfer station of the transported goods; the destination station refers to a final station to which a certain cargo needs to be transported; freight volume refers to the amount of freight transported to a destination site.

In practical application, after the transportation task of the target object in the target time period is obtained, historical transportation data related to each target time-space information is further obtained according to the target time-space information of each to-be-transported cargo in the transportation task, for example, the delivery date in the target time-space information is 3 months and 15 days, historical transportation data for 2 months and 15 days is obtained according to the delivery date, and if the target place in the target time-space information is the target site a, historical transportation data related to the target site a is obtained. And the freight transportation amount of each destination station is counted according to the destination space-time information, for example, the destination station to which each freight to be transported is sent is determined according to the destination space information of each freight to be transported in the transportation task, and the freight transportation amount of each destination station is further determined. Wherein the target spatial information is information for representing a space in the target spatiotemporal information.

In one or more optional embodiments of the present specification, when obtaining historical transportation data according to destination temporal-spatial information of each cargo to be transported, the destination temporal-spatial information may be input into a preset historical transportation data obtaining tool, and then the historical transportation data obtaining tool identifies the destination temporal-spatial information to obtain an identifier of the historical transportation data, and then obtains corresponding historical transportation data from a preset historical transportation database according to the identifier. Thus, the efficiency of historical transportation data acquisition can be improved.

In one or more alternative embodiments of the present disclosure, when historical transportation data is obtained according to the destination spatiotemporal information of each cargo to be transported, the historical transportation data may also be obtained according to the destination spatial information in the destination spatiotemporal information of each cargo to be transported. That is, in the case that the destination temporal-spatial information includes a destination site identifier, the historical transportation data is obtained according to the destination temporal-spatial information of each cargo to be transported, and the specific implementation process may be as follows:

determining the destination station of each cargo to be transported according to the destination station identification of each cargo to be transported;

and acquiring historical transportation data corresponding to the destination site of each cargo to be transported.

The destination site identifier is information for representing a destination site in the destination spatial information, and may be a name of the destination site, a geographic location of the destination site, or a reference number of the destination site, which is not limited in this specification.

In practical application, according to the destination station identification in the destination space-time information of each cargo to be transported, the destination station pointed by each destination station identification is determined, that is, the destination station of each cargo to be transported is determined, and then historical transportation data related to the destination station is obtained according to the destination station. Therefore, the accuracy of acquiring historical transportation data can be improved.

In one or more alternative embodiments of the present description, the destination temporal-spatial information includes destination station identifications, and at this time, freight transportation volumes of the destination stations may be counted based on the destination station identifications in the destination temporal-spatial information. That is, under the condition that the destination temporal-spatial information includes destination station identifiers, the freight transportation amount of each destination station is counted according to each destination temporal-spatial information, and the specific implementation process may be as follows:

for any destination station, determining the destination space-time information quantity of the destination station identification representing the destination station, and determining the destination information quantity as the freight transportation quantity of the destination station.

Specifically, the destination site identifier may be a name of the destination site, a geographic location of the destination site, or a reference number of the destination site, which is not limited in this specification; the number of destination spatio-temporal information means the number of destination spatio-temporal information including an identification of a certain destination station.

In practical application, the destination station identifier in the destination space-time information of each cargo to be transported is compared with each destination station, so that the cargo transportation volume of each destination station is determined: and for a certain destination station, comparing destination station identifications of all destination space-time information with the destination station, if the destination station identifications of the destination space-time information represent the destination station, adding one to the number of the destination space-time information, indicating that goods to be transported corresponding to the destination space-time information need to be transported to the destination station, adding one to the goods transportation amount of the destination station, traversing the destination space-time information, and further determining the goods transportation amount of the destination station. Therefore, the quantity of the target space-time information is determined only through the target station identification of the target space-time information, and then the freight volume of each target station is determined, so that the processing of other information in the target space-time information is avoided, the data processing amount can be reduced, the freight volume rate is improved, and the freight volume accuracy can be improved.

For example, there are 2 destination sites: a destination site A and a destination site B; there are 5 destination spatio-temporal information, where the destination site identification in the first destination spatio-temporal information is a, the destination site identification in the second destination spatio-temporal information is b, the destination site identification in the third destination spatio-temporal information is b, the destination site identification in the fourth destination spatio-temporal information is a, and the destination site identification in the fifth destination spatio-temporal information is a. Assuming that the destination station identifier a represents the destination station a and the destination station identifier B represents the destination station B, the destination station identifier represents that the number of destination spatio-temporal information of the destination station a is 3, that is, the freight transportation amount of the destination station a is 3, and the destination station identifier represents that the number of destination spatio-temporal information of the destination station B is 2, that is, the freight transportation amount of the destination station B is 2.

In one or more optional embodiments of the present disclosure, the transportation task may correspond to different transportation types, such as delivery transportation of purchased goods of the user, and return transportation of purchased goods of the user, that is, the transportation task further includes a transportation type identifier, and when the destination temporal and spatial information includes a destination endpoint identifier or a destination start point identifier, and the destination endpoint is a destination endpoint or a destination start point of the transportation of goods, the transportation amount of goods at the destination endpoint or the destination start point may be determined according to the amount of the temporal and spatial information. That is, the transportation task further includes a transportation type identifier, the destination site identifier includes a destination endpoint identifier or a destination start point identifier, and when the destination site is a destination endpoint or a destination start point of cargo transportation, the cargo transportation amount of each destination site is counted according to the destination spatio-temporal information of each cargo to be transported, and the specific implementation process may be as follows:

under the condition that the transportation type identifier is a purchase identifier, determining the quantity of target space-time information of a target terminal represented by the target terminal identifier aiming at any target terminal, and determining the quantity of the target space-time information as the freight transportation quantity of the target terminal;

and under the condition that the transportation type identifier is a goods return identifier, determining the target space-time information quantity of the target starting point characterized by the target starting point identifier aiming at any target starting point, and determining the target space-time information quantity as the goods transportation quantity of the target starting point.

Specifically, the transportation type identifier refers to an identifier of a transportation type corresponding to the transportation task; the purchase identification represents that the transportation task is a transportation task in a purchase scene; the destination site identifier is information for characterizing a destination site in the destination spatial information, and may be a name of the destination site, a geographic location of the destination site, or a label of the destination site, and the destination endpoint identifier is a destination site identifier to which a purchase item needs to be delivered, such as a destination site closest to a user address of the purchase item; the destination starting point identifier is a destination site identifier of the sent goods during purchase, namely a destination site identifier which needs to be sent during return of the goods, such as a destination site closest to the address of the merchant from which the goods are sent.

In practical application, if the transportation type identifier is a purchase identifier, it is indicated that the transportation task in the target time period is the goods purchased by the delivery user, for any destination, the destination identifier of each destination time-space information is compared with the destination, if the destination identifier of a certain destination time-space information represents the destination, the number of the destination time-space information is increased by one, it is indicated that the goods to be transported corresponding to the destination time-space information need to be transported to the destination, the freight volume of the destination is increased by one, the destination time-space information is traversed, and then the freight volume of the destination is determined. Similarly, if the transportation type identifier is a return identifier, the transportation task in the target time period is to deliver goods returned by the user, the destination starting point identifier of each destination time-space information is compared with the destination starting point for any destination starting point, if the destination starting point identifier of a certain destination time-space information represents the destination starting point, the quantity of the destination time-space information is increased by one, the goods to be transported corresponding to the destination time-space information need to be transported to the destination starting point, the goods transportation quantity of the destination starting point is increased by one, the destination time-space information is traversed, and the goods transportation quantity of the destination starting point is determined. Therefore, the quantity of the target time-space information is determined only through the target end point identification or the target starting point identification of the target time-space information, and then the freight volume of each target end point or target starting point is determined, so that the processing of other information in the target time-space information is avoided, the data processing amount can be reduced, the freight volume rate can be increased, and the freight volume accuracy can be increased.

Step 106: and determining the transportation route of the target object in the target time period according to the historical transportation data and the freight transportation amount of each destination station.

Specifically, the transportation route refers to a finally determined route for the target object to transport the goods to be transported.

In practical application, after the historical transportation data are acquired and the freight transportation amount of each destination station is counted according to the destination time-space information, further, data analysis and intelligent wire arrangement are required to be performed based on the historical transportation data and the freight transportation amount of each destination station, so that a route, namely a transportation route, which is required by a target object to finish a transportation task in a destination time period is determined.

In one or more alternative embodiments of the present disclosure, the historical transportation data includes historical station time of each destination station and historical resource consumption between destination stations, and the destination spatiotemporal information further includes destination arrival time, where the consumption of each link in the transportation process may be based on the historical station time, the historical resource consumption between destination stations and cargo transportation volume, and the line arrangement may be performed based on the consumption and the destination arrival time to determine the transportation route. That is, in the case that the historical transportation data includes the historical resource consumption amount between the station duration and each destination station of each destination station, and the destination temporal-spatial information further includes the destination arrival time, the transportation route of the target object in the target time period is determined according to the historical transportation data and the freight transportation amount of each destination station, and the specific implementation process may be as follows:

predicting the station consumption duration of each destination station in the target time period according to the historical station duration of each destination station and the freight transportation volume of each destination station;

predicting inter-station resource consumption of each target station in the target time period according to the historical resource consumption among the target stations;

and determining the transportation route of the target object in the target time period according to the target arrival time, the consumption time in the station and the resource consumption between the stations.

Specifically, the historical station time length refers to the time length for transporting goods to enter and exit a certain destination station before the target object; the historical resource consumption amount refers to a value of a resource consumed by the target object to transport the goods between the two destination sites before.

In practical application, for any destination station, the time length of the transportation task in the destination station within the target time period can be predicted according to the historical time length and the freight transportation amount of the destination station, such as 10 minutes, half an hour and the like. And traversing each destination site, and predicting the time length which needs to be consumed by the transportation task at each destination site in the target time period, namely predicting the time length which is consumed by each destination site in the target time period. And then predicting the inter-station resource consumption between the target stations of the transportation task in a target time period according to the historical resource consumption between every two target stations corresponding to the transportation task. And further, performing data analysis and parallel arrangement on the basis of the destination arrival time, the consumption time in the station and the resource consumption between the stations, and further determining the transport route of the target object in the target time period. Therefore, the in-station consumption time and the inter-station resource consumption of each target station in the target time period are predicted, the cable arrangement is carried out based on the target arrival time, the in-station consumption time and the inter-station resource consumption, the transport route of the target object in the target time period is determined, the cable arrangement efficiency can be effectively improved, and the transport route is more accurate.

It should be noted that the historical transportation data includes the historical resource consumption amount between the station duration and each destination station of the history of each destination station, and at this time, the historical resource consumption amount between the station duration and each destination station of the history of each destination station needs to be obtained. That is, in the case that the historical transportation data includes the historical station duration of each destination station and the historical resource consumption amount between the destination stations, the historical transportation data is obtained according to the destination spatio-temporal information of each cargo to be transported, and the specific implementation process may be as follows:

and acquiring the historical station-on time of each destination station, and acquiring the historical resource consumption of the target object among the destination stations.

In practical application, the historical station-time length corresponding to each destination station can be obtained from the historical station-time length library, and the historical resource consumption between each destination station pair can be obtained from the historical resource consumption library; and the travel data of the goods transported at each destination site before the target object is obtained according to the destination site, and then the historical station-time length of the destination site and the historical resource consumption of the target object between the destination sites are calculated according to the formed data. Therefore, historical resource consumption of each destination station between the station time and each destination station is obtained to represent historical transportation data, so that the historical transportation data have smaller granularity, the target transportation route determined based on the historical transportation data is more accurate, the cargo transportation is more efficient, the use experience of a user is further improved, and the viscosity of the user is improved.

In addition, the consumed resource may be time, cost, time and cost. Namely the historical resource consumption comprises the consumption duration among the historical stations and/or the consumption cost among the historical stations; at this time, when the historical resource consumption amount of the target object between the destination sites is obtained, it is necessary to obtain the consumption time of the target object between the historical stations and/or the cost consumption amount of the target object between the historical stations. The consumption duration between the historical stations refers to the time length consumed by the target object between some two destination stations, and the consumption amount of the cost between the historical stations refers to the cost consumed by the target object between some two destination stations. Therefore, the consumption duration between the historical stations and/or the cost consumption between the historical stations between the target stations are obtained to represent the consumption of the historical resources, the historical transportation data are further refined, the granularity of the historical transportation data is smaller, the target transportation route determined based on the historical transportation data is more accurate, the goods transportation is more efficient, the use experience of a user is further improved, and the viscosity of the user is improved.

In one or more alternative embodiments of the present disclosure, the historical at-station duration includes a historical arrival time, a historical departure time, where a historical processing duration for the destination station to process the unit good may be determined based on the historical arrival time, the historical departure time, and the historical freight transportation volume in the historical transportation data, and the intra-station consumption duration for the destination station may be further determined based on the historical processing duration for the unit good and the current freight transportation volume. That is, when the historical station-in time length includes the historical station-in time and the historical station-out time, and the historical transportation data further includes the historical freight transportation volume of each destination station, the intra-station consumption time length of each destination station in the target time period is predicted according to the historical station-in time length of each destination station and the freight transportation volume of each destination station, and the specific implementation process may be as follows:

according to the historical arrival time, the historical departure time and the historical freight transportation volume of a first destination station, predicting the historical processing time of unit freight in the first destination station, wherein the first destination station is any destination station;

and predicting the consumption time of the first destination station in the station within the target time period according to the historical processing time of the unit goods in the first destination station and the goods transportation amount.

Specifically, the historical arrival time refers to the time when a target object or other objects enter each destination station in a certain historical transportation task; the historical outbound time refers to the time when a target object or other objects exit each target site in a certain historical transportation task; the historical freight transportation amount refers to the amount of cargos loaded and unloaded at the destination station during the historical arrival time and the historical departure time; the historical processing time length of the unit goods is the time length consumed for processing a single goods or the goods with unit volume;

in practical application, for any destination station, according to the historical arrival time and the historical departure time of the destination station, the historical consumed time at the destination station, that is, the historical arrival time at the destination station is determined, and then according to the historical arrival time and the historical freight volume at the destination station, the historical processing time of the unit freight in the destination station is calculated, wherein the calculation process is shown as formula 1. Further, according to the historical processing time length of the unit goods in the destination station and the goods transportation amount, the in-station consumption time length of the transportation task of the destination station in the target time period is predicted, and the calculation process is shown as the formula 2. Therefore, the consumption time in the station can be determined more accurately, and the accuracy of route planning can be improved.

Historical processing time length of unit goods is historical station time length/historical goods transportation volume

Time spent in station (historical outbound time-historical arrival time)/historical freight volume (formula 1) ═ time spent in station (historical processing time of unit freight) — freight volume (formula 2)

For example, the historical outbound time and the historical inbound time for destination site a are 10: 00 and 9: 00, the historical freight transportation amount is 10, the historical station-in time of the destination station A is 60 minutes, and the historical processing time of unit freight is 6 minutes. If the freight traffic of destination site a is 20, the in-site consumption time is 120 minutes.

In one or more optional embodiments of the present specification, the inter-station resource consumption includes inter-station consumption duration or inter-station cost consumption, at this time, the corresponding inter-station resource consumption may be obtained according to different requirements, such as time efficiency priority or cost priority, and the transportation route of the transportation task is determined by combining the destination arrival time and the intra-station consumption duration. That is, in the case that the inter-station resource consumption amount includes inter-station consumption duration or inter-station cost consumption amount, the transportation route of the target object in the target time period is determined according to the target arrival time, the intra-station consumption duration, and the inter-station resource consumption amount, and the specific implementation process may be as follows:

receiving a selection instruction of a user for a route planning mode sent by a client;

under the condition that the selection instruction carries an aging identifier, determining a transport route of the target object in the target time period according to the target arrival time, the intra-station consumption time and the inter-station consumption time;

and under the condition that the selection instruction carries a cost identifier, determining a transport route of the target object in the target time period according to the target arrival time, the consumption time in the station and the cost consumption amount between stations.

Specifically, the route planning mode refers to the requirement of route planning, such as time efficiency priority or cost priority; the selection instruction refers to an instruction triggered by the selection of a route planning mode by a user; the aging identification refers to an identification corresponding to a route planning mode with prior aging selected by a user; the cost identification refers to an identification corresponding to a route planning mode with cost priority selected by a user; the inter-station consumption duration refers to the time length consumed between two destination stations; the inter-site cost consumption amount refers to the cost amount consumed between some two destination sites.

In practical application, a user can select the required route planning mode through a client, if the user selects the route planning mode with the prior aging, the locally received selection instruction carries an aging identifier, and at the moment, the route planning needs to be carried out based on the destination arrival time, the consumption time in the station and the consumption time between the stations, so that the transportation route of the target object in the target time period with the prior aging is determined; if the user selects the route planning mode with the cost priority, the locally received selection instruction carries the cost identifier, and at this time, route planning needs to be performed based on destination arrival time, intra-station consumption time and inter-station cost consumption, so that the transportation route of the target object in the target time period with the cost priority is determined. Therefore, the transportation route of the object can be provided based on different requirements of customers, and the viscosity of the user is greatly improved.

In one or more alternative embodiments of the present specification, before receiving the instruction sent by the client to select the route planning mode, a reference needs to be provided to the user so that the user can select the route planning mode. That is, before the receiving the instruction sent by the client for selecting the route planning mode by the user, the method further includes:

calculating the total consumption time corresponding to each transport route to be selected according to the consumption time in the station and the consumption time between the stations;

calculating the total cost consumption corresponding to each to-be-selected transportation route according to the inter-station cost consumption;

and sending the total consumed time and the total cost consumption corresponding to each transport route to be selected to a client for displaying so that a user can select a route planning mode according to the total consumed time and the total cost consumption corresponding to each transport route to be selected.

Specifically, the transportation route to be selected refers to a plurality of initial routes obtained according to the primary wire arrangement of each destination station; the total consumed time length is the total time length which is required by the target object to finish the transportation task in the target time period through a selected transportation route; the total cost consumption amount refers to the amount of cost that the target object needs to consume to complete the transportation task in the target time period through a certain selected transportation route.

In practical application, preliminary route planning can be performed on the basis of destination stations of goods to be transported to obtain a plurality of transportation routes to be selected, then, the total consumption time corresponding to each transportation route to be selected is calculated according to the in-station consumption time of each destination station and the inter-station consumption time between the destination stations, and the total cost consumption corresponding to each transportation route to be selected is calculated according to the inter-station cost consumption between the destination stations. And then displaying the total consumed time and the total cost consumption corresponding to each transport route to be selected through the client for a user to check, and selecting a route planning mode by the user according to the total consumed time and the total cost consumption corresponding to each transport route to be selected.

For example, there are three destination sites: destination site b1, destination site b2, and destination site b3, wherein destination site b1 is the origin site; assume that intra-station consumption periods of destination site b1, destination site b2, and destination site b3 are 10 minutes, 20 minutes, and 15 minutes, respectively, a total inter-station consumption period between destination site b1 and destination site b2 is 25 minutes, a total inter-station consumption period between destination site b1 and destination site b3 is 10 minutes, a total inter-station consumption period between destination site b2 and destination site b3 is 30 minutes, an inter-station cost consumption amount of destination site b1 to destination site b2 is 6, an inter-station cost consumption amount of destination site b1 to destination site b3 is 8, an inter-station cost consumption amount of destination site b2 to destination site b3 is 9, and an inter-station cost consumption amount of destination site b3 to destination inter-station site b2 is 10. There are two haul routes to be selected as determined by destination site b1, destination site b2, and destination site b 3: the transportation route 1 to be selected is "destination site b1 → destination site b2 → destination site b 3"; the transportation route 2 to be selected is "destination station b1 → destination station b3 → destination station b 2", the total consumption time of the transportation route 1 to be selected is 100 minutes from 10+20+15+25+30, and the total consumption amount is 15 from 6+ 9; the total consumption time of the transport route 2 to be selected is 85 minutes from 10+20+15+10+30, and the total consumption amount is 18 from 8+ 10. The total consumed time of the transport route 1 to be selected is 100 minutes and the total cost consumed amount 15, and the total consumed time of the transport route 2 to be selected is 85 minutes and the total cost consumed amount 18 are sent to the client to be displayed.

In one or more alternative embodiments of the present specification, after determining the freight transportation amount of the destination endpoint in the case where the transportation type identifier is the purchase identifier, or determining the freight transportation amount of the destination endpoint in the case where the transportation type identifier is the return identifier, the transportation route of the target object in the target time period needs to be determined based on the freight transportation amount of the destination endpoint or the freight transportation amount of the destination endpoint, and the historical transportation data. That is, the transportation route of the target object in the target time period is determined according to the historical transportation data and the freight transportation amount of each destination station, and the specific implementation process may be as follows:

under the condition that the transportation type identifier is a purchase identifier, determining a transportation route of the target object in the target time period by taking a warehouse station as a starting point according to the historical transportation data and the freight transportation amount of each destination terminal;

and under the condition that the transportation type identifier is a goods return identifier, determining the transportation route of the target object in the target time period by taking a warehouse station as a terminal point according to the historical transportation data and the goods transportation amount of each destination starting point.

In practical application, under the condition that the transportation type identifier is a purchase identifier, the initial site, that is, the warehouse site, is a starting site of the goods, that is, a starting point; at the moment, the warehouse site is taken as a starting point, data analysis and intelligent wire arrangement are carried out based on historical transportation data and the cargo transportation amount of each destination end point, so that a route, namely a transportation route, which is required by a target object to finish a transportation task in a target time period is determined, and forward wire arrangement can be realized, and materials are sent to each destination end point from the warehouse site for selling, serving and the like. Under the condition that the transportation type identifier is the goods returning identifier, the initial station, namely the warehouse station, is the delivery station, namely the destination, of the goods, at the moment, the warehouse station is taken as the destination, data analysis and intelligent line arrangement are carried out on the basis of historical transportation data and the goods transportation amount of each destination starting point, so that a route, namely a transportation route, which is needed by a target object to finish a transportation task in a target time period is determined, and therefore reverse line arrangement can be achieved, and goods and materials from the destination starting point are returned to the warehouse station.

It should be noted that, the user may participate in route planning through the client, for example, add some planning requirements, adjust the route, and the like. That is, the transportation route of the target object in the target time period is determined according to the historical transportation data and the freight transportation amount of each destination station, and the specific implementation process may be as follows:

receiving a planning additional parameter sent by a client;

and determining the transportation route of the target object in the target time period according to the historical transportation data, the freight transportation amount of each destination station and the planning additional parameters.

Specifically, the planning additional parameter refers to a parameter of route planning provided by a user based on planning requirements in route planning.

In practical application, when route planning is carried out, a user can input some planning additional parameters through a client, or input user requirements, the client converts the planning additional parameters into the planning additional parameters according to the user requirements, and then the planning additional parameters are sent to the local. The method is characterized in that the local system carries out planning additional parameter data analysis and intelligent wire arrangement on the basis of historical transportation data and the freight transportation amount of each destination station, so that a route which a target object needs to travel to complete a transportation task in a target time period, namely a transportation route, is determined. Therefore, the transportation route is determined based on the planning additional parameters, the transportation route which meets the requirements of the user can be obtained, the accuracy of the transportation route is improved, the efficiency of cargo transportation is improved, and the viscosity of the user is improved.

In one or more alternative embodiments of the present disclosure, in order to improve the efficiency and accuracy of determining the transportation route, a route planning model may be trained in advance, and then the transportation route of the target object in the target time period may be determined based on the historical transportation data, the freight transportation amount of each destination station, and the route planning model. That is, the transportation route of the target object in the target time period is determined according to the historical transportation data and the freight transportation volume of each destination station, and the specific implementation process may be as follows:

inputting the historical transportation data and the freight transportation amount of each destination station into a pre-trained route planning model to obtain the transportation route of the target object in the target time period, wherein the route planning model is obtained by training based on a sample transportation task carrying a label route.

Specifically, the route planning model refers to a preset neural network model or function; the sample transportation task refers to some pre-specified transportation tasks, which can be historical transportation tasks or proposed transportation tasks; the label route refers to a route with a good transportation effect corresponding to the sample transportation task, such as a transportation route with the shortest transportation time, and further such as a transportation route with the lowest transportation cost.

In practical applications, a route planning model can be trained in advance: obtaining a sample transportation task carrying a label route, then inputting a preset neural network model or function of the sample transportation task, and outputting a predicted transportation route of the sample transportation task by the neural network model or function; and inputting the predicted transportation route and the label route carried by the sample transportation task into a preset loss function, and determining a loss value. And further, adjusting parameters of the neural network model or the function according to the loss value, then continuously acquiring a sample transportation task carrying the label route, starting the next round of training until the loss value is smaller than a preset threshold value or the iteration times reach the preset iteration times, stopping the training, and determining the trained neural network model or function as a route planning model.

In addition, after the historical transportation data and the freight transportation amount of each destination station are obtained, the historical transportation data and the freight transportation amount of each destination station can be sent to a trained route planning model, the historical transportation data and the freight transportation amount of each destination station are processed by the route planning model, and the transportation route of the target object in the target time period is output. Therefore, the automatic arrangement of the transportation route is realized through the route planning model for the historical transportation data and the cargo transportation amount of each destination station, the manpower and material resources are saved, the efficiency and the accuracy of the determined transportation route are improved, and the user can be better served.

In one or more alternative embodiments of the present disclosure, to further improve the accuracy of the transportation route, different route planning models are set for different transportation consumption indexes. That is, before the historical transportation data and the freight transportation amount of each destination station are input into the pre-trained route planning model to obtain the transportation route of the target object in the target time period, the specific implementation process may be as follows:

receiving a transportation consumption index, wherein the transportation consumption index comprises a transportation time consumption index and/or a transportation cost index;

and determining a route planning model corresponding to the transportation consumption index.

Specifically, the transportation consumption index refers to a consumption index to be achieved by transporting the goods at this time; the transportation time consumption index is a time consumption index which is required to be reached by the transportation of the goods; the transportation cost index is a cost consumption index to be achieved for the transportation of the goods.

In practical application, the display panel has transportation consumption indexes for the user to select, such as transportation time consumption indexes, transportation cost indexes, transportation time consumption indexes and transportation cost indexes. The user can select the corresponding transportation consumption index according to the requirement, namely the transportation consumption index is received, and then the corresponding route planning model is obtained based on the received transportation consumption index.

For example, if the transportation consumption index is a transportation time consumption index, a route planning model for determining a transportation route based on transportation time consumption is obtained; if the transportation consumption index is a transportation cost index, a route planning model for determining a transportation route based on the transportation cost is obtained; if the transportation consumption index is the transportation time consumption index and the transportation cost index, a route planning model for determining the transportation route based on the transportation time consumption and the transportation cost is obtained.

In one or more alternative embodiments of the present disclosure, to further improve the accuracy of the transportation route, different route planning models are set for different transportation scenarios. That is, before the historical transportation data and the freight transportation amount of each destination station are input into the pre-trained route planning model to obtain the transportation route of the target object in the target time period, the specific implementation process may be as follows:

acquiring a transportation scene identifier of the target object;

and determining a route planning model corresponding to the transportation scene identification.

Specifically, the transportation scene identifier refers to a name, a label, and the like corresponding to the transportation scene.

In practical application, the display panel is provided with transportation scene marks for a user to select, such as vegetable transportation scene marks, clothes transportation scene marks, and city leg running scene marks. The user can select the corresponding transportation scene identification according to the requirement, namely the transportation scene identification is obtained, and then the corresponding route planning model is obtained based on the obtained transportation scene identification. Therefore, different route planning models can be obtained according to different transportation scenes, the accuracy of the target transportation route is improved, the efficiency of goods transportation is improved, and the viscosity of a user is improved.

In one or more alternative embodiments of the present description, a shipping route may be presented to the user after the shipping route is determined, and the user may adjust the shipping route if the user is not satisfied with the shipping route. That is, after determining the transportation route of the target object in the target time period according to the historical transportation data and the freight transportation volume of each destination station, the method further includes:

sending the transportation data to a client for display;

and under the condition that a route adjusting instruction aiming at the transportation data is received, adjusting the transportation route according to an adjusting parameter carried in the route adjusting instruction to obtain the adjusted transportation route.

Specifically, the route adjustment instruction refers to an instruction sent by a user or a server by the user to adjust a transportation route; the adjustment of the parameters refers to adjusting the parameters of the transportation route so that the transportation route is improved to be the transportation route meeting the requirements of the user.

In practical application, intelligent wire arranging can be performed according to historical transportation data and the cargo transportation amount of each destination station, so that a route which is required by a target object to finish a transportation task in a target time period is determined, and the transportation route of the target object in the target time period is also determined. And then displaying the transportation route to a user through the client, and if a route adjusting instruction for adjusting the transportation route is received, adjusting the transportation route according to an adjusting parameter in the route adjusting instruction to obtain an adjusted transportation route.

It should be noted that, in the case of receiving the route adjustment instruction, after the transportation route is adjusted according to the adjustment parameter carried in the route adjustment instruction, if the route adjustment instruction is received again, the transportation route after adjustment needs to be adjusted again. So, through the adjustment to the haul route, can obtain the haul route that accords with user's requirement more, also improved the rate of accuracy of haul route, and then improved freight's efficiency, improved user's viscosity.

In addition, after the transportation route is determined, the transportation index corresponding to the transportation route can be determined, and the transportation route and the transportation index are displayed to the user. That is, after the transportation route of the target object in the target time period is determined according to the historical transportation data and the freight transportation amount of each destination station, the transportation index corresponding to the transportation route needs to be calculated; and sending the transportation route and the transportation index to a client for displaying. The transportation index refers to parameter information of a transportation route, such as time, history, running time, loading rate and other indexes of reaching a certain destination station. Therefore, the user can simply and intuitively check the transportation indexes of the transportation route, and the relevance degree of the user is provided.

Referring to fig. 2A, fig. 2A is a schematic view illustrating a processing procedure of a transportation route planning platform in a transportation route planning method according to an embodiment of the present disclosure: the transportation management system receives an order, that is, a transportation task in a target time period, wherein the transportation task comprises a transportation date, a starting point and an end point, that is, destination space-time information, and also can comprise cargo attribute information, such as the weight, the quantity, the volume and the like of the cargo to be transported. Then, importing/synchronizing the order into the visual intelligent flat cable for planning, and determining the order, namely the round order, including the delivery date, the type of the temperature layer, the task line and the like by the visual intelligent flat cable. Further, all information is gathered to carry out cargo volume statistics, namely, the cargo transportation quantity of each destination station is determined according to destination space-time information, and further, a transportation route is automatically generated based on intelligent cable arrangement according to cable arrangement strategies such as cable arrangement preference (time efficiency priority and cost priority), vehicle type rules and order interception rules, and the transportation route can also be generated based on manual cable arrangement. Thereafter, the transportation route may be adjusted, thereby generating a waybill or deriving a transportation route. And further exporting/synchronizing the transportation route, carrying out vehicle scheduling, then carrying out cargo transportation according to a vehicle scheduling scheme, and charging while monitoring the cargo transportation process.

In addition, the transportation management system provides basic capability for building wire arrangement, and can arrange wires in a forward direction (for example, goods and materials are delivered to a store from a warehouse end for sale), in a reverse direction (for example, wire arrangement is carried out on tasks related to goods return), in a pre-arranging manner (for example, transportation lines of next days are predicted by predicting the goods quantity), and in a line tracing manner (on the arranged transportation lines, additional stations are arranged, and after wire arrangement in advance, additional goods quantity is provided for part of stations; the method supports manual intervention, introduces the manual winding displacement, copies the winding displacement on a certain day before, and is used for displaying a map page; path data can be obtained in advance for determining transportation route calculation; strategic, white-boxed, and simulated | trial traffic routes are supported.

Moreover, the transportation route planning platform deposits the wire arranging algorithm capability, can predict departure rhythm, the time length of navigation in the way, the operation time length of a predicted station and the loading of vehicles, for example, according to the time of historical vehicles entering and exiting a certain target station, the historical average loading time length (the historical departure time-the historical arrival time) is calculated, namely the departure rhythm is predicted; obtaining the average in-transit time according to the historical navigation time; according to (historical outbound time-historical arrival time)/historical freight volume (historical single-piece operation duration (historical processing duration of unit goods), and historical single-piece operation duration (freight volume) (predicted station operation duration (in-station consumption duration)); and obtaining information such as xxx pieces/xxx orders of the maximum volume of a certain transport vehicle according to historical data. And various navigation modes can be precipitated for navigation service, such as cost priority and mature road priority, which are provided for users to select, namely road network/time efficiency.

The transportation management system can also build a wire arranging strategy capability, such as wire arranging strategy, precipitate wire arranging related parameters, standardize the wire arranging related parameters for users to use, and enable the users to modify the parameters according to requirements to obtain a result more suitable for project scenes; and if the indexes are visualized, the wire arrangement result is presented by the indexes, and the logistics network is visualized, so that the reached station (position information, vehicle type constraint, time window and container constraint), route (distance aging and block division), vehicle type (carrying capacity and loading and unloading duration) and capacity are determined, and the indexes such as the arrival time, mileage, running duration, loading rate and the like can be displayed.

The transportation management system is based on a certain platform and mainly comprises a tenant system, an account system, an organization structure, a permission system and a configuration center. The visual intelligent flat cable can interact with an METIS algorithm (based on a multi-level recursive bisection method, a multi-level K-way bisection method and a multi-constraint division mechanism), the visual intelligent flat cable provides rule input for the METIS algorithm platform, the METIS algorithm platform outputs feedback algorithms such as road network/time efficiency provided by navigation service, input rules of the visual intelligent flat cable, tenant registration, strategy configuration, algorithm output and learning optimization to the visual intelligent flat cable, the tenant registration can be provided for the METIS algorithm platform from a platform basis, and a logistics network can provide basic data for the METIS algorithm platform for learning optimization of the METIS algorithm platform.

One or more embodiments of the present disclosure provide a transportation route plan having two target outcomes and two product outcomes, wherein the two target outcomes are: the aging indexes comprise bus cable issuing time, list intercepting time, planned arrival time of each station, planned departure time of each station, planned in-place time, on-road time and in-station operation time; cost index, number of sticks, total inventory, total volume, total weight, and loading rate. The two product outputs were: the intelligent flat cable replaces a manual flat cable to improve the efficiency; data analysis ability, displaying the wire arrangement result in a data mode, and optimizing the input parameters according to the result. A set of intelligent wire arranging algorithm is also deposited: discharging lines according to data such as stations and cargo volumes; calling historical data in real time to obtain the station operation time and the in-transit time; the rolling departure is carried out, and the vehicles can depart according to the time length of the shift or the interval. In addition, the transportation timeliness can be accurately predicted, and the time of outbound and outbound can be accurately fed back by using historical data; guiding drivers and station operation and preparing in advance; and the system can trace the responsibility after the incident, analyze the management problem and improve the efficiency. Not only has established unified winding displacement data center: a large amount of historical operation data, the operation time in the station, the warehouse-out time and the like; the related index data of the wire arrangement result sediment can be analyzed clearly after the wire arrangement is finished; the method uses ADB (analytical database Mysql) distributed storage, supports full-index query and has super-strong data analysis capability. The ability of new task can be accessed fast, and new project access only needs to lead in basic site data and can use, and the butt joint navigation can be more accurate output winding displacement result when historical operation data is increased.

In one or more alternative embodiments of the present disclosure, different route planning methods may be required for different transportation identified transportation tasks. That is, before the historical transportation data is obtained according to the destination space-time information of each cargo to be transported, the method further comprises the following steps:

identifying a transportation identification of the transportation task;

correspondingly, the acquiring historical transportation data according to the target space-time information of each cargo to be transported includes:

and under the condition that the transportation identification is a dynamic transportation identification, acquiring historical transportation data according to the target space-time information of each cargo to be transported, wherein the dynamic transportation identification represents that the variation between the transportation task and the historical transportation task is larger than a preset value.

Specifically, the transportation identifier represents a transportation task scene corresponding to the transportation task; the dynamic transportation identification represents that the variation between the transportation task and the historical transportation task is larger than a preset value, namely the transportation route in each day or a period of time is not fixed and has larger variation, for example, self-picking type goods purchasing is carried out according to the order of a client user, the destination station in each day is uncertain, and the transportation route needs to be recalculated every day.

In practical application, after a transportation task of a target object in a target time period is obtained, a transportation identifier of the transportation task is identified, if the transportation identifier is a dynamic transportation identifier, historical transportation data are obtained according to target space-time information of each to-be-transported cargo in the transportation task, the cargo transportation amount of each target station is counted, and a transportation route of the target object in the target time period is determined further according to the historical transportation data and the cargo transportation amount of each target station. Therefore, the corresponding route planning method is selected based on the transportation identification, and the accuracy of determining the transportation route can be improved.

In one or more alternative embodiments of the present disclosure, the transportation identifier may be a static transportation identifier, and the transportation route is determined based on the static transportation identifier, that is:

under the condition that the transportation identification is a static transportation identification, obtaining a repeated route according to the transportation task, wherein the static transportation identification represents that the variation between the transportation task and the historical transportation task is smaller than or equal to a preset value, and the repeated route is any historical transportation route;

determining the similarity between a plurality of historical sites and each destination site contained in the repeated carving route;

and determining the transportation route of the target object in the target time period according to the route planning strategy corresponding to the similarity and the repeated carving route and each destination station.

Specifically, the dynamic transportation identifier represents that the variation between the transportation task and the historical transportation task is smaller than or equal to a preset value, that is, the transportation route changes little in each day or a period of time, such as trunk transportation and point-to-point transportation.

In practical application, after a transportation task of a target object in a target time period is obtained, a transportation identifier of the transportation task is identified, if the transportation identifier is a static transportation identifier, a historical transportation route and/or an alternative transportation route are obtained, and then one route is selected from the historical transportation route and/or the alternative transportation route to serve as a repeated route. Further, the similarity between the repeated carving route and each destination site is calculated, that is, the similarity between a plurality of historical sites included in the repeated carving route and each destination site is calculated. And then selecting a route planning strategy corresponding to the similarity, and then analyzing the repeated carving route and each destination station according to the route planning strategy, namely adjusting the repeated carving route based on each destination station to determine the transportation route of the target object in the target time period. Therefore, the transportation route can be determined based on the repeated route, the time consumption of route planning under a complex scene can be reduced, more time is strived for warehouse production and subsequent real-time transportation, and meanwhile, the cost and the threshold of route planning are reduced.

It should be noted that the rescheduled route may be a plurality of historical transportation routes, the historical cargo quantity of which is close to the cargo quantity of the transportation task and has a higher score, screened from a historical transportation route set in a period of time, and the plurality of historical transportation routes are sorted according to the weighted score, and then one historical transportation route is selected as the rescheduled route according to a preset condition or a preset parameter. Or obtaining a satisfactory alternative transportation route by adopting other modes such as wire arrangement trial calculation and the like, and taking the alternative transportation route as a repeated route. And one transportation route is selected from the plurality of historical transportation routes and the alternative transportation routes according to preset conditions or preset parameters to serve as the repeated turning route.

In one or more optional embodiments of the present disclosure, the similarity may be compared with a preset similarity threshold, if the similarity is greater than the preset similarity threshold, a point-to-point precise matching policy is selected for route planning, and if the similarity is not greater than the preset similarity threshold, a point-to-point precise matching policy including matching is selected for route planning. That is, the transportation route of the target object in the target time period is determined according to the route planning strategy corresponding to the similarity and according to the repeated carving route and the destination stations, and specifically may be as follows:

if the similarity is larger than a preset similarity threshold, judging whether the repeated carving route contains the destination station or not for any destination station, and determining the transportation route of the target object in the target time period according to the judgment result;

if the similarity is smaller than or equal to the similarity threshold, determining a transportation surface corresponding to the repeated carving route, identifying whether the transportation surface comprises a destination station or not aiming at any destination station, and determining the transportation route of the target object in the target time period according to an identification result.

In practical application, after the similarity between a plurality of historical stops and each destination stop included in the repeated route is calculated, different route planning strategies are selected according to a preset similarity threshold. If the similarity is larger than a preset similarity threshold, using a point-to-point accurate matching strategy: and judging whether the destination station exists in the repeated etching line or not for any destination station, if so, adding the destination station to the transportation line, and if not, not adding the destination station to the transportation line. And traversing all the destination sites to obtain the transportation route of the target object in the target time period. If the similarity is not larger than the preset similarity threshold, using a strategy of containing matching by the facing point: firstly, determining a transportation surface corresponding to the repeated carving route, namely a convex hull, judging whether the destination station exists in the transportation surface or not aiming at any destination station, if so, adding the destination station to the transportation route, and if not, not adding the destination station to the transportation route. And traversing all the destination sites to obtain the transportation route of the target object in the target time period. Therefore, the transportation route can be determined based on the repeated route, the time consumption of route planning under a complex scene can be reduced, more time is strived for warehouse production and subsequent real-time transportation, and meanwhile, the cost and the threshold of route planning are reduced.

In addition, for the case that the similarity is not greater than the preset similarity threshold, after the transportation route is determined, for the non-ranked stations, that is, the distance between the station not added to the transportation route and the transportation route, if the distance is smaller than the preset accommodation threshold, it is only necessary to further judge whether the current station can be installed after being added to the route and can satisfy the performance timeliness, if both are satisfied, the non-ranked stations are added to the transportation route, and if not, the non-ranked stations are not added to the transportation route.

Referring to fig. 2B, fig. 2B is a schematic processing diagram of another transportation route planning method provided in an embodiment of the present disclosure: and calculating the similarity between the repeated etching line and the target site, and then judging whether the similarity is greater than a similarity threshold value.

If yes, point-to-point accurate matching is carried out: counting station sets in the repeated carving route, then carrying out point-to-point accurate matching according to the longitude and latitude, namely judging whether each target station exists in the repeated carving route according to the longitude and latitude of each station in the station sets, aiming at a certain target station, if so, bringing the target station into the transportation route, if not, not bringing the target station into the transportation route, traversing all the target stations, generating the transportation route, and then outputting the transportation route.

If not, the face points are matched: firstly, calculating a convex hull (minimum circumscribed polygon) of a station in a repeated line, namely a transportation surface, and then carrying out surface-point inclusion matching according to a graph (convex hull) relation, namely matching each destination station one by one to determine whether the destination station is included by the current convex hull, if so, including the destination station in the transportation line, otherwise, not including the destination station in the transportation line, traversing all destination stations and generating a transportation line. In order to further reduce the work of a dispatcher, after the steps are completed, the distance between the non-ranked station and the transportation route can be calculated, whether the distance is larger than an accommodation threshold value or not is judged, if not, the loading capacity and the estimated time effectiveness of the transportation route need to be calculated, whether the loading capacity and the time effectiveness are met after the non-ranked station is added is further judged, namely whether the current station can be loaded after the current station is added into the route and the performance time effectiveness can be met or not is judged, if yes, the non-ranked station is added into the transportation route, and if not, the non-ranked station is not added into the transportation route. And outputting the transportation route after traversing all destination stations.

Referring to fig. 2C, fig. 2C is a schematic diagram illustrating an effect of a transportation route planning method provided in an embodiment of the present specification: the resculpting route comprises stations 1-7, the destination stations comprise stations 1-5 and 7-10, wherein station 6 does not need to be wired, and stations 8, 9 and 10 are newly added stations relative to the resculpting route. For point-to-point exact matching: the destination stations are compared one by one whether they are present in the repeat engraving line and, if so, are brought into the corresponding transport lines, so that stations 1-6 and 7 are brought into the transport lines and stations 8-10 are not brought into the transport lines, which the dispatcher can manually adjust. And (3) calculating a convex hull (a minimum circumscribed polygon, namely the polygon in the figure 3) of the repeated line when the facing points contain the matching, comparing whether each destination station is contained by the convex hull, if the destination station is contained by the convex hull, then the destination station is contained by the transportation route, then the stations 1-5 and 7-8 are contained by the transportation route, then the distance from the non-ranked station to the transportation route is calculated, the distance from the non-ranked station 9 to the transportation route is smaller than a containing threshold value, the distance from the non-ranked station 10 to the transportation route is larger than the containing threshold value, then the station 9 is contained by the transportation route, and the station 10 is not contained by the transportation route.

Referring to fig. 2D, fig. 2D is a schematic view illustrating a transportation route planning platform processing procedure in another transportation route planning method provided in an embodiment of the present disclosure: the transportation route planning platform comprises three units, namely a transportation scheduling preparation unit for recommending proper high-quality historical transportation routes; a line re-engraving unit for actually re-engraving the line and finishing the wire arrangement and scheduling; and carrying out actual operation based on the transportation route, and respectively counting actual operation results to feed back the transportation actual operation and the statistical unit for next cable arrangement scheduling.

A transportation schedule preparation unit: receiving the freight transportation volume of each destination station through the transportation management system, that is, receiving the transportation task, will find the scheduling result with the close freight volume and the higher score from the historical transportation routes within a period of time (such as the last 2 months): if the first similarity with the historical freight transportation amount and the historical scheduling result score are calculated and then the high-quality historical transportation routes which can be used for repeated moments are ranked according to the weighted scores, the high-quality historical transportation routes are recommended to the dispatcher. After the comparison, the dispatcher selects a proper historical transportation route as a resculpting route, namely the dispatcher selects the resculpting route; or the dispatcher finds a more satisfactory historical route after repeated etching, and can also restart repeated etching; besides the historical transportation route, the dispatcher can also obtain a satisfactory route planning result in other modes such as wire arrangement trial calculation and the like, namely the route planning result actively selected by the dispatcher is imported into the system and then the route is re-engraved, namely the dispatcher selects the re-engraved route.

A route re-engraving unit: and the system is responsible for completing the recommendation of the retentions and the transport capacity of the line. The number or variation of destination sites may vary widely from scenario to scenario. For example, in the scene of buying vegetables on the line by the user, the change of the destination site is large, and in the scene of not promoting the target site is small, and the similarity rate is about 70%; under the scene of buying vegetables under a user line to a shop, the similarity rate is basically 100% as the target site covers more people and is self-supporting. Such differences may place different requirements on the line review. Therefore, the second similarity between the re-etching line and the target station is calculated firstly, then whether the second similarity is greater than the similarity threshold value is judged, and if yes, a point-to-point accurate matching strategy is adopted, so that a better re-etching effect is realized; if not, if the precise matching strategy is still adopted, a large number of stations do not belong to the transportation line, and a dispatcher still needs to spend a large amount of time for adjustment, so that the strategy of containing matching for points is used, greater flexibility is realized, and the work of the dispatcher is reduced. And then outputting the transportation route. After the transportation route is obtained, the dispatching work of the driver vehicle is needed, the driver is recommended to obtain the best matching transportation capacity information of each transportation route by obtaining the familiarity of the driver to the stop and the familiarity of the driver to the route, weighting and summing the familiarity to the transportation route, and obtaining the recommended driver, and then the bus cable dispatching result is output. Thus, after a certain driver runs the same parcel for a plurality of consecutive days, the familiarity of the driver with the parcel is increased, the driver can continue to serve the parcel, and the transportation and handover efficiency of the driver is improved.

A transportation practice and statistics unit: after the flat cable scheduling result, the flat cable scheduling result is determined and submitted by the dispatcher. And further entering a transportation practice, calculating a dispatching result after the transportation practice is finished, calculating the driver familiarity to the stop (for example, the driver familiarity to the stop +1 when the driver actually achieves the stop A) and the driver familiarity to the route (the driver familiarity to the route AB +1 when the driver actually achieves the stop A to the stop B) for providing a data base in the future flat cable dispatching. Wherein, the scheduling result is: the assessment on the transportation task is mainly the time efficiency assessment of arrival and departure.

Therefore, drivers familiar with the routes and the stops are selected to execute the transportation tasks according to the familiarity, so that the dependence on driver navigation can be avoided, and the navigation cost is reduced; the efficiency of the dispatcher can be improved through the repeated route, the dependence of a warehouse on a full-time dispatcher is reduced, the threshold of the dispatcher is reduced, the dispatcher is helped to more easily iterate the wire arranging result, and the wire arranging dispatching effect is improved. Meanwhile, based on point-to-point accurate matching or point-to-point matching, the vehicle efficiency can be improved on the premise of meeting the timeliness, the transportation cost is reduced, and various special scenes such as fluctuation of goods quantity and fluctuation of stations are compatible.

Referring to fig. 2E, fig. 2E is a diagram illustrating a comparison between a resculpting route and a transportation route in a transportation route planning method according to an embodiment of the present disclosure: the repeated marked route is a district A in a certain city-route 5, wherein a carrier is company B, a driver is red, the license plate number is 123456, the number of stations is 10, the total mileage and the forward mileage are both 12 kilometers, the total cargo volume is 20, the volume is 0.5 cubic meter, the weight is 25 kilograms, the repeated marked route is provided with the station distribution sequence, and the original sequence is reserved in the copying process. The transportation route is a region A in a certain city-route 5, wherein a carrier is company B, a driver is Xiaoming, the license plate number is 654321, the number of stations is 8, the total mileage and the forward mileage are both 10 kilometers, the total cargo volume is 15 pieces, the volume is 0.4 cubic meter, the weight is 20 kilograms, and the transportation route is marked with the station distribution sequence.

In addition, the transportation route is determined through the route planning model, cost and timeliness can be considered at the same time, namely a value with a good theoretical effect is calculated according to historical transportation data, and a wire arranging result with the lowest cost can be obtained under the condition that timeliness is guaranteed. Through historical transportation data, the operation time between historical sites and the operation time in the historical sites, namely the historical resource consumption of the historical site between the site time and the target site, can be obtained, and the completion time of the transportation task can be accurately calculated. And the warehouse operation time is reversely deduced through the time so as to transport and drive the warehouse. And historical transportation data, positioning data and truck navigation receiving are combined, the on-the-way time and the in-station operation time (in-station consumption time) are predicted, accurate prediction on future multi-line can be realized in a rolling mode in real time, and more accurate prediction time is provided for receiving and picking up goods at subsequent stations.

The transportation route planning method provided in this specification is further described below with reference to fig. 3, taking an application of the transportation route planning method in a vegetable transportation scenario as an example. Fig. 3 shows a processing flow chart of a transportation route planning method provided in an embodiment of the present specification, and specifically includes the following steps.

Step 302: and receiving a vegetable transportation task of the target object in the target time period, wherein the vegetable transportation task comprises target space-time information of each to-be-transported vegetable.

Step 304: identifying a transportation identification of the vegetable transportation task.

Step 306: and under the condition that the transportation identifier is the dynamic transportation identifier, determining the destination site of each vegetable to be transported according to the destination site identifier contained in the destination space-time information of each vegetable to be transported.

The dynamic transportation identification represents that the variation between the transportation task and the historical transportation task is larger than a preset value.

Step 308: and acquiring historical transportation data corresponding to the destination site of each vegetable to be transported.

Step 310: and (4) according to the target space-time information of each vegetable to be transported, counting the vegetable transportation amount of each target site.

Optionally, the destination temporal-spatial information comprises a destination site identification;

according to the destination space-time information of each vegetable to be transported, the vegetable transportation amount of each destination station is counted, and the method comprises the following steps:

and for any destination station, determining the destination space-time information quantity of the destination station identification representing the destination station, and determining the destination space-time information quantity as the vegetable traffic volume of the destination station.

Optionally, the transportation task further comprises a transportation type identifier; the destination station mark comprises a destination end point mark or a destination starting point mark, and the destination station is a destination end point or a destination starting point of the vegetable transportation;

for any destination station, determining the quantity of destination space-time information of destination station identification representing the destination station, and determining the quantity as the vegetable transportation quantity of the destination station, wherein the method comprises the following steps:

under the condition that the transportation type identifier is a purchase identifier, determining the quantity of target space-time information of a target terminal represented by the target terminal identifier, and determining the quantity of the target space-time information as the vegetable transportation quantity of the target terminal;

and under the condition that the transportation type identifier is a goods return identifier, determining the quantity of the destination space-time information of the destination starting point represented by the destination starting point identifier, and determining the quantity of the destination space-time information as the vegetable transportation quantity of the destination starting point.

Step 312: and predicting the in-station consumption duration of each destination station in the target time period according to the historical in-station duration of each destination station and the vegetable transportation volume of each destination station.

Optionally, the historical on-station duration includes historical on-station time and historical off-station time, and the historical transportation data further includes historical vegetable transportation amount of each destination station;

predicting the in-station consumption duration of each destination station in a target time period according to the historical in-station duration of each destination station and the vegetable transportation volume of each destination station, wherein the method comprises the following steps:

according to the historical arrival time, the historical departure time and the historical vegetable transportation volume of a first destination site, predicting to obtain the historical processing duration of unit vegetables in the first destination site, wherein the first destination site is any destination site;

and predicting the in-station consumption time of the first target station in the target time period according to the historical processing time of the unit vegetables in the first target station and the vegetable transportation amount.

Step 314: and predicting the inter-station resource consumption of each destination station in the target time period according to the historical resource consumption among the destination stations.

Step 316: and determining the transport route of the target object in the target time period according to the target arrival time, the consumption time in the station and the resource consumption between the stations.

Optionally, the consumption amount of the inter-station resources comprises the consumption duration of the inter-station or the consumption amount of the inter-station cost;

determining a transportation route of the target object in the target time period according to the target arrival time, the intra-station consumption time and the inter-station resource consumption, wherein the method comprises the following steps:

under the condition that the selection instruction carries the aging identification, determining a transport route of the target object in the target time period according to the target arrival time, the intra-station consumption time and the inter-station consumption time;

and under the condition that the selection instruction carries the cost identifier, determining the transport route of the target object in the target time period according to the target arrival time, the consumption time in the station and the cost consumption between stations.

Optionally, before receiving a selection instruction of the user for the route planning mode sent by the client, the method further includes:

calculating the total consumption time corresponding to each to-be-selected transportation route according to the consumption time in the stations and the consumption time between the stations;

calculating the total cost consumption corresponding to each transportation route to be selected according to the cost consumption between stations;

and sending the total consumed time and the total cost consumption corresponding to each transport route to be selected to the client for displaying so that a user can select a route planning mode according to the total consumed time and the total cost consumption corresponding to each transport route to be selected.

Optionally, determining a transportation route of the target object in the target time period according to the historical transportation data and the transportation amount of the vegetables at each destination station includes:

under the condition that the transportation type identifier is a purchase identifier, determining a transportation route of a target object in a target time period by taking a warehouse station as a starting point according to historical transportation data and the vegetable transportation amount of each destination terminal;

and under the condition that the transportation type identifier is a goods returning identifier, determining a transportation route of the target object in the target time period by taking the warehouse site as an end point according to the historical transportation data and the vegetable transportation amount of each target starting point.

Step 318: and receiving the planning additional parameters sent by the client.

Step 320: and determining a transportation route of the target object in the target time period according to the historical transportation data, the vegetable transportation amount of each destination station and the planning additional parameters.

Step 322: and under the condition that the transportation identifier is the static transportation identifier, acquiring a repeated route according to the vegetable transportation task.

The static transportation identification represents that the variation between the transportation task and the historical transportation task is smaller than or equal to a preset value, and the repeated route is any historical transportation route;

step 324: and determining the similarity between a plurality of historical sites and each destination site contained in the repeated carving route.

Step 326: and if the similarity is greater than a preset similarity threshold, judging whether the repeated carving route comprises the destination station or not aiming at any destination station.

Step 328: and determining the transportation route of the target object in the target time period according to the judgment result.

Step 330: and if the similarity is smaller than or equal to the similarity threshold value, determining the transportation surface corresponding to the repeated carving route.

Step 332: and identifying whether the transport plane contains the destination station or not aiming at any destination station, and determining the transport route of the target object in the target time period according to the identification result.

Step 334: and calculating a transportation index corresponding to the transportation route, and sending the transportation route and the transportation index to the client for displaying.

According to the transportation route planning method provided by the specification, the transportation route corresponding to the target object is determined according to the historical transportation data and the vegetable transportation amount of each destination station, so that the difference caused by manual wire arrangement is avoided, the efficiency and the accuracy of transportation route planning can be effectively improved, and the target transportation route can be accurately determined according to the historical transportation data.

Corresponding to the above method embodiment, the present specification further provides an embodiment of a transportation route planning device, and fig. 4 shows a schematic structural diagram of the transportation route planning device provided in an embodiment of the present specification. As shown in fig. 4, the apparatus includes:

a receiving module 402, configured to receive a transportation task of a target object within a target time period, wherein the transportation task includes destination spatiotemporal information of each cargo to be transported;

a statistic module 404 configured to obtain historical transportation data according to the destination temporal-spatial information of each to-be-transported cargo, and count the cargo transportation amount of each destination station;

a determining module 406 configured to determine a transportation route of the target object within the target time period according to the historical transportation data and the freight transportation amount of each destination station.

In one or more alternative embodiments of the present specification, the destination temporal-spatial information includes a destination site identification;

the statistics module 404 is further configured to:

In one or more alternative embodiments of the present disclosure, the historical transportation data includes historical station length of each destination station and historical resource consumption amount among the destination stations; the destination spatio-temporal information further comprises a destination arrival time;

the determining module 406 is further configured to:

In one or more alternative embodiments of the present disclosure, the historical on-station duration includes historical on-station time, historical off-station time, and the historical transportation data further includes historical freight transportation volume for each destination station;

the determining module 406 is further configured to:

In one or more alternative embodiments of the present description, the inter-station resource consumption amount includes an inter-station consumption duration or an inter-station cost consumption amount;

the determining module 406 is further configured to:

In one or more alternative embodiments of the present description, the determining module 406 is further configured to:

In one or more alternative embodiments of the present description, the transportation task further includes a transportation type identifier; the destination space-time information comprises destination terminal point identification or destination starting point identification, and the destination station is a destination terminal point or a destination starting point of the cargo transportation;

the statistics module 404 is further configured to:

under the condition that the transportation type identifier is a purchase identifier, determining a transportation route of the target object in the target time period by taking a warehouse site as a starting point according to the historical transportation data and the transportation quantity of the goods at each destination terminal;

In one or more alternative embodiments of the present description, the apparatus further includes an identification module configured to:

identifying a transportation identification of the transportation task;

the obtaining module 404 is further configured to:

and under the condition that the transportation identification is a dynamic transportation identification, obtaining historical transportation data according to the target space-time information of the goods to be transported, wherein the dynamic transportation identification represents that the variation between the transportation task and the historical transportation task is larger than a preset value.

In one or more alternative embodiments of the present description, the apparatus further includes a duplication module configured to:

In one or more alternative embodiments of the present description, the duplication module is further configured to:

The transportation route planning device provided by the specification receives a transportation task of a target object in a target time period, wherein the transportation task comprises target space-time information of each cargo to be transported; acquiring historical transportation data according to the target space-time information of each cargo to be transported, and counting the cargo transportation amount of each target station; and determining the transportation route of the target object in the target time period according to the historical transportation data and the freight transportation amount of each destination station. The target transportation route corresponding to the target object in the target time period is determined according to the historical transportation data and the cargo transportation amount of each target station, so that the difference caused by manual wiring is avoided, the efficiency and the accuracy of transportation route planning can be effectively improved, and the transportation route can be accurately determined according to the historical transportation data.

The above is a schematic scheme of a transportation route planning device of this embodiment. It should be noted that the technical solution of the transportation route planning device and the technical solution of the transportation route planning method belong to the same concept, and details of the technical solution of the transportation route planning device, which are not described in detail, can be referred to the description of the technical solution of the transportation route planning method.

Fig. 5 illustrates a block diagram of a computing device 500, according to an embodiment of the present disclosure. The components of the computing device 500 include, but are not limited to, a memory 510 and a processor 520. Processor 520 is coupled to memory 510 via bus 530, and database 550 is used to store data.

Computing device 500 also includes access device 540, access device 540 enabling computing device 500 to communicate via one or more networks 560. Examples of such networks include a Public Switched Telephone Network (PSTN), a Local Area Network (LAN), a Wide Area Network (WAN), a Personal Area Network (PAN), or a combination of communication networks such as the internet. The Access device 540 may include one or more of any type of Network Interface (e.g., a Network Interface Controller (NIC)) whether wired or Wireless, such as an IEEE802.11 Wireless Local Area Network (WLAN) Wireless Interface, a Worldwide Interoperability for Microwave Access (Wi-MAX) Interface, an ethernet Interface, a Universal Serial Bus (USB) Interface, a cellular Network Interface, a bluetooth Interface, a Near Field Communication (NFC) Interface, and so forth.

In one embodiment of the present description, the above-described components of computing device 500, as well as other components not shown in FIG. 5, may also be connected to each other, such as by a bus. It should be understood that the block diagram of the computing device architecture shown in FIG. 5 is for purposes of example only and is not limiting as to the scope of the present description. Those skilled in the art may add or replace other components as desired.

Computing device 500 may be any type of stationary or mobile computing device, including a mobile computer or mobile computing device (e.g., tablet computer, personal digital assistant, laptop computer, notebook computer, netbook, etc.), mobile phone (e.g., smartphone), wearable computing device (e.g., smartwatch, smart glasses, etc.), or other type of mobile device, or a stationary computing device such as a desktop computer or PC. Computing device 500 may also be a mobile or stationary server.

Wherein the processor 520 is configured to execute computer-executable instructions that, when executed by the processor, implement the steps of the transportation route planning method described above.

The above is an illustrative scheme of a computing device of the present embodiment. It should be noted that the technical solution of the computing device and the technical solution of the transportation route planning method belong to the same concept, and details that are not described in detail in the technical solution of the computing device can be referred to the description of the technical solution of the transportation route planning method.

An embodiment of the present specification also provides a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the transportation route planning method described above.

The above is an illustrative scheme of a computer-readable storage medium of the present embodiment. It should be noted that the technical solution of the storage medium belongs to the same concept as the technical solution of the transportation route planning method, and details that are not described in detail in the technical solution of the storage medium can be referred to the description of the technical solution of the transportation route planning method.

An embodiment of the present specification further provides a computer program, wherein when the computer program is executed in a computer, the computer is caused to execute the steps of the transportation route planning method.

The above is an illustrative scheme of a computer program of the present embodiment. It should be noted that the technical solution of the computer program and the technical solution of the transportation route planning method belong to the same concept, and details that are not described in detail in the technical solution of the computer program can be referred to the description of the technical solution of the transportation route planning method.

The foregoing description has been directed to specific embodiments of this disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.

The computer instructions comprise computer program code which may be in the form of source code, object code, an executable file or some intermediate form, or the like. 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.

It should be noted that, for the sake of simplicity, the foregoing method embodiments are described as a series of acts, but those skilled in the art should understand that the present embodiment is not limited by the described acts, because some steps may be performed in other sequences or simultaneously according to the present embodiment. Further, those skilled in the art should also appreciate that the embodiments described in this specification are preferred embodiments and that acts and modules referred to are not necessarily required for an embodiment of the specification.

In the above embodiments, 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.

The preferred embodiments of the present specification disclosed above are intended only to aid in the description of the specification. Alternative embodiments are not exhaustive and do not limit the invention to the precise embodiments described. Obviously, many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the embodiments and the practical application, to thereby enable others skilled in the art to best understand and utilize the embodiments. The specification is limited only by the claims and their full scope and equivalents.

Claims

1. A transportation route planning method, comprising:

2. The method of claim 1, the destination spatio-temporal information comprising a destination site identification;

the acquiring historical transportation data according to the target space-time information of each cargo to be transported comprises the following steps:

3. The method of claim 2, the historical transportation data comprising historical station length of each destination site and historical resource consumption between the destination sites; the destination spatio-temporal information further comprises a destination arrival time;

the determining the transportation route of the target object in the target time period according to the historical transportation data and the freight transportation amount of each destination station comprises the following steps:

4. The method of claim 3, the historical on-station durations comprising historical on-station times, historical off-station times, the historical transportation data further comprising historical freight traffic for each destination station;

the predicting the station consumption duration of each destination station in the target time period according to the historical station duration of each destination station and the freight transportation volume of each destination station comprises the following steps:

5. The method of claim 3, the inter-station resource consumption comprising inter-station consumption duration or inter-station cost consumption;

the step of determining the transportation route of the target object in the target time period according to the target arrival time, the intra-station consumption time and the inter-station resource consumption amount comprises the following steps:

6. The method according to claim 5, further comprising, before receiving the instruction sent by the client for selecting the route planning mode by the user, the following steps:

7. The method of claim 1, the transportation task further comprising a transportation type identification; the destination space-time information comprises destination terminal point identification or destination starting point identification, and the destination station is a destination terminal point or a destination starting point of the cargo transportation;

the step of counting the freight transportation amount of each destination station according to the destination space-time information of each freight to be transported comprises the following steps:

8. The method of claim 7, wherein determining the transportation route of the target object within the target time period based on the historical transportation data and the freight transportation volume of each destination site comprises:

9. The method as claimed in claim 1, further comprising, before the obtaining historical transportation data according to the destination spatiotemporal information of each cargo to be transported, the following steps:

identifying a transportation identification of the transportation task;

10. The method of claim 9, further comprising:

11. The method of claim 10, wherein determining the transportation route of the target object within the target time period according to the resculpting route and the destination sites according to the route planning strategy corresponding to the similarity comprises:

12. A transportation route planning apparatus comprising:

13. A computing device, comprising:

a memory and a processor;

the memory is for storing computer executable instructions and the processor is for executing the computer executable instructions which when executed by the processor implement the steps of the transportation route planning method of any one of claims 1 to 11.

14. A computer-readable storage medium storing computer-executable instructions that, when executed by a processor, perform the steps of the transportation route planning method of any one of claims 1 to 11.