Freight carpooling dispatching method, computer readable storage medium and computer device

Abstract

The present application is applicable to the field of freight, and provides a method, device, computer-readable storage medium and computer equipment for scheduling freight carpooling. The method comprises the following steps: S101, obtaining the unassigned freight orders in the preset area and the vehicle information and corresponding driver information of the vehicle that is executing an order task, and the current status of the order task being executed includes the order being received but not arriving at the loading point and the order being received and the goods being picked up but not arriving at the unloading point; S102, recommending an unassigned freight order to the driver who is executing an order task according to the preset rules, and forming a freight carpooling order pairing combination with the order task being executed and the recommended freight order. The present invention can efficiently utilize the existing driver capacity, and the hourly income of the driver after the combination is not less than the preset threshold, and can improve the level of acceptance of same-city freight orders and the transaction volume of the freight platform.

Description

Technical Field

[0001] The present application relates to the field of freight transportation, and in particular to a method, device, computer-readable storage medium and computer equipment for dispatching freight carpooling. Background Art

[0002] In recent years, with the rapid development of the Internet and freight crowdsourcing industry, on the one hand, the freight demand and capacity supply in different cities are not matched, and there is often a situation where the capacity supply cannot meet the freight demand well; on the other hand, the existing model of grabbing orders and one vehicle one order, that is, after the customer places an order on the platform, the order is published on the platform, the driver checks the order details and chooses whether to accept the order (grab the order). If he chooses to accept the order, he will take the next order after executing this order. This model often has low load and volume utilization rates for transport vehicles, resulting in a waste of driver capacity and an inability to efficiently utilize the existing driver capacity. Summary of the invention

[0003] The purpose of the present application is to provide a method, device, computer-readable storage medium and computer equipment for dispatching freight carpooling, aiming to solve the problem that the existing mode of grabbing orders and one-vehicle-one-order has low load and volume utilization rate of transport vehicles, resulting in waste of driver capacity and inability to efficiently utilize existing driver capacity.

[0004] In a first aspect, the present application provides a method for dispatching freight carpooling, comprising the following steps:

[0005] S101, obtaining information about unassigned freight orders and vehicles that are executing an order task and corresponding driver information in a preset area, wherein the current status of the order task being executed includes the order being received but not arriving at the loading point and the order being received and the goods have been picked up but not arriving at the unloading point;

[0006] S102, recommending an unassigned freight order to a driver who is currently executing an order task according to a preset rule, and forming a freight carpooling order pairing combination with the currently executing order task and the recommended freight order, wherein the preset rule includes:

[0007] The longest side of the vehicle that is executing an order task is larger than the longest side of the goods in the unassigned freight order;

[0008] The volume loaded on a vehicle that is executing an order task plus the volume of goods in unassigned freight orders shall not exceed a preset ratio of the vehicle's loadable volume;

[0009] The weight of the vehicle that is executing an order task plus the weight of the goods of the unassigned freight order does not exceed the preset proportion of the maximum load of the vehicle;

[0010] The vehicle that is executing an order task must meet the estimated empty driving rate of the order task being executed and the recommended freight order within the preset range;

[0011] A driver who is currently executing an order task must meet the estimated hourly income of the driver completing the order task being executed and the recommended freight order is not less than the preset threshold;

[0012] When a freight order is recommended to a driver who is currently executing an order task, the estimated time for the driver to arrive at the recommended freight order loading point is within a preset range from the recommended freight order placement time; and

[0013] When a freight order is recommended to a driver who is executing an order task, the distance to the recommended freight order loading point is within a preset range.

[0014] In a second aspect, the present application provides a dispatching device for freight carpooling, the dispatching device comprising:

[0015] The acquisition module is used to obtain the unassigned freight orders in the preset area and the vehicle information and corresponding driver information of the order task being executed. The current status of the order task being executed includes the order being received but not arriving at the loading point and the order being received and the goods have been picked up but have not arrived at the unloading point;

[0016] The recommendation module is used to recommend an unassigned freight order to a driver who is currently executing an order task according to preset rules, and to form a freight carpooling order pairing combination with the order task being executed and the recommended freight order. The preset rules include:

[0017] The longest side of the vehicle that is executing an order task is larger than the longest side of the goods in the unassigned freight order;

[0018] The volume loaded on a vehicle that is executing an order task plus the volume of goods in unassigned freight orders shall not exceed a preset ratio of the vehicle's loadable volume;

[0019] The weight of the vehicle that is executing an order task plus the weight of the goods of the unassigned freight order does not exceed the preset proportion of the maximum load of the vehicle;

[0020] The vehicle that is executing an order task must meet the estimated empty driving rate of the order task being executed and the recommended freight order within the preset range;

[0021] A driver who is currently executing an order task must meet the estimated hourly income of the driver completing the order task being executed and the recommended freight order is not less than the preset threshold;

[0022] When a freight order is recommended to a driver who is currently executing an order task, the estimated time for the driver to arrive at the recommended freight order loading point is within a preset range from the recommended freight order placement time; and

[0023] When a freight order is recommended to a driver who is executing an order task, the distance to the recommended freight order loading point is within a preset range.

[0024] In a third aspect, the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the freight carpooling scheduling method as described above are implemented.

[0025] In a fourth aspect, the present application provides a computer device, comprising:

[0026] one or more processors;

[0027] Memory; and

[0028] One or more computer programs, the processor and the memory are connected via a bus, wherein the one or more computer programs are stored in the memory and are configured to be executed by the one or more processors, and the processors implement the steps of the freight carpooling scheduling method as described above when executing the computer programs.

[0029] In this application, due to obtaining the unassigned freight orders in the preset area and the vehicle information and corresponding driver information that are executing an order task, an unassigned freight order is recommended to the driver who is executing an order task according to the preset rules, and the order task being executed and the recommended freight order are combined into a freight carpooling order pairing combination, wherein the vehicle that is executing an order task must meet the estimated empty driving rate of the order task being executed and the recommended freight order within the preset range; the driver who is executing an order task must meet the estimated hourly income of the driver who completes the order task being executed and the recommended freight order is not less than the preset threshold. Therefore, the existing driver capacity can be efficiently utilized, and the hourly income of the driver after the combination is not less than the preset threshold, and the level of acceptance of same-city freight orders and the transaction volume of the freight platform can be improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 It is a flow chart of a method for dispatching freight carpooling provided in one embodiment of the present application.

[0031] Figure 2 It is a rendering of the effect of the freight carpooling scheduling method provided by an embodiment of the present application.

[0032] Figure 3It is a functional module block diagram of a freight carpooling scheduling device provided in one embodiment of the present application.

[0033] Figure 4 It is a specific structural block diagram of a computer device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0034] In order to make the purpose, technical solution and beneficial effects of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0035] In order to illustrate the technical solution described in this application, a specific embodiment is provided below for illustration.

[0036] See also Figure 1 , is a flow chart of a method for dispatching freight carpooling provided in an embodiment of the present application. This embodiment mainly uses the method for dispatching freight carpooling applied to a computer device as an example to illustrate. The method for dispatching freight carpooling provided in an embodiment of the present application includes the following steps:

[0037] S101. Obtain unassigned freight orders in a preset area and vehicle information and corresponding driver information that are executing an order task. The current status of the order task being executed includes the order being received but not arriving at the loading point and the order being received and the goods have been picked up but have not arrived at the unloading point.

[0038] S102, recommending an unassigned freight order to a driver who is currently executing an order task according to a preset rule, and forming a freight carpooling order pairing combination with the currently executing order task and the recommended freight order, wherein the preset rule includes:

[0039] The longest side of the vehicle that is executing an order task is larger than the longest side of the goods in the unassigned freight order;

[0040] The volume loaded on a vehicle that is executing an order task plus the volume of goods in unassigned freight orders shall not exceed a preset ratio of the vehicle's loadable volume;

[0041] The weight of the vehicle that is executing an order task plus the weight of the goods of the unassigned freight order does not exceed the preset proportion of the maximum load of the vehicle;

[0042] The vehicle that is executing an order task must meet the estimated empty driving rate of the order task being executed and the recommended freight order within the preset range;

