CN110852534A

CN110852534A - Transportation path determining method and device, computer equipment and storage medium

Info

Publication number: CN110852534A
Application number: CN202010039391.3A
Authority: CN
Inventors: 陈金涛; 俞恺; 朱珊珊; 张旭东; 王宇栋
Original assignee: Jiangsu Suning Logistics Co Ltd
Current assignee: Jiangsu Suning Logistics Co Ltd
Priority date: 2020-01-15
Filing date: 2020-01-15
Publication date: 2020-02-28

Abstract

The application relates to a transportation path determination method, a transportation path determination device, computer equipment and a storage medium. The method comprises the following steps: determining the number of shifts to be allocated; determining distributed task information corresponding to the to-be-distributed shift, wherein the distribution time of the distributed task information is within a preset time interval; predicting the information of the tasks to be distributed of the number of the tasks to be distributed according to the distributed task information; and determining the transportation path to be distributed corresponding to the shift to be distributed according to the task information to be distributed. According to the embodiment of the invention, more accurate tasks to be delivered can be predicted, so that the transportation path planning can be carried out in advance, warehouse personnel can have more abundant time to pick the goods, vehicle scheduling personnel can have more abundant time to schedule the vehicles, and the delivery speed is not influenced.

Description

Transportation path determining method and device, computer equipment and storage medium

Technical Field

The present application relates to the field of logistics transportation, and in particular, to a transportation path determination method, apparatus, computer device, and storage medium.

Background

The transportation path planning problem refers to that N vehicles start from the origin, each vehicle returns to the origin after passing through some points, all the points are required to be accessed, and the shortest vehicle running distance or the minimum required vehicle number or the minimum longest running distance is required. The transportation path planning is beneficial to improving the distribution speed and the distribution service quality of the logistics company and reducing the distribution cost of the logistics company.

At present, in the prior art, transportation path planning and solving are performed under the condition that the operation to be delivered is already clear, picking work of goods is performed, and scheduling work of vehicles is performed after all goods to be delivered are picked and packaged. Therefore, the transportation path which is as accurate as possible can be planned, and the adjustment of the transportation path is reduced.

However, the picking work of the goods and the dispatching work of the vehicles after the route planning work take a lot of time, and when the departure time is fixed, if the work to be distributed is clear later, the departure is likely to be impossible on time, which affects the distribution speed of the whole logistics company.

Disclosure of Invention

Aiming at the defects of the prior art, the invention provides a transportation path determining method, a transportation path determining device, computer equipment and a storage medium.

The present invention provides according to a first aspect a method of transportation path determination, which in one embodiment comprises:

determining the number of shifts to be allocated;

determining distributed task information corresponding to the to-be-distributed shift, wherein the distribution time of the distributed task information is within a preset time interval;

predicting the information of the tasks to be distributed of the number of the tasks to be distributed according to the distributed task information;

and determining the transportation path to be distributed corresponding to the shift to be distributed according to the task information to be distributed.

In one embodiment, the predicting the information of the tasks to be distributed of the to-be-distributed shift according to the distributed task information includes:

generating a distributed task sequence according to the distributed task information;

preprocessing the distributed task sequence to obtain a preprocessed distributed task sequence;

and predicting the information of the tasks to be distributed of the to-be-distributed shift according to the pre-processed distributed task sequence.

In one embodiment, after determining the transportation path to be delivered corresponding to the shift to be delivered according to the task information to be delivered, the method further includes:

if the actual distribution task information corresponding to the to-be-distributed shift is received;

and updating the transportation path to be delivered according to the actual delivery task information to obtain an updated transportation path.

In one embodiment, the updating the transportation path to be delivered according to the actual delivery task information includes:

updating and pre-storing actual distribution task information according to the actual distribution task information received this time;

and updating the transportation path to be delivered according to the updated pre-stored actual delivery task information according to a preset path updating rule.

In an embodiment, the updating the transportation path to be delivered according to the updated pre-stored actual delivery task information according to the preset path update rule includes:

determining the current time, and updating the transportation path to be delivered according to the updated pre-stored actual delivery task information if the current time meets a first preset condition; or the like, or, alternatively,

determining the updated information of the goods to be distributed of the pre-stored actual distribution task information, and updating the transportation path to be distributed according to the updated pre-stored actual distribution task information if the information of the goods to be distributed meets a second preset condition; or the like, or, alternatively,

determining the updated information of the goods to be distributed of the pre-stored actual distribution task information, if the information of the goods to be distributed does not meet a second preset condition, determining the current time, and if the current time meets a third preset condition, updating the transportation path to be distributed according to the updated pre-stored actual distribution task information.

In one embodiment, the transportation path to be delivered comprises predicted route information and predicted delivery information, the predicted route information comprises a plurality of predicted routes, and the predicted delivery information comprises predicted route delivery information corresponding to each predicted route;

the updating the transportation path to be delivered according to the actual delivery task information to obtain an updated transportation path includes:

determining predicted distribution point information corresponding to each predicted line, wherein the predicted distribution point information comprises a plurality of predicted distribution points;

comparing each predicted distribution point corresponding to each predicted route with all actual distribution points corresponding to the actual distribution task information to obtain a comparison result;

and updating the predicted route information and the predicted delivery information of the transportation path to be delivered according to the comparison result to obtain an updated transportation path.

In one embodiment, each predicted line is also corresponding to predicted distribution point distribution information, and the predicted distribution point distribution information comprises predicted demand information corresponding to each predicted distribution point;

