Route determination method and apparatus, device, and medium

Abstract

Provided in the embodiments of the present invention are a route determination method and apparatus, a device, and a medium. The method comprises: acquiring a service order request; on the basis of attribute information, a first distance and a second distance, determining an initial route, the initial route comprising address identifiers of goods addresses and a first arrangement order of the address identifiers, the first arrangement order being used for indicating a goods retrieval order of goods to be processed; on the basis of the address identifiers and the first arrangement order, reconstructing the initial route, to obtain at least one route to be determined; when it is determined, on the basis of the attribute information, that the route to be determined is valid, determining the route, from among the routes to be determined, which has the smallest total route mileage to be a final route, wherein the validity of the route to be determined is used for indicating that a loading rate corresponding to the route to be determined is greater than a preset loading rate. The present invention is used to solve the problems in the prior art of low loading rates and long time durations when retrieving goods on the basis of planned goods retrieval routes, thereby increasing goods loading rates as well as reducing goods retrieval durations.

Description

Route determination method, device, equipment and medium TECHNICAL FIELD

[0001] The present application relates to the technical field of route planning, and in particular to a route determination method, device, equipment and medium. BACKGROUND

[0002] In the express logistics industry, express personnel need to go to various pickup points to pick up goods from the dispatch center, and then return to the dispatch center with the goods. In the prior art, the pickup route is planned before picking up the goods, so that the express personnel can pick up the goods according to the planned pickup route.

[0003] However, the prior art considers only a single dimension when planning the pickup route, which results in low loading rate and long pickup time when the express personnel picks up the goods according to the planned pickup route. SUMMARY

[0004] The present application provides a route determination method, device, equipment and medium to solve the problem of low loading rate and long pickup time when picking up goods based on the planned pickup route in the prior art, and to achieve high loading rate and short pickup time.

[0005] The present application provides a route determination method, which comprises:

[0006] Obtaining a business order request, wherein the business order request comprises: attribute information of at least one to-be-processed goods, a first distance between a goods address of the to-be-processed goods and an origin point, and a second distance between the goods addresses of each to-be-processed goods, and the attribute information is used to indicate the loading mode of the to-be-processed goods;

[0007] Determining an initial route based on the attribute information, the first distance and the second distance, wherein the initial route comprises: an address identifier of the goods address and a first arrangement order of the address identifier, and the first arrangement order is used to indicate the pickup order of the to-be-processed goods;

[0008] Reconstructing the initial route based on the address identifier and the first arrangement order to obtain at least one to-be-determined route;

[0009] Determining the route with the minimum total mileage in the to-be-determined route as the final route under the condition that the to-be-determined route is legal based on the attribute information, wherein the to-be-determined route is legal to represent that the loading rate corresponding to the to-be-determined route is greater than a preset loading rate.

[0010] According to the route determination method provided by the present application, the initial route comprises at least one first branch;

[0011] reconstructing the initial route based on the address identifiers and the first arrangement order to obtain at least one to-be-determined route, comprising:

[0012] performing the following removal operation on each of the first branches:

[0013] determining a first identifier number of address identifiers to be removed; and removing the address identifiers in the first branch based on the first identifier number to obtain a to-be-reconstructed branch; wherein the first identifier number is less than a second identifier number of address identifiers in the first branch;

[0014] performing the following reconstruction operation on each of the to-be-reconstructed branches based on the removed address identifiers corresponding to all the first branches:

[0015] adding the removed address identifiers to the to-be-reconstructed branch based on the first identifier number to obtain a second branch; wherein the second branch and the first branch are different;

[0016] obtaining the to-be-determined route based on the second branch.

[0017] According to the route determination method provided by the embodiment of the present application, the first identifier number of address identifiers to be removed comprises:

[0018] determining an average value of the second identifier number of the first branch in the initial route;

[0019] determining the smaller value between the average value and a preset value as a third identifier number;

[0020] determining the first identifier number based on the third identifier number and a preset removal determination strategy.

[0021] According to the route determination method provided by the embodiment of the present application, before the removal of the address identifiers in the first branch based on the first identifier number to obtain the to-be-reconstructed branch, further comprising:

[0022] determining a target address identifier, wherein the target address identifier is randomly determined from the address identifiers of the first branch;

[0023] the removal of the address identifiers in the first branch based on the first identifier number to obtain the to-be-reconstructed branch, comprising:

[0024] removing the first identifier number of address identifiers adjacent to the target address identifier from the first branch to obtain the to-be-reconstructed branch.

[0025] According to the route determination method provided by the embodiment of the present application, after the to-be-determined route is obtained based on the second branch, further comprising:

[0026] determine whether the loading rate corresponding to the to-be-determined route is greater than the preset loading rate based on the attribute information and a second arrangement order of the to-be-determined route;

[0027] determine that the to-be-determined route is legal in a case where it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate.

[0028] According to the route determination method provided in the embodiment of the present application, in the case where it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, the to-be-determined route is determined to be legal, which comprises:

[0029] determine whether the pickup time corresponding to each of the cargo addresses belongs to a preset time range in the case where it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate;

[0030] determine that the to-be-determined route is legal in the case where it is determined that the pickup time corresponding to the cargo addresses belongs to the preset time range.

[0031] According to the route determination method provided in the embodiment of the present application, the determination of whether the loading rate corresponding to the to-be-determined route is greater than the preset loading rate based on the attribute information and a second arrangement order of the to-be-determined route comprises:

[0032] determine a placement address of the to-be-processed cargo in the transportation device based on the second arrangement order of the to-be-determined route and in combination with the attribute information;

[0033] determine whether the to-be-processed cargo can be fully loaded in the transportation device and whether the remaining device space of the transportation device is less than a preset space based on the device space of the transportation device and the placement address;