[0043] A driver who is currently executing an order task must meet the estimated hourly income of the driver completing the order task being executed and the recommended freight order is not less than the preset threshold;

[0044] When a freight order is recommended to a driver who is currently executing an order task, the estimated time for the driver to arrive at the recommended freight order loading point is within a preset range from the recommended freight order placement time; and

[0045] When a freight order is recommended to a driver who is executing an order task, the distance to the recommended freight order loading point is within a preset range.

[0046] In one embodiment of the present application, let order i be the order task being executed, and order j be the recommended freight order;

[0047] The specific calculation formula for the longest side of the carriage of the vehicle that is executing an order task is greater than the longest side of the goods of the unassigned freight order is as follows:

[0048] L j <L d

[0049] The longest side L of the order j item j Smaller than the longest side L of the vehicle loading space d .

[0050] The specific calculation formula for the preset ratio of the volume loaded by the vehicle executing an order task plus the volume of the goods in the unassigned freight order not exceeding the vehicle's loadable volume is as follows:

[0051] v i +v j ≤αv d

[0052] The sum of the volumes of order i and order j cannot exceed the predetermined ratio of the volume of the vehicle used by order i, v i represents the volume of goods for order i, v j represents the cargo volume of order j, α represents the proportional coefficient pre-set according to business needs (because in general, the cargo cannot completely fill the loading space of the vehicle, so α≤1), v d Indicates the loadable volume of the vehicle when it is unloaded.

[0053] The specific calculation formula for the weight of the vehicle that is executing an order task plus the weight of the goods of the unassigned freight order not exceeding the preset ratio of the maximum load of the vehicle is as follows:

[0054] u i +u j ≤βu d

[0055] Indicates that the sum of the weights of order i and order j cannot exceed the predetermined ratio of the vehicle load used for order i, ui represents the weight of the goods in order i, u j represents the weight of the goods in order j, β represents the proportional coefficient pre-set according to business needs (because in general, the goods cannot completely fill the loading space of the vehicle, so β≤1), u d Indicates the loadable weight of the vehicle when it is unloaded.

[0056] The driver who is currently executing an order task must meet the estimated hourly income of the driver completing the order task being executed and the recommended freight order, which is not less than the preset threshold. The specific calculation formula is as follows:

[0057] IPH ij ≥a

[0058] IPH represents the hourly income after combining order i and order j ij Not less than a predetermined value a (for example, a may be the platform average IPH).

[0059] When a driver who is executing an order task is recommended a freight order, he has not yet arrived at the pickup point of the order task he is executing. The distance to the recommended loading point of the freight order must be within the preset range. The specific calculation formula is as follows:

[0060] d i_1j_1 ≤d0

[0061] It means that if a driver who is currently executing an order task (order i) has not completed the pickup of order i, when a freight order j is recommended, the distance d from the loading point of order i to the loading point of order j is i_1j_1 It cannot exceed d0 (the specific value is determined by the average driving distance of platform drivers for receiving orders or the median driving distance for receiving orders multiplied by a certain coefficient);

[0062] d vj_1 ≤d0

[0063] It means that if a driver who is currently executing an order task (order i) has completed the pickup of order i but has not yet arrived at the unloading point of the order task being executed, when a freight order j is recommended, the driver is expected to travel a distance d to reach the loading point of order j. vj_1 It cannot exceed d0 (the specific value is determined by the average driving distance of platform drivers for receiving orders or the median driving distance for receiving orders multiplied by a certain coefficient).

[0064] When a freight order is recommended to a driver who is currently executing an order task, the estimated time for the driver to arrive at the recommended freight order loading point is within a preset range from the recommended freight order placement time. The specific calculation formula is as follows:

[0065] If the driver who is executing an order task (order i) has arrived at the pickup point of order i, then:

[0066]

[0067] It means that if the driver who is executing an order task (order i) has completed the pickup of order i, when recommending freight order j to the driver, the estimated time of arrival at the loading point of order j and the order time t of order j are j The difference is within the predetermined range t0 (the specific value is determined by the average pickup waiting time of the platform or the median pickup waiting time multiplied by a certain coefficient), t represents the current decision time, t vj_1 represents the time required for the driver to reach the loading point of order j, represents the estimated remaining loading time of the driver at the loading point of order i;

[0068] If the driver who is executing an order task (order i) has not arrived at the loading point of order i, if b1≤b2 (where b1 represents the shortest driving distance required to complete order i and order j when the driver arrives at the loading point of order i first; b2 represents the shortest driving distance required to complete order i and order j when the driver arrives at the loading point of order j first), then

[0069] t+t vi_1 -t i ≤t0

[0070] t+t vi_1 +l i_ +t i_1j_1 -t j ≤t0

[0071] It means that the driver follows the plan with the minimum idle rate and arrives at the loading point of order i first. The estimated time when the driver arrives at the loading point of order i is the same as the time when order i is placed. i The difference must be within the predetermined range t0, and the driver's estimated arrival time at the loading point of order j is the same as the order placement time t j The difference must be within the predetermined range t0, t represents the current decision moment, t vi_1 represents the time it takes for the driver to travel to the loading point of order i, l i_ represents the estimated remaining loading time of order i;

[0072] Otherwise, you must meet

[0073] t+t vj_1 -t j ≤t0

[0074] t+t vj_1 +l j_1 +t j_1i_1 -t i≤t0

[0075] It means that the driver arrives at the loading point of order j first according to the plan with the minimum empty driving rate. The difference between the time when the driver is expected to arrive at the loading point of order j and the time when order j is placed must be within the predetermined range t0, and the difference between the time when the driver is expected to arrive at the loading point of order i and the time when order i is placed must be within the predetermined range t0, t vj_1 represents the time it takes for the driver to travel to the loading point of order i, l j_1 represents the expected loading time of order j, t i_1j_1 It represents the estimated travel time between the loading point of order i and the unloading point of order j.

[0076] In an embodiment of the present application, the estimating and completing the empty driving rate of the order tasks being executed and the recommended freight orders specifically includes the following steps:

[0077] When the current status of the order task being executed is that the order has been received but has not arrived at the loading point, the calculation logic and related formula for the estimated completion of the order task being executed and the recommended freight order are as follows:

[0078] c1=d vi_1 +d i_1j_1 +d j_1j_2 +d j_2i_2

[0079] c2=d vi_1 +d i_1j_1 +d j_1i_2 +d i_2j_2

[0080] b1=min{c1,c2}

[0081] c3=d vj_1 +d j_1i_1 +d i_1j_2 +d j_2i_2

[0082] c4=d vj_1 +d j_1i_1 +d i_1i_2 +d i_2j_2

[0083] b2=min{c3,c4}

[0084] b=min{b1,b2} / (d vi_1 +d vj_1 +d i_1i_2 +d j_1j_2 )-1

[0085] Where b represents the minimum empty driving rate corresponding to completing the order tasks being executed and the recommended freight orders;

[0086] b1 represents the shortest driving distance required to complete order i and order j when the driver first goes to the loading point of order i and then to the loading point of order j;

[0087] b2 represents the shortest driving distance required to complete order i and order j when the driver first goes to the loading point of order j and then goes to the loading point of order i;

[0088] c1 represents the estimated driving distance for the driver to first arrive at the loading point of order i, then pass through the loading point of order j, the unloading point of order j, and the unloading point of order i in sequence;

[0089] c2 represents the estimated driving distance for the driver to first arrive at the loading point of order i, then pass through the loading point of order j, the unloading point of order i, and the unloading point of order j in sequence;

[0090] c3 represents the estimated driving distance for the driver to first arrive at the loading point of order j, then pass through the loading point of order i, the unloading point of order j, and the unloading point of order i in sequence;

[0091] c4 represents the estimated driving distance for the driver to first arrive at the loading point of order j, then pass through the loading point of order i, the unloading point of order i, and the unloading point of order i in sequence;

[0092] d vi_1 represents the estimated driving distance of the driver to the loading point of order i;

[0093] d i_1j_1 represents the estimated travel distance between the loading point of order i and the loading point of order j;

[0094] d j_1j_2 represents the estimated travel distance from the loading point of order j to the unloading point of order j;