the updating the predicted route information and the predicted delivery information of the transportation path to be delivered according to the comparison result to obtain an updated transportation path includes:

according to the comparison result, determining invalid distribution points which are not contained in all the actual distribution points and intersection distribution points which are contained in all the actual distribution points in the predicted distribution point information corresponding to each predicted line, and determining valid distribution points which are not contained in the predicted distribution point information corresponding to any predicted line in all the actual distribution points;

deleting all invalid distribution points in the predicted route information, and deleting the predicted demand information corresponding to all invalid distribution points in the predicted distribution information;

updating the predicted demand information corresponding to each intersection distribution point in the predicted distribution information into actual demand information corresponding to each intersection distribution point in the actual distribution task information;

and adding each effective distribution point to the predicted distribution point information corresponding to the predicted route closest to the position of the effective distribution point, and adding the actual demand information corresponding to each effective distribution point in the actual distribution task information to the predicted distribution point distribution information corresponding to the predicted route closest to the position of the effective distribution point.

The present invention provides according to a second aspect a transport path determination apparatus, which in one embodiment comprises:

the shift determining module is used for determining the shift to be allocated;

the distributed information determining module is used for determining distributed task information corresponding to the to-be-distributed shift, and the distribution time of the distributed task information is within a preset time interval;

the to-be-distributed information determining module is used for predicting the to-be-distributed task information of the to-be-distributed shift according to the distributed task information;

and the to-be-distributed path determining module is used for determining the to-be-distributed transportation path corresponding to the to-be-distributed shift according to the to-be-distributed task information.

The present invention provides according to a third aspect a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of an embodiment of any of the methods described above when executing the computer program.

The present invention provides according to a fourth aspect a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the embodiments of the method of any one of the above.

In the embodiment of the invention, the shift to be allocated is determined; determining distributed task information corresponding to the to-be-distributed shift, wherein the distribution time of the distributed task information is within a preset time interval; the information of the tasks to be distributed of the classes to be distributed can be predicted according to the distributed task information; and then the transportation path to be distributed corresponding to the shift to be distributed can be determined according to the information of the task to be distributed, so that warehouse personnel can have more abundant time to pick the goods, vehicle scheduling personnel can have more abundant time to schedule the vehicles, and the distribution speed is not influenced.

Drawings

FIG. 1 is a schematic flow chart diagram of a method for determining a transportation route in one embodiment;

FIG. 2 is a schematic flow chart diagram of another method for determining a transportation route in one embodiment;

FIG. 3 is a block diagram of a transportation path determining apparatus according to an embodiment;

FIG. 4 is a diagram illustrating an internal structure of a computer device according to an embodiment.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

To facilitate understanding of the transportation path determining method provided by the present invention, a plurality of embodiments of the method applied to a scenario where a warehouse delivers goods to a plurality of delivery points are provided below for explanation.

As shown in fig. 1, a transportation route determining method according to an embodiment of the present invention includes the following steps:

and S110, determining the shift to be allocated.

In this embodiment, the execution subject may be a planning server for planning the transportation path, and the planning server may be implemented by using an independent server or a server cluster composed of a plurality of servers. In order to conveniently distribute the goods to the distribution points, a plurality of distribution shifts are arranged in each time granularity of the warehouse, such as every day, every three days or every week, so as to distribute the goods to the distribution points, for example, a certain warehouse has 3 distribution shifts every day, the distribution time is respectively 5, 13 and 20 points every day, and the warehouse distributes the goods to the distribution points once every distribution time. Specifically, the number of delivery shifts needs to be set according to actual requirements, for example, 5 delivery shifts per day may be set, and 6 delivery shifts per day may also be set, which is not limited in the present invention.

The to-be-delivered shift refers to a delivery shift after the current time corresponding to the delivery time, and may be a delivery shift closest to the current time or a delivery shift farther from the current time. For example, in the above example, the warehouse has 3 delivery shifts a day, and the current time is 6 o 'clock, then the shift to be delivered may be a delivery shift with a delivery time of 13 o' clock of the day, a delivery shift with a delivery time of 20 o 'clock of the day, or even a delivery shift with a delivery time of 13 o' clock of the next day. The to-be-delivered shift is specifically determined according to a path planning instruction received by the planning server, where the path planning instruction may be an instruction issued by a manager actively, or may also be an instruction issued by a preset timing task to the planning server automatically after being triggered, for example, the path planning instruction is issued to the planning server 6 hours before each delivery shift, and the time for starting the path planning corresponding to each delivery shift may be different, for example, the time for starting the path planning corresponding to the delivery shift a is 6 hours before the delivery time, and the time for starting the path planning corresponding to the delivery shift B is 4 hours before the delivery time.

Each delivery shift is assigned a unique shift identification for distinguishing between different delivery shifts. In one embodiment, the unique shift identification is made up of two fields, a date and a shift number, such as 20191001A, where "20191001" represents the date field and "A" identifies the shift number field.

And S120, determining the distributed task information corresponding to the to-be-distributed shift, wherein the distribution time of the distributed task information is within a preset time interval.

In this embodiment, after determining the to-be-delivered shift, the planning server determines the delivered task information corresponding to the to-be-delivered shift and having the delivery time within the preset time interval. The distributed task information is the intercepted distributed task information corresponding to the distributed shift with the distribution time within a preset time interval, the distribution time of the distributed task information is consistent with the distribution time corresponding to the distributed shift, and the preset time interval is configured in advance by a manager, for example, the preset time interval may be the distribution time of the shift to be distributed or a time interval from the current date to a previous time point or a certain date.