[0034] determine that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate in the case where it is determined that the to-be-processed cargo can be fully loaded in the transportation device and that the remaining device space of the transportation device is less than the preset space.

[0035] According to the route determination method provided in the embodiment of the present application, the initial route comprises at least one first branch.

[0036] The determination of the initial route based on the attribute information, the first distance and the second distance comprises:

[0037] determine a first candidate cargo address corresponding to a first distance which is the smallest distance from the origin; and divide the first candidate cargo address to the first branch in the case where it is determined that the to-be-processed cargo at the first candidate cargo address can be loaded based on the attribute information;

[0038] determine a second candidate goods address corresponding to a second distance being the smallest distance from the first candidate goods address; and based on the attribute information, if it is determined that the to-be-processed goods at the second candidate goods address can be loaded, divide the second candidate goods address to the first branch; and until the to-be-processed goods at the second candidate goods address cannot be loaded.

[0039] The embodiment of the present application also provides a route determination device, and the device comprises:

[0040] an acquisition module, configured to acquire a service order request, wherein the service order request comprises attribute information of at least one to-be-processed goods, a first distance of a goods address of the to-be-processed goods from an origin point and a second distance between goods addresses of each to-be-processed goods, and the attribute information is used to indicate a loading mode of the to-be-processed goods;

[0041] a first determination module, configured to determine an initial route based on the attribute information, the first distance and the second distance, wherein the initial route comprises an address identifier of the goods address and a first arrangement order of the address identifier, and the first arrangement order is used to indicate a goods taking order of the to-be-processed goods;

[0042] a reconstruction module, configured to reconstruct the initial route based on the address identifier and the first arrangement order to obtain at least one to-be-determined route;

[0043] a second determination module, configured to determine a final route as a route with the minimum total mileage in the to-be-determined route based on the attribute information if the to-be-determined route is legal, wherein the to-be-determined route being legal is used to represent that a loading rate corresponding to the to-be-determined route is greater than a preset loading rate.

[0044] The embodiment of the present application also provides an electronic device, comprising a memory, a processor and a computer program stored in the memory and capable of running on the processor, and the processor implements the steps of the route determination method when executing the program.

[0045] The embodiment of the present application also provides a non-transient computer readable storage medium, which stores a computer program, and the computer program implements the steps of the route determination method when executed by a processor.

[0046] The route determination method, device, equipment and medium provided by the embodiment of the application determine the initial route through the attribute information, the first distance and the second distance in the obtained service order request. It can be seen that the determination of the initial route of the application is based on the attribute information of the to-be-processed goods and the distance information between each address, and the initial route is determined from multiple dimensions. Then, the initial route is destroyed and reconstructed based on the address identifier and the first arrangement order to obtain at least one to-be-determined route. In the case that the to-be-determined route is determined to be legal based on the attribute information, the to-be-determined route with the minimum total route mileage in the to-be-determined route is determined as the final route. It can be seen that the final route is determined from the to-be-determined route through the distance (the minimum total route mileage) and the attribute (determination of how to load the goods, and ensuring that the loading rate is greater than the preset loading rate). The final route is determined by the application as a reference standard in multiple dimensions, and the total route mileage of the obtained final route is minimum and the loading rate is high enough, so that the express personnel can reduce the pickup distance and the pickup frequency, reduce the pickup time, quickly complete the pickup, and solve the problems of low loading rate and long time consumption in the pickup in the prior art. BRIEF DESCRIPTION OF DRAWINGS

[0047] In order to more clearly illustrate the technical solutions in the embodiments of the application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiments or the prior art description. Obviously, the drawings in the following description are some embodiments of the application, and other drawings can be obtained by those skilled in the art without creative labor.

[0048] FIG. 1 is a flowchart of a route determination method provided by an embodiment of the application;

[0049] FIG. 2 is a structural schematic diagram of a route determination device provided by an embodiment of the application;

[0050] FIG. 3 is a structural schematic diagram of an electronic device provided by an embodiment of the application. DETAILED DESCRIPTION

[0051] In order to make the objects, technical solutions and advantages of the embodiments of the application clearer, the following will combine the drawings in the embodiments of the application to clearly and completely describe the technical solutions in the embodiments of the application. Obviously, the described embodiments are some embodiments of the application, rather than all the embodiments. Based on the embodiments in the application, all other embodiments obtained by those skilled in the art without creative labor are within the protection scope of the application.

[0052] The embodiment of the present application provides a route determination method, which can be applied to a client, such as a smart terminal, for example, a mobile phone, a computer, a tablet computer and the like, and can also be applied to a server. Hereinafter, the method applied to the server is taken as an example for description, and of course, the present application is not limited to the example. Some other descriptions in the embodiment of the present application are also taken as examples, and the present application is not limited to the examples, and the following descriptions will not be repeated.

[0053] As shown in FIG. 1, the method specifically comprises the following steps.

[0054] In step 101, a service order request is acquired.

[0055] The service order request comprises attribute information of at least one to-be-processed cargo, a first distance between a cargo address of the to-be-processed cargo and an original point, and a second distance between the cargo addresses of the to-be-processed cargos, and the attribute information is used to indicate a loading mode of the to-be-processed cargo.

[0056] The attribute information comprises a volume, a weight, a category and whether the to-be-processed cargo can be pressed, and the category comprises food, clothing and files.

[0057] The original point is a preset starting point, and a courier starts from the starting point, collects the cargos at the cargo addresses and returns to the starting point.

[0058] The loading mode comprises determining a placement address of the to-be-processed cargo in a transportation device based on whether the to-be-processed cargo can be pressed, determining the placement address of the to-be-processed cargo in the transportation device based on the volume and the weight of the to-be-processed cargo, determining the placement address of the to-be-processed cargo in the transportation device based on the category of the to-be-processed cargo, determining the placement address of the to-be-processed cargo in the transportation device based on whether the to-be-processed cargo can be pressed and the volume, determining the placement address of the to-be-processed cargo in the transportation device based on the category of the to-be-processed cargo and whether the to-be-processed cargo can be pressed, and the like.