[0095] d j_2i_2 represents the estimated travel distance from the unloading point of order j to the unloading point of order i;

[0096] d j_1i_2 represents the estimated travel distance from the loading point of order j to the unloading point of order i;

[0097] d i_2j_2 represents the estimated travel distance from the unloading point of order i to the unloading point of order j;

[0098] d vj_1 represents the estimated driving distance of the driver to the loading point of order j;

[0099] d j_1i_1 represents the estimated travel distance from the loading point of order j to the loading point of order i;

[0100] d i_1j_2represents the estimated travel distance between the loading point of order i and the unloading point of order j;

[0101] d j_2i_2 represents the estimated travel distance between the unloading point of order j and the unloading point of order i;

[0102] d i_1i_2 It represents the estimated travel distance between the loading point of order i and the unloading point of order i.

[0103] When the current status of the order task being executed is that the order has been received and has arrived at the loading point, the calculation logic and related formula for the estimated completion of the order task being executed and the recommended freight order are as follows:

[0104] c5=d vj_1 +d j_1j_2 +d j_2i_2

[0105] c6=d vj_1 +d j_1i_2 +d i_2j_2

[0106] b = min{c5, c6} / (d vi_2 +d j_1j_2 )-1

[0107] Among them, d vj_1 represents the distance from the driver to the loading point of order j;

[0108] d vi_2 Indicates the driving distance from the driver's current location to the destination of order i;

[0109] c5 indicates that the status of the order task being executed is that the driver has arrived at the loading point of order i, and the estimated driving distance from the current position to the loading point of order j, the unloading point of order j, and the unloading point of order i in sequence;

[0110] c6 indicates that the status of the order task being executed is that the loading point of order i has been reached, and the driver is expected to travel from the current position through the loading point of order j, the unloading point of order i, and the unloading point of order j in sequence.

[0111] In one embodiment of the present application, the preset threshold may be the average hourly revenue of the freight platform or the estimated hourly revenue when any order is executed individually.

[0112] In one embodiment of the present application, estimating the hourly income of a driver for completing the order tasks being executed and the recommended freight orders specifically includes the following steps:

[0113] When the current status of the order task being executed is that the order has been received but has not arrived at the loading point, the estimated hourly income calculation logic and related formula for the driver to complete the order task being executed and the recommended freight order are as follows:

[0114] e1=t vi_1 +t i_1j_1 +t j_1j_2 +t j_2i_2

[0115] e2=t vi_1 +t i_1j_1 +t j_1i_2 +t i_2j_2

[0116] e3=t vj_1 +t j_1i_1 +t i_1j_2 +t j_2i_2

[0117] e4=t vj_1 +t j_1i_1 +t i_1i_2 +t i_2j_2

[0118] In calculating the idle rate, if b1≤b2 and c1≤c2, then e * =e1; if b1≤b2, and c2<c1, then e * =e2; if b2<b1, and c3≤c4, then e * =e3; if b2<b1, and c4<c3, then e * =e4

[0119] IPH ij =(v1+v2) / (e * +l i +l j )

[0120] Among them, IPH ij represents the hourly income corresponding to completing order i and order j;

[0121] e1 represents the estimated driving time for the driver to first arrive at the loading point of order i, then pass through the loading point of order j, the unloading point of order j, and the unloading point of order i in sequence;

[0122] e2 represents the estimated driving time for the driver to first arrive at the loading point of order i, then pass through the loading point of order j, the unloading point of order i, and the unloading point of order j in sequence;

[0123] e3 represents the estimated driving time for the driver to first arrive at the loading point of order j, then pass through the loading point of order i, the unloading point of order j, and the unloading point of order i in sequence;

[0124] e4 represents the estimated driving time for the driver to first arrive at the loading point of order j, then pass through the loading point of order i, the unloading point of order i, and the unloading point of order j in sequence;

[0125] v i , v j are the amounts of order i and order j respectively;

[0126] l i , l j are respectively the loading and unloading time of order i and order j estimated by the freight platform (e.g., based on the median or mean of historical loading and unloading time);

[0127] t vi_1 represents the estimated driving time from the driver’s current location to the loading point of order i, t i_1j_1 It represents the estimated travel time between the loading point of order i and the unloading point of order j;

[0128] t j_1j_2 represents the estimated travel time from the loading point of order j to the unloading point of order j, t j_2i_2 It represents the estimated travel time from the unloading point of order j to the unloading point of order i;

[0129] t j_1i_2 represents the estimated travel time from the loading point of order j to the unloading point of order i, t i_2j_2 It represents the estimated travel time from the unloading point of order i to the unloading point of order j;

[0130] t vj_1 represents the estimated driving time from the driver’s current location to the loading point of order j, t j_1i_1 It represents the estimated travel time from the loading point of order j to the loading point of order i;

[0131] t i_1j_2 represents the estimated travel time from the loading point of order i to the unloading point of order j;

[0132] t j_2i_2 represents the estimated travel time from the unloading point of order j to the unloading point of order i;

[0133] t i_1i_2 represents the estimated travel time from the loading point of order i to the unloading point of order i;

[0134] When the current status of the order task being executed is that the order has been received and has arrived at the loading point, the estimated hourly income calculation logic and related formula for the driver to complete the order task being executed and the recommended freight order are as follows:

[0135]

[0136]

[0137] In calculating the idle rate, if c5<c6, then e * = e5, otherwise e * =e6

[0138] IPH ij =(v i +v j ) / (e * +l i +l j )

[0139] Among them, t represents the current time, represents the time when the driver arrives at the loading point of order i,

[0140] In an embodiment of the present application, after S102, the method may further include the following steps:

[0141] Calculate the time when the driver arrives at the loading point of the order task being executed and the recommended freight order, the time when the driver leaves the loading point of the order task being executed and the recommended freight order, the time when the driver arrives at the unloading point of the order task being executed and the recommended freight order, and the time when the unloading of the order task being executed and the recommended freight order is completed and the driver leaves the destination;

[0142] Generate a route relationship between the order tasks being executed and the recommended freight orders, and send to the driver the time when the driver arrives at the loading point of the order tasks being executed and the recommended freight orders, the time when the driver leaves the loading point of the order tasks being executed and the recommended freight orders, the time when the driver arrives at the unloading point of the order tasks being executed and the recommended freight orders, and the time when the unloading of the order tasks being executed and the recommended freight orders is completed and left.

[0143] In one embodiment of the present application, let order i be the order task being executed, and order j be the recommended freight order;

[0144] When the driver fails to arrive at the loading point for the order being executed,

[0145] (1) If b1≤b2, then

[0146] The time it takes for the driver to arrive at the loading point for order i is calculated as in represents the time when the driver arrives at the loading point of order i, t represents the current time, and t vi_1 Indicates the estimated driving time from the driver's current location to the loading point of order i;

[0147] The time calculation formula for the driver leaving the loading point of order i is: in, represents the time when the driver leaves the loading point of order i, l i_1 represents the estimated loading time at the loading point of order i (which can be estimated based on factors such as the median loading time of the platform);

[0148] The time it takes for the driver to arrive at the loading point of order j is calculated as in, represents the time when the driver arrives at the loading point of order j, t i_1j_1 It represents the estimated driving time of the driver from the loading point of order i to the loading point of order j;

[0149] The time calculation formula for the driver leaving the loading point of order j is: in, represents the time when the driver leaves the loading point of order j, l j_1 represents the estimated loading time at the loading point of order j (which can be estimated based on factors such as the median loading time of the platform);

[0150] (2) If b1≤b2, and c1>c2, then

[0151] The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_1i_2 represents the estimated driving time for the driver from the loading point of order j to the unloading point of order i;

[0152] The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 It represents the estimated time to unload the goods at the unloading point of order i (which can be estimated based on factors such as the median unloading time of the platform);

[0153] The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t i_2j_2 It represents the estimated driving time for the driver from the unloading point of order i to the unloading point of order j;

[0154] The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j (which can be estimated based on factors such as the median unloading time of the platform);

[0155] (3) If b1≤b2 and c1≤c2, then

[0156] The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t j_1j_2 represents the estimated driving time of the driver from the loading point of order j to the unloading point of order j;

