Transportation route planning method and device

Abstract

The embodiments of this specification provide a method and device for transport route planning, wherein the method comprises: receiving a transport task of a target object within a target time period, wherein the transport task comprises the destination time-space information of each cargo to be transported; obtaining historical transport data according to the destination time-space information of each cargo to be transported, and counting the cargo transport volume of each destination station; determining the transport route of the target object within the target time period according to the historical transport data and the cargo transport volume of each destination station. This method can improve the efficiency and accuracy of transport route planning.

Description

Technical Field

[0001] The embodiments of the present specification relate to the field of computer technology, and in particular to a transportation route planning method. Background Art

[0002] With the development of market economy and the improvement of logistics specialization, transportation tasks have developed rapidly. In order to improve transportation efficiency and ensure that transportation tasks are relatively balanced in cost and timeliness, vehicle scheduling is required.

[0003] In the prior art, the transportation route is mainly planned manually, but the method has a low level of intelligence, and there are problems such as unreasonable transportation route arrangement and serious waste of transportation resources. Therefore, an effective solution is urgently needed to solve the above problems. Summary of the invention

[0004] In view of this, an embodiment of this specification provides a method for planning a transportation route. One or more embodiments of this specification also relate to a transportation route planning device, a computing device, a computer-readable storage medium, and a computer program to solve the technical defects existing in the prior art.

[0005] According to a first aspect of an embodiment of this specification, a transportation route planning method is provided, comprising:

[0006] Receiving a transportation task for a target object within a target time period, wherein the transportation task includes destination time and space information of each cargo to be transported;

[0007] According to the time-space information of the destination of each cargo to be transported, historical transportation data is obtained, and the cargo transportation volume of each destination station is counted;

[0008] The transportation route of the target object within the target time period is determined according to the historical transportation data and the cargo transportation volume of each destination site.

[0009] According to a second aspect of an embodiment of this specification, a transport route planning device is provided, including:

[0010] A receiving module is configured to receive a transportation task of a target object within a target time period, wherein the transportation task includes destination time and space information of each cargo to be transported;

[0011] A statistical module is configured to obtain historical transportation data according to the destination time-space information of each cargo to be transported, and to count the cargo transportation volume of each destination station;

[0012] The determination module is configured to determine the transportation route of the target object within the target time period according to the historical transportation data and the cargo transportation volume of each destination station.

[0013] According to a third aspect of an embodiment of this specification, a computing device is provided, including:

[0014] Memory and processor;

[0015] The memory is used to store computer executable instructions, and the processor is used to execute the computer executable instructions. When the computer executable instructions are executed by the processor, the steps of the above-mentioned transportation route planning method are implemented.

[0016] According to a fourth aspect of the embodiments of this specification, a computer-readable storage medium is provided, which stores computer-executable instructions, and when the instructions are executed by a processor, the steps of the above-mentioned transportation route planning method are implemented.

[0017] According to a fifth aspect of the embodiments of this specification, a computer program is provided, wherein when the computer program is executed in a computer, the computer is caused to execute the steps of the above-mentioned transportation route planning method.

[0018] The transportation route planning method provided in this specification receives a transportation task of a target object within a target time period, wherein the transportation task includes the destination time-space information of each cargo to be transported; based on the destination time-space information of each cargo to be transported, historical transportation data is obtained, and the cargo transportation volume of each destination station is counted; based on the historical transportation data and the cargo transportation volume of each destination station, the transportation route of the target object within the target time period is determined. The target transportation route corresponding to the target object within the target time period is determined by the historical transportation data and the cargo transportation volume of each destination station, which avoids the differences caused by manual line arrangement, can effectively improve the efficiency and accuracy of transportation route planning, and the transportation route can be accurately determined by the historical transportation data. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] Figure 1 is a flow chart of a transportation route planning method provided by an embodiment of this specification;

[0020] Figure 2A It is a schematic diagram of the processing process of a transport route planning platform in a transport route planning method provided by an embodiment of this specification;

[0021] Figure 2B It is a schematic diagram of the processing process of another transportation route planning method provided by an embodiment of this specification;

[0022] Figure 2C This is a schematic diagram of the effect of a transportation route planning method provided by an embodiment of this specification;

[0023] Figure 2DIt is a schematic diagram of a processing process of a transportation route planning platform in another transportation route planning method provided by an embodiment of this specification;

[0024] Figure 2E It is a comparison diagram of a replica route and a transport route in a transport route planning method provided in one embodiment of this specification;

[0025] Figure 3 is a processing flow chart of a transportation route planning method provided by an embodiment of this specification;

[0026] Figure 4 It is a structural schematic diagram of a transport route planning device provided by an embodiment of this specification;

[0027] Figure 5 It is a structural block diagram of a computing device provided by an embodiment of this specification. DETAILED DESCRIPTION

[0028] Many specific details are described in the following description to facilitate a full understanding of this specification. However, this specification can be implemented in many other ways than those described herein, and those skilled in the art can make similar generalizations without violating the connotation of this specification, so this specification is not limited to the specific implementation disclosed below.

[0029] The terms used in one or more embodiments of this specification are only for the purpose of describing specific embodiments, and are not intended to limit one or more embodiments of this specification. The singular forms of "a", "said" and "the" used in one or more embodiments of this specification and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings. It should also be understood that the term "and / or" used in one or more embodiments of this specification refers to and includes any or all possible combinations of one or more associated listed items.

[0030] It should be understood that although the terms first, second, etc. may be used to describe various information in one or more embodiments of this specification, this information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of one or more embodiments of this specification, the first may also be referred to as the second, and similarly, the second may also be referred to as the first. Depending on the context, the word "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".

[0031] First, the terms involved in one or more embodiments of this specification are explained.

[0032] Sites, also known as logistics sites, mainly include processing centers, stores, distribution stations and warehouses. From processing centers to fresh food processing centers, warehouses can be B2C (Bus iness-to-Consumer) warehouses, normal temperature warehouses, cold chain warehouses, etc.

[0033] Smart dispatch: In the traditional sense, dispatch means manually arranging the order of stops for drivers based on experience. Smart dispatch means calling algorithms based on different parameters and outputting the best solution.

[0034] Then, the transportation route planning method provided in this specification is briefly described.

[0035] With the development of the market economy and the improvement of the level of logistics specialization, transportation tasks have developed rapidly. In order to improve transportation efficiency and ensure that transportation tasks are relatively balanced in terms of cost and timeliness, vehicle scheduling is required. Truck scheduling is to help dispatchers plan and dispatch transportation tasks to ensure that transportation is relatively balanced in terms of cost and timeliness. When dispatchers generate scheduling plans, they need to fully consider the priority of timeliness and cost in the project scenario. In some scenarios, such as B2C or NB (self-pickup) links, it is necessary to prioritize transportation timeliness and ensure delivery before the user's pickup time. However, for B2B (Business-to-Business) links, there are not many requirements for timeliness, and they only need to be delivered within a fixed time period. At this time, transportation costs should be given priority, and the transportation loading rate needs to be increased.

[0036] In the existing technology, transportation routes are mainly planned manually, such as using manual scheduling to directly arrange routes; another example is to install a locator on the vehicle, and obtain the vehicle's real-time en route information, vehicle driver information, etc. by calling the locator provider's interface in real time, and display the obtained information on the map; at the same time, the decoupling of the third-party map provider can be called to obtain the vehicle's current speed and other information, and display it on the map, so as to achieve visual monitoring of the transport vehicle.

[0037] However, when a large number of transportation needs need to be met, manual connection of points requires a lot of manpower. When the number of points reaches a certain level, manual connection cannot complete the task. For example, in store transportation, there are no more than 50 stations in a city. The stations are few and fixed, and the cargo volume is stable. Manual connection can be arranged based on experience to obtain a better solution. However, in a certain self-pickup business scenario, a warehouse needs to deliver to hundreds or thousands of stations. The stations that need to be delivered each time are not fixed, and the cargo volume is unstable. Manual connection cannot be completed. In addition, the method has a low level of intelligence and relies too much on the experience of the dispatcher. There is a big gap between excellent dispatchers and general dispatchers in terms of timeliness and cost control. For example, manual connection cannot put the dispatching experience into the system, and the punctuality rate and cost fluctuation of the dispatcher's resignation are uncontrollable. When an excellent dispatcher sees the cargo volume, he can roughly estimate how many vehicles are needed and how long it takes to transport to several stations, while a general dispatcher cannot make accurate estimates. That is, there are problems such as unreasonable transportation route arrangement and serious waste of transportation resources.

[0038] Therefore, this specification provides a method for transport route planning, receiving a transport task of a target object within a target time period, wherein the transport task includes the destination time-space information of each cargo to be transported; according to the destination time-space information of each cargo to be transported, historical transport data is obtained, and the cargo transportation volume of each destination station is counted; according to the historical transport data and the cargo transportation volume of each destination station, the transport route of the target object within the target time period is determined. The target transport route corresponding to the target object within the target time period is determined by the historical transport data and the cargo transportation volume of each destination station, which avoids the differences caused by manual line arrangement, can effectively improve the efficiency and accuracy of transport route planning, and the target transport route can be accurately determined by the historical transport data.

[0039] In this specification, a transportation route planning method is provided. This specification also relates to a transportation route planning device, a computing device, and a computer-readable storage medium, which are described in detail one by one in the following embodiments.

[0040] See also Figure 1 , Figure 1 A flow chart of a transportation route planning method provided by an embodiment of the present specification is shown, which specifically includes the following steps.

[0041] Step 102: receiving a transportation task for a target object within a target time period, wherein the transportation task includes destination time-space information of each cargo to be transported.

[0042] The execution subject of the transportation route planning method may be a computing device with a transportation route planning function, such as a server or terminal with a transportation route planning function.

[0043] Specifically, the target object refers to something that transports goods, which may be a transport personnel, a transport vehicle, or a cargo plane, etc., and this specification does not limit this; the target time period refers to a pre-specified time period, such as the next day, the next week, etc.; a transportation task refers to a task generated when a user, company or organization has a demand for goods and then purchases or reserves goods, or returns goods, etc., which requires the delivery of goods, such as a user buying clothes through a shopping platform or a user delivering documents through an errand platform; the destination time-space information refers to at least one of the transportation starting point, transportation end point, estimated delivery time (arrival time), estimated sending time, site identification, etc. corresponding to the transportation task.

[0044] In actual applications, there are many ways to receive the transportation task of the target object within the target time period. For example, the operator may send a transportation route planning instruction to the execution entity, or send an instruction to receive the transportation task of the target object within the target time period. Accordingly, after receiving the instruction, the execution entity begins to carry out the transportation task of the target object within the target time period. Alternatively, the server may automatically obtain the transportation task of the target object within the target time period at preset time intervals. For example, after a preset time period, a server with a transportation route planning function automatically obtains the transportation task of the target object within the target time period in a specified access area. Or after a preset time period, a terminal with a transportation route planning function automatically obtains the transportation task of the target object within the target time period stored locally. This specification does not impose any restrictions on the method of receiving the transportation task of the target object within the target time period.