It should be noted that, in order to facilitate the development of the route planning work, the goods picking work of the warehouse, and the scheduling work of the vehicle, the order cutting time is set for each delivery shift, and the order cutting time may be set before the delivery time of each delivery shift or may be set as the delivery time of each delivery shift. Before the order-cutting time of each delivery shift, the delivery point can issue delivery tasks to the warehouse, at the moment, the delivery task information corresponding to the delivery shift is changeable, after the warehouse receives the delivery tasks, the originally planned transportation path can be adjusted adaptively, warehouse personnel can pick the goods, and vehicle scheduling personnel schedule vehicles. However, when the current time reaches or exceeds the order intercepting time, the delivery shift does not accept the delivery tasks issued by the delivery points any more, for example, the delivery time of a certain delivery shift is 13 points, the order intercepting time is set one hour ahead, that is, the order intercepting time is 12 points, and if the current time reaches or exceeds 12 points, the delivery shift does not accept the delivery tasks issued by the delivery points any more. At this time, the distribution task information corresponding to the distribution shift, i.e. the intercepted distribution task information, is completely determined and will not change.

And S130, predicting the information of the tasks to be distributed of the to-be-distributed shifts according to the distributed task information.

And S140, determining a transportation path to be distributed corresponding to the shift to be distributed according to the information of the task to be distributed.

In this embodiment, after determining the delivered task information, the planning server predicts the information of the task to be delivered corresponding to the to-be-delivered shift according to the delivered task information, and can determine the transportation path to be delivered corresponding to the to-be-delivered shift according to the predicted information of the task to be delivered.

In one embodiment, the process of determining a transport path to be delivered comprises the steps of:

1. each delivery point is first connected to the source point (o), i.e. the warehouse, constituting 1 route comprising only 1 point. The total cost is twice the cost of the distance from the origin to each point. Calculating the saving value between any two points to generate a saving value matrix C, wherein the element of the saving value matrix C is C_ij；C_ijRepresenting a saving value between the ith point and the jth point;

2. traversing elements in the saving value matrix C from large to small according to the saving values, if the combination of the ith line and the jth line meets constraint conditions such as preset timeliness and preset loading capacity (namely, whether distribution can be completed within a specified time, and whether the cargo volume to be accompanied and delivered after the two lines are combined is within the loading capacity of a vehicle or not), executing line combination, otherwise, not executing line combination; after traversing the matrix of savings values, the savings values in the matrix are updated. This step needs to be repeated until no more lines can be merged, at which point all the resulting lines are the initial solution S1. It is also possible to set a maximum number of iterations M and stop executing this step if the current number of iterations N is equal to M.

3. And deeply searching to obtain a better solution on the basis of the initial solution. Specifically, the shaking (neighborhood action) process is performed on the initial solution S1 obtained in step 1, thereby obtaining a solution S2.

4. And (4) optimizing the result in the step (3) by adopting a neighborhood search method, and searching to obtain an optimal solution. Specifically, the solution S2 is subjected to Neighborhood descent search vnd (variable neighbor solution) processing to obtain a solution S3.

5. And updating S1= S3, repeating the steps 3 and 4 when the current iteration number is N +1, and knowing that the optimal solution S3 is obtained.

Specifically, reduction of CarReduce (neighborhood of vehicle number), neighborhood InnerSwapTask (two-point exchange in a group), BetweencrossTask (line crossing between groups) and making the current solution equal to the initial solution are constructed; using a CarReduce neighborhood to search and reduce the number of vehicles, searching a solution which is better than the current solution in an InnerSwapTask neighborhood, if the solution which is better than the current solution exists, updating the current solution, if the solution which is better than the current solution does not exist, searching a solution which is better than the current solution in a Betwencross Task neighborhood, and if the solution which is better than the current solution is searched, updating the current solution; the latest current solution is the optimal solution in the neighborhood of the initial solution.

The embodiment can realize that warehouse personnel have more abundant time to pick the goods, vehicle dispatching personnel can have more abundant time to dispatch the vehicle, reduce the goods and pick the condition emergence of making mistakes because of picking the time limit in the in-process, reduce the pressure to personnel such as dispatching personnel and transport driver because of the time limit of dispatching in the vehicle dispatching process, can also effectively avoid appearing unable on time departure and for the delivery point delivery goods, and then the condition of the speed of delivery point delivery goods is given in the influence.

In one embodiment, predicting the information of the tasks to be distributed of the to-be-distributed shift according to the distributed task information comprises the following steps:

and predicting the information of the tasks to be distributed of the to-be-distributed shifts according to the pre-processed distributed task sequence.

In this embodiment, an ARIMA Model (auto-regressive moving average Model) is used to predict the information of the task to be delivered for the delivery shift.

The distributed task information includes distributed task information corresponding to a plurality of distributed shifts, and the distributed task information includes information of a plurality of indexes. In different application scenarios, the distribution task information includes different types and quantities of indexes, for example, in an application scenario in which a warehouse distributes goods for distribution points, the distribution task information includes related information of three indexes, that is, the volume of the goods, the weight of the goods, and the quantity of the distribution points, i.e., how many distribution points the goods are to be distributed.