[0059] In step 102, an initial route is determined based on the attribute information, the first distance and the second distance.

[0060] The initial route comprises address identifiers of the cargo addresses and a first arrangement order of the address identifiers, and the first arrangement order is used to indicate a taking order of the to-be-processed cargos.

[0061] The initial route comprises at least one first branch.

[0062] For example, the initial route is {a, b, c, d, e} {f, g, h} {i, j, k, l}; wherein, {a, b, c, d, e}, {f, g, h} and {i, j, k, l} are first branches respectively, the first arrangement order is a > b > c > d > e, f > g > h, i > j > k > l, wherein a, b, …, l represent the addresses of goods.

[0063] Wherein, from the origin to a, b, c, d, e and return to the origin, from the origin to f, g, h and return to the origin, from the origin to i, j, k, l and return to the origin. The present application does not limit whether one or more transport devices are assigned, and the user can set it according to the actual needs.

[0064] Wherein, in the case of assigning one transport device, the first arrangement order a > b > c > d > e, f > g > h, i > j > k > l and a > b > c > d > e, i > j > k > l, f > g > h and f > g > h, i > j > k > l, a > b > c > d > e are equivalent, and any first branch can be executed first. In the case of assigning multiple transport devices, each first branch can be executed simultaneously, therefore, the first arrangement order of the initial route can also be equivalent to the arrangement order of the first branch.

[0065] Step 103, reconstructing the initial route based on the address identifier and the first arrangement order to obtain at least one to-be-determined route.

[0066] Wherein, the order of the address identifier in the initial route is broken and re-planned to obtain at least one to-be-determined route.

[0067] Step 104, determining the to-be-determined route based on the attribute information, and determining the route with the minimum total mileage in the at least one to-be-determined route as the final route under the condition that the at least one to-be-determined route is legal.

[0068] Wherein, the to-be-determined route is legal to represent that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate.

[0069] Wherein, under the condition that the attribute information determines that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, the route with the minimum total mileage in the to-be-determined route is determined as the final route.

[0070] The route determination method provided by the embodiment of the present application determines the initial route through the attribute information, the first distance and the second distance in the obtained service order request. It can be seen that the determination of the initial route of the present application is based on the attribute information of the to-be-processed goods and the distance information between each address, and the initial route is determined from multiple dimensions. Then, the initial route is destroyed and reconstructed based on the address identifier and the first arrangement order to obtain at least one to-be-determined route. In the case that the to-be-determined route is determined to be legal based on the attribute information, the to-be-determined route with the minimum total mileage in the to-be-determined route is determined as the final route. It can be seen that the final route is determined from the to-be-determined route through the distance (the minimum total mileage) and the attribute (determination of how to load the goods, and ensuring that the loading rate is greater than the preset loading rate). It can be seen that the final route is determined by the present application with multiple dimensions as the reference standard, and the total mileage of the obtained final route is minimum and the loading rate is high enough, so that the express personnel can reduce the pickup distance and the pickup frequency, reduce the pickup time, quickly complete the pickup, and solve the problems of low loading rate and long time in the pickup in the prior art.

[0071] In one specific embodiment, the specific implementation of determining the initial route based on the attribute information, the first distance and the second distance includes:

[0072] The first candidate goods address corresponding to the first distance closest to the origin is determined. In the case that the to-be-processed goods at the first candidate goods address can be loaded based on the attribute information, the first candidate goods address is divided to the first branch. The second candidate goods address corresponding to the second distance closest to the first candidate goods address is determined. In the case that the to-be-processed goods at the second candidate goods address can be loaded based on the attribute information, the second candidate goods address is divided to the first branch. Until the to-be-processed goods at the second candidate goods address cannot be loaded.

[0073] Specifically, the goods address is divided to the first branch, that is, the address identifier corresponding to the goods address is added to the set corresponding to the first branch.

[0074] For example, taking the goods address including {a, b, c, d, e, f, g, h, i, j, k, l} as an example. The first distance closest to the origin is determined from {a, b, c, d, e, f, g, h, i, j, k, l} to obtain a. In the case that the to-be-processed goods at a can be loaded based on the attribute information of the to-be-processed goods at a, a is divided to the first branch. That is, a is determined from a plurality of goods addresses, and a is divided to the second branch.

[0075] The second distance with the minimum distance from a is determined from {b, c, d, e, f, g, h, i, j, k, l}, and based on the attribute information of the to-be-processed goods at b, if the to-be-processed goods at b can be loaded, b is divided to the first branch. The second distance with the minimum distance from b is determined from {c, d, e, f, g, h, i, j, k, l}, and based on the attribute information of the to-be-processed goods at c, if the to-be-processed goods at c can be loaded, c is divided to the first branch. That is, the second address is determined from the remaining addresses of the plurality of goods addresses after removing a, and the second address is divided to the first branch if the to-be-processed goods at the second address can be loaded.

[0076] Similarly, the step of dividing the second address to the first branch is iteratively performed until the to-be-processed goods at f cannot be loaded, and the first branch {a, b, c, d, e} is obtained.

[0077] Similarly, the first distance with the minimum distance from the origin is determined from {f, g, h, i, j, k, l} to obtain f, and based on the attribute information of the to-be-processed goods at f, if the to-be-processed goods at f can be loaded, f is divided to the first branch.

[0078] The second distance with the minimum distance from f is determined from {g, h, i, j, k, l} to obtain g, and based on the attribute information of the to-be-processed goods at g, if the to-be-processed goods at g can be loaded, g is divided to the first branch.