[0045] It should be noted that the transportation task includes the destination time and space information of each cargo to be transported. For example, the transportation task includes 2 pairs of trousers and 3 pairs of socks, and the destination time and space information of the 2 pairs of trousers and 3 pairs of socks are all to be delivered from A to B on March 13.

[0046] Step 104: According to the destination time-space information of each cargo to be transported, historical transportation data is obtained, and the cargo transportation volume of each destination station is counted.

[0047] Specifically, historical transportation data refers to the data corresponding to the target object when it performed the previous transportation task; the station refers to the starting point, end point and transfer station for transporting goods; the destination station refers to the final station to which a certain cargo needs to be transported; the cargo transportation volume refers to the quantity of cargo transported to the destination station.

[0048] In practical applications, after obtaining the transportation task of the target object within the target time period, further, according to the destination space-time information of each cargo to be transported in the transportation task, the historical transportation data related to each destination space-time information is obtained. For example, if the delivery date in the destination space-time information is March 15, the historical transportation data of February 15 is obtained according to the delivery date. If the destination in the destination space-time information is destination station A, the historical transportation data related to destination station A is obtained. And according to the destination space-time information, the cargo transportation volume of each destination station is counted. For example, according to the destination space information of each cargo to be transported in the transportation task, the destination station to which each cargo to be transported is to be delivered is determined, and then the cargo transportation volume of each destination station is determined. Among them, the destination space information is the information representing the space in the destination space-time information.

[0049] In one or more optional embodiments of the present specification, when acquiring historical transportation data according to the time-space information of the destination of each cargo to be transported, the time-space information of each destination can be input into a preset historical transportation data acquisition tool, and then the historical transportation data acquisition tool identifies the time-space information of each destination, obtains the identifier of the historical transportation data, and then acquires the corresponding historical transportation data from the preset historical transportation database according to the identifier. In this way, the efficiency of acquiring historical transportation data can be improved.

[0050] In one or more optional embodiments of the present specification, when acquiring historical transportation data according to the destination time-space information of each cargo to be transported, the historical transportation data can also be acquired according to the destination space information in the destination time-space information of each cargo to be transported. That is, when the destination time-space information includes the destination station identifier, the historical transportation data is acquired according to the destination time-space information of each cargo to be transported, and the specific implementation process can be as follows:

[0051] Determining the destination site of each of the goods to be transported according to the destination site identifier of each of the goods to be transported;

[0052] Obtain the historical transportation data corresponding to the destination site of each of the goods to be transported.

[0053] The destination site identifier is information representing the destination site in the destination space information, and may be the name of the destination site, the geographical location of the destination site, or the number of the destination site, which is not limited in this specification.

[0054] In practical applications, the destination site identifiers in the destination spatiotemporal information of each cargo to be transported are used to determine the destination sites pointed to by each destination site identifier, that is, the destination sites of each cargo to be transported are determined, and then historical transportation data related to the destination sites are obtained based on the destination sites. In this way, the accuracy of obtaining historical transportation data can be improved.

[0055] In one or more optional embodiments of the present specification, the destination time-space information includes a destination site identifier. In this case, the cargo transportation volume of each destination site can be counted based on the destination site identifier in each destination time-space information. That is, when the destination time-space information includes a destination site identifier, the cargo transportation volume of each destination site is counted based on each of the destination time-space information. The specific implementation process can be as follows:

[0056] For any destination site, the destination site identifier represents the destination time and space information quantity of the destination site, and the destination information quantity is determined as the cargo transportation volume of the destination site.

[0057] Specifically, the destination site identifier may be the name of the destination site, the geographical location of the destination site, or the number of the destination site, which is not limited in this specification; the number of destination space-time information refers to the number of destination space-time information that includes a certain destination site identifier.

[0058] In practical applications, the destination site identifier in the destination space-time information of each cargo to be transported is compared with each destination site to determine the cargo transportation volume of each destination site: for a certain destination site, the destination site identifier of each destination space-time information is compared with the destination site. If the destination site identifier of a certain destination space-time information represents the destination site, the number of destination space-time information is increased by one, which means that the cargo to be transported corresponding to the destination space-time information needs to be transported to the destination site, and the cargo transportation volume of the destination site is increased by one. The destination space-time information is traversed to determine the cargo transportation volume of the destination site. In this way, the number of destination space-time information is determined only by the destination site identifier of the destination space-time information, and then the cargo transportation volume of each destination site is determined. This not only avoids processing other information in the destination space-time information, but also reduces the amount of data processing, increases the rate of cargo transportation volume, and can also improve the accuracy of cargo transportation volume.

[0059] For example, there are two destination sites: destination site A and destination site B; there are five destination spatiotemporal information, of which the destination site identifier in the first destination spatiotemporal information is a, the destination site identifier in the second destination spatiotemporal information is b, the destination site identifier in the third destination spatiotemporal information is b, the destination site identifier in the fourth destination spatiotemporal information is a, and the destination site identifier in the fifth destination spatiotemporal information is a. Assuming that the destination site identifier a represents the destination site A, and the destination site identifier b represents the destination site B, then the number of destination spatiotemporal information represented by the destination site identifier for the destination site A is 3, that is, the cargo transportation volume of the destination site A is 3, and the number of destination spatiotemporal information represented by the destination site identifier for the destination site B is 2, that is, the cargo transportation volume of the destination site B is 2.

[0060] In one or more optional embodiments of the present specification, the transport task may correspond to different transport types, such as delivery transport of the user's purchased goods, or return transport of the user's purchased goods, that is, the transport task also includes a transport type identifier, and when the destination time-space information includes a destination end identifier or a destination starting identifier, and the destination station is the destination end or destination starting point of the goods transportation, the cargo transportation volume of the destination end or destination starting point can be determined according to the time-space information quantity. That is, when the transport task also includes a transport type identifier, the destination station identifier includes a destination end identifier or a destination starting point identifier, and the destination station is the destination end or destination starting point of the goods transportation, the cargo transportation volume of each destination station is counted according to the destination time-space information of each of the goods to be transported, and the specific implementation process can be as follows:

[0061] In the case where the transport type identifier is a purchase identifier, for any destination, determining the quantity of destination time-space information of the destination represented by the destination identifier, and determining the quantity of destination time-space information as the cargo transport volume of the destination;

[0062] When the transport type identifier is a return identifier, for any destination starting point, the quantity of destination time and space information of the destination starting point represented by the destination starting point identifier is determined, and the quantity of destination time and space information is determined as the cargo transportation volume of the destination starting point.

[0063] Specifically, the transport type identifier refers to the identifier of the transport type corresponding to the transport task; the purchase identifier indicates that the transport task is a transport task under the purchase scenario; the destination site identifier is the information representing the destination site in the destination space information, which can be the name of the destination site, the geographical location of the destination site, or the number of the destination site; the destination end identifier is the identifier of the destination site to which the purchase needs to be delivered, such as the destination site closest to the address of the user who purchased the goods; the destination starting point identifier is the identifier of the destination site to which the goods are sent when purchasing, that is, the identifier of the destination site to which the goods need to be delivered when returning, such as the destination site closest to the address of the merchant from which the goods were sent.

[0064] In actual application, if the transport type is identified as a purchase mark, it means that the transport task within the target time period is to deliver the goods purchased by the user. For any destination, the destination mark of each destination time-space information is compared with the destination. If the destination mark of a certain destination time-space information represents the destination, the number of destination time-space information is increased by one, which means that the goods to be transported corresponding to the destination time-space information need to be transported to the destination, and the cargo transportation volume of the destination is increased by one. The destination time-space information is traversed to determine the cargo transportation volume of the destination. Similarly, if the transport type is identified as a return mark, it means that the transport task within the target time period is to deliver the goods returned by the user. For any destination starting point, the destination starting point mark of each destination time-space information is compared with the destination starting point. If the destination starting point mark of a certain destination time-space information represents the destination starting point, the number of destination time-space information is increased by one, which means that the goods to be transported corresponding to the destination time-space information need to be transported to the destination starting point, and the cargo transportation volume of the destination starting point is increased by one. The destination time-space information is traversed to determine the cargo transportation volume of the destination starting point. In this way, the quantity of destination time-space information is determined only through the destination end point identifier or destination starting point identifier of the destination time-space information, and then the cargo transportation volume of each destination end point or destination starting point is determined. This not only avoids processing other information in the destination time-space information, reduces the amount of data processing, increases the rate of cargo transportation volume, but also improves the accuracy of cargo transportation volume.

[0065] Step 106: Determine the transportation route of the target object within the target time period according to the historical transportation data and the cargo transportation volume of each destination station.

[0066] Specifically, the transportation route refers to the route that the target object finally determines to transport the goods to be transported.

[0067] In practical applications, after obtaining historical transportation data and counting the cargo transportation volume to each destination station based on the spatiotemporal information of each destination, it is further necessary to perform data analysis and intelligent routing based on the historical transportation data and the cargo transportation volume of each destination station, so as to determine the route that the target object needs to travel to complete the transportation task within the target time period, that is, the transportation route.

[0068] In one or more optional embodiments of the present specification, the historical transportation data includes the historical on-site time of each of the destination sites and the historical resource consumption between each of the destination sites, and the destination time-space information also includes the destination arrival time. At this time, based on the historical on-site time, the historical resource consumption between each of the destination sites and the cargo transportation volume, the consumption of each link in the transportation process, and then based on the consumption and the destination arrival time, the route is arranged to determine the transportation route. That is, when the historical transportation data includes the historical on-site time of each of the destination sites and the historical resource consumption between each of the destination sites, and the destination time-space information also includes the destination arrival time, the transportation route of the target object within the target time period is determined based on the historical transportation data and the cargo transportation volume of each of the destination sites. The specific implementation process can be as follows:

[0069] According to the historical on-site time of each destination station and the cargo transportation volume of each destination station, the on-site consumption time of each destination station in the target time period is predicted;

[0070] Predicting the inter-station resource consumption of each destination site within the target time period according to the historical resource consumption between the destination sites;

[0071] The transportation route of the target object within the target time period is determined according to the destination arrival time, the time consumed in the station and the resource consumption between stations.

[0072] Specifically, the historical on-site time refers to the time the target object previously took to transport goods in and out of a destination station; the historical resource consumption refers to the resource value consumed by the target object in transporting goods between two destination stations.