In different application scenarios, the time granularity adopted by the sequence when constructing the ARIMA model may be different, and the time granularity is the minimum time unit for describing time data, and may be set to 1 day, one week, and the like according to the needs of the scenario. It is therefore necessary to process the dispatched task information according to the employed time granularity to generate the dispatched task sequence. For example, in the application scenario, the information included in the distributed task information is divided into distribution shifts, and if the time granularity is 1 day, statistics on information of all distribution shifts per day is required according to different types of indexes to obtain summarized data, and it is assumed that the distributed task information corresponds to information of 2 distribution shifts on 1 month and 1 day, and the information is respectively the first distribution shift: the volume of the delivered goods is 4 cubes, the weight of the goods is 1000 kilograms, and the goods are delivered to 16 delivery points; the second delivery shift: the volume of the delivered goods is 5 cubic meters, the weight of the goods is 1250 kilograms, and the goods are delivered to 21 delivery points; the delivery task information of 1 month and 1 day is summarized, the volume of the delivered goods is 9 cubes, the weight of the goods is 2250 kg, and the goods are delivered to 37 delivery points.

The ARIMA model is also referred to as ARIMA (p, d, q), where "p" represents the lag (lags) of the time series data itself used in the ARIMA model, "d" represents the lag (lags) of the prediction error used in the ARIMA model, and "q" represents the lag (lags) of the time series data that needs to be differentiated by several steps to be stabilized.

When the prediction is carried out, the sequence input into the ARIMA model needs to be stable, and if the sequence is not stable, the ARIMA model cannot capture the regularity, so that the prediction result is very inaccurate. Therefore, after the planning server generates the distributed task sequence according to the distributed task information, the planning server needs to preprocess the distributed task sequence so that the distributed task sequence becomes a smooth sequence. In one embodiment, the preprocessing of the dispatched task sequence may be a difference processing and a smoothing processing of the dispatched task sequence. In order to further improve the accuracy of the prediction result, the planning server may detect whether there is an abnormality in the data at a certain time point in the distributed task sequence before performing the difference processing and smoothing processing on the distributed task sequence, where the abnormality is that the data at the time point is significantly different from the data at the past time point in value, and remove the abnormal data from the distributed task sequence, for example, remove the data at the date when the major event is held by the electronic commerce such as twenty-one/twenty-two/618.

After the planning server preprocesses the distributed task sequence, the preprocessed distributed task sequence is processed by using bic minimum criteria, and values of two parameters of 'p' and 'q' are obtained. And inputting the p and the q into the ARIMA model to obtain data which is the information of the task to be allocated of the shift to be allocated.

As shown in fig. 2, in an embodiment, after determining the transportation path to be delivered corresponding to the shift to be delivered according to the task information to be delivered, the method further includes:

s150: and if the actual distribution task information corresponding to the to-be-distributed shift is received, updating the to-be-distributed transportation path according to the actual distribution task information to obtain an updated transportation path.

In this embodiment, since there is a difference between the predicted information of the task to be distributed and the actual demand for distribution of the distribution point, after receiving the distribution task sent by the distribution point, that is, the actual distribution task information, the transportation path to be distributed obtained according to the predicted information of the task to be distributed before updating according to the actual distribution task information.

Considering that before the order cutting time of the to-be-distributed shift arrives, not all distribution points distribute the distribution tasks to the warehouse in a uniform time, the warehouse usually receives the distribution tasks sent by the distribution points continuously, if the distribution tasks sent by the distribution points are received after the transportation path to be distributed is updated, the mode is consistent with the mode of updating the transportation path to be distributed, the updated transportation path is updated according to the newly received actual distribution task information, and then the updated transportation path is obtained. That is, after receiving the actual delivery task information sent by the delivery point, the planning server updates the current latest transportation path according to the latest received actual delivery task information, so as to obtain an updated transportation path.

In this embodiment, the warehouse staff and the vehicle scheduling staff can respectively perform the work of cargo picking and vehicle scheduling according to the predicted task information to be delivered and the transportation path to be delivered. After receiving a delivery task actually issued by a delivery point, the planning server compares actual delivery task information with predicted information of the task to be delivered, adjusts a previously planned transportation path to be delivered based on the difference between the actual delivery task information and the predicted information of the task to be delivered, sends latest information of goods to be picked to warehouse personnel, and sends the latest transportation path, namely the updated transportation path, to vehicle scheduling personnel so that the vehicle scheduling personnel can adjust the vehicle scheduling. That is to say, the picking work of the goods and the dispatching work of the vehicles can be dynamically adjusted in the process of proceeding, so that the finally picked goods are consistent with the goods actually required to be dispatched by the dispatching points, and the dispatched vehicles can meet the requirements of the transportation paths actually taken.

In one embodiment, updating the transportation path to be delivered according to the actual delivery task information comprises:

updating and pre-storing actual distribution task information according to the received actual distribution task information;

and updating the transportation path to be distributed according to the updated pre-stored actual distribution task information according to the preset path updating rule.

In this embodiment, considering that the amount of the goods required by each delivery point is relatively small compared with the amount of the goods to be delivered by the whole warehouse, if the delivery task sent by the delivery point is received by the warehouse each time, the transportation path is updated once, the operation is complicated, and before the order cutting time is reached, the warehouse staff and the vehicle scheduling staff may need to perform adjustment for a very large number of times, which may affect the work efficiency and the work experience of the warehouse staff and the vehicle scheduling staff. Therefore, the planning server sets the pre-stored actual delivery task information for recording the actual delivery task information received within a period of time, and the information may be recorded in a form of a table, a text, or the like. The planning server may receive actual distribution task information sent by a plurality of distribution points at the same time, merge the received actual distribution task information and record the pre-stored actual distribution task information, and if the pre-stored actual distribution task information has a record, merge the information recorded in the pre-stored actual distribution task information and the newly received actual distribution task information together.