[0079] Similarly, until the to-be-processed goods at i cannot be loaded, the first branch {f, g, h} is obtained. That is, the step of obtaining the next first branch is iteratively performed for the addresses in the plurality of goods addresses except the addresses in the first branch.

[0080] Based on the above first branch determination logic, the first branch {i, j, k, l} is obtained.

[0081] After all the goods addresses are completely divided, the initial route is obtained.

[0082] Specifically, the present application pre-sets a goods stacking logic, and the to-be-processed goods are placed in the transport device based on the pre-set goods stacking logic and attribute information. For example, whether the length and width of two to-be-processed goods are consistent; the length of to-be-processed goods 1 is equal to the length of to-be-processed goods 2, and the width of to-be-processed goods 1 is equal to the width of to-be-processed goods 2; or the length of to-be-processed goods 1 is equal to the width of to-be-processed goods 2, and the width of to-be-processed goods 1 is equal to the length of to-be-processed goods 2 (of course, this condition also needs to be pre-determined in the case of to-be-processed goods being able to be flipped).

[0083] In addition, the transport device can include a rack and a fence box, in which case the swinging relationship between the to-be-processed goods needs to be considered, and the spatial relationship between the to-be-processed goods and the rack and the fence box also needs to be considered.

[0084] The present application finds an initial route in which all to-be-processed goods can be loaded by using the shortest distance greedy algorithm, and the initial route can be quickly and efficiently obtained, thereby providing an effective data basis for obtaining a final route.

[0085] In one specific embodiment, based on the address identifier and the first arrangement order, the initial route is reconstructed to obtain a specific implementation of the at least one to-be-determined route, which includes the following steps:

[0086] For each first branch, the following removal operation is performed: determining a first identifier number of to-be-removed address identifiers; based on the first identifier number, removing the address identifiers in the first branch to obtain a to-be-reconstructed branch. The first identifier number is less than a second identifier number of the address identifiers in the first branch.

[0087] Based on the removed address identifiers corresponding to all the first branches, the following reconstruction operation is performed on each to-be-reconstructed branch: based on the first identifier number, the removed address identifiers are added to the to-be-reconstructed branch to obtain a second branch. The second branch is different from the first branch.

[0088] Based on the second branch, the to-be-determined route is obtained.

[0089] For example, the first identifier number of the to-be-removed address identifiers is 1, {a, b, c, d, e} removes an address identifier e to obtain a to-be-reconstructed branch {a, b, c, d}; {f, g, h} removes an address identifier h to obtain a to-be-reconstructed branch {f, g}; and {i, j, k, l} removes an address identifier i to obtain a to-be-reconstructed branch {j, k, l}.

[0090] Based on the first identifier number, the removed address identifiers {e, h, i} are added to the to-be-reconstructed branch to obtain second branches {a, b, c, d, h}, {f, g, i}, and {j, k, l, e}. The second branches here are only illustrative, and based on the removed address identifiers and their addition positions in the to-be-reconstructed branch, multiple second branches can be obtained.

[0091] For example, the first identifier number of the to-be-removed address identifiers is 2, {a, b, c, d, e} removes two address identifiers b and e to obtain a to-be-reconstructed branch {a, c, d}; {f, g, h} removes two address identifiers g and h to obtain a to-be-reconstructed branch {f}; and {i, j, k, l} removes two address identifiers i and k to obtain a to-be-reconstructed branch {j, l}.

[0092] Based on the first number of identifiers, the removed address identifiers {b, e, g, h, i, k} are added to the branch to be reconstructed, resulting in second branches {a, c, d, i, g}, {f, e, b}, and {j, h, l, g}. These second branches are for illustrative purposes only; multiple second branches can be obtained based on the removed address identifiers and their addition positions in the branch to be reconstructed.

[0093] Of course, the address identifier removed from the first branch will not be added to its initial position when it is added to the branch to be reconstructed corresponding to the first branch; that is, the first branch and the second branch are different. For example, if address identifier e is removed from {a, b, c, d, e}, resulting in the branch to be reconstructed {a, b, c, d}, then e will not be added after d.

[0094] This invention uses an initial route as a benchmark, destroys and reconstructs the initial route to obtain the route to be determined, and provides an effective data foundation for obtaining the legal final route in the future.

[0095] In one specific embodiment, the specific implementation of determining the first number of address identifiers to be removed includes:

[0096] Determine the average number of second markers on the first branch in the initial route; determine the smaller of the average and the preset value as the number of third markers; determine the number of first markers based on the number of third markers and the preset removal determination strategy.

[0097] For example, the initial route is {a, b, c, d, e}{f, g, h}{i, j, k, l}, which includes three first branches. The number of second identifiers for the first branches are 5, 3, and 4 respectively, and their average value is (5+3+4) / 3 = 4.

[0098] Specifically, the number of third identifiers is obtained using formula (1):

[0099] in, L indicates the number of third identifiers. max 'c' represents the preset value, and 'c' represents the average number of second identifiers on the first branch in the initial route.

[0100] In this formula, if the letters are the same as those in the address identifier, they are distinguished by correspondence. The letters in the address identifier are only used to represent the address of the goods, and the letters in the formula also explain their physical meaning.

[0101] Specifically, the specific implementation of determining the number of first identifiers based on the number of third identifiers and the preset removal determination strategy includes:

[0102] The maximum number of deletable address identifiers can be obtained using formula (2):

[0103] wherein c represents an average value, represents the maximum number of address identifiers that can be deleted.

[0104] The first number of identifiers is obtained by using formula (3) :

[0105] wherein k s represents the first number of identifiers, represents generating a random number between 1 and represents rounding down the generated random number.

[0106] The present application can quickly obtain the first number of identifiers of the address identifiers to be removed that meet the initial route by using formula (2) and formula (3).