[0073] In practical applications, for any destination station, the station consumption time of the destination station can be predicted within the target time period according to the historical station time and cargo transportation volume of the destination station, such as 10 minutes, half an hour, etc. Traverse each destination station and predict the time that the transportation task needs to consume at each destination station within the target time period, that is, predict the station consumption time of each destination station within the target time period. Then, according to the historical resource consumption between all the destination stations corresponding to this transportation task, the station-to-station resource consumption between each destination station is predicted within the target time period. Further, data analysis and line arrangement are performed based on the destination arrival time, station consumption time and station-to-station resource consumption, and then the transportation route of the target object within the target time period is determined. In this way, the station consumption time and station-to-station resource consumption of each destination station within the target time period are first predicted, and then the line arrangement is performed based on the destination arrival time, station consumption time and station-to-station resource consumption, and the transportation route of the target object within the target time period is determined, which can effectively improve the line arrangement efficiency and make the transportation route more accurate.

[0074] It should be noted that the historical transportation data includes the historical on-site time of each of the destination sites and the historical resource consumption between each of the destination sites. In this case, it is necessary to obtain the historical on-site time of each of the destination sites and the historical resource consumption between each of the destination sites. That is, in the case where the historical transportation data includes the historical on-site time of each of the destination sites and the historical resource consumption between each of the destination sites, the historical transportation data is obtained according to the destination time-space information of each of the goods to be transported. The specific implementation process can be as follows:

[0075] The historical on-site duration of each of the destination sites is obtained, and the historical resource consumption of the target object between the destination sites is obtained.

[0076] In practical applications, the historical on-site time corresponding to each destination station can be obtained from the historical on-site time library, and the historical resource consumption between each pair of destination stations can be obtained from the historical resource consumption library; the itinerary data of the target object in each destination station for transporting goods can also be obtained according to the destination station, and then the historical on-site time of the destination station and the historical resource consumption of the target object between each destination station can be calculated according to the formed data. In this way, the historical on-site time of each destination station and the historical resource consumption between each destination station are obtained to characterize the historical transportation data, so that the historical transportation data has a smaller granularity, so that the target transportation route determined based on the historical transportation data is more accurate, the cargo transportation is more efficient, and the user experience is further improved, and the user stickiness is improved.

[0077] In addition, the consumed resources can be time, cost, or both time and cost. That is, the historical resource consumption includes the historical inter-station consumption time and / or the historical inter-station cost consumption; at this time, when obtaining the historical resource consumption of the target object between each of the destination sites, it is necessary to obtain the historical inter-station consumption time and / or the historical inter-station cost consumption of the target object between each of the destination sites. The historical inter-station consumption time refers to the length of time consumed by the target object between two destination sites, and the historical inter-station cost consumption refers to the cost consumed by the target object between two destination sites. In this way, the historical inter-station consumption time and / or the historical inter-station cost consumption between each destination site are obtained to characterize the historical resource consumption, which further refines the historical transportation data, and even makes the granularity of the historical transportation data smaller, so that the target transportation route determined based on the historical transportation data is more accurate, and the cargo transportation is more efficient, which further improves the user experience and improves user stickiness.

[0078] In one or more optional embodiments of the present specification, the historical time at the station includes the historical arrival time and the historical departure time. At this time, the historical processing time of the destination station for processing unit cargo can be determined based on the historical arrival time, the historical departure time, and the historical cargo transportation volume in the historical transportation data, and the station consumption time of the destination station can be further determined based on the historical processing time of the unit cargo and the current cargo transportation volume. That is, when the historical time at the station includes the historical arrival time and the historical departure time, and the historical transportation data also includes the historical cargo transportation volume of each destination station, the station consumption time of each destination station in the target time period is predicted based on the historical time at the station and the cargo transportation volume of each destination station. The specific implementation process can be as follows:

[0079] According to the historical arrival time, historical departure time and historical cargo transportation volume of the first destination site, the historical processing time of the unit cargo in the first destination site is predicted, wherein the first destination site is any destination site;

[0080] The time consumed in the first destination station during the target time period is predicted based on the historical processing time of the unit cargo and the cargo transportation volume in the first destination station.

[0081] Specifically, historical arrival time refers to the time when the target object or other object enters a certain destination station in a certain historical transportation task; historical departure time refers to the time when the target object or other object leaves a certain destination station in a certain historical transportation task; historical cargo transportation volume refers to the amount of cargo loaded and unloaded at the destination station during the historical arrival time and historical departure time; historical handling time per unit of cargo refers to the time spent on handling a single cargo or a unit volume of cargo;

[0082] In practical applications, for any destination station, the historical time consumed at the destination station, that is, the historical time spent at the destination station, is determined based on the historical arrival time and historical departure time of the destination station. Then, the historical processing time per unit of cargo at the destination station is calculated based on the historical time spent at the destination station and the historical cargo transportation volume. The calculation process is shown in Formula 1. Furthermore, based on the historical processing time per unit of cargo at the destination station and the cargo transportation volume, the time consumed in the station for this transportation task at the destination station within the target time period is predicted. The calculation process is shown in Formula 2. In this way, the time consumed in the station can be determined more accurately, which is conducive to improving the accuracy of route planning.

[0083] Historical processing time per unit of cargo = historical time at the station / historical cargo transportation volume

[0084] = (historical departure time - historical arrival time) / historical cargo transportation volume (Formula 1) Time consumed in the station = historical processing time per unit of cargo * cargo transportation volume (Formula 2)

[0085] For example, if the historical departure time and arrival time of destination station A are 10:00 and 9:00 respectively, and the historical cargo transportation volume is 10, then the historical station time of destination station A is 60 minutes, and the historical processing time per unit of cargo is 6 minutes. If the cargo transportation volume of destination station A is 20, the time consumed in the station is 120 minutes.

[0086] In one or more optional embodiments of this specification, the inter-station resource consumption includes the inter-station consumption time or the inter-station cost consumption. At this time, the corresponding inter-station resource consumption can be obtained according to different requirements, such as time priority or cost priority, and the transportation route of this transportation task can be determined in combination with the destination arrival time and the in-station consumption time. That is, in the case where the inter-station resource consumption includes the inter-station consumption time or the inter-station cost consumption, the transportation route of the target object within the target time period is determined according to the destination arrival time, the in-station consumption time and the inter-station resource consumption. The specific implementation process can be as follows:

[0087] Receive a user's selection instruction for a route planning method sent by a client;

[0088] In the case where the selection instruction carries a time limit identifier, determining the transportation route of the target object within the target time period according to the destination arrival time, the time consumed in the station and the time consumed between stations;

[0089] In the case where the selection instruction carries a cost identifier, the transportation route of the target object within the target time period is determined according to the destination arrival time, the time consumed in the station and the cost consumption between stations.

[0090] Specifically, the route planning method refers to the requirement for route planning, such as time priority or cost priority; the selection instruction refers to the instruction triggered by the user selecting the route planning method; the time limit identifier refers to the identifier corresponding to the user's selection of the route planning method with time priority; the cost identifier refers to the identifier corresponding to the user's selection of the route planning method with cost priority; the inter-station consumption time refers to the length of time consumed between two destination stations; the inter-station cost consumption refers to the cost consumed between two destination stations.

[0091] In actual applications, users can select the route planning method they need through the client. If the user selects a time-priority route planning method, the selection instruction received locally carries a time-priority mark. At this time, it is necessary to perform route planning based on the destination arrival time, the time consumed in the station, and the time consumed between stations, and determine the transportation route of the target object within the target time period with time priority; if the user selects a cost-priority route planning method, the selection instruction received locally carries a cost mark. At this time, it is necessary to perform route planning based on the destination arrival time, the time consumed in the station, and the cost consumption between stations, and determine the transportation route of the target object within the target time period with cost priority. In this way, the transportation route of the object can be provided based on the different needs of customers, which greatly improves user stickiness.

[0092] In one or more optional embodiments of the present specification, before receiving the user's selection instruction for the route planning method sent by the client, it is necessary to provide a reference for the user to select the route planning method. That is, before receiving the user's selection instruction for the route planning method sent by the client, it also includes:

[0093] Calculate the total consumption time corresponding to each transportation route to be selected according to the consumption time within the station and the consumption time between stations;

[0094] Calculate the total cost consumption corresponding to each of the transportation routes to be selected according to the inter-station cost consumption;

[0095] The total time consumption and total cost consumption corresponding to each of the transportation routes to be selected are sent to the client for display, so that the user can select a route planning method according to the total time consumption and total cost consumption corresponding to each of the transportation routes to be selected.

[0096] Specifically, the transportation route to be selected refers to multiple initial routes obtained based on the preliminary arrangement of each destination station; the total consumption time refers to the total time required for the target object to complete the transportation task within the target time period through a certain selected transportation route; the total cost consumption refers to the cost amount required for the target object to complete the transportation task within the target time period through a certain selected transportation route.

[0097] In practical applications, preliminary route planning can be performed based on the destination stations of each cargo to be transported to obtain multiple transportation routes to be selected, and then the total consumption time corresponding to each transportation route to be selected is calculated based on the in-station consumption time of each destination station and the inter-station consumption time between each destination station, and the total cost consumption corresponding to each transportation route to be selected is calculated based on the inter-station cost consumption between each destination station. The total consumption time and total cost consumption corresponding to each transportation route to be selected are then displayed through the client for users to view, and users can select a route planning method based on the total consumption time and total cost consumption corresponding to each transportation route to be selected.

[0098] For example, there are three destination sites: destination site b1, destination site b2 and destination site b3, among which destination site b1 is the starting site; assuming that the intra-site consumption time of destination site b1, destination site b2 and destination site b3 are 10 minutes, 20 minutes and 15 minutes respectively, the total inter-site consumption time between destination site b1 and destination site b2 is 25 minutes, the total inter-site consumption time between destination site b1 and destination site b3 is 10 minutes, and the total inter-site consumption time between destination site b2 and destination site b3 is 30 minutes, the inter-site cost consumption from destination site b1 to destination site b2 is 6, the inter-site cost consumption from destination site b1 to destination site b3 is 8, the inter-site cost consumption from destination site b2 to destination site b3 is 9, and the inter-site cost consumption from destination site b3 to destination site b2 is 10. There are two transportation routes to be selected according to destination b1, destination b2 and destination b3: transportation route 1 to be selected is "destination b1→destination b2→destination b3"; transportation route 2 to be selected is "destination b1→destination b3→destination b2", then the total consumption time of transportation route 1 to be selected is 10+20+15+25+30=100 minutes, and the total cost consumption is 6+9=15; the total consumption time of transportation route 2 to be selected is 10+20+15+10+30=85 minutes, and the total cost consumption is 8+10=18. Then the total consumption time of 100 minutes and the total cost consumption of 15 for transportation route 1 to be selected, and the total consumption time of 85 minutes and the total cost consumption of 18 for transportation route 2 to be selected are sent to the client for display.