For example, the record of the pre-stored actual distribution task information is that the volume of the distributed goods is 9 cubes, the weight of the goods is 2250 kg, the goods are distributed to 37 distribution points, and the actual distribution task information received this time is as follows: the planning server determines the volume and weight of the goods required to be delivered by the delivery points according to the types and the quantities of different goods required by the delivery points, for example, if the volume of the goods required to be delivered by the delivery point A is 1 cube and the weight of the goods is 200 kg, the volume and the weight of the goods are combined into the pre-stored actual delivery task information, the volume of the delivered goods is 10 cubes, the weight of the goods is 2450 kg, and the goods are delivered to 38 delivery points.

It should be noted that the pre-stored actual delivery task information corresponds to the delivery tasks that are issued by each delivery point in the current delivery shift, before the information is combined, it needs to be determined whether the delivery point a has issued the delivery tasks in the current delivery shift, if so, the current combination is performed, and a field of how many delivery points to deliver the goods in the pre-stored actual delivery task information does not need to be updated.

Further, if the a distribution point has issued a distribution task in the current distribution shift, the type of the request issued by the a distribution point needs to be determined, where the request type includes a new order and an order modification, the new order refers to the distribution of the distribution point that adds another cargo on the basis of the previous request for distributing the cargo, and the order modification refers to the modification of the previous request for distributing the cargo by the distribution point, for example, 20 pieces of the previous request for distributing a-type cargo and 10 pieces of the current modification for a-type cargo, then the distribution task issued before the distribution point needs to be found, the distribution task needs to be updated, and the record of the information of the actual distribution task is updated.

And after updating the pre-stored actual distribution task information, the planning server updates the transportation path to be distributed according to the updated pre-stored actual distribution task information according to the preset path updating rule.

In one embodiment, updating the transportation path to be delivered according to the updated pre-stored actual delivery task information according to a preset path update rule includes:

and determining the current time, and updating the transportation path to be distributed according to the updated pre-stored actual distribution task information if the current time meets a first preset condition.

In this embodiment, the planning server may update the transportation path to be delivered according to the updated pre-stored actual delivery task information at intervals after the path planning is started, for example, the delivery time of the to-be-delivered shift is 13 points, the planning server starts path planning at 7 points, and then updates the newly planned transportation path at 1 hour intervals. Since the delivery time corresponding to each delivery shift, the planning time for starting to plan the route, and the update time interval for updating the transportation route are also determined, the update time of each route can be determined according to the three pieces of information, based on the above example, the delivery time of the shift to be delivered is 13 points, the planning time is 7 points, and the update time interval is 1 hour, it can be determined that 8-9 points-10 points-11 points-12 points-13 points are all the route update times, the planning server monitors the current time, determines that the current time satisfies the first preset condition if the current time belongs to the first route update time, and updates the transportation route to be delivered according to the updated pre-stored actual delivery task information. Possibly, at least one path update time may also be preconfigured for each delivery shift, not necessarily at regular time intervals. And when the current time belongs to the route updating time, the planning server determines that the current time meets a first preset condition, and updates the transportation route to be delivered according to the updated pre-stored actual delivery task information.

It is easy to understand that if the current time belongs to a route update time other than the first route update time, it is determined that the current time satisfies the time update condition, and the newly planned transportation route is updated according to the updated pre-stored actual delivery task information.

In another embodiment, updating the transportation path to be delivered according to the updated pre-stored actual delivery task information according to a preset path update rule, including:

and determining the updated information of the goods to be distributed of the pre-stored actual distribution task information, and updating the transportation path to be distributed according to the updated pre-stored actual distribution task information if the information of the goods to be distributed meets a second preset condition.

In this embodiment, when the distribution time of the distribution tasks issued by the distribution points is not uniform, the warehouse may receive a large amount of actual distribution task information in a short time, or may receive only a small amount of actual distribution task information for a long time. If the transportation path is updated according to time, the updated transportation path may not change much from the previous transportation path, and the updated transportation path may change greatly from the previous transportation path, so that the warehouse personnel and the vehicle scheduling personnel may be stressed if the change is large suddenly, for example, the weight of the goods to be delivered suddenly increases, the types of the vehicles to be arranged may be different, and the sudden increase of the weight of the goods indicates that the quantity of the goods to be picked is also large. Therefore, a plurality of monitoring thresholds matched with important fields of the to-be-distributed goods information can be preset, for example, one monitoring threshold is respectively set for three fields of the goods volume, the goods weight and the number of distribution points to be distributed, when the numerical value of at least one field in the fields of the goods volume, the goods weight and the number of the distribution points to be distributed exceeds the corresponding monitoring threshold, the to-be-distributed goods information is determined to meet a second preset condition, and the to-be-distributed transportation path is further updated according to the updated pre-stored actual distribution task information.

It is easily understood that, after updating the transportation path to be delivered, if it is determined that the information on the goods to be delivered satisfies the second preset condition, the newly planned transportation path is updated according to the updated pre-stored actual delivery task information in the same manner as the updating of the transportation path to be delivered.

In another embodiment, updating the transportation path to be delivered according to the updated pre-stored actual delivery task information according to the preset path update rule includes:

and determining the updated information of the goods to be distributed of the pre-stored actual distribution task information, determining the current time if the information of the goods to be distributed does not meet a second preset condition, and updating the transportation path to be distributed according to the updated information of the pre-stored actual distribution task if the current time meets a third preset condition.