[0157] The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j (which can be estimated based on factors such as the median unloading time of the platform);

[0158] The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_2i_2 represents the estimated driving time of the driver from the unloading point of order j to the unloading point of order i;

[0159] The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 represents the estimated unloading time at the unloading point of order i (which can be estimated based on factors such as the median unloading time of the platform);

[0160] (4) If b1>b2, then

[0161] The time it takes for the driver to arrive at the loading point of order j is calculated as in, represents the time when the driver arrives at the loading point of order j, t represents the current time, and t vj_1 represents the estimated driving time from the driver's current location to the loading point of order j;

[0162] The time calculation formula for the driver leaving the loading point of order j is: in, represents the time when the driver leaves the loading point of order j, l j_1 represents the estimated loading time at the loading point of order j (which can be estimated based on factors such as the median loading time of the platform);

[0163] The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_1i_2 represents the estimated driving time for the driver from the loading point of order j to the unloading point of order i;

[0164] The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_1 represents the estimated loading time at the loading point of order i (which can be estimated based on factors such as the median loading time of the platform);

[0165] (5) If b1>b2, and c3≤c4, then

[0166] The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, represents the time when the driver leaves the loading point of order i, t i_1j_2 It represents the estimated driving time of the driver from the loading point of order i to the unloading point of order j;

[0167] The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j (which can be estimated based on factors such as the median unloading time of the platform);

[0168] The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_2i_2 represents the estimated driving time of the driver from the unloading point of order j to the unloading point of order i;

[0169] The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 It represents the estimated time to unload the goods at the unloading point of order i (which can be estimated based on factors such as the median unloading time of the platform);

[0170] (6) If b1>b2, and c3≤c4, then

[0171] The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, represents the time when the driver leaves the loading point of order i, ti_1i_2 It represents the estimated driving time of the driver from the loading point of order i to the unloading point of order i;

[0172] The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 It represents the estimated time to unload the goods at the unloading point of order i (which can be estimated based on factors such as the median unloading time of the platform);

[0173] The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t i_2j_2 It represents the estimated driving time for the driver from the unloading point of order i to the unloading point of order j;

[0174] The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 It represents the estimated unloading time at the unloading point of order j (which can be estimated based on factors such as the median unloading time of the platform).

[0175] When the driver has arrived at the loading point of the order task being executed,

[0176] (1) If the driver fails to complete the pickup at the loading point for order i, then

[0177] The time calculation formula for the driver leaving the loading point of order i is: in, represents the time when the driver leaves the loading point of order i, t represents the current time, Indicates the estimated remaining loading time if the driver has arrived at the loading point of order i but has not left it (estimated by the platform based on factors such as the median loading time and the used loading time);

[0178] The time it takes for the driver to arrive at the loading point of order j is calculated as in, represents the time when the driver arrives at the loading point of order j, t i_1j_1 It represents the estimated driving time of the driver from the loading point of order i to the loading point of order j;

[0179] The time calculation formula for the driver leaving the loading point of order j is: in, represents the time when the driver leaves the loading point of order j, l j_1 represents the estimated loading time at the loading point of order j (which can be estimated based on factors such as the median loading time of the platform);

[0180] (2) If the driver has completed the pickup at the loading point for order i, then

[0181] The time it takes for the driver to arrive at the loading point of order j is calculated as in, represents the time when the driver arrives at the loading point of order j, t represents the current time, and t vj_1 represents the estimated driving time from the driver's current location to the loading point of order j;

[0182] The time calculation formula for the driver leaving the loading point of order j is: in, represents the time when the driver leaves the loading point of order j, l j_1 represents the estimated loading time at the loading point of order j (which can be estimated based on factors such as the median loading time of the platform);

[0183] (3) If c5≤c6, then

[0184] The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t j_1j_2 represents the estimated driving time of the driver from the loading point of order j to the unloading point of order j;

[0185] The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload the goods at the unloading point of order j (which can be estimated based on factors such as the median unloading time of the platform);

[0186] The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_2i_2 represents the estimated driving time of the driver from the unloading point of order j to the unloading point of order i;

[0187] The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 represents the estimated unloading time at the unloading point of order i (which can be estimated based on factors such as the median unloading time of the platform);

[0188] (4) If c5>c6, then

[0189] The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, represents the time when the driver leaves the loading point of order j, t j_1i_2 represents the estimated driving time for the driver from the loading point of order j to the unloading point of order i;

[0190] The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 It represents the estimated time to unload the goods at the unloading point of order i (which can be estimated based on factors such as the median unloading time of the platform);

[0191] The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t i_2j_2 It represents the estimated driving time for the driver from the unloading point of order i to the unloading point of order j;

[0192] The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 It represents the estimated unloading time at the unloading point of order j (which can be estimated based on factors such as the median unloading time of the platform).

[0193] In an embodiment of the present application, S102 may specifically include the following steps:

[0194] Pair the freight orders in order set B with those in order set A to maximize the total weight. Each order can be paired at most once. If freight order i and freight order j do not meet the preset rules after pairing, the pairing weight calculation coefficient a of freight order i and freight order j is ij = 0, so that order i and order j cannot be paired, that is, x ij =0, where order set A represents the order set that is executing an order task, and order set B represents the order set of unassigned freight orders.

[0195] It can be expressed specifically by the following formula:

[0196]

[0197]

[0198]

[0199]

[0200]

[0201] Formula (1) indicates that the objective function is to maximize the total weight, where x ij is a decision variable, indicating whether the pairing solution is from the loading point of freight order i to the loading point of freight order j, w ij is the pairing weight of freight order i and freight order j. Formula (2) indicates that the unexecuted orders to be collocated can only be collocated once at most. Formula (3) indicates that the orders being executed and available for collocation can only be collocated once at most. Formula (4) indicates that the decision variable x ij is a 0, 1 variable that can only take values ​​0 or 1, x ij = 0 means that freight order i and freight order j are not matched, x ij =1 indicates that freight order i is successfully matched with freight order j.

[0202] In one embodiment of the present application, in S102, when there are multiple unallocated freight orders that meet the preset rules, a greedy algorithm based on weight sorting from high to low is adopted to select the best unallocated freight order.

[0203] The specific steps may include:

[0204] S1021. Traverse the feasible order pairing set and calculate the pairing weight w of each order pairing ij , or

[0205] Among them, a ij It is 1 if order i and order j can be combined, otherwise it is 0; Indicates the distance saving rate of the group order solution, represents the time saving rate of the group-buying solution, α and β are and The weight coefficient is set by the business's preference for time and distance; in formula (7), M is a sufficiently large number;

[0206]

[0207]

[0208] d vj_1 represents the distance from the driver to the loading point of order j, d j_1j_2 represents the distance from the loading point of order j to the unloading point of order j, d j_2i_2 represents the distance from the unloading point of order j to the unloading point of order i, d j_1i_2 represents the travel distance from the loading point of order j to the unloading point of order i, d i_2j_2represents the distance from the unloading point of order i to the unloading point of order j, d i represents the driving distance from the driver’s current location to the unloading point of order i, d j It represents the driving distance from the loading point to the unloading point of order j when executing order j alone;

[0209] t vj_1 represents the time taken by the driver to reach the loading point of order j, t j_1j_2 represents the time from the loading point of order j to the unloading point of order j, t j_2i_2 represents the time taken to transport from the unloading point of order j to the unloading point of order i, t j_1i_2 represents the time taken from the loading point of order j to the unloading point of order i, t i_2j_2 represents the time taken from the loading point of order i to the unloading point of order j, t i represents the driving time from the driver’s current location to the unloading point of order i, t j It represents the time it takes for the driver to travel from the loading point to the unloading point of order j when executing order j alone;

[0210] S1022. Arrange all order pairs according to pairing weights;

[0211] Specifically, it can be:

[0212] Arrange all order pairs in descending order according to the pairing weights;

[0213] Arrange all order pairs in ascending order of completion time according to pairing weight;

[0214] Arrange all order pairs in ascending order of completion distance according to pairing weight;