[0099] In one or more optional embodiments of the present specification, when the transport type identifier is a purchase identifier, after determining the cargo transportation volume of the destination, or when the transport type identifier is a return identifier, after determining the cargo transportation volume of the destination starting point, it is also necessary to determine the transportation route of the target object within the target time period based on the cargo transportation volume of the destination or the cargo transportation volume of the destination starting point, as well as historical transportation data. That is, according to the historical transportation data and the cargo transportation volume of each destination station, the transportation route of the target object within the target time period is determined, and the specific implementation process can be as follows:

[0100] In the case where the transport type identifier is a purchase identifier, taking the warehouse site as the starting point, determining the transport route of the target object within the target time period according to the historical transport data and the cargo transport volume of each destination;

[0101] When the transport type identifier is a return identifier, the transport route of the target object within the target time period is determined based on the warehouse site as the end point and the historical transport data and the cargo transport volume of each destination starting point.

[0102] In actual applications, when the transport type is identified as a purchase mark, the initial site, i.e., the warehouse site, is the departure site, i.e., the starting point; at this time, the warehouse site is used as the starting point, and data analysis and intelligent routing are performed based on historical transport data and the cargo transportation volume of each destination, so as to determine the route that the target object needs to travel to complete the transport task within the target time period, i.e., the transport route, so that forward routing can be achieved, and the materials are delivered from the warehouse site to each destination for sale, service, etc. When the transport type is identified as a return mark, the initial site, i.e., the warehouse site, is the delivery site, i.e., the destination of the goods. At this time, the warehouse site is used as the destination, and data analysis and intelligent routing are performed based on historical transport data and the cargo transportation volume of each destination starting point, so as to determine the route that the target object needs to travel to complete the transport task within the target time period, i.e., the transport route, so that reverse routing can be achieved, and the materials from the destination starting point are returned to the warehouse site.

[0103] It should be noted that users can participate in route planning through the client, such as adding some planning requirements, adjusting the route, etc. That is, according to the historical transportation data and the cargo transportation volume of each destination station, the transportation route of the target object within the target time period is determined. The specific implementation process can be as follows:

[0104] Receive additional planning parameters sent by the client;

[0105] The transportation route of the target object within the target time period is determined according to the historical transportation data, the cargo transportation volume of each destination site and the additional planning parameters.

[0106] Specifically, the additional planning parameters refer to the route planning parameters provided by the user based on planning requirements during route planning.

[0107] In actual applications, when planning a route, users can input some additional planning parameters through the client, or input user requirements. The client converts the additional planning parameters into planning parameters according to the user requirements, and then sends the additional planning parameters to the local. The local area analyzes the data of the additional planning parameters and arranges the routes intelligently based on the historical transportation data, the cargo transportation volume of each destination station, and the route that the target object needs to travel to complete the transportation task within the target time period, that is, the transportation route. In this way, by determining the transportation route based on the additional planning parameters, a transportation route that better meets the user's requirements can be obtained, which improves the accuracy of the transportation route, thereby improving the efficiency of cargo transportation and increasing user stickiness.

[0108] In one or more optional embodiments of the present specification, in order to improve the efficiency and accuracy of determining the transportation route, a route planning model can be pre-trained, and then the transportation route of the target object within the target time period can be determined based on the historical transportation data, the cargo transportation volume of each destination station, and the route planning model. That is, the transportation route of the target object within the target time period is determined based on the historical transportation data and the cargo transportation volume of each destination station. The specific implementation process can be as follows:

[0109] The historical transportation data and the cargo transportation volume of each destination site are input into a pre-trained route planning model to obtain a transportation route for the target object within the target time period, wherein the route planning model is trained based on sample transportation tasks carrying labeled routes.

[0110] Specifically, the route planning model refers to a pre-set neural network model or function; the sample transportation tasks refer to some pre-specified transportation tasks, which can be historical transportation tasks or planned transportation tasks; the label route refers to the route with better transportation effect corresponding to the sample transportation task, such as the transportation route with the shortest transportation time, or the transportation route with the lowest transportation cost.

[0111] In practical applications, a route planning model can be pre-trained: obtain a sample transport task with a labeled route, then input the sample transport task into a neural network model or function with a preset value, and the neural network model or function outputs the predicted transport route of the sample transport task; the predicted transport route and the labeled route carried by the sample transport task are input into a preset loss function to determine the loss value. Further, adjust the parameters of the neural network model or function according to the loss value, then continue to obtain a sample transport task with a labeled route, start the next round of training, stop training until the loss value is less than the preset threshold or the number of iterations reaches the preset number of iterations, and determine the trained neural network model or function as the route planning model.

[0112] In addition, after obtaining the historical transportation data and the cargo transportation volume of each destination station, the historical transportation data and the cargo transportation volume of each destination station can be sent to the trained route planning model, and the route planning model processes the historical transportation data and the cargo transportation volume of each destination station, and outputs the transportation route of the target object within the target time period. In this way, the route planning model can automatically arrange the transportation route based on the historical transportation data and the cargo transportation volume of each destination station, saving manpower and material resources, and improving the efficiency and accuracy of the determined transportation route, so as to better serve users.

[0113] In one or more optional embodiments of the present specification, in order to further improve the accuracy of the transportation route, different route planning models are set for different transportation consumption indicators. That is, before the historical transportation data and the cargo transportation volume of each destination station are input into the pre-trained route planning model to obtain the transportation route of the target object within the target time period, the specific implementation process can be as follows:

[0114] Receiving a transport consumption indicator, wherein the transport consumption indicator includes a transport time consumption indicator and / or a transport cost indicator;

[0115] Determine a route planning model corresponding to the transportation consumption index.

[0116] Specifically, the transportation consumption index refers to the consumption index to be achieved for the transportation of goods this time; the transportation time consumption index refers to the time consumption index to be achieved for the transportation of goods this time; and the transportation cost index refers to the cost consumption index to be achieved for the transportation of goods this time.

[0117] In actual applications, the display panel will display transportation consumption indicators for users to select, such as transportation time consumption indicators, transportation cost indicators, and transportation time consumption indicators and transportation cost indicators. Users can select corresponding transportation consumption indicators according to their needs, that is, receive transportation consumption indicators, and then obtain corresponding route planning models based on the received transportation consumption indicators.

[0118] For example, if the transportation consumption indicator is a transportation time consumption indicator, then a route planning model is obtained for determining the transportation route based on the transportation time consumption; for another example, if the transportation consumption indicator is a transportation cost indicator, then a route planning model is obtained for determining the transportation route based on the transportation cost; for another example, if the transportation consumption indicator is a transportation time consumption indicator and a transportation cost indicator, then a route planning model is obtained for determining the transportation route based on the transportation time consumption and the transportation cost.

[0119] In one or more optional embodiments of the present specification, in order 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 cargo transportation volume of each destination station are input into the pre-trained route planning model to obtain the transportation route of the target object within the target time period, the specific implementation process can be as follows:

[0120] Obtaining a transportation scene identifier of the target object;

[0121] Determine a route planning model corresponding to the transportation scenario identifier.

[0122] Specifically, the transport scene identification refers to the name, number, etc. corresponding to the transport scene.

[0123] In actual applications, there will be transportation scene logos for users to choose from on the display panel, such as vegetable transportation scene logos, clothing transportation scene logos, and errand scene logos in the same city. Users can select the corresponding transportation scene logo according to their needs, that is, obtain the transportation scene logo, and then obtain the corresponding route planning model based on the obtained transportation scene logo. In this way, different route planning models can be obtained for different transportation scenarios, which is conducive to improving the accuracy of the target transportation route, thereby improving the efficiency of cargo transportation and increasing user stickiness.

[0124] In one or more optional embodiments of the present specification, after the transportation route is determined, the transportation route can be displayed to the user, and if the user is not satisfied with the transportation route, the transportation route can be adjusted. That is, after determining the transportation route of the target object within the target time period based on the historical transportation data and the cargo transportation volume of each destination station, it also includes:

[0125] sending the transport data to the client for display;

[0126] When a route adjustment instruction for the transportation data is received, the transportation route is adjusted according to the adjustment parameters carried in the route adjustment instruction to obtain an adjusted transportation route.

[0127] Specifically, the route adjustment instruction refers to an instruction sent by a user or a user through a server to adjust a transportation route; the adjustment parameter refers to adjusting the parameters of the transportation route so that the transportation route is improved to become a transportation route that meets the needs of the user.

[0128] In practical applications, intelligent routing can be performed based on historical transportation data and the cargo transportation volume of each destination station, thereby determining the route that the target object needs to travel to complete the transportation task within the target time period, that is, the transportation route of the target object within the target time period. The transportation route is then displayed to the user through the client. If a route adjustment instruction is received to adjust the transportation route, the transportation route is adjusted according to the adjustment parameters in the route adjustment instruction to obtain an adjusted transportation route.

[0129] It should be noted that, when a route adjustment instruction is received, the transport route is adjusted according to the adjustment parameters carried in the route adjustment instruction. If a route adjustment instruction is received again, the adjusted transport route needs to be adjusted again. In this way, by adjusting the transport route, a transport route that better meets the user's requirements can be obtained, which improves the accuracy of the transport route, thereby improving the efficiency of cargo transportation and increasing user stickiness.

[0130] In addition, after the transportation route is determined, the transportation index corresponding to the transportation route can also be determined, and then the transportation route and the transportation index can be displayed to the user. That is, after the transportation route of the target object within the target time period is determined based on the historical transportation data and the cargo transportation volume of each destination station, the transportation index corresponding to the transportation route needs to be calculated; the transportation route and the transportation index are sent to the client for display. Among them, the transportation index refers to the parameter information of the transportation route, such as the time to reach a certain destination station, the course, the running time, the loading rate and other indicators. In this way, the user can simply and intuitively view the transportation index of the transportation route, and provide the relevance to the user.

[0131] See also Figure 2A , Figure 2AA schematic diagram of the processing process of a transport route planning platform in a transport route planning method provided by an embodiment of the present specification is shown: the transport management system receives an order, that is, a transport task within a target time period, and the transport task includes a transport date, a starting point and an end point, that is, the destination time and space information, and may also include cargo attribute information, such as the weight, quantity and volume of the cargo to be transported. Then the order is imported / synchronized into the visual intelligent line arrangement for planning, and the order is circled by the visual intelligent line arrangement, that is, the order, including the delivery date, temperature layer type and task line, etc. Further, all the information is summarized for cargo volume statistics, that is, the cargo transportation quantity of each destination station is determined according to the destination time and space information, and further, according to the line arrangement strategy, such as line arrangement preference (time priority and cost priority), vehicle model rules and order cut-off rules, etc., the transport route is automatically generated based on the intelligent line arrangement, and the transport route can also be generated based on the manual line arrangement. Afterwards, the transport route can be adjusted, and then a waybill can be generated or the transport route can be exported. Further, the transport route is exported / synchronized, and the vehicle is dispatched, and then the cargo is transported according to the vehicle dispatching plan, and the cargo transportation process is monitored while charging.