In this embodiment, it is possible that the information of the goods to be delivered does not satisfy the second preset condition for a long time, but if the information of the goods to be delivered does not satisfy the second preset condition for a long time and then the information of the goods to be delivered is updated after the information of the goods to be delivered satisfies the second preset condition, the time for the warehouse staff and the vehicle scheduling staff to work is less because the planning server updates the transportation route to be delivered even if the information of the goods to be delivered does not satisfy the second preset condition but the current time satisfies the third preset condition.

It is easy to understand that, after the transportation path to be delivered is updated, if it is determined that the information of the goods to be delivered satisfies the second preset condition, or the information of the goods to be delivered does not satisfy the second preset condition, but the current time satisfies the third preset condition, the newly planned transportation path is updated according to the updated pre-stored actual delivery task information in the same manner as the updating of the transportation path to be delivered.

In one embodiment, the transportation path to be delivered comprises predicted route information and predicted delivery information, the predicted route information comprises a plurality of predicted routes, and the predicted delivery information comprises predicted route delivery information corresponding to each predicted route; each predicted line is also corresponding to predicted distribution point distribution information, and the predicted distribution point distribution information comprises predicted demand information corresponding to each predicted distribution point; the actual distribution task information comprises a plurality of actual distribution points and actual demand information corresponding to each actual distribution point. The predicted distribution point and the actual distribution point are both distribution points, the predicted distribution point is a distribution point predicted to issue a distribution task, the actual distribution point is a distribution point actually issued with the distribution task, and more specifically, both are unique identifiers corresponding to the distribution points in the planning server. The predicted distribution point and the actual distribution point are possibly the same or different, and the prediction is successful if the predicted distribution point and the actual distribution point are the same; similarly, the predicted demand information and the actual demand information both refer to demand information corresponding to the distribution points, the predicted demand information is a distribution task which is required to be distributed by the predicted distribution points, and the actual demand information is a distribution task which is actually required to be distributed by the distribution points.

Updating the transportation path to be delivered according to the actual delivery task information to obtain an updated transportation path, comprising:

In this embodiment, after receiving the actual delivery task information, the planning server updates the transportation path to be delivered, which is obtained by prediction before, according to the actual delivery task information.

During updating, each predicted delivery point corresponding to each predicted route is compared with all actual delivery points corresponding to the actual delivery task information to obtain several comparison results, and then the predicted route information and the predicted delivery information of the transportation route to be delivered are updated according to the comparison results.

In one embodiment, updating the predicted route information and the predicted delivery information of the transportation path to be delivered according to the comparison result to obtain an updated transportation path includes:

deleting all invalid distribution points in the predicted route information, and deleting the predicted demand information corresponding to all the invalid distribution points in the predicted distribution information;

and adding the actual demand information corresponding to the actual delivery task information of each effective delivery point to the predicted delivery point delivery information corresponding to the predicted route closest to the position of the effective delivery point.

In the present embodiment, the adjustment is performed in units of lines. Comparing each predicted delivery point corresponding to each predicted route with all actual delivery points corresponding to the actual delivery task information, it can be determined which predicted delivery points are successful in prediction in the predicted delivery points corresponding to each predicted route, that is, the predicted delivery points are the same as some actual delivery points of the actual delivery task information, which predicted delivery points are failed in prediction, that is, no actual delivery points are the same as the predicted delivery points, and which delivery points are not predicted, that is, actual delivery points are not included in the predicted delivery point information corresponding to any predicted route. For convenience of description, a delivery point that is predicted successfully is referred to as an intersect delivery point, a delivery point that is predicted unsuccessfully is referred to as a fail delivery point, and a delivery point that is not predicted is referred to as a valid delivery point.

Deleting all invalid distribution points in the predicted route information for the distribution points with failed prediction, specifically, judging whether each piece of predicted distribution point information contains the invalid distribution points, if so, deleting the invalid distribution points, for example, if the distribution points included in the predicted route are A-B-C-D, and if the distribution points B are the invalid distribution points, deleting the invalid distribution points, and the new predicted route is A-C-D; and correspondingly, the predicted demand information corresponding to all invalid distribution points in the predicted distribution information needs to be deleted.

For the distribution points with successful prediction, updating the prediction demand information corresponding to each intersection distribution point in the prediction distribution information into the actual demand information corresponding to each intersection distribution point in the actual distribution task information, specifically, determining the prediction distribution point distribution information containing the intersection distribution points, and modifying the prediction demand information corresponding to each intersection distribution point into the actual demand information corresponding to each intersection distribution point in the actual distribution task information.

For the distribution points which cannot be predicted, each effective distribution point is added into the predicted distribution point information corresponding to the predicted route with the closest position, and the actual demand information corresponding to each effective distribution point in the actual distribution task information is added into the predicted distribution point distribution information corresponding to the predicted route with the closest position, namely, all the effective distribution points are merged into the planned route with the closest position.

In one embodiment, considering that the load capacity and the compartment volume of the vehicle are limited, the predicted delivery point delivery information of each predicted route has corresponding cargo limit conditions, such as cargo volume limit, cargo weight limit, and the like, if the predicted delivery point delivery information of the transportation path to be delivered is modified according to the intersection delivery point and/or the effective delivery point, it needs to consider whether the modified predicted delivery point delivery information of the predicted route exceeds the limit, and if a certain cargo limit condition is exceeded, 1 or several delivery points are removed from the predicted route, so that the predicted delivery point delivery information of the predicted route does not exceed the limit. All distribution points for which the route is predicted to move out can be re-routed.