[0215] S1023. Traverse all order pairs. If the order pair is not in the output pair list, output the order pair and mark the order pair as an output pair until all order pairs are traversed.

[0216] In one embodiment of the present application, in S102, when there are multiple unallocated freight orders that meet the preset rules, a neighborhood search algorithm or a bipartite graph algorithm (such as KM (Kuhn Munkres) algorithm, Hungarian algorithm, HK algorithm, etc.) is used to select optimized matching orders and generate output matching orders.

[0217] Figure 2 The following table shows the relevant data of the freight carpooling scheduling method provided by an embodiment of the present application:

[0218]

[0219] See also Figure 3 The freight carpooling dispatching device provided in one embodiment of the present application may be a computer program or a program code running in a computer device, for example, the freight carpooling dispatching device is an application software; the freight carpooling dispatching device may be used to execute the corresponding steps in the freight carpooling dispatching method provided in the embodiment of the present application. The freight carpooling dispatching device provided in one embodiment of the present application includes:

[0220] The acquisition module 11 is used to acquire the unassigned freight orders in the preset area and the vehicle information and the corresponding driver information that are executing an order task. The current status of the order task being executed includes the order that has been received but not arrived at the loading point and the order that has been received and the goods have been picked up but have not arrived at the unloading point;

[0221] The recommendation module 12 is used to recommend an unassigned freight order to a driver who is currently executing an order task according to preset rules, and to form a freight carpooling order pairing combination with the currently executing order task and the recommended freight order. The preset rules include:

[0222] The longest side of the vehicle that is executing an order task is larger than the longest side of the goods in the unassigned freight order;

[0223] The volume loaded on a vehicle that is executing an order task plus the volume of goods in unassigned freight orders shall not exceed a preset ratio of the vehicle's loadable volume;

[0224] The weight of the vehicle that is executing an order task plus the weight of the goods of the unassigned freight order does not exceed the preset proportion of the maximum load of the vehicle;

[0225] The vehicle that is executing an order task must meet the estimated empty driving rate of the order task being executed and the recommended freight order within the preset range;

[0226] A driver who is currently executing an order task must meet the estimated hourly income of the driver completing the order task being executed and the recommended freight order is not less than the preset threshold;

[0227] When a freight order is recommended to a driver who is currently executing an order task, the estimated time for the driver to arrive at the recommended freight order loading point is within a preset range from the recommended freight order placement time; and

[0228] When a freight order is recommended to a driver who is executing an order task, the distance to the recommended freight order loading point is within a preset range.

[0229] The freight carpooling dispatching device provided in one embodiment of the present application and the freight carpooling dispatching method provided in one embodiment of the present application belong to the same concept, and the specific implementation process is detailed in the full text of the specification and will not be repeated here.

[0230] An embodiment of the present application provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the steps of the freight carpooling scheduling method provided in an embodiment of the present application are implemented.

[0231] Figure 4 A specific structural block diagram of a computer device provided in an embodiment of the present application is shown, a computer device 100 includes: one or more processors 101, a memory 102, and one or more computer programs, wherein the processor 101 and the memory 102 are connected via a bus, the one or more computer programs are stored in the memory 102, and are configured to be executed by the one or more processors 101, and the processor 101 implements the steps of the freight carpooling scheduling method provided in an embodiment of the present application when executing the computer program. The computer device includes a server and a terminal, etc. The computer device can be a desktop computer, a mobile terminal or a vehicle-mounted device, and the mobile terminal includes at least one of a mobile phone, a tablet computer, a personal digital assistant or a wearable device, etc.

[0232] In this application, due to obtaining the unassigned freight orders in the preset area and the vehicle information and corresponding driver information that are executing an order task, an unassigned freight order is recommended to the driver who is executing an order task according to the preset rules, and the order task being executed and the recommended freight order are combined into a freight carpooling order pairing combination, wherein the vehicle that is executing an order task must meet the estimated empty driving rate of the order task being executed and the recommended freight order within the preset range; the driver who is executing an order task must meet the estimated hourly income of the driver who completes the order task being executed and the recommended freight order is not less than the preset threshold. Therefore, the existing driver capacity can be efficiently utilized, and the hourly income of the driver after the combination is not less than the preset threshold, and the level of acceptance of same-city freight orders and the transaction volume of the freight platform can be improved.

[0233] It should be understood that each step in each embodiment of the present application is not necessarily performed in sequence according to the order indicated by the step number. Unless there is clear explanation in this article, the execution of these steps does not have strict order restriction, and these steps can be performed in other orders. Moreover, at least a part of the steps in each embodiment can include a plurality of sub-steps or a plurality of stages, and these sub-steps or stages are not necessarily performed at the same time, but can be performed at different times, and the execution order of these sub-steps or stages is not necessarily performed in sequence, but can be performed in turn or alternately with at least a part of other steps or sub-steps or stages of other steps.

[0234] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the program can be stored in a non-volatile computer-readable storage medium. When the program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0235] The technical features of the above embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0236] The above embodiments only express several implementation methods of the present invention, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for those of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the patent of the present invention shall be subject to the attached claims.

Claims

1. A method for dispatching freight carpooling, characterized in that: The following steps are involved: S101, obtaining information about unassigned freight orders and vehicles that are executing an order task and corresponding driver information in a preset area, wherein the current status of the order task being executed includes the order being received but not arriving at the loading point and the order being received and the goods have been picked up but not arriving at the unloading point; S102, recommending an unassigned freight order to a driver who is currently executing an order task according to a preset rule, and forming a freight carpooling order pairing combination with the currently executing order task and the recommended freight order, wherein the preset rule includes: The longest side of the vehicle that is executing an order task is larger than the longest side of the goods in the unassigned freight order; The volume loaded on a vehicle that is executing an order task plus the volume of goods in unassigned freight orders does not exceed a preset ratio of the vehicle's loadable volume; The weight of the vehicle that is executing an order task plus the weight of the goods of the unassigned freight order does not exceed the preset proportion of the maximum load of the vehicle; The vehicle that is executing an order task must meet the estimated empty driving rate of the order task being executed and the recommended freight order within the preset range; A driver who is currently executing an order task must meet the estimated hourly income of the driver completing the order task being executed and the recommended freight order is not less than the preset threshold; When a freight order is recommended to a driver who is currently executing an order task, the estimated time for the driver to arrive at the recommended freight order loading point is within a preset range from the recommended freight order placement time; and When a driver who is executing an order task is recommended a freight order, the distance from the driver to the recommended freight order loading point is within a preset range; S102 specifically includes the following steps: Pair the freight orders in order set B with those in order set A to maximize the total weight. Each order can be paired at most once. If freight order i and freight order j do not meet the preset rules after pairing, the pairing weight calculation coefficient a of freight order i and freight order j is ij = 0, so that order i and order j cannot be paired, that is, x ij =0, where order set A represents the order set that is executing an order task, and order set B represents the order set of unassigned freight orders; The specific formula is as follows: Formula (1) indicates that the objective function is to maximize the total weight, where x ij is a decision variable, indicating whether the pairing solution is from the loading point of freight order i to the loading point of freight order j, w ij is the pairing weight of freight order i and freight order j. Formula (2) indicates that the unexecuted orders to be collocated can only be collocated once at most. Formula (3) indicates that the orders being executed and available for collocation can only be collocated once at most. Formula (4) indicates that the decision variable x ij 0,1 variable, x ij = 0 means that freight order i and freight order j are not matched, x ij =1, indicating that freight order i is successfully matched with freight order j; In S102, when there are multiple unassigned freight orders that meet the preset rules, a greedy algorithm based on weight sorting from high to low is used to select the best unassigned freight order; or, when there are multiple unassigned freight orders that meet the preset rules, a neighborhood search algorithm or a bipartite graph algorithm is used to select an optimized pairing order and generate an output pairing order; When there are multiple unallocated freight orders that meet the preset rules, a greedy algorithm based on weight sorting from high to low is adopted to select the best unallocated freight order, which specifically includes the following steps: S1021. Traverse the feasible order pairing set and calculate the pairing weight w of each order pairing ij , or Among them, a ij It is 1 if order i and order j can be combined, otherwise it is 0; Indicates the distance saving rate of the group order solution, represents the time saving rate of the group-buying solution, α and β are and The weight coefficient is set by the business's preference for time and distance; in formula (7), M is a sufficiently large number; d vj_1 represents the distance from the driver to the loading point of order j, d j_1j_2 represents the distance from the loading point of order j to the unloading point of order j, d j_2i_2 represents the distance from the unloading point of order j to the unloading point of order i, d j_1i_2 represents the travel distance from the loading point of order j to the unloading point of order i, d i_2j_2 represents the distance from the unloading point of order i to the unloading point of order j, d i represents the driving distance from the driver’s current location to the unloading point of order i, d j It represents the driving distance from the loading point to the unloading point of order j when executing order j alone; t vj_1 represents the time taken by the driver to reach the loading point of order j, t j_1j_2 represents the time taken from the loading point of order j to the unloading point of order j, t j_2i_2 represents the time taken to transport from the unloading point of order j to the unloading point of order i, t j_1i_2 represents the time taken from the loading point of order j to the unloading point of order i, t i_2j_2 represents the time taken from the loading point of order i to the unloading point of order j, t i represents the driving time from the driver’s current location to the unloading point of order i, t j It represents the time it takes for the driver to travel from the loading point to the unloading point of order j when executing order j alone; S1022. Arrange all order pairs according to pairing weights; Specifically: Arrange all order pairs in descending order according to the pairing weights; Arrange all order pairs in ascending order of completion time according to pairing weight; Arrange all order pairs in ascending order of completion distance according to pairing weight; S1023. Traverse all order pairs. If the order pair is not in the output pair list, output the order pair and mark the order pair as an output pair until all order pairs are traversed.