[0132] In addition, the transportation management system provides the basic capabilities for building routing, including forward routing (such as sending materials from the warehouse to the store for sale), reverse routing (such as routing for return-related tasks), pre-routing (such as predicting the transportation routes for the next few days by predicting the cargo volume) and tracing (adding stations to the already scheduled transportation routes. After the advance routing, some stations have additional cargo. After the warehouse operation is issued, the operation information is added); it supports manual intervention, imports manual routing, and copies the routing of a previous day for map page display; it can obtain path data in advance for use in determining the transportation route calculation; it supports strategic, white-box, and simulation|trial calculation of transportation routes.

[0133] In addition, the transportation route planning platform has accumulated the ability of routing algorithms, which can predict the rhythm of departure, depict the navigation time in transit, predict the operation time of the station and depict the vehicle loading. For example, according to the time of historical vehicle entry and exit of a destination station, the historical average loading time (historical exit time-historical arrival time) is calculated, that is, the rhythm of departure is predicted; the average transit time is obtained according to the historical navigation time; according to (historical exit time-historical arrival time) / historical cargo transportation volume = historical single piece operation time (historical processing time of unit cargo), and historical single piece operation time * cargo transportation volume = expected station operation time (consumption time in the station); according to historical data, the maximum volume of a transport vehicle is xxx pieces / xxx orders and other information. It can also accumulate multiple navigation methods and provide navigation services, such as cost priority and familiar road priority for users to choose, that is, road network / timeliness.

[0134] The transportation management system can also build routing strategy capabilities, such as routing strategy, which precipitates routing-related parameters, standardizes them and provides them to users, allowing users to modify parameters according to their needs and obtain results that are more suitable for their project scenarios; another example is indicator visualization, which presents routing results with indicators and visualizes the logistics network, clearly indicating the sites (location information, vehicle type constraints, time windows and container constraints), routes (distance timeliness and block division), vehicle types (carrying capacity and loading and unloading time) and capacity to be reached, and can also display indicators such as arrival time, mileage, running time, and loading rate.

[0135] The transportation management system has a certain platform foundation, mainly including the tenant system, account system, organizational structure, authority system and configuration center. Visual intelligent routing can interact with the METIS algorithm (based on multi-level recursive binary segmentation method, multi-level K-way segmentation method and multi-constraint partitioning mechanism) platform. Visual intelligent routing provides rule input for the METIS algorithm platform. The METIS algorithm platform outputs feedback algorithms such as the road network / time efficiency provided by the navigation service, the rules input by the visual intelligent routing, tenant registration, strategy configuration, algorithm output and learning optimization to the visual intelligent routing. Among them, tenant registration can be provided by the platform foundation for the METIS algorithm platform, and the logistics network can provide basic data for the METIS algorithm platform for learning and optimization.

[0136] The transport route planning provided by one or more embodiments of this specification has two indicator outputs and two product outputs, of which the two indicator outputs are: timeliness index, line dispatch time, order cut-off time, planned arrival time at each station, planned departure time at each station, planned time in place, duration in transit, and duration of operation within the station; cost index, number of string points, total cargo volume, total volume, total weight, and loading rate. The two product outputs are: intelligent line arrangement, which replaces manual line arrangement to improve efficiency; data analysis capability, which displays the line arrangement results in a digital way and optimizes the input parameters according to the results. A set of intelligent line arrangement algorithms has also been developed: arrange routes according to data such as stations and cargo volume; call historical data in real time to obtain station operation time and duration in transit; and dispatch vehicles in a rolling manner, where vehicles can be dispatched according to shifts or intervals. In addition, the transportation timeliness can be accurately predicted, and historical data can be used to accurately feedback the arrival and departure time; guide drivers and station operations and make preparations in advance; hold people accountable afterwards, analyze management issues, and improve efficiency. Not only has a unified data center for wiring has been established: a large amount of historical operation data, on-site operation time, warehouse outbound time, etc.; the wiring results have been precipitated with relevant indicator data, and the wiring can be analyzed at a glance after completion; ADB (Analytical Database Mysql) distributed storage is used, which supports full index query and has super powerful data analysis capabilities. It can quickly access new tasks, and new project access only requires importing basic site data to use it. When adding historical operation data, the docking navigation can produce more accurate wiring results.

[0137] In one or more optional embodiments of the present specification, different route planning methods are required for transport tasks with different transport identifiers. That is, before acquiring historical transport data according to the destination spatiotemporal information of each of the goods to be transported, the method further includes:

[0138] A transport identifier identifying the transport task;

[0139] Accordingly, the acquisition of historical transportation data according to the destination time-space information of each cargo to be transported includes:

[0140] In the case where the transport identifier is a dynamic transport identifier, historical transport data is acquired according to the destination time-space information of each of the goods to be transported, wherein the dynamic transport identifier indicates that the change between the transport task and the historical transport task is greater than a preset value.

[0141] Specifically, the transport identifier represents the transport task scenario corresponding to the transport task; the dynamic transport identifier represents that the change between the transport task and the historical transport task is greater than a preset value, that is, the transport route is not fixed every day or within a period of time, and varies greatly. For example, for self-pickup purchases, the destination site is uncertain every day based on the order placed by the client user, and the transport route needs to be recalculated every day.

[0142] In actual applications, after obtaining the transportation task of the target object within the target time period, the transportation identification of the transportation task is identified. If the transportation identification is a dynamic transportation identification, the historical transportation data is obtained according to the destination time and space information of each cargo to be transported in the transportation task, and the cargo transportation volume of each destination station is counted. Further, based on the historical transportation data and the cargo transportation volume of each destination station, the transportation route of the target object within the target time period is determined. In this way, the corresponding route planning method is selected based on the transportation identification, which can improve the accuracy of determining the transportation route.

[0143] In one or more optional embodiments of the present specification, the transport identifier may be a static transport identifier. In this case, the transport route is determined based on the static transport identifier, that is:

[0144] In the case where the transport identifier is a static transport identifier, a replica route is obtained according to the transport task, wherein the static transport identifier indicates that the change between the transport task and the historical transport task is less than or equal to a preset value, and the replica route is any historical transport route;

[0145] Determine the similarity between the multiple historical sites included in the replica route and each destination site;

[0146] According to the route planning strategy corresponding to the similarity, the transportation route of the target object within the target time period is determined based on the replica route and the destination sites.

[0147] Specifically, the dynamic transport identifier indicates that the change between the transport task and the historical transport task is less than or equal to a preset value, that is, the transport route changes little every day or within a period of time, such as trunk line transport and point-to-point transport.

[0148] In actual applications, after obtaining the transportation task of the target object within the target time period, the transportation identification of the transportation task is identified. If the transportation identification is a static transportation identification, the historical transportation route and / or the alternative transportation route are obtained, and then a route is selected from the historical transportation route and / or the alternative transportation route as the replica route. Further, the similarity between the replica route and each destination site is calculated, that is, the similarity between the multiple historical sites contained in the replica route and each destination site. Then, a route planning strategy corresponding to the similarity is selected, and then the replica route and each destination site are analyzed according to the route planning strategy, that is, the replica route is adjusted based on each destination site to determine the transportation route of the target object within the target time period. In this way, the transportation route can be determined based on the replica route, which can reduce the time consumption of route planning in complex scenarios, gain more time for warehouse production and subsequent real-time transportation, and reduce the cost and threshold of route planning.

[0149] It should be noted that the replica route can be a plurality of historical transport routes selected from a set of historical transport routes within a period of time, whose historical cargo volume is close to the cargo volume of this transport task and has a high score, and the plurality of historical transport routes are sorted according to the weighted score, and then a historical transport route is selected as the replica route according to the preset conditions or preset parameters. Alternatively, a satisfactory alternative transport route is obtained by other methods such as line arrangement trial calculation, and the alternative transport route is used as the replica route. Alternatively, a transport route is selected from multiple historical transport routes and alternative transport routes according to the preset conditions or preset parameters as the replica route.

[0150] In one or more optional embodiments of this specification, the similarity can be compared with a preset similarity threshold. If it is greater than, a point-to-point precise matching strategy is selected for route planning. If it is not greater than, a face-to-point inclusion matching strategy is selected for route planning. That is, according to the route planning strategy corresponding to the similarity, the transportation route of the target object within the target time period is determined according to the replica route and the destination sites. Specifically, it can be as follows:

[0151] If the similarity is greater than a preset similarity threshold, for any destination site, determine whether the replica route includes the destination site, and determine the transportation route of the target object within the target time period according to the determination result;

[0152] If the similarity is less than or equal to the similarity threshold, determine the transportation surface corresponding to the replica route, identify whether the transportation surface includes any destination site for any destination site, and determine the transportation route of the target object within the target time period based on the identification result.

[0153] In practical applications, after calculating the similarity between multiple historical sites and each destination site included in the replica route, different route planning strategies are selected according to the preset similarity threshold. If the similarity is greater than the preset similarity threshold, the point-to-point precise matching strategy is used: for any destination site, determine whether the destination site exists in the replica route. If so, add the destination site to the transportation route. If not, do not add it to the transportation route. Traverse all destination sites to obtain the transportation route of the target object within the target time period. If the similarity is not greater than the preset similarity threshold, use the face-to-point inclusion matching strategy: first determine the transportation surface corresponding to the replica route, that is, the convex hull, for any destination site, determine whether the destination site exists in the transportation surface. If so, add the destination site to the transportation route. If not, do not add it to the transportation route. Traverse all destination sites to obtain the transportation route of the target object within the target time period. In this way, the transportation route can be determined based on the replica route, which can reduce the time consumption of route planning in complex scenarios, gain more time for warehouse production and subsequent real-time transportation, and reduce the cost and threshold of route planning.

[0154] In addition, for the case where the similarity is not greater than the preset similarity threshold, after the transportation route is determined, for the unscheduled stations, that is, the distance between the stations that have not been added to the transportation route and the transportation route, if the distance is less than the preset accommodation threshold, it is only necessary to further determine whether the current station can be accommodated after joining the route and whether the fulfillment time limit can be met. If all of them are met, the unscheduled station will be added to the transportation route. If not all of them are met, it will not be added to the transportation route.

[0155] See also Figure 2B , Figure 2B A schematic diagram of the processing process of another transportation route planning method provided by an embodiment of the present specification is shown: the similarity between the replica route and the destination site is calculated, and then it is determined whether the similarity is greater than a similarity threshold.