In another embodiment, after the order-intercepting time is reached, whether the cargo loading rates of all the routes meet a preset condition is detected, if the cargo loading rates meet the preset condition, for example, when the cargo loading rates corresponding to the routes are lower than a preset threshold, it is determined that the cargo loading rates meet the preset condition, the routes are split, specifically, the distribution points corresponding to the routes are merged into other routes, the merging mode is the same as that described in the above embodiment, and after merging, whether the cargo limit condition is exceeded needs to be considered, and if the cargo limit condition is exceeded, the corresponding processing mode is the same as that of the above embodiment.

Possibly, the cargo loading rate refers to a ratio of a cargo weight to be delivered to a total cargo weight corresponding to the route, or the cargo loading rate refers to a ratio of a cargo volume to be delivered to a total cargo volume corresponding to the route.

Possibly, the cargo loading rate refers to a combination of a weight ratio of the weight of the cargo to be delivered to the total weight of the cargo corresponding to the route and a volume ratio of the volume of the cargo to be delivered to the total volume of the cargo corresponding to the route, and the mode of judging that the cargo loading rate meets the preset condition can be configured according to an actual scene. For example, when the weight ratio is lower than a preset weight threshold and the volume ratio is lower than a preset volume threshold, it is determined that the cargo loading rate meets a preset condition; for another example, when the weight ratio is lower than the preset weight threshold, or the volume ratio is lower than the preset volume threshold, it is determined that the cargo loading rate satisfies the preset condition.

In one embodiment, as shown in fig. 3, there is provided a transport path determining apparatus including the following modules:

a shift determining module 110, configured to determine a shift to be allocated;

a distributed information determining module 120, configured to determine distributed task information corresponding to a to-be-distributed shift, where a distribution time of the distributed task information is within a preset time interval;

the to-be-distributed information determining module 130 is configured to predict the to-be-distributed task information of the to-be-distributed shift according to the distributed task information;

and the to-be-distributed path determining module 140 is configured to determine, according to the to-be-distributed task information, a to-be-distributed transportation path corresponding to the to-be-distributed shift.

In one embodiment, the to-be-distributed information determining module 130 includes:

the sequence generation submodule is used for generating a distributed task sequence according to the distributed task information;

the preprocessing submodule is used for preprocessing the distributed task sequence to obtain a preprocessed distributed task sequence;

and the information to be distributed determining submodule is used for predicting the information of the tasks to be distributed of the to-be-distributed shift according to the pre-processed distributed task sequence.

In one embodiment, after performing the function corresponding to the to-be-delivered route determining module 140, the transportation route determining device further performs the functions corresponding to the following modules:

and the path updating module is used for updating the transportation path to be distributed according to the actual distribution task information to obtain an updated transportation path when the actual distribution task information corresponding to the shift to be distributed is received.

In one embodiment, a path update module includes:

the actual task updating submodule is used for updating and pre-storing actual distribution task information according to the received actual distribution task information;

and the path updating submodule is used for updating the transportation path to be distributed according to the updated pre-stored actual distribution task information according to the preset path updating rule.

In one embodiment, the path update submodule includes:

the first path updating unit is used for determining the current time, and updating the transportation path to be distributed according to the updated pre-stored actual distribution task information if the current time meets a first preset condition; or the like, or, alternatively,

the second path updating unit is used for determining the to-be-distributed goods information of the updated pre-stored actual distribution task information, and updating the to-be-distributed transportation path according to the updated pre-stored actual distribution task information if the to-be-distributed goods information meets a second preset condition; or the like, or, alternatively,

and the third path updating unit is used for determining the to-be-distributed goods information of the updated pre-stored actual distribution task information, determining the current time if the to-be-distributed goods information does not meet the second preset condition, and updating the to-be-distributed transportation path according to the updated pre-stored actual distribution task information if the current time meets the third preset condition.

the path updating module further comprises:

the system comprises a prediction distribution point determining submodule and a prediction distribution point determining submodule, wherein the prediction distribution point determining submodule is used for determining prediction distribution point information corresponding to each prediction line, and the prediction distribution point information comprises a plurality of prediction distribution points;

the comparison submodule is used for comparing each predicted delivery point corresponding to each predicted line with all actual delivery points corresponding to the actual delivery task information to obtain a comparison result;

and the path updating submodule is used for updating the predicted line information and the predicted delivery information of the transportation path to be delivered according to the comparison result to obtain an updated transportation path.

a path update submodule comprising:

a distribution point type determining unit, configured to determine, according to the comparison result, invalid distribution points that are not included in all the actual distribution points and intersection distribution points that are included in all the actual distribution points in the predicted distribution point information corresponding to each predicted line, and determine valid distribution points that are not included in the predicted distribution point information corresponding to any one predicted line in all the actual distribution points;

the first updating unit is used for deleting all invalid distribution points in the predicted line information and deleting the predicted demand information corresponding to all the invalid distribution points in the predicted distribution information;

the second updating unit is used for updating the predicted demand information corresponding to each intersection distribution point in the predicted distribution information into actual demand information corresponding to each intersection distribution point in the actual distribution task information;

and a third updating unit configured to add each effective distribution point to the predicted distribution point information corresponding to the predicted route closest to the position thereof, and add the actual demand information corresponding to each effective distribution point in the actual distribution task information to the predicted distribution point distribution information corresponding to the predicted route closest to the position thereof.