[0107] In one embodiment, the target address identifier is determined before the address identifiers in the first branch are removed based on the first number of identifiers to obtain the branch to be reconstructed. Then, the first number of address identifiers adjacent to the target address identifier are removed from the first branch to obtain the branch to be reconstructed.

[0108] wherein the target address identifier is randomly determined from the address identifiers in the first branch.

[0109] For example, the first number of identifiers of the address identifiers to be removed is 1, and the target address identifier is c, g and k.

[0110] Specifically, the specific implementation of removing the first number of address identifiers adjacent to the target address identifier from the first branch includes:

[0111] The first number of address identifiers adjacent to the target address identifier from the left of the target address identifier are removed, for example, {a, b, c, d, e} removes b to obtain {a, c, d, e}; {f, g, h} removes f to obtain {g, h}; {i, j, k, l} removes j to obtain {i, k, l}.

[0112] Or, the first number of address identifiers adjacent to the target address identifier from the right of the target address identifier are removed, for example, {a, b, c, d, e} removes d to obtain {a, b, c, e}; {f, g, h} removes h to obtain {f, g}; {i, j, k, l} removes l to obtain {i, j, k}.

[0113] Or, the first number of address identifiers adjacent to the target address identifier from the left and right of the target address identifier are removed, for example, {a, b, c, d, e} removes b and d to obtain {a, c, e}; {f, g, h} removes f and h to obtain {g}; {i, j, k, l} removes j and l to obtain {i, k}. ​

[0114] Specifically, the user can determine how to remove the address identifier according to actual needs and the position of the target address identifier in the first branch, and the application does not make any limitation.

[0115] In one specific embodiment, based on the second branch, after obtaining the to-be-determined route, based on the attribute information and the second arrangement order of the to-be-determined route, it is determined whether the loading rate corresponding to the to-be-determined route is greater than the preset loading rate; in the case where it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, it is determined that the to-be-determined route is legal.

[0116] Specifically, based on the attribute information, it is determined whether the to-be-processed goods corresponding to the to-be-determined route in the second arrangement order can be fully loaded; if not, it is determined that the to-be-determined route is illegal; if yes, it is determined whether the loading rate corresponding to the to-be-determined route is greater than the preset loading rate; if the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, it is determined that the to-be-determined route is legal; if the loading rate corresponding to the to-be-determined route is less than or equal to the preset loading rate, it is determined that the to-be-determined route is illegal.

[0117] The preset loading rate can be set by the user's actual needs.

[0118] In the case where it is determined that the to-be-processed goods corresponding to the to-be-determined route can be fully loaded, the application determines the legality of the to-be-determined route according to the loading rate of the to-be-determined route, ensures that the loading rate of the to-be-determined route is greater than the preset loading rate, and improves the loading rate of the goods.

[0119] In one specific embodiment, in the case where it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, the specific implementation of determining that the to-be-determined route is legal includes:

[0120] In the case where it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, it is determined whether the pickup time corresponding to each goods address belongs to the preset time range; in the case where it is determined that the pickup time corresponding to the goods address belongs to the preset time range, it is determined that the to-be-determined route is legal.

[0121] Specifically, in the case where it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, it is also necessary to ensure that the pickup time of the express personnel arriving at each goods address, so that the to-be-processed goods at the goods address are taken away within the time range, and the pickup time of the goods is ensured.

[0122] It can be seen that after obtaining the to-be-determined route, the application needs to verify whether the to-be-determined route meets the loading requirement, wherein the loading requirement includes that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, and the pickup time corresponding to each goods address belongs to the preset time range.

[0123] According to the second arrangement order and the attribute information of the to-be-processed goods at the goods address of the to-be-determined route, it is determined whether the to-be-processed goods can be fully loaded, and if not, the to-be-determined route is not legal. If the to-be-processed goods can be fully loaded, it is checked whether the pickup time of the to-be-determined route belongs to the preset time range, and if so, it is determined whether the loading rate corresponding to the to-be-determined route is greater than the preset loading rate, and if so, the to-be-determined route is determined to be legal.

[0124] The order of judging the two conditions in the loading requirement is not strictly limited by the application, and the user can judge according to the actual needs.

[0125] The application determines the legality of the to-be-determined route by the loading requirement, and provides an effective data basis for finally determining the final route.

[0126] In one embodiment, based on the attribute information and the second arrangement order of the to-be-determined route, the specific implementation of determining whether the loading rate corresponding to the to-be-determined route is greater than the preset loading rate includes:

[0127] Based on the second arrangement order of the to-be-determined route and the attribute information, the placement address of the to-be-processed goods in the transportation device is determined. Based on the device space of the transportation device and the placement address, it is determined whether the to-be-processed goods can be fully loaded by the transportation device, and whether the remaining device space of the transportation device is less than the preset space. In the case where the to-be-processed goods can be fully loaded by the transportation device and the remaining device space of the transportation device is less than the preset space, it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate.

[0128] For example, the second arrangement order of the to-be-determined route is {a, c, e, f}, and the pickup order is a goods address, c goods address, e goods address and f goods address. Specifically, according to the second arrangement order and the attribute information (or the loading mode), the placement address of the to-be-processed goods in the transportation device is determined. For example, there are three to-be-processed goods S1, S2 and S3 in a goods address a. S1 is placed at the starting position of the transportation device first (the user can determine it according to the actual needs), and the placement address of S2 is determined according to whether S2 and S1 can be stacked and whether the length and width are the same. If so, S2 is stacked on S1 or placed beside S1. According to this placement logic, the placement of the to-be-processed goods is performed in turn until the to-be-processed goods can be fully loaded by the transportation device and the remaining device space of the transportation device is less than the preset space, and then it is determined that the loading rate corresponding to the to-be-determined route is greater than the preset loading rate.

[0129] The application determines the packing of the to-be-processed goods based on the second arrangement order and in combination with attribute information, can realize fast and efficient packing, so that the final route obtained finally meets the shortest total mileage while maximizing the loading rate, and improves user experience.