[0156] If so, perform point-to-point precise matching: count the site set in the replica route, and then perform point-to-point precise matching according to longitude and latitude, that is, determine whether each destination site exists in the replica route based on the longitude and latitude of each site in the site set. For a certain destination site, if it exists, it will be included in the transportation route. If it does not exist, it will not be included in the transportation route. Traverse all destination sites, generate a transportation route, and then output the transportation route.

[0157] If not, perform face-to-point inclusion matching: first calculate the convex hull (minimum circumscribed polygon) of the stations in the replica route, that is, the transport surface, and then perform face-to-point inclusion matching according to the graphic (convex hull) relationship, that is, match each destination station one by one to see if it is included in the current convex hull. If it is included, it will be included in the transport route. If not, it will not be included in the transport route. Traverse all destination stations to generate a transport route. In order to further reduce the work of the dispatcher, after completing the above steps, you can also calculate the distance between the unscheduled station and the transport route to determine whether the distance is greater than the accommodation threshold. If not, you need to calculate the loading capacity and estimated timeliness of the transport route, and further determine whether the loading capacity and timeliness are met after adding the unscheduled station, that is, determine whether the current station can be loaded and meet the performance timeliness after joining the route. If so, add the unscheduled station to the transport route. If not, do not add the unscheduled station to the transport route. After traversing all destination stations, output the transport route.

[0158] See also Figure 2C , Figure 2C A schematic diagram of the effect of a transportation route planning method provided by an embodiment of the present specification is shown: the replica route includes stations 1-7, and the destination stations include stations 1-5 and 7-10, among which station 6 does not need to be wired, and stations 8, 9, and 10 are newly added stations relative to the replica route. For point-to-point precise matching: the destination station will be compared one by one to see if it exists in the replica route. If it does, it will be included in the corresponding transportation route. Therefore, stations 1-6 and 7 are included in the transportation route, and stations 8-10 are not included in the transportation route. The dispatcher can adjust it manually. Face point inclusion matching, calculate the convex hull of the replica route (the minimum circumscribed polygon, i.e. Figure 3 The polygon in the convex hull is collected and compared to see if each destination station is included in the transport route. If so, it is included in the transport route. Stations 1-5 and 7-8 are included in the transport route. Then, the distances from the unranked stations to the transport route are calculated. If the distance from the unranked station 9 to the transport route is less than the accommodation threshold, and the distance from the unranked station 10 to the transport route is greater than the accommodation threshold, station 9 is included in the transport route, and station 10 is not included in the transport route.

[0159] See also Figure 2D , Figure 2D A schematic diagram of the processing process of a transport route planning platform in another transport route planning method provided by an embodiment of the present specification is shown: the transport route planning platform includes three units, namely a transport scheduling preparation unit for recommending suitable high-quality historical transport routes; a route replication unit for actually replicating routes, completing line arrangement and scheduling; and a transport operation and statistics unit for performing practical operations based on the transport routes and separately counting the practical operation results to feed back the next line arrangement and scheduling.

[0160] Transport scheduling preparation unit: Receives cargo transportation volume of each destination station through the transport management system, that is, receives the transport task, and searches for scheduling results with similar cargo volume and high scores from historical transport routes within a period of time (such as the last 2 months): such as calculating the first similarity with the historical cargo transportation volume and the historical scheduling result score, and then sorting them according to the weighted score, and recommending high-quality historical transportation routes that can be used for replication to the dispatcher. After comparison, the dispatcher selects a suitable historical transportation route as the replication route, that is, the dispatcher selects the replication route; or if the dispatcher finds a more satisfactory historical route after replication, he can also re-initiate replication; in addition to historical transportation routes, the dispatcher can also obtain satisfactory route planning results through other methods such as line arrangement and trial calculation, that is, the route planning results actively selected by the dispatcher, and then initiate route replication after importing it into the system, that is, the dispatcher selects the replication route.

[0161] Route replication unit: responsible for completing the replication of routes and the recommendation of transport capacity. In different scenarios, the number or changes of destination sites may vary greatly. For example, in the scenario where users buy groceries online, the destination sites change greatly, and in the non-promotional scenario, the destination sites change little, with a similarity rate of about 70%; in the scenario where users go to the store to buy groceries offline, because the destination sites cover a large number of people and are all self-operated, the similarity rate is basically 100%. Such differences will put forward different requirements for route review. Therefore, the second similarity between the replicated route and the destination site is calculated first, and then it is determined whether the second similarity is greater than the similarity threshold. If a point-to-point precise matching strategy is adopted, a better replication effect can be achieved; if not, if the precise matching strategy is still adopted, a large number of sites will not belong to the transportation route, and the dispatcher will still need to spend a lot of time to adjust. Therefore, the use of the face-to-point inclusion matching strategy has achieved greater flexibility and reduced the work of the dispatcher. Then output the transportation route. After obtaining the transportation routes, the driver's vehicle dispatching work needs to be carried out. By obtaining the driver's familiarity with the site and the driver's familiarity with the route, and weighted summing and counting them on the transportation route, the best matching capacity information for each transportation route is obtained, that is, the recommended driver is obtained, and then the line dispatching result is output. In this way, after a driver has been running in the same area for several consecutive days, his familiarity with this area will increase, and the driver will continue to serve this area, improving the driver's transportation and handover efficiency.

[0162] Transport operation and statistics unit: After the line scheduling result is obtained, the dispatcher determines and submits the line scheduling result. Further enter the transport operation, and after the transport operation is completed, calculate the scheduling result, calculate the driver's familiarity with the site (for example, every time the driver arrives at site A during the operation, the driver's familiarity with the site +1) and the driver's familiarity with the route (every time the driver goes from site A to site B during the operation, the driver's familiarity with route AB +1), which is used to provide a data basis for future line scheduling. Among them, the scheduling result: the assessment of this transportation task is mainly the timeliness assessment of arrival and departure.

[0163] In this way, drivers who are familiar with the routes and stations are selected to perform transportation tasks based on their familiarity, which can avoid dependence on driver navigation and reduce navigation costs; by replicating routes, dispatcher efficiency can be improved, warehouses can reduce their dependence on full-time dispatchers, and the threshold for dispatchers can be lowered, helping dispatchers to iterate the routing results more easily and improve the routing scheduling effect. At the same time, based on point-to-point precise matching or face-to-point inclusion matching, it can improve vehicle efficiency and reduce transportation costs while meeting timeliness, and be compatible with a variety of special scenarios such as cargo volume fluctuations and station fluctuations.

[0164] See also Figure 2E , Figure 2E This is a comparison chart of a replica route and a transport route in a transport route planning method provided in an embodiment of this specification: the replica route is District A of a certain city - Route 5, where the carrier is Company B, the driver is Xiao Hong, the license plate number is 123456, there are 10 stations, the total mileage and forward mileage are both 12 kilometers, the total cargo volume is 20 pieces, the volume is 0.5 cubic meters and the weight is 25 kilograms, and the replica route is marked with the order of station distribution, and the original order will be retained during the copying process. The transport route is District A of a certain city - Route 5, where the carrier is Company B, the driver is Xiao Ming, the license plate number is 654321, there are 8 stations, the total mileage and forward mileage are both 10 kilometers, the total cargo volume is 15 pieces, the volume is 0.4 cubic meters and the weight is 20 kilograms, and the transport route is marked with the order of station distribution.

[0165] The transportation route planning method provided in this specification receives a transportation task of a target object within a target time period, wherein the transportation task includes the destination time-space information of each cargo to be transported; based on the destination time-space information of each cargo to be transported, historical transportation data is obtained, and the cargo transportation volume of each destination station is counted; based on the historical transportation data and the cargo transportation volume of each destination station, the transportation route of the target object within the target time period is determined. The target transportation route corresponding to the target object within the target time period is determined by the historical transportation data and the cargo transportation volume of each destination station, which avoids the differences caused by manual line arrangement, can effectively improve the efficiency and accuracy of transportation route planning, and the transportation route can be accurately determined by the historical transportation data.

[0166] In addition, by determining the transportation route through the route planning model, both cost and timeliness can be taken into account. That is, a value with a better theoretical effect can be calculated based on historical transportation data, and the lowest cost line arrangement result can be obtained while ensuring timeliness. Through historical transportation data, the historical operation time between stations and within stations can be obtained, that is, the historical station time of the destination station and the historical resource consumption between the destination stations, and the completion time of the transportation task can be calculated more accurately. Through this time, the warehouse operation time can be reversed, and the warehouse can be driven by transportation. In addition, combined with historical transportation data, positioning data and truck navigation reception, the in-transit time and station operation time (station consumption time) can be predicted, and accurate predictions can be made for multiple routes in the future in real time, providing a more accurate prediction time for receiving and picking up goods at subsequent stations.

[0167] The following combination Figure 3 Taking the application of the transportation route planning method provided in this specification in the vegetable transportation scenario as an example, the transportation route planning method is further explained. Figure 3 A processing flow chart of a transportation route planning method provided by an embodiment of the present specification is shown, which specifically includes the following steps.

[0168] Step 302: Receive the vegetable transportation task of the target object within the target time period, wherein the vegetable transportation task includes the destination time and space information of each vegetable to be transported.

[0169] Step 304: Identify the transportation identification of the vegetable transportation task.

[0170] Step 306: When the transport identifier is a dynamic transport identifier, the destination site of each vegetable to be transported is determined according to the destination site identifier included in the destination space-time information of each vegetable to be transported.

[0171] Among them, the dynamic transportation mark indicates that the change between the transportation task and the historical transportation task is greater than the preset value.

[0172] Step 308: Obtain the historical transportation data corresponding to the destination site of each vegetable to be transported.

[0173] Step 310: According to the destination time and space information of each vegetable to be transported, the transportation volume of vegetables at each destination station is counted.

[0174] Optionally, the destination spatiotemporal information includes a destination site identifier;

[0175] According to the time and space information of the destination of each vegetable to be transported, the transportation volume of vegetables at each destination station is counted, including:

[0176] For any destination site, determine the destination site identifier to represent the destination time and space information quantity of the destination site, and determine the destination time and space information quantity as the vegetable transportation volume of the destination site.

[0177] Optionally, the transport task further includes a transport type identifier; the destination station identifier includes a destination end identifier or a destination starting point identifier, and the destination station is the destination end or destination starting point of the vegetable transport;

[0178] For any destination station, the destination station identifier is used to determine the quantity of destination time-space information of the destination station, and the quantity is determined as the vegetable transportation volume of the destination station, including:

[0179] In the case where the transport type identifier is a purchase identifier, the destination time-space information quantity of the destination represented by the destination identifier is determined, and the destination time-space information quantity is determined as the vegetable transport volume of the destination;