2. The method according to claim 1, characterized in that Let order i be the order task being executed, and order j be the recommended freight order; The specific calculation formula for the longest side of the carriage of the vehicle that is executing an order task is greater than the longest side of the goods of the unassigned freight order is as follows: L j <L d The longest side L of the order j item j Smaller than the longest side L of the vehicle loading space d ; The specific calculation formula for the preset ratio of the volume loaded by the vehicle executing an order task plus the volume of the goods of the unassigned freight order not exceeding the vehicle's loadable volume is as follows: v i +v j ≤αv d The sum of the volumes of order i and order j cannot exceed the predetermined ratio of the volume of the vehicle used by order i, v i represents the volume of goods for order i, v j represents the volume of goods in order j, α represents the proportional coefficient pre-set according to business needs, and v d Indicates the loadable volume of the vehicle when it is unloaded; The specific calculation formula for the weight of the vehicle that is executing an order task plus the weight of the goods of the unassigned freight order not exceeding the preset ratio of the maximum load of the vehicle is as follows: in i +in j ≤βu d Indicates that the sum of the weights of order i and order j cannot exceed the predetermined ratio of the vehicle load used for order i, u i represents the weight of the goods in order i, u j represents the weight of the goods in order j, β represents the proportional coefficient pre-set according to business needs, and u d Indicates the loadable weight of the vehicle when it is unloaded; The driver who is currently executing an order task must meet the estimated hourly income of the driver completing the order task being executed and the recommended freight order, which is not less than the preset threshold. The specific calculation formula is as follows: IPH ij ≥a IPH represents the hourly income after combining orders i and j ij Not less than a predetermined value a; When a driver who is executing an order task is recommended a freight order, he has not yet arrived at the pickup point of the order task he is executing. The distance to the recommended loading point of the freight order must be within the preset range. The specific calculation formula is as follows: d i_1j_1 ≤d0 It means that if an order task is being executed, that is, the driver of order i has not completed the pickup of order i, when a freight order j is recommended, the distance d from the loading point of order i to the loading point of order j is i_1j_1 Cannot exceed d0; d vj_1 ≤d0 It means that if an order task is being executed, that is, the driver of order i has completed the pickup of order i, but has not reached the unloading point of the order task being executed, when a freight order j is recommended, the driver is expected to travel a distance d to reach the loading point of order j vj_1 Cannot exceed d0; When a freight order is recommended to a driver who is currently executing an order task, the estimated time for the driver to arrive at the recommended freight order loading point is within a preset range from the recommended freight order placement time. The specific calculation formula is as follows: If an order task is being executed, that is, the driver of order i has arrived at the pickup point of order i, then: It means that if an order task is being executed, that is, the driver of order i has completed the pickup of order i, when recommending freight order j to the driver, the estimated time of arrival at the loading point of order j and the order time t of order j j The difference is within the predetermined range t0, t represents the current decision moment, t vj_1 represents the time required for the driver to reach the loading point of order j, represents the estimated remaining loading time of the driver at the loading point of order i; If an order task is being executed, that is, the driver of order i has not arrived at the loading point of order i, if b1≤b2, where b1 represents the shortest driving distance required to complete order i and order j when the driver arrives at the loading point of order i first; b2 represents the shortest driving distance required to complete order i and order j when the driver arrives at the loading point of order j first, then t+t vi_1 -t i ≤t0 t+t vi_1 +l i_ +t i_1j_1 -t j ≤t0 It means that the driver follows the plan with the minimum idle rate and arrives at the loading point of order i first. The estimated time when the driver arrives at the loading point of order i is the same as the time when order i is placed. i The difference must be within the predetermined range t0, and the driver's estimated arrival time at the loading point of order j is the same as the order placement time t j The difference must be within the predetermined range t0, t represents the current decision moment, t vi_1 represents the time it takes for the driver to travel to the loading point of order i, l i_ represents the estimated remaining loading time of order i; Otherwise, you must meet t+t vj_1 -t j ≤t0 t+t vj_1 +l j_1 +t j_1i_1 -t i ≤t0 It means that the driver arrives at the loading point of order j first according to the plan with the minimum empty driving rate. The difference between the time when the driver is expected to arrive at the loading point of order j and the time when order j is placed must be within the predetermined range t0, and the difference between the time when the driver is expected to arrive at the loading point of order i and the time when order i is placed must be within the predetermined range t0, t vj_1 represents the time it takes for the driver to travel to the loading point of order i, l j_1 represents the expected loading time of order j, t i_1j_1 It represents the estimated travel time between the loading point of order i and the unloading point of order j.

3. The method according to claim 2, characterized in that The method of estimating the empty driving rate of the order tasks being executed and the recommended freight orders specifically includes the following steps: When the current status of the order task being executed is that the order has been received but has not arrived at the loading point, the calculation logic and related formula for the estimated completion of the order task being executed and the recommended freight order are as follows: c1=d vi_1 +d i_1j_1 +d j_1j_2 +d j_2i_2 c2=d vi_1 +d i_1j_1 +d j_1i_2 +d i_2j_2 b1=min{c1,c2} c3d vj_1 +d j_1i_1 +d i_1j_2 +d j_2i_2 c4=d vj_1 +d j_1i_1 +d i_1i_2 +d i_2j_2 b2=min{c3,c4} b=min{b1,b2} / (d vi_1 +d vj_1 +d i_1i_2 +d j_1j_2 )-1 Where b represents the minimum empty driving rate corresponding to completing the order tasks being executed and the recommended freight orders; b1 represents the shortest driving distance required to complete order i and order j when the driver first goes to the loading point of order i and then to the loading point of order j; b2 represents the shortest driving distance required to complete order i and order j when the driver first goes to the loading point of order j and then goes to the loading point of order i; c1 represents the estimated driving distance for the driver to first arrive at the loading point of order i, then pass through the loading point of order j, the unloading point of order j, and the unloading point of order i in sequence; c2 represents the estimated driving distance for the driver to first arrive at the loading point of order i, then pass through the loading point of order j, the unloading point of order i, and the unloading point of order j in sequence; c3 represents the estimated driving distance for the driver to first arrive at the loading point of order j, then pass through the loading point of order i, the unloading point of order j, and the unloading point of order i in sequence; c4 represents the estimated driving distance for the driver to first arrive at the loading point of order j, then pass through the loading point of order i, the unloading point of order i, and the unloading point of order i in sequence; d vi_1 represents the estimated driving distance of the driver to the loading point of order i; d i_1j_1 represents the estimated travel distance between the loading point of order i and the loading point of order j; d j_1j_2 represents the estimated travel distance from the loading point of order j to the unloading point of order j; d j_2i_2 represents the estimated travel distance from the unloading point of order j to the unloading point of order i; d j_1i_2 represents the estimated travel distance from the loading point of order j to the unloading point of order i; d i_2j_2 represents the estimated travel distance from the unloading point of order i to the unloading point of order j; d vj_1 represents the estimated driving distance of the driver to the loading point of order j; d j_1i_1 represents the estimated travel distance from the loading point of order j to the loading point of order i; d i_1j_2 represents the estimated travel distance between the loading point of order i and the unloading point of order j; d j_2i_2 represents the estimated travel distance between the unloading point of order j and the unloading point of order i; d i_1i_2 represents the estimated travel distance between the loading point of order i and the unloading point of order i; When the current status of the order task being executed is that the order has been received and has arrived at the loading point, the calculation logic and related formula for the estimated completion of the order task being executed and the recommended freight order are as follows: c5=d vj_1 +d j_1j_2 +d j_2i_2 c6=d vj_1 +d j_1i_2 +d i_2j_2 b=min{c5,c6} / (d vi_2 +d j_1j_2 )-1 Among them, d vj_1 represents the distance from the driver to the loading point of order j; d vi_2 Indicates the driving distance from the driver's current location to the destination of order i; c5 indicates that the status of the order task being executed is that the driver has arrived at the loading point of order i, and the estimated driving distance from the current position to the loading point of order j, the unloading point of order j, and the unloading point of order i in sequence; c6 indicates that the status of the order task being executed is that the loading point of order i has been reached, and the driver is expected to travel from the current position through the loading point of order j, the unloading point of order i, and the unloading point of order j in sequence.