[0130] Next, the application is schematically illustrated through a specific example:

[0131] Firstly, the initial route is obtained based on the shortest distance greedy algorithm.

[0132] Further, the initial route is destroyed and reconstructed to obtain at least one to-be-determined route.

[0133] Finally, the final route is obtained from the multiple to-be-determined routes based on the total mileage of the route.

[0134] Specifically, the number of first identifiers is determined, and of course the number of first identifiers deleted in each round is not fixed, but a random value between 1 and .

[0135] Specifically, the final route is obtained through an iterative loop, and the specific implementation is as follows:

[0136] Step 1, obtaining the initial route.

[0137] Step 2, determining the number of first identifiers and the target address identifier; based on the number of first identifiers and the target address identifier, removing the first identifier number of address identifiers adjacent to the target address identifier from the first branch (initial route) to obtain the to-be-reconstructed branch (to-be-reconstructed route); based on the removed address identifier, inserting into the to-be-reconstructed branch (to-be-reconstructed route) to obtain the second branch (to-be-determined route).

[0138] Step 3, determining the legality of the to-be-determined route, in the case of determining that the to-be-determined route is legal, comparing the total mileage and loading rate of the current to-be-determined route and the previous to-be-determined route, and retaining the better route in the current to-be-determined route and the previous to-be-determined route. Wherein, the total mileage and the loading rate are provided with corresponding weights, and the better route in the previous to-be-determined route and the previous to-be-determined route is obtained according to the weight.

[0139] Iteratively executing Step 2 and Step 3, until the iteration number reaches the preset number of times, the last retained better route is taken as the final route.

[0140] The present application determines the final route from the to-be-determined route by distance (the total mileage of the route is minimum) and attribute (determining that the goods meet the loading requirements), and can be seen that the present application determines the final route by taking multiple dimensions as the reference standard, the total mileage of the obtained final route is the shortest, and the loading rate can be maximized, so that the express personnel can reduce the pickup distance and the pickup times, reduce the pickup time, quickly complete the pickup, and solve the problems of low loading rate and long time in the prior art.

[0141] The route determining device provided by the embodiment of the present application is described below, which is applied to a client, and the route determining device described below can be correspondingly referred to the route determining method described above, and the repeated parts will not be described herein again. As shown in FIG. 2, the device comprises:

[0142] The obtaining module 201 is configured to obtain a service order request, wherein the service order request comprises attribute information of at least one to-be-processed goods, a first distance between a goods address of the to-be-processed goods and an original point, and a second distance between the goods addresses of the to-be-processed goods, and the attribute information is used to indicate a loading mode of the to-be-processed goods.

[0143] The first determining module 202 is configured to determine an initial route based on the attribute information, the first distance and the second distance, wherein the initial route comprises an address identifier of the goods address and a first arrangement order of the address identifier, and the first arrangement order is used to indicate a pickup order of the to-be-processed goods.

[0144] The reconstructing module 203 is configured to reconstruct the initial route based on the address identifier and the first arrangement order to obtain at least one to-be-determined route.

[0145] The second determining module 204 is configured to determine a route with the minimum total mileage in the to-be-determined route as the final route in the case that the to-be-determined route is legal based on the attribute information, wherein the to-be-determined route is legal, which means that the loading rate corresponding to the to-be-determined route is greater than a preset loading rate.

[0146] In one specific embodiment, the initial route comprises at least one first branch; and the reconstructing module 203 is specifically configured to perform the following removal operation on each first branch:

[0147] determine a first identifier number of the address identifier to be removed, remove the address identifier in the first branch based on the first identifier number to obtain a to-be-reconstructed branch, and wherein the first identifier number is less than a second identifier number of the address identifier in the first branch.

[0148] perform the following reconstruction operation on each to-be-reconstructed branch based on the removed address identifier corresponding to all the first branches:

[0149] The removed address identifiers are added to the branch to be reconstructed based on the first identifier quantity, to obtain a second branch; and the second branch is different from the first branch.

[0150] The route to be determined is obtained based on the second branch.

[0151] In one specific embodiment, the reconstruction module 203 is specifically configured to determine an average value of the second identifier quantity of the first branch in the initial route; determine the smaller value between the average value and a preset value as a third identifier quantity; and determine the first identifier quantity based on the third identifier quantity and a preset removal determination strategy.

[0152] In one specific embodiment, the reconstruction module 203 is further configured to determine a target address identifier, wherein the target address identifier is randomly determined from the address identifiers of the first branch; and the reconstruction module 203 is specifically configured to remove the first identifier quantity of address identifiers adjacent to the target address identifier from the first branch, to obtain the branch to be reconstructed.

[0153] In one specific embodiment, the device further includes a verification module configured to determine whether the loading rate corresponding to the route to be determined is greater than a preset loading rate based on the attribute information and the second arrangement order of the route to be determined; and determine that the route to be determined is legal in a case where it is determined that the loading rate corresponding to the route to be determined is greater than the preset loading rate.

[0154] In one specific embodiment, the verification module is specifically configured to determine whether the pickup time corresponding to each goods address belongs to a preset time range in a case where it is determined that the loading rate corresponding to the route to be determined is greater than the preset loading rate; and determine that the route to be determined is legal in a case where it is determined that the pickup time corresponding to the goods address belongs to the preset time range.

[0155] In one specific embodiment, the verification module is specifically configured to determine the placement address of the goods to be processed in the transportation device based on the second arrangement order of the route to be determined and in combination with the attribute information; determine whether the goods to be processed can be fully loaded by the transportation device and whether the remaining device space of the transportation device is less than a preset space based on the device space of the transportation device and the placement address; and determine that the loading rate corresponding to the route to be determined is greater than the preset loading rate in a case where it is determined that the goods to be processed can be fully loaded by the transportation device and the remaining device space of the transportation device is less than the preset space.