[0180] When the transport type is identified as a return mark, the quantity of destination time and space information of the destination starting point represented by the destination starting point identifier is determined, and the quantity of destination time and space information is determined as the vegetable transport volume of the destination starting point.

[0181] Step 312: Based on the historical on-site time of each destination station and the vegetable transportation volume of each destination station, the on-site consumption time of each destination station within the target time period is predicted.

[0182] Optionally, the historical time at the station includes historical arrival time and historical departure time, and the historical transportation data also includes historical vegetable transportation volume of each destination station;

[0183] According to the historical on-site time of each destination station and the vegetable transportation volume of each destination station, the on-site consumption time of each destination station in the target time period is predicted, including:

[0184] According to the historical arrival time, historical departure time and historical vegetable transportation volume of the first destination station, the historical processing time of the unit vegetables in the first destination station is predicted, wherein the first destination station is any destination station;

[0185] According to the historical processing time of units of vegetables and the transportation volume of vegetables in the first destination station, the consumption time within the first destination station within the target time period is predicted.

[0186] Step 314: According to the historical resource consumption between the destination sites, the inter-site resource consumption of each destination site within the target time period is predicted.

[0187] Step 316: Determine the transportation route of the target object within the target time period according to the destination arrival time, the time consumed in the station, and the resource consumption between stations.

[0188] Optionally, the inter-station resource consumption includes inter-station consumption time or inter-station cost consumption;

[0189] Determine the transportation route of the target object within the target time period based on the destination arrival time, the time spent in the station, and the resource consumption between stations, including:

[0190] Receive a user's selection instruction for a route planning method sent by a client;

[0191] When the selection instruction carries a time limit mark, the transportation route of the target object within the target time period is determined according to the destination arrival time, the time consumed in the station and the time consumed between stations;

[0192] When the instruction is selected to carry a cost identifier, the transportation route of the target object within the target time period is determined based on the destination arrival time, the time consumed within the station, and the cost consumption between stations.

[0193] Optionally, before receiving the user's selection instruction for the route planning method sent by the client, the method further includes:

[0194] Calculate the total time consumption for each transportation route to be selected based on the time consumption within the station and the time consumption between stations;

[0195] According to the inter-station cost consumption, calculate the total cost consumption corresponding to each transportation route to be selected;

[0196] The total time consumption and total cost consumption corresponding to each transportation route to be selected are sent to the client for display, so that the user can select a route planning method according to the total time consumption and total cost consumption corresponding to each transportation route to be selected.

[0197] Optionally, based on historical transportation data and the vegetable transportation volume of each destination station, a transportation route of the target object within a target time period is determined, including:

[0198] When the transport type is marked as a purchase mark, the transport route of the target object within the target time period is determined based on the historical transport data and the vegetable transport volume of each destination, taking the warehouse site as the starting point;

[0199] When the transport type is identified as a return mark, the warehouse site is taken as the end point, and the transport route of the target object within the target time period is determined based on the historical transport data and the vegetable transport volume of each destination starting point.

[0200] Step 318: Receive the planning additional parameters sent by the client.

[0201] Step 320: Determine the transportation route of the target object within the target time period based on historical transportation data, the vegetable transportation volume of each destination station, and additional planning parameters.

[0202] Step 322: When the transport identifier is a static transport identifier, a replica route is obtained according to the vegetable transport task.

[0203] Among them, the static transport mark indicates that the change between the transport task and the historical transport task is less than or equal to the preset value, and the replica route is any historical transport route;

[0204] Step 324: Determine the similarity between the multiple historical sites included in the replica route and each destination site.

[0205] Step 326: If the similarity is greater than a preset similarity threshold, for any destination site, determine whether the replica route includes the destination site.

[0206] Step 328: Determine the transportation route of the target object within the target time period according to the judgment result.

[0207] Step 330: If the similarity is less than or equal to the similarity threshold, determine the transportation surface corresponding to the replica route.

[0208] Step 332: For any destination site, identify whether the transportation surface includes the destination site, and determine the transportation route of the target object within the target time period according to the identification result.

[0209] Step 334: Calculate the transportation index corresponding to the transportation route, and send the transportation route and the transportation index to the client for display.

[0210] The transportation route planning method provided in this specification determines the transportation route corresponding to the target object through historical transportation data and the vegetable transportation volume of each destination station, avoiding the differences caused by manual line arrangement, and can effectively improve the efficiency and accuracy of transportation route planning. Through historical transportation data, the target transportation route can be accurately determined.

[0211] Corresponding to the above method embodiment, this specification also provides a transportation route planning device embodiment, Figure 4 FIG. 1 is a schematic diagram showing the structure of a transport route planning device provided by an embodiment of the present specification. Figure 4 As shown, the device comprises:

[0212] The receiving module 402 is configured to receive a transportation task of a target object within a target time period, wherein the transportation task includes the destination time and space information of each cargo to be transported;

[0213] The statistics module 404 is configured to obtain historical transportation data according to the destination time and space information of each cargo to be transported, and to count the cargo transportation volume of each destination station;

[0214] The determination module 406 is configured to determine the transportation route of the target object within the target time period according to the historical transportation data and the cargo transportation volume of each destination station.

[0215] In one or more optional embodiments of the present specification, the destination spatiotemporal information includes a destination site identifier;

[0216] The statistics module 404 is further configured to:

[0217] Determining the destination site of each of the goods to be transported according to the destination site identifier of each of the goods to be transported;

[0218] Obtain the historical transportation data corresponding to the destination site of each of the goods to be transported.

[0219] In one or more optional embodiments of the present specification, the historical transportation data includes the historical on-site time of each destination station and the historical resource consumption between the destination stations; the destination time-space information also includes the destination arrival time;

[0220] The determining module 406 is further configured to:

[0221] According to the historical on-site time of each destination station and the cargo transportation volume of each destination station, the on-site consumption time of each destination station in the target time period is predicted;

[0222] Predicting the inter-station resource consumption of each destination site within the target time period according to the historical resource consumption between the destination sites;

[0223] The transportation route of the target object within the target time period is determined according to the destination arrival time, the time consumed in the station and the resource consumption between stations.

[0224] In one or more optional embodiments of the present specification, the historical time at the station includes historical arrival time and historical departure time, and the historical transportation data also includes historical cargo transportation volume of each destination station;

[0225] The determining module 406 is further configured to:

[0226] According to the historical arrival time, historical departure time and historical cargo transportation volume of the first destination site, the historical processing time of the unit cargo in the first destination site is predicted, wherein the first destination site is any destination site;

[0227] The time consumed in the first destination station during the target time period is predicted based on the historical processing time of the unit cargo and the cargo transportation volume in the first destination station.

[0228] In one or more optional embodiments of the present specification, the inter-station resource consumption includes inter-station consumption time or inter-station cost consumption;

[0229] The determining module 406 is further configured to:

[0230] Receive a user's selection instruction for a route planning method sent by a client;

[0231] In the case where the selection instruction carries a time limit identifier, determining the transportation route of the target object within the target time period according to the destination arrival time, the time consumed in the station and the time consumed between stations;

[0232] In the case where the selection instruction carries a cost identifier, the transportation route of the target object within the target time period is determined according to the destination arrival time, the time consumed in the station and the cost consumption between stations.

[0233] In one or more optional embodiments of this specification, the determining module 406 is further configured to:

[0234] Calculate the total consumption time corresponding to each transportation route to be selected according to the consumption time within the station and the consumption time between stations;

[0235] Calculate the total cost consumption corresponding to each of the transportation routes to be selected according to the inter-station cost consumption;

[0236] The total time consumption and total cost consumption corresponding to each of the transportation routes to be selected are sent to the client for display, so that the user can select a route planning method according to the total time consumption and total cost consumption corresponding to each of the transportation routes to be selected.

[0237] In one or more optional embodiments of the present specification, the transport task further includes a transport type identifier; the destination time-space information includes a destination end identifier or a destination starting identifier, and the destination station is the destination end or destination starting point of the cargo transportation;

[0238] The statistics module 404 is further configured to:

[0239] In the case where the transport type identifier is a purchase identifier, for any destination, determining the quantity of destination time-space information of the destination represented by the destination identifier, and determining the quantity of destination time-space information as the cargo transport volume of the destination;

[0240] When the transport type identifier is a return identifier, for any destination starting point, the quantity of destination time and space information of the destination starting point represented by the destination starting point identifier is determined, and the quantity of destination time and space information is determined as the cargo transportation volume of the destination starting point.

[0241] In one or more optional embodiments of this specification, the determining module 406 is further configured to:

[0242] In the case where the transport type identifier is a purchase identifier, taking the warehouse site as the starting point, determining the transport route of the target object within the target time period according to the historical transport data and the cargo transport volume of each destination;

[0243] When the transport type identifier is a return identifier, the transport route of the target object within the target time period is determined based on the warehouse site as the end point and the historical transport data and the cargo transport volume of each destination starting point.

[0244] In one or more optional embodiments of the present specification, the device further includes an identification module configured to:

[0245] A transport identifier identifying the transport task;

[0246] The acquisition module 404 is further configured to:

[0247] In the case where the transport identifier is a dynamic transport identifier, historical transport data is acquired according to the destination time-space information of each of the goods to be transported, wherein the dynamic transport identifier indicates that the change between the transport task and the historical transport task is greater than a preset value.

[0248] In one or more optional embodiments of the present specification, the device further includes a replica module configured to:

[0249] In the case where the transport identifier is a static transport identifier, a replica route is obtained according to the transport task, wherein the static transport identifier indicates that the change between the transport task and the historical transport task is less than or equal to a preset value, and the replica route is any historical transport route;

[0250] Determine the similarity between the multiple historical sites included in the replica route and each destination site;

[0251] According to the route planning strategy corresponding to the similarity, the transportation route of the target object within the target time period is determined based on the replica route and the destination sites.

[0252] In one or more optional embodiments of this specification, the replica module is further configured to:

[0253] If the similarity is greater than a preset similarity threshold, for any destination site, determine whether the replica route includes the destination site, and determine the transportation route of the target object within the target time period according to the determination result;

[0254] If the similarity is less than or equal to the similarity threshold, determine the transportation surface corresponding to the replica route, identify whether the transportation surface includes any destination site for any destination site, and determine the transportation route of the target object within the target time period based on the identification result.

[0255] The transport route planning device provided in this specification receives a transport task of a target object within a target time period, wherein the transport task includes the destination time-space information of each cargo to be transported; based on the destination time-space information of each cargo to be transported, historical transport data is obtained, and the cargo transport volume of each destination station is counted; based on the historical transport data and the cargo transport volume of each destination station, the transport route of the target object within the target time period is determined. The target transport route corresponding to the target object within the target time period is determined by the historical transport data and the cargo transport volume of each destination station, thereby avoiding the differences caused by manual line arrangement, and can effectively improve the efficiency and accuracy of transport route planning. The transport route can be accurately determined through historical transport data.