4. The method according to claim 2, characterized in that The method of estimating the hourly income of a driver for completing the order tasks being executed and the recommended freight orders specifically includes the following steps: When the current status of the order task being executed is that the order has been received but has not arrived at the loading point, the estimated hourly income calculation logic and related formula for the driver to complete the order task being executed and the recommended freight order are as follows: e1=t vi_1 +t i_1j_1 +t j_1j_2 +t j_2i_2 e2=t vi_1 +t i_1j_1 +t j_1i_2 +t i_2j_2 e3=t vj_1 +t j_1i_1 +t i_1j_2 +t j_2i_2 e4=t vj_1 +t j_1i_1 +t i_1i_2 +t i_2j_2 In calculating the deadhead rate, if b1 ≤ b2 and c1 ≤ c2, then e * = e1; if b1 ≤ b2 and c2 < c1, then e * = e2; if b2 < b1 and c3 ≤ c4, then e * = e3; if b2 < b1 and c4 < c3, then e * = e4 IP ij =(v1+v2) / (e * +l i +l j ) Among them, IPH ij represents the hourly income corresponding to completing order i and order j; e1 represents the estimated driving time for the driver to first arrive at the loading point of order i, then pass through the loading point of order j, the unloading point of order j, and the unloading point of order i in sequence; e2 represents the estimated driving time for the driver to first arrive at the loading point of order i, then pass through the loading point of order j, the unloading point of order i, and the unloading point of order j in sequence; e3 represents the estimated driving time for the driver to first arrive at the loading point of order j, then pass through the loading point of order i, the unloading point of order j, and the unloading point of order i in sequence; e4 represents the estimated driving time for the driver to first arrive at the loading point of order j, then pass through the loading point of order i, the unloading point of order i, and the unloading point of order j in sequence; v i , v j are the amounts of order i and order j respectively; l i , l j are the loading and unloading time of order i and order j estimated by the freight platform respectively; t vi_1 represents the estimated driving time from the driver’s current location to the loading point of order i, t i_1j_1 represents the estimated travel time between the loading point of order i and the unloading point of order j; t j_1j_2 represents the estimated travel time from the loading point of order j to the unloading point of order j, t j_2i_2 It represents the estimated travel time from the unloading point of order j to the unloading point of order i; t j_1i_2 represents the estimated travel time from the loading point of order j to the unloading point of order i, t i_2j_2 It represents the estimated travel time from the unloading point of order i to the unloading point of order j; t vj_1 represents the estimated driving time from the driver’s current location to the loading point of order j, t j_1i_1 It represents the estimated travel time from the loading point of order j to the loading point of order i; t i_1j_2 represents the estimated travel time from the loading point of order i to the unloading point of order j; t j_2i_2 represents the estimated travel time from the unloading point of order j to the unloading point of order i; t i_1i_2 represents the estimated travel time from the loading point of order i to the unloading point of order i; When the current status of the order task being executed is that the order has been received and has arrived at the loading point, the estimated hourly income calculation logic and related formula for the driver to complete the order task being executed and the recommended freight order are as follows: In calculating the deadhead rate, if c5 < c6, then e * = e5, otherwise e * = e6 IPH ij =(in i +v j ) / (e * +l i +l j ) Among them, t represents the current time, represents the time when the driver arrives at the loading point of order i, 5. The method according to claim 2, characterized in that After S102, the method further includes the following steps: Calculate the time when the driver arrives at the loading point of the order task being executed and the recommended freight order, the time when the driver leaves the loading point of the order task being executed and the recommended freight order, the time when the driver arrives at the unloading point of the order task being executed and the recommended freight order, and the time when the unloading of the order task being executed and the recommended freight order is completed and the driver leaves the destination; Generate a route relationship between the order tasks being executed and the recommended freight orders, and send to the driver the time when the driver arrives at the loading point of the order tasks being executed and the recommended freight orders, the time when the driver leaves the loading point of the order tasks being executed and the recommended freight orders, the time when the driver arrives at the unloading point of the order tasks being executed and the recommended freight orders, and the time when the unloading of the order tasks being executed and the recommended freight orders is completed and left.