[0156] In one specific embodiment, the initial route includes at least one first branch; the first determining module 202 is specifically configured to determine a first candidate goods address corresponding to a first distance from the origin point being the smallest; based on the attribute information, in a case where it is determined that the to-be-processed goods at the first candidate goods address can be loaded, the first candidate goods address is allocated to the first branch; a second candidate goods address corresponding to a second distance from the first candidate goods address being the smallest is determined; based on the attribute information, in a case where it is determined that the to-be-processed goods at the second candidate goods address can be loaded, the second candidate goods address is allocated to the first branch; and the process is repeated until the to-be-processed goods at the second candidate goods address cannot be loaded.

[0157] FIG. 3 illustrates an entity structure diagram of an electronic device, as shown in FIG. 3, the electronic device can include a processor 301, a communications interface 302, a memory 303, and a communications bus 304, wherein the processor 301, the communications interface 302, and the memory 303 complete mutual communication through the communications bus 304. The processor 301 can invoke a logical instruction in the memory 303 to execute the route determination method provided by each of the above embodiments, the method including: obtaining a service order request, wherein the service order request includes attribute information of at least one to-be-processed goods, a first distance of a goods address of the to-be-processed goods from an origin point, and a second distance between goods addresses of each to-be-processed goods, and the attribute information is used to indicate a loading mode of the to-be-processed goods; determining an initial route based on the attribute information, the first distance, and the second distance, wherein the initial route includes an address identifier of the goods address and a first arrangement order of the address identifier, and the first arrangement order is used to indicate a pickup order of the to-be-processed goods; reconstructing the initial route based on the address identifier and the first arrangement order to obtain at least one to-be-determined route; and determining a final route based on the attribute information in a case where the to-be-determined route is legal, wherein the to-be-determined route being legal is used to represent that a loading rate corresponding to the to-be-determined route is greater than a preset loading rate.

[0158] In addition, the logic instructions in the memory 303 described above can be implemented in the form of software function units and sold or used as independent products, and can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application essentially or the part that contributes to the prior art or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for making a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various program code storage media.

[0159] In another aspect, the present application also provides a computer program product, which comprises a computer program stored on a non-transitory computer readable storage medium, and the computer program comprises program instructions, when the program instructions are executed by a computer, the computer can execute the route determination method provided by the above-mentioned embodiments, and the method comprises: obtaining a service order request, wherein the service order request comprises: attribute information of at least one to-be-processed cargo, a first distance between a cargo address of the to-be-processed cargo and an origin, and a second distance between the cargo addresses of the to-be-processed cargo, and the attribute information is used to indicate a loading mode of the to-be-processed cargo; determining an initial route based on the attribute information, the first distance and the second distance, wherein the initial route comprises: address identifiers of the cargo addresses and a first arrangement order of the address identifiers, and the first arrangement order is used to indicate a pickup order of the to-be-processed cargo; reconstructing the initial route based on the address identifiers and the first arrangement order to obtain at least one to-be-determined route; and determining a final route as a route with the minimum total mileage in the to-be-determined route under the condition that the to-be-determined route is legal, wherein the to-be-determined route is legal is used to represent that a loading rate corresponding to the to-be-determined route is greater than a preset loading rate.

[0160] In yet another aspect, the present application also provides a non-transitory computer readable storage medium having stored thereon a computer program, which, when executed by a processor, implements a route determination method provided by any of the above embodiments, the method comprising: obtaining a service order request, wherein the service order request comprises attribute information of at least one to-be-processed cargo, a first distance of a cargo address of the to-be-processed cargo from an origin, and a second distance between cargo addresses of the to-be-processed cargos, and the attribute information is used to indicate a loading mode of the to-be-processed cargo; determining an initial route based on the attribute information, the first distance, and the second distance, wherein the initial route comprises address identifiers of the cargo addresses and a first arrangement order of the address identifiers, and the first arrangement order is used to indicate a pickup order of the to-be-processed cargos; reconstructing the initial route based on the address identifiers and the first arrangement order to obtain at least one to-be-determined route; and determining a final route as a route with a minimum total mileage in the to-be-determined routes under a condition that the to-be-determined route is legal, wherein the to-be-determined route is legal is used to represent that a loading rate corresponding to the to-be-determined route is greater than a preset loading rate.

[0161] The device embodiments described above are merely illustrative, wherein the units described as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, i.e., can be located in one place, or can be distributed on multiple network units. Part or all of the modules can be selected to achieve the purpose of the embodiment according to actual needs. Those skilled in the art can understand and implement without creative labor.

[0162] From the above description of the embodiments, those skilled in the art can clearly understand that the embodiments can be realized by means of software plus necessary general hardware platforms, and of course can also be realized by hardware. Based on such understanding, the above technical solutions can be embodied in the form of software products, which can be stored in a computer readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and include a number of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute the methods described in each embodiment or some parts of the embodiments.

[0163] Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, rather than limit them; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: it can still modify the technical solutions recorded in the foregoing embodiments, or make equivalent replacement to some technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A route determination method, characterized in that, The method includes: Obtain a business order request, wherein the business order request includes: attribute information of at least one goods to be processed, a first distance of the goods address of the goods to be processed from the origin, and a second distance between the goods addresses of each of the goods to be processed, and the attribute information is used to indicate the loading method of the goods to be processed; Based on the attribute information, the first distance, and the second distance, an initial route is determined, wherein the initial route includes: the address identifier of the cargo address and a first arrangement order of the address identifiers, the first arrangement order being used to indicate the pickup order of the cargo to be processed; Based on the address identifier and the first arrangement order, the initial route is reconstructed to obtain at least one route to be determined; If the route to be determined is deemed valid based on the attribute information, the route with the smallest total mileage among the routes to be determined is determined as the final route. The validity of the route to be determined is used to indicate that the loading rate of the route to be determined is greater than the preset loading rate.