[0256] The above is a schematic scheme of a transport route planning device of this embodiment. It should be noted that the technical scheme of the transport route planning device and the technical scheme of the above-mentioned transport route planning method belong to the same concept, and the details not described in detail in the technical scheme of the transport route planning device can be referred to the description of the technical scheme of the above-mentioned transport route planning method.

[0257] Figure 5 The block diagram of a computing device 500 provided in one embodiment of the present specification is shown. The components of the computing device 500 include but are not limited to a memory 510 and a processor 520. The processor 520 is connected to the memory 510 via a bus 530, and the database 550 is used to store data.

[0258] The computing device 500 also includes an access device 540 that enables the computing device 500 to communicate via one or more networks 560. Examples of these 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 card (NIC)) of wired or wireless, such as an IEEE 802.11 wireless local area network (WLAN) wireless interface, a world-wide 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 the like.

[0259] In one embodiment of the present specification, the above components of the computing device 500 and Figure 5 Other components not shown in the figure may also be connected to each other, for example, via a bus. It should be understood that Figure 5 The computing device structure block diagram shown is only for the purpose of illustration, and is not intended to limit the scope of this specification. Those skilled in the art can add or replace other components as needed.

[0260] The computing device 500 may be any type of stationary or mobile computing device, including a mobile computer or mobile computing device (e.g., a tablet computer, a personal digital assistant, a laptop computer, a notebook computer, a netbook, etc.), a mobile phone (e.g., a smart phone), a wearable computing device (e.g., a smart watch, smart glasses, etc.), or other types of mobile devices, or a stationary computing device such as a desktop computer or PC. The computing device 500 may also be a mobile or stationary server.

[0261] The processor 520 is used to execute the following computer executable instructions, which, when executed by the processor, implement the steps of the above-mentioned transportation route planning method.

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

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

[0264] The above is a schematic scheme of a computer-readable storage medium of this embodiment. It should be noted that the technical scheme of the storage medium and the technical scheme of the above-mentioned transportation route planning method belong to the same concept, and the details not described in detail in the technical scheme of the storage medium can be referred to the description of the technical scheme of the above-mentioned transportation route planning method.

[0265] An embodiment of the present specification also provides a computer program, wherein when the computer program is executed in a computer, the computer is caused to execute the steps of the above-mentioned transportation route planning method.

[0266] The above is a schematic scheme of a computer program of this embodiment. It should be noted that the technical scheme of the computer program and the technical scheme of the above-mentioned transportation route planning method belong to the same concept, and the details not described in detail in the technical scheme of the computer program can be referred to the description of the technical scheme of the above-mentioned transportation route planning method.

[0267] The above is a description of a specific embodiment of the specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the embodiments and still achieve the desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0268] The computer instructions include computer program codes, which may be in source code form, object code form, executable files or some intermediate forms, etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium, etc.

[0269] It should be noted that, for the above-mentioned method embodiments, for the sake of simplicity of description, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the embodiments of this specification are not limited by the order of the actions described, because according to the embodiments of this specification, some steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the embodiments of this specification.

[0270] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0271] The preferred embodiments of this specification disclosed above are only used to help explain this specification. The optional embodiments do not describe all the details in detail, nor do they limit the invention to only the specific implementation methods described. Obviously, many modifications and changes can be made according to the content of the embodiments of this specification. This specification selects and specifically describes these embodiments in order to better explain the principles and practical applications of the embodiments of this specification, so that technicians in the relevant technical field can well understand and use this specification. This specification is only limited by the claims and their full scope and equivalents.

Claims

1. A transportation route planning method, comprising: Receiving a transport task for a target object within a target time period, wherein the transport task includes destination time-space information of each cargo to be transported, and the destination time-space information includes a destination arrival time; According to the destination time-space information of each cargo to be transported, historical transportation data is obtained, and the cargo transportation volume of each destination station is counted, wherein the historical transportation data includes the historical station time of each destination station and the historical resource consumption between the destination stations; Determine the transportation route of the target object within the target time period based on the historical transportation data and the cargo transportation volume of each destination site, wherein determining the transportation route of the target object within the target time period based on the historical transportation data and the cargo transportation volume of each destination site includes: predicting the in-station consumption time of each destination site within the target time period based on the historical on-station time of each destination site and the cargo transportation volume of each destination site; predicting the inter-station resource consumption of each destination site within the target time period based on the historical resource consumption between the destination sites; determine the transportation route of the target object within the target time period based on the destination arrival time, the in-station consumption time and the inter-station resource consumption.

2. The method according to claim 1, wherein the destination spatiotemporal information includes a destination site identifier; The acquiring of historical transportation data according to the destination time-space information of each cargo to be transported includes: Determining the destination site of each of the goods to be transported according to the destination site identifier of each of the goods to be transported; Obtain the historical transportation data corresponding to the destination site of each of the goods to be transported.

3. According to the method of claim 1, the historical time at the station includes historical arrival time and historical departure time, and the historical transportation data also includes historical cargo transportation volume of each destination station; The predicting of the time spent in the station at each destination station within the target time period according to the historical time spent in the station at each destination station and the cargo transportation volume of each destination station includes: According to the historical arrival time, historical departure time and historical cargo transportation volume of the first destination site, the historical processing time of the unit cargo in the first destination site is predicted, wherein the first destination site is any destination site; The time consumed in the first destination station during the target time period is predicted based on the historical processing time of the unit cargo and the cargo transportation volume in the first destination station.

4. The method according to claim 1, wherein the inter-station resource consumption comprises inter-station consumption time or inter-station cost consumption; The determining, according to the destination arrival time, the time consumed in the station, and the resource consumption between stations, of the transportation route of the target object within the target time period includes: Receive a user's selection instruction for a route planning method sent by a client; In the case where the selection instruction carries a time limit identifier, determining the transportation route of the target object within the target time period according to the destination arrival time, the time consumed in the station and the time consumed between stations; In the case where the selection instruction carries a cost identifier, the transportation route of the target object within the target time period is determined according to the destination arrival time, the time consumed in the station and the cost consumption between stations.

5. The method according to claim 4, before receiving the user's selection instruction for the route planning method sent by the client, further comprising: Calculate the total consumption time corresponding to each transportation route to be selected according to the consumption time within the station and the consumption time between stations; Calculate the total cost consumption corresponding to each of the transportation routes to be selected according to the inter-station cost consumption; The total time consumption and total cost consumption corresponding to each of the transportation routes to be selected are sent to the client for display, so that the user can select a route planning method according to the total time consumption and total cost consumption corresponding to each of the transportation routes to be selected.

6. According to the method of claim 1, the transport task further includes a transport type identifier; the destination time-space information includes a destination end identifier or a destination starting identifier, and the destination station is the destination end or destination starting point of the cargo transportation; The method of counting the cargo transportation volume of each destination station according to the destination time-space information of each cargo to be transported includes: In the case where the transport type identifier is a purchase identifier, for any destination, determining the quantity of destination time-space information of the destination represented by the destination identifier, and determining the quantity of destination time-space information as the cargo transport volume of the destination; When the transport type identifier is a return identifier, for any destination starting point, the quantity of destination time and space information of the destination starting point represented by the destination starting point identifier is determined, and the quantity of destination time and space information is determined as the cargo transportation volume of the destination starting point.

7. The method according to claim 6, wherein determining the transportation route of the target object within the target time period according to the historical transportation data and the cargo transportation volume of each destination station comprises: In the case where the transport type identifier is a purchase identifier, taking the warehouse site as the starting point, determining the transport route of the target object within the target time period according to the historical transport data and the cargo transport volume of each destination; When the transport type identifier is a return identifier, the transport route of the target object within the target time period is determined based on the warehouse site as the end point and the historical transport data and the cargo transport volume of each destination starting point.

8. The method according to claim 1, before acquiring historical transportation data according to the destination time-space information of each cargo to be transported, further comprises: A transport identifier identifying the transport task; The acquiring of historical transportation data according to the destination time-space information of each cargo to be transported includes: In the case where the transport identifier is a dynamic transport identifier, historical transport data is acquired according to the destination time-space information of each of the goods to be transported, wherein the dynamic transport identifier indicates that the change between the transport task and the historical transport task is greater than a preset value.

9. The method according to claim 8, further comprising: In the case where the transport identifier is a static transport identifier, a replica route is obtained according to the transport task, wherein the static transport identifier indicates that the change between the transport task and the historical transport task is less than or equal to a preset value, and the replica route is any historical transport route; Determine the similarity between the multiple historical sites included in the replica route and each destination site; According to the route planning strategy corresponding to the similarity, the transportation route of the target object within the target time period is determined based on the replica route and the destination sites.

10. The method according to claim 9, wherein the route planning strategy corresponding to the similarity is used to determine the transportation route of the target object within the target time period according to the replica route and the destination sites, including: If the similarity is greater than a preset similarity threshold, for any destination site, determine whether the replica route includes the destination site, and determine the transportation route of the target object within the target time period according to the determination result; If the similarity is less than or equal to the similarity threshold, determine the transportation surface corresponding to the replica route, identify whether the transportation surface includes any destination site for any destination site, and determine the transportation route of the target object within the target time period based on the identification result.

11. A transport route planning device, comprising: A receiving module is configured to receive a transport task of a target object within a target time period, wherein the transport task includes destination time-space information of each cargo to be transported, and the destination time-space information includes a destination arrival time; A statistical module is configured to obtain historical transportation data according to the destination time-space information of each cargo to be transported, and to count the cargo transportation volume of each destination station, wherein the historical transportation data includes the historical station time of each destination station and the historical resource consumption between the destination stations; The determination module is configured to determine the transportation route of the target object within the target time period based on the historical transportation data and the cargo transportation volume of each destination station, wherein the determination module 406 is further configured to: predict the in-station consumption time of each destination station within the target time period based on the historical on-station time of each destination station and the cargo transportation volume of each destination station; predict the inter-station resource consumption of each destination station within the target time period based on the historical resource consumption between the destination stations; determine the transportation route of the target object within the target time period based on the destination arrival time, the in-station consumption time and the inter-station resource consumption.

12. A computing device comprising: Memory and processor; The memory is used to store computer executable instructions, and the processor is used to execute the computer executable instructions. When the computer executable instructions are executed by the processor, the steps of the transportation route planning method according to any one of claims 1 to 10 are implemented.

13. A computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the steps of the transportation route planning method according to any one of claims 1 to 10.

Images