6. The method according to claim 5, characterized in that Let order i be the order task being executed, and order j be the recommended freight order; When the driver fails to arrive at the loading point for the order being executed, (1) If b1≤b2, then The time it takes for the driver to arrive at the loading point for order i is calculated as in represents the time when the driver arrives at the loading point of order i, t represents the current time, and t vi_1 Indicates the estimated driving time from the driver's current location to the loading point of order i; The time calculation formula for the driver leaving the loading point of order i is: in, represents the time when the driver leaves the loading point of order i, l i_1 represents the estimated time to load the goods at the loading point of order i; The time it takes for the driver to arrive at the loading point of order j is calculated as in, represents the time when the driver arrives at the loading point of order j, t i_1j_1 It represents the estimated driving time of the driver from the loading point of order i to the loading point of order j; The time calculation formula for the driver leaving the loading point of order j is: in, represents the time when the driver leaves the loading point of order j, l j_1 represents the estimated time to load the goods at the loading point of order j; (2) If b1≤b2, and c1>c2, then The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_1i_2 represents the estimated driving time for the driver from the loading point of order j to the unloading point of order i; The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 represents the estimated time to unload at the unloading point of order i; The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t i_2j_2 It represents the estimated driving time for the driver from the unloading point of order i to the unloading point of order j; The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j; (3) If b1≤b2 and c1≤c2, then The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t j_1j_2 represents the estimated driving time of the driver from the loading point of order j to the unloading point of order j; The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j; The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_2i_2 represents the estimated driving time of the driver from the unloading point of order j to the unloading point of order i; The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 represents the estimated unloading time at the unloading point of order i; (4) If b1>b2, then The time it takes for the driver to arrive at the loading point of order j is calculated as in, represents the time when the driver arrives at the loading point of order j, t represents the current time, and t vj_1 represents the estimated driving time from the driver's current location to the loading point of order j; The time calculation formula for the driver leaving the loading point of order j is: in, represents the time when the driver leaves the loading point of order j, l j_1 represents the estimated time to load the goods at the loading point of order j; The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_1i_2 represents the estimated driving time for the driver from the loading point of order j to the unloading point of order i; The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_1 represents the estimated time to load the goods at the loading point of order i; (5) If b1>b2, and c3≤c4, then The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, represents the time when the driver leaves the loading point of order i, t i_1j_2 It represents the estimated driving time of the driver from the loading point of order i to the unloading point of order j; The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j; The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_2i_2 represents the estimated driving time of the driver from the unloading point of order j to the unloading point of order i; The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 represents the estimated time to unload at the unloading point of order i; (6) If b1>b2, and c3≤c4, then The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, represents the time when the driver leaves the loading point of order i, t i_1i_2 It represents the estimated driving time of the driver from the loading point of order i to the unloading point of order i; The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 represents the estimated time to unload at the unloading point of order i; The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t i_2j_2 It represents the estimated driving time for the driver from the unloading point of order i to the unloading point of order j; The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j; When the driver has arrived at the loading point of the order task being executed, (1) If the driver fails to complete the pickup at the loading point for order i, then The time calculation formula for the driver leaving the loading point of order i is: in, represents the time when the driver leaves the loading point of order i, t represents the current time, Indicates the estimated remaining loading time if the driver has arrived at the loading point of order i but has not left it; The time it takes for the driver to arrive at the loading point of order j is calculated as in, represents the time when the driver arrives at the loading point of order j, t i_1j_1 It represents the estimated driving time of the driver from the loading point of order i to the loading point of order j; The time calculation formula for the driver leaving the loading point of order j is: in, represents the time when the driver leaves the loading point of order j, l j_1 represents the estimated time to load the goods at the loading point of order j; (2) If the driver has completed the pickup at the loading point for order i, then The time it takes for the driver to arrive at the loading point of order j is calculated as in, represents the time when the driver arrives at the loading point of order j, t represents the current time, and t vj_1 represents the estimated driving time from the driver's current location to the loading point of order j; The time calculation formula for the driver leaving the loading point of order j is: in, represents the time when the driver leaves the loading point of order j, l j_1 represents the estimated time to load the goods at the loading point of order j; (3) If c5≤c6, then The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t j_1j_2 represents the estimated driving time of the driver from the loading point of order j to the unloading point of order j; The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j; The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, t j_2i_2 represents the estimated driving time of the driver from the unloading point of order j to the unloading point of order i; The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 represents the estimated unloading time at the unloading point of order i; (4) If c5>c6, then The time it takes for the driver to arrive at the unloading point of order i is calculated as follows: in, represents the time when the driver arrives at the unloading point of order i, represents the time when the driver leaves the loading point of order j, t j_1i_2 represents the estimated driving time for the driver from the loading point of order j to the unloading point of order i; The time calculation formula for the driver leaving the unloading point of order i is: in, represents the time when the driver leaves the unloading point of order i, l i_2 represents the estimated time to unload at the unloading point of order i; The time it takes for the driver to arrive at the unloading point of order j is calculated as in, represents the time when the driver arrives at the unloading point of order j, t i_2j_2 It represents the estimated driving time for the driver from the unloading point of order i to the unloading point of order j; The time calculation formula for the driver leaving the unloading point of order j is: in, represents the time when the driver leaves the unloading point of order j, l j_2 represents the estimated time to unload at the unloading point of order j.

7. A dispatching device for freight carpooling, characterized in that: The scheduling device comprises: The acquisition module is used to obtain the unassigned freight orders in the preset area and the vehicle information and corresponding driver information of the order task being executed. The current status of the order task being executed includes the order being received but not arriving at the loading point and the order being received and the goods have been picked up but have not arrived at the unloading point; The recommendation module is used to recommend an unassigned freight order to a driver who is currently executing an order task according to preset rules, and to form a freight carpooling order pairing combination with the order task being executed and the recommended freight order. The preset rules include: The longest side of the vehicle that is executing an order task is larger than the longest side of the goods in the unassigned freight order; The volume loaded on a vehicle that is executing an order task plus the volume of goods in unassigned freight orders does not exceed a preset ratio of the vehicle's loadable volume; The weight of the vehicle that is executing an order task plus the weight of the goods of the unassigned freight order does not exceed the preset proportion of the maximum load of the vehicle; The vehicle that is executing an order task must meet the estimated empty driving rate of the order task being executed and the recommended freight order within the preset range; A driver who is currently executing an order task must meet the estimated hourly income of the driver completing the order task being executed and the recommended freight order is not less than the preset threshold; When a freight order is recommended to a driver who is currently executing an order task, the estimated time for the driver to arrive at the recommended freight order loading point is within a preset range from the recommended freight order placement time; and When a driver who is executing an order task is recommended a freight order, the distance from the driver to the recommended freight order loading point is within a preset range; Recommended modules are specifically used for: Pair the freight orders in order set B with those in order set A to maximize the total weight. Each order can be paired at most once. If freight order i and freight order j do not meet the preset rules after pairing, the pairing weight calculation coefficient a of freight order i and freight order j is ij = 0, so that order i and order j cannot be paired, that is, x ij =0, where order set A represents the order set that is executing an order task, and order set B represents the order set of unassigned freight orders; The specific formula is as follows: Formula (1) indicates that the objective function is to maximize the total weight, where x ij is a decision variable, indicating whether the pairing solution is from the loading point of freight order i to the loading point of freight order j, w ij is the pairing weight of freight order i and freight order j. Formula (2) indicates that the unexecuted orders to be collocated can only be collocated once at most. Formula (3) indicates that the orders being executed and available for collocation can only be collocated once at most. Formula (4) indicates that the decision variable x ij 0,1 variable, x ij = 0 means that freight order i and freight order j are not matched, x ij =1, indicating that freight order i is successfully matched with freight order j; When there are multiple unassigned freight orders that meet the preset rules, a greedy algorithm based on weight sorting from high to low is used to select the best unassigned freight order; or, when there are multiple unassigned freight orders that meet the preset rules, a neighborhood search algorithm or a bipartite graph algorithm is used to select an optimized pairing order and generate an output pairing order; When there are multiple unallocated freight orders that meet the preset rules, a greedy algorithm based on weight sorting from high to low is adopted to select the best unallocated freight order, specifically including: S1021. Traverse the feasible order pairing set and calculate the pairing weight w of each order pairing ij , (6) or Among them, a ij It is 1 if order i and order j can be combined, otherwise it is 0; Indicates the distance saving rate of the group order solution, represents the time saving rate of the group-buying solution, α and β are and The weight coefficient is set by the business's preference for time and distance; in formula (7), M is a sufficiently large number; d vj_1 represents the distance from the driver to the loading point of order j, d j_1j_2 represents the distance from the loading point of order j to the unloading point of order j, d j_2i_2 represents the distance from the unloading point of order j to the unloading point of order i, d j_1i_2 represents the travel distance from the loading point of order j to the unloading point of order i, d i_2j_2 represents the distance from the unloading point of order i to the unloading point of order j, d i represents the driving distance from the driver’s current location to the unloading point of order i, d j It represents the driving distance from the loading point to the unloading point of order j when executing order j alone; t vj_1 represents the time taken by the driver to reach the loading point of order j, t j_1j_2 represents the time taken from the loading point of order j to the unloading point of order j, t j_2i_2 represents the time taken to transport from the unloading point of order j to the unloading point of order i, t j_1i_2 represents the time taken from the loading point of order j to the unloading point of order i, t i_2j_2 represents the time taken from the loading point of order i to the unloading point of order j, t i represents the driving time from the driver’s current location to the unloading point of order i, t j It represents the time it takes for the driver to travel from the loading point to the unloading point of order j when executing order j alone; S1022. Arrange all order pairs according to pairing weights; Specifically: Arrange all order pairs in descending order according to the pairing weights; Arrange all order pairs in ascending order of completion time according to pairing weight; Arrange all order pairs in ascending order of completion distance according to pairing weight; S1023. Traverse all order pairs. If the order pair is not in the output pair list, output the order pair and mark the order pair as an output pair until all order pairs are traversed.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the freight carpooling scheduling method as described in any one of claims 1 to 6 are implemented.

9. A computer device comprising: one or more processors; Memory; as well as One or more computer programs, the processor and the memory are connected via a bus, wherein the one or more computer programs are stored in the memory and are configured to be executed by the one or more processors, wherein the processor implements the steps of the freight carpooling scheduling method as described in any one of claims 1 to 6 when executing the computer program.

Images