2. The route determination method according to claim 1, characterized in that, The initial route includes at least one first branch road; The step of reconstructing the initial route based on the address identifier and the first arrangement order to obtain at least one route to be determined includes: Perform the following removal operation on each of the first branches: Determine the first number of address identifiers to be removed; based on the first number of identifiers, remove the address identifiers in the first branch to obtain the branch to be reconstructed; wherein, the first number of identifiers is less than the second number of address identifiers in the first branch; Based on the removed address identifiers corresponding to all the first branches, the following reconstruction operation is performed on each of the branches to be reconstructed: Based on the first number of identifiers, the removed address identifiers are added to the branch to be reconstructed to obtain a second branch; wherein the second branch is different from the first branch; Based on the second branch, the route to be determined is obtained.

3. The route determination method according to claim 2, characterized in that, The determination of the first number of address identifiers to be removed includes: Determine the average number of second identifiers for the first branch in the initial route; The smaller value between the average value and the preset value is determined as the third identifier quantity; The number of the first identifier is determined based on the number of the third identifier and the preset removal determination strategy.

4. The route determination method according to claim 2, characterized in that, Before removing the address identifiers from the first branch based on the first identifier count to obtain the branch to be reconstructed, the method further includes: Determine the target address identifier, wherein the target address identifier is randomly determined from the address identifiers of the first branch; The step of removing address identifiers from the first branch based on the first identifier count to obtain the branch to be reconstructed includes: Remove the number of address identifiers adjacent to the target address identifier from the first branch to obtain the branch to be reconstructed.

5. The route determination method according to any one of claims 2-4, characterized in that, After obtaining the route to be determined based on the second branch, the process further includes: Based on the attribute information and the second arrangement order of the routes to be determined, determine whether the loading rate corresponding to the routes to be determined is greater than the preset loading rate; If the loading rate of the route to be determined is greater than the preset loading rate, the route to be determined is determined to be valid.

6. The route determination method according to claim 5, characterized in that, The step of determining the route to be determined to be valid when the load rate corresponding to the route to be determined is greater than the preset load rate includes: If it is determined that the loading rate of the route to be determined is greater than the preset loading rate, it is determined whether the pickup time corresponding to each cargo address is within the preset time range; If the pickup time corresponding to the cargo address is determined to be within the preset time range, the route to be determined is deemed valid.

7. The route determination method according to claim 5, characterized in that, The step of determining whether the load rate corresponding to the route to be determined is greater than the preset load rate based on attribute information and the second arrangement order of the route to be determined includes: Based on the second arrangement order of the routes to be determined, and in conjunction with the attribute information, the placement address of the goods to be processed in the transportation equipment is determined; Based on the equipment space of the transport equipment and the placement address, it is determined whether the goods to be processed can be fully loaded by the transport equipment, and whether the remaining equipment space of the transport equipment is less than a preset space; If it is determined that the goods to be processed can be fully loaded by the transport equipment, and the remaining equipment space of the transport equipment is less than the preset space, then the loading rate corresponding to the route to be determined is determined to be greater than the preset loading rate.

8. The route determination method according to any one of claims 1-7, characterized in that, The initial route includes at least one first branch road; Determining the initial route based on the attribute information, the first distance, and the second distance includes: Determine the first candidate cargo address corresponding to the first distance with the smallest distance from the origin; based on the attribute information, if it is determined that the cargo to be processed at the first candidate cargo address can be loaded, assign the first candidate cargo address to the first branch road; Determine the second candidate cargo address corresponding to the second distance that is smallest to the first candidate cargo address; based on the attribute information, if it is determined that the cargo to be processed at the second candidate cargo address can be loaded, assign the second candidate cargo address to the first branch road; until the cargo to be processed at the second candidate cargo address cannot be loaded.

9. The route determination method according to any one of claims 1 to 8, characterized in that, The attribute information includes at least one of the following: the volume, weight, category, and whether the goods can be pressed.

10. The route determination method according to any one of claims 1 to 8, characterized in that, The loading method includes at least one of the following: determining the placement address of the goods to be processed in the transport equipment based on whether the goods can be pressed; determining the placement address of the goods to be processed in the transport equipment based on the volume and weight of the goods to be processed; determining the placement address of the goods to be processed in the transport equipment based on the category of the goods to be processed; determining the placement address of the goods to be processed in the transport equipment based on whether the goods can be pressed and their volume; determining the placement address of the goods to be processed in the transport equipment based on the category of the goods to be processed and whether the goods can be pressed.

11. A route determination device, characterized in that, The device includes: The acquisition module is used to acquire business order requests, wherein the business order request includes: attribute information of at least one goods to be processed, a first distance of the goods address of the goods to be processed from the origin, and a second distance between the goods addresses of each of the goods to be processed, and the attribute information is used to indicate the loading method of the goods to be processed. The first determining module is used to determine an initial route based on the attribute information, the first distance, and the second distance, wherein the initial route includes: the address identifier of the cargo address and a first arrangement order of the address identifiers, the first arrangement order being used to indicate the pickup order of the cargo to be processed; The reconstruction module is used to reconstruct the initial route based on the address identifier and the first arrangement order to obtain at least one route to be determined; The second determining module is used to determine the route with the smallest total mileage among the routes to be determined as the final route when the route to be determined is determined to be legal based on the attribute information. The legality of the route to be determined is used to indicate that the loading rate corresponding to the route to be determined is greater than a preset loading rate.

12. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the route determination method as described in any one of claims 1 to 10.

13. A non-transitory computer-readable storage medium, characterized in that, It stores a computer program that, when executed by a processor, implements the route determination method as described in any one of claims 1 to 10.

Images