For the specific definition of the transportation path determination device, reference may be made to the above definition of the transportation path determination method, which is not described herein again. The various modules in the transport path determination device described above may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In one embodiment, a computer device is provided, the internal structure of which may be as shown in FIG. 4. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a transportation path determination method.

Those skilled in the art will appreciate that the architecture shown in fig. 4 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.

In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:

determining the number of shifts to be allocated; determining distributed task information corresponding to a to-be-distributed shift, wherein the distribution time of the distributed task information is within a preset time interval; predicting the information of the tasks to be distributed of the number of the tasks to be distributed according to the distributed task information; and determining a transportation path to be distributed corresponding to the shift to be distributed according to the task information to be distributed.

In one embodiment, when the processor executes the computer program to predict the information of the tasks to be distributed of the to-be-distributed shift according to the distributed task information, the following steps are also implemented:

generating a distributed task sequence according to the distributed task information; preprocessing the distributed task sequence to obtain a preprocessed distributed task sequence; and predicting the information of the tasks to be distributed of the to-be-distributed shifts according to the pre-processed distributed task sequence.

In one embodiment, after the processor executes the computer program to determine the transportation path to be delivered corresponding to the shift to be delivered according to the task information to be delivered, the following steps are also implemented:

and if the actual distribution task information corresponding to the to-be-distributed shift is received, updating the to-be-distributed transportation path according to the actual distribution task information to obtain an updated transportation path.

In one embodiment, the processor executes the computer program to update the transportation path to be delivered according to the actual delivery task information, and further implements the following steps:

updating and pre-storing actual distribution task information according to the received actual distribution task information; and updating the transportation path to be distributed according to the updated pre-stored actual distribution task information according to the preset path updating rule.

In one embodiment, when the processor executes the computer program to update the transportation path to be delivered according to the updated pre-stored actual delivery task information according to the preset path update rule, the following steps are also implemented:

the processor executes the computer program to update the transportation path to be delivered according to the actual delivery task information, and when the updated transportation path is obtained, the following steps are also realized:

determining predicted distribution point information corresponding to each predicted line, wherein the predicted distribution point information comprises a plurality of predicted distribution points; comparing each predicted distribution point corresponding to each predicted route with all actual distribution points corresponding to the actual distribution task information to obtain a comparison result; and updating the predicted route information and the predicted delivery information of the transportation path to be delivered according to the comparison result to obtain an updated transportation path.

the processor executes the computer program to update the predicted route information and the predicted delivery information of the transportation path to be delivered according to the comparison result, and when the updated transportation path is obtained, the following steps are also realized:

according to the comparison result, determining invalid distribution points which are not contained in all the actual distribution points and intersection distribution points which are contained in all the actual distribution points in the predicted distribution point information corresponding to each predicted line, and determining valid distribution points which are not contained in the predicted distribution point information corresponding to any predicted line in all the actual distribution points; deleting all invalid distribution points in the predicted route information, and deleting the predicted demand information corresponding to all the invalid distribution points in the predicted distribution information; updating the predicted demand information corresponding to each intersection distribution point in the predicted distribution information into actual demand information corresponding to each intersection distribution point in the actual distribution task information; and adding the actual demand information corresponding to the actual delivery task information of each effective delivery point to the predicted delivery point delivery information corresponding to the predicted route closest to the position of the effective delivery point.

In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:

In one embodiment, the computer program is executed by a processor, and when predicting task information to be distributed of a to-be-distributed shift according to distributed task information, further implements the following steps:

In one embodiment, after the computer program is executed by the processor and determines the transportation path to be delivered corresponding to the shift to be delivered according to the task information to be delivered, the following steps are further implemented:

In one embodiment, the computer program is executed by the processor, and when updating the transportation path to be delivered according to the actual delivery task information, the following steps are further implemented:

In one embodiment, when the computer program is executed by the processor and updates the transportation path to be delivered according to the updated pre-stored actual delivery task information according to the preset path update rule, the following steps are further implemented:

the computer program is executed by the processor, the transportation path to be distributed is updated according to the actual distribution task information, and when the updated transportation path is obtained, the following steps are also realized:

In one embodiment, when the computer program is executed by the processor, the predicted route information and the predicted delivery information of the transportation path to be delivered are updated according to the comparison result, and the updated transportation path is obtained, the following steps are further implemented:

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware related to instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A transportation path determination method, comprising:

determining the number of shifts to be allocated;

2. The transportation path determination method of claim 1,

the predicting the information of the tasks to be distributed of the to-be-distributed shift according to the distributed task information comprises the following steps:

3. The transportation path determination method of claim 1,

after the to-be-distributed transportation path corresponding to the to-be-distributed shift is determined according to the to-be-distributed task information, the method further comprises the following steps:

4. The transportation path determination method of claim 3,

the updating the transportation path to be delivered according to the actual delivery task information includes:

5. The transportation path determination method of claim 4,

the updating of the transportation path to be delivered according to the updated pre-stored actual delivery task information according to the preset path updating rule comprises the following steps:

6. The transportation path determination method of claim 3,

the to-be-distributed transportation path comprises predicted line information and predicted distribution information, the predicted line information comprises a plurality of predicted lines, and the predicted distribution information comprises predicted line distribution information corresponding to each predicted line;

7. The transportation path determination method of claim 6,

each predicted line is also corresponding to predicted distribution point distribution information, and the predicted distribution point distribution information comprises predicted demand information corresponding to each predicted distribution point;

8. A transportation path determination device characterized by comprising:

the shift determining module is used for determining the shift to be allocated;

9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 7 are implemented when the computer program is executed by the processor.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 7.