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

By allocating vehicles and drivers to freight orders and recommending corresponding bad or good orders, forming a freight relay order pairing combination, the problem of low relative returns in the existing technology is solved, and the efficiency of the freight platform is improved and income.

CN114493369BActive Publication Date: 2024-11-29SHENZHEN YISHIHUOLALA TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202210264578.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-17
Publication Date
2024-11-29
Estimated Expiration
2042-03-17

AI Technical Summary

Technical Problem

Under the existing freight order grabbing and one-car one-order mode, the order acceptance rate of orders with relatively low returns is lower, resulting in the inability to effectively meet freight demand.

Method used

By obtaining good orders and bad orders in the preset area, assigning vehicles and drivers to each good order or bad order according to the preset rules, and recommending corresponding bad orders or good orders to form a pairing combination of freight relay orders to ensure that the vehicle and The driver meets certain loading, driving distance and income requirements.

Benefits of technology

It has improved the order acceptance rate of orders with relatively low returns, improved the order acceptance level and platform transaction volume of freight orders in the same city, reduced the order acceptance operation and waiting time of drivers, and improved the income level of drivers and the attractiveness of the platform.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114493369B_ABST
    Figure CN114493369B_ABST
Patent Text Reader

Abstract

The present application is applicable to the field of freight, and provides a method, device, computer-readable storage medium and computer equipment for dispatching freight relay. The method comprises the following steps: S101, obtaining unallocated freight orders in a preset area, wherein the unallocated freight orders include good orders and bad orders; S102, assigning a vehicle and a corresponding driver to each good order or bad order; S103, when S102 is to assign a vehicle and a corresponding driver to each good order, recommend a bad order for each good order according to a preset rule, or, when S102 is to assign a vehicle and a corresponding driver to each bad order, recommend a good order for each bad order, and a good order and a bad order constitute a freight relay order pairing combination. The present application can increase the acceptance rate of orders with relatively low returns, improve the acceptance level of same-city freight orders and the transaction volume of freight platforms, reduce the driver's order acceptance operation and waiting time, improve the driver's income level, and enhance the platform's attractiveness to drivers.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of freight, and in particular, relates to a method, device, computer-readable storage medium and computer equipment for dispatching freight relays. 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 car one order is implemented, 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 you choose to accept the order, you will take the next order after executing this order. In this mode, the time between the driver completing an order and taking the next order is often uncertain. Usually, the driver needs to complete the previous order before taking the next order, resulting in the driver only taking the orders that he thinks are relatively high-profit. Therefore, orders with relatively low profits are prone to no one taking the orders, that is, the acceptance rate of orders with relatively low profits is low. Summary of the invention

[0003] The purpose of this application is to provide a freight relay scheduling method, device, computer-readable storage medium and computer equipment, aiming to solve the problem that the existing model of grabbing orders and one vehicle one order results in a low order acceptance rate for orders with relatively low returns.

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

[0005] S101, obtaining unallocated freight orders in a preset area, wherein the unallocated freight orders include good orders and bad orders, and the good orders and bad orders are determined according to order-related characteristics, and orders whose related characteristics meet preset rules are determined as good orders, and orders whose related characteristics do not meet preset rules are determined as bad orders;

[0006] S102, assigning a vehicle and a corresponding driver to each good order or bad order;

[0007] S103. When S102 is to assign a vehicle and a corresponding driver to each good order, a bad order is recommended for each good order according to a preset rule, or when S102 is to assign a vehicle and a corresponding driver to each bad order, a good order is recommended for each bad order, and a good order and a bad order form a freight relay order pairing combination, and the preset rules include:

[0008] The volume of the assigned vehicle loaded with the completed order and the volume of the missing order shall not exceed the preset proportion of the vehicle's loadable volume;

[0009] The longest side of the compartment of the assigned vehicle is larger than the longest side of the cargo in the good order and the bad order;

[0010] The assigned vehicle arrives at the pickup point and unloading point of the good order first, and then arrives at the pickup point and unloading point of the bad order, and the estimated driving distance between the unloading point of the good order and the pickup point of the bad order is within a preset range, and the estimated driving time between the unloading point of the good order and the pickup point of the bad order is within a preset range; or, the assigned vehicle arrives at the pickup point and unloading point of the bad order first, and then arrives at the pickup point and unloading point of the good order, and the estimated driving distance between the unloading point of the bad order and the pickup point of the good order is within a preset range, and the estimated driving time between the unloading point of the bad order and the pickup point of the good order is within a preset range;

[0011] The assigned driver must meet the estimated hourly income of the driver for completing good and bad orders and not be less than the preset threshold;

[0012] The assigned vehicles must ensure that the estimated empty driving rate of completed good and bad orders is within the preset range.

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

[0014] An acquisition module is used to acquire unallocated freight orders in a preset area, wherein the unallocated freight orders include good orders and bad orders, and the good orders and bad orders are determined according to order-related characteristics. Orders with relevant characteristics that meet preset rules are determined as good orders, and orders with relevant characteristics that do not meet preset rules are determined as bad orders;

[0015] The allocation module is used to allocate vehicles and corresponding drivers to each good or bad order;

[0016] The recommendation module is used to recommend a bad order for each good order according to a preset rule when the allocation module allocates a vehicle and a corresponding driver to each good order, or to recommend a good order for each bad order when the allocation module allocates a vehicle and a corresponding driver to each bad order. A good order and a bad order constitute a freight relay order pairing combination, and the preset rules include:

[0017] The volume of the assigned vehicle loaded with the completed order and the volume of the missing order shall not exceed the preset proportion of the vehicle's loadable volume;

[0018] The longest side of the compartment of the assigned vehicle is larger than the longest side of the cargo in the good order and the bad order;

[0019] The assigned vehicle arrives at the pickup point and unloading point of the good order first, and then arrives at the pickup point and unloading point of the bad order, and the estimated driving distance between the unloading point of the good order and the pickup point of the bad order is within a preset range, and the estimated driving time between the unloading point of the good order and the pickup point of the bad order is within a preset range; or, the assigned vehicle arrives at the pickup point and unloading point of the bad order first, and then arrives at the pickup point and unloading point of the good order, and the estimated driving distance between the unloading point of the bad order and the pickup point of the good order is within a preset range, and the estimated driving time between the unloading point of the bad order and the pickup point of the good order is within a preset range;

[0020] The assigned driver must meet the estimated hourly income of the driver for completing good and bad orders and not be less than the preset threshold;

[0021] The assigned vehicles must ensure that the estimated empty driving rate of completed good and bad orders is within the preset range.

[0022] In a third aspect, the present application provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the steps of the freight relay scheduling method as described above.

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

[0024] one or more processors;

[0025] Memory; and

[0026] 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 relay scheduling method when executing the computer programs.

[0027] In this application, since the unassigned good orders and bad orders in the preset area are obtained, when assigning a vehicle and a corresponding driver to each good order, a bad order is recommended for each good order according to the preset rules, or, when assigning a vehicle and a corresponding driver to each bad order, a good order is recommended for each bad order, and a good order and a bad order form a freight relay order pairing combination. Therefore, it can increase the acceptance rate of orders with relatively low returns, improve the acceptance level of same-city freight orders and the transaction volume of the freight platform, reduce the driver's order acceptance operation and waiting time, improve the driver's income level, and increase the platform's attractiveness to drivers. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0029] Figure 2It is a rendering of the effect of the freight relay dispatching method provided by an embodiment of the present application.

[0030] Figure 3 This is a functional module block diagram of a freight relay dispatching device provided in one embodiment of the present application.

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

[0032] 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.

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

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

[0035] S101. Obtain unallocated freight orders in a preset area, wherein the unallocated freight orders include good orders and bad orders, which are determined based on order-related characteristics. Orders whose related characteristics meet preset rules are determined as good orders, and orders whose related characteristics do not meet preset rules are determined as bad orders.

[0036] In one embodiment of the present application, for example, an order with an amount higher than a preset amount is judged as a good order, an order with an amount lower than a preset amount is judged as a bad order, an hourly income higher than a preset value is judged as a good order, an hourly income lower than a preset value is judged as a bad order, an order accepted by someone within the scheduled time is judged as a good order, and an order not accepted by anyone within the scheduled time is judged as a bad order, etc.

[0037] S102: Allocate a vehicle and a corresponding driver to each good order or bad order.

[0038] S103. When S102 is to assign a vehicle and a corresponding driver to each good order, a bad order is recommended for each good order according to a preset rule, or when S102 is to assign a vehicle and a corresponding driver to each bad order, a good order is recommended for each bad order, and a good order and a bad order form a freight relay order pairing combination, and the preset rules include:

[0039] The volume of the assigned vehicle loaded with the completed order and the volume of the missing order shall not exceed the preset proportion of the vehicle's loadable volume;

[0040] The longest side of the compartment of the assigned vehicle is larger than the longest side of the cargo in the good order and the bad order;

[0041] The assigned vehicle arrives at the pickup point and unloading point of the good order first, and then arrives at the pickup point and unloading point of the difference order, and the estimated driving distance between the unloading point of the good order and the pickup point of the difference order is within the preset range, for example, the preset range is 10km, and the estimated driving time between the unloading point of the good order and the pickup point of the difference order is within the preset range; or, the assigned vehicle arrives at the pickup point and unloading point of the difference order first, and then arrives at the pickup point and unloading point of the good order, and the estimated driving distance between the unloading point of the difference order and the pickup point of the good order is within the preset range, for example, the preset range is 10km, and the estimated driving time between the unloading point of the difference order and the pickup point of the good order is within the preset range;

[0042] The assigned driver must meet the estimated hourly income of the driver for completing good and bad orders and must not be less than the preset threshold, for example, the preset threshold is 70 yuan / hour;

[0043] The assigned vehicles must ensure that the estimated empty driving rate of completed good and bad orders is within the preset range.

[0044] In one embodiment of the present application, it is assumed that order i is a good order and order j is a bad order;

[0045] The volume of the assigned vehicle loaded with the completed order and the volume of the unloaded order shall not exceed the preset ratio of the vehicle's loadable volume. The specific calculation formula is as follows:

[0046] V i <αV0

[0047] Indicates the preset ratio that the cargo volume of order i is less than the assigned vehicle loadable volume V0, α represents the proportional coefficient (α≤1), V i represents the cargo volume of order i, V0 represents the loadable volume of the assigned vehicle when it is empty;

[0048] V j <αV0

[0049] Indicates that the cargo volume of order j is less than the preset proportion of the allocated vehicle's loadable volume V0.

[0050] The specific calculation formula for the longest side of the compartment of the assigned vehicle is greater than the longest side of the goods in the good order and the bad order is as follows:

[0051] L i <L d

[0052] The longest side L of the goods of order ii Smaller than the longest side L of the compartment of the assigned vehicle d ,

[0053] L j <L d

[0054] The longest side L representing the goods of order j j Smaller than the longest side L of the compartment of the assigned vehicle d .

[0055] The assigned driver must meet the estimated hourly income of the driver completing good orders and bad orders is not less than the preset threshold. The relevant formula is as follows:

[0056] IPH ij ≥a0

[0057] IPH represents the hourly income after the combination of good order i and bad order j ij Not less than the preset threshold a0 (for example, a0 can be the average IPH of platform orders). The specific calculation logic and related formulas are as follows:

[0058] IPH1=(v i +v j ) / (t i_1i_2 +t i_2j_1 +t j_1j_2 +l i +l j )

[0059] IPH2=(v i +v j ) / (t i_2j_1 +t j_2i_1 +t i_1i_2 +l i +l j )

[0060] IPH ij =max{IPH1,IPH2}

[0061] Among them, IPH1 represents the hourly income when the cargo arrives at the pickup and unloading points of the good order first, and then arrives at the pickup and unloading points of the bad order; IPH2 represents the hourly income when the cargo arrives at the pickup and unloading points of the bad order first, and then arrives at the pickup and unloading points of the good order; v i and v j are the amounts of order i and order j respectively, l i and l j are the estimated (based on the median or mean of historical loading and unloading times) loading and unloading times of order i and order j, respectively, t i_1i_2 represents the estimated travel time from the loading point to the unloading point of order i, t i_2j_1represents the estimated travel time from the unloading point of order i to the loading point of order j, t j_2i_1 represents the estimated travel time from the unloading point of order j to the loading point of order i, t j_1j_2 It represents the estimated travel time from the loading point of order j to the unloading point of order j.

[0062] If IPH1≥IPH2, the estimated driving distance between the unloading point of the good order and the pickup point of the bad order must be within the preset range. The specific calculation formula is as follows:

[0063] d i_2j_1 ≤d0

[0064] It means that the estimated driving distance from the unloading point of good order i to the pickup point of bad order j is within the preset range d0 (for example, according to business needs, the average order acceptance distance of platform drivers and the median order acceptance distance are multiplied by a certain coefficient).

[0065] If IPH1<IPH2, the estimated driving distance between the unloading point of the bad order and the pickup point of the good order must be within the preset range. The specific calculation formula is as follows:

[0066] d j_2i_1 ≤d0

[0067] It means that the estimated driving distance from the unloading point of bad order j to the pickup point of good order i is within the preset range d0 (for example, according to business needs, the average order acceptance distance of platform drivers and the median order acceptance distance are multiplied by a certain coefficient).

[0068] If IPH1≥IPH2, the estimated driving time between the unloading point of the good order and the pickup point of the bad order must be within the preset range. The specific calculation formula is as follows:

[0069] t i_2j_1 ≤t0

[0070] It means that the estimated driving time from the unloading point of good order i to the pickup point of bad order j is within the preset range t0 (for example, according to business needs, the average order acceptance time and the median order acceptance waiting time of the platform drivers are multiplied by a certain coefficient).

[0071] If IPH1<IPH2, the estimated driving time between the unloading point of the bad order and the pickup point of the good order must be within the preset range. The specific calculation formula is as follows:

[0072] t j_2i_1 ≤t0

[0073] It means that the estimated driving time from the unloading point of bad order j to the pickup point of good order i is within the preset range t0 (for example, according to business needs, the average order acceptance time and the median order acceptance waiting time of the platform drivers are multiplied by a certain coefficient).

[0074] The assigned vehicles must meet the estimated empty driving rate of completed orders and bad orders within the preset range. The relevant formula is as follows:

[0075] b ij ≤b0

[0076] If IPH1≥IPH2, then

[0077] b ij =(d i_1i_2 +d i_2j_1 +d j_1j_2 ) / (d i_1i_2 +d j_1j_2 )-1

[0078] If IPH1<IPH2, then

[0079] b ij =(d j_1j_2 +d j_2i_1 +d i_1i_2 ) / (d i_1i_2 +d j_1j_2 )-1

[0080] Indicates that the empty driving rate after the combination of good order i and bad order j cannot exceed the specified value b0 (for example, the average empty driving rate of the platform drivers multiplied by the predetermined coefficient), where b ij represents the empty driving rate after the order i and order j are paired, d i_1i_2 represents the estimated travel distance from the loading point to the unloading point of order i, d i_2j_1 represents the estimated travel distance from the unloading point of order i to the loading point of order j, d j_2i_1 represents the estimated travel distance from the unloading point of order j to the loading point of order i, d j_1j_2 It represents the estimated travel distance from the loading point of order j to the unloading point of order j.

[0081] In one embodiment of the present application, in S103, when there are multiple defective orders that meet the preset rules, one good order is combined with multiple defective orders to form multiple freight relay order pairing combinations, and a greedy algorithm based on weight sorting from high to low is used to select the optimal freight relay order pairing combination. The criterion for determining the optimal combination is to maximize the total pairing weight, which is expressed as follows:

[0082]

[0083] Among them, x ij Indicates whether order i forms a freight relay order pairing combination with order j, 0 means no, 1 means yes, w ij represents the pairing weights of good orders i and bad orders j, A represents the set of good orders, and B represents the set of bad orders.

[0084] The specific method of selecting the optimal freight relay order pairing combination may include the following steps:

[0085] S1021, traverse the plurality of freight relay order pairing combinations, and calculate the pairing weight of each freight relay order pairing combination, w ij =IPH ij , where w ij IPH represents the pairing weight of good order i and bad order j, ij represents the hourly income after combining good order i and bad order j;

[0086] S1022, arranging the plurality of freight relay order pairing combinations according to pairing weights;

[0087] Specifically, it can be:

[0088] Arrange the multiple freight relay order pairing combinations in descending order according to the pairing weights;

[0089] Arrange the plurality of freight relay order pairing combinations in ascending order of completion time according to the pairing weights;

[0090] Arrange the plurality of freight relay order pairing combinations in ascending order of completion distance according to the pairing weights;

[0091] S1023, traversing the multiple freight relay order pairing combinations, if the freight relay order pairing combination is not in the output pairing list, output the freight relay order pairing combination, and mark the freight relay order pairing combination as an output pairing, until all freight relay order pairing combinations are traversed.

[0092] In one embodiment of the present application, in S103, when there are multiple difference orders that meet the preset rules, one good order is combined with multiple difference orders to form multiple freight relay order pairing combinations, and a neighborhood search algorithm or a bipartite graph algorithm (such as KM (Kuhn Munkres) algorithm, Hungarian algorithm, HK algorithm, etc.) is used to select the optimal freight relay order pairing combination and output it.

[0093] Figure 2 It is a rendering of the effect of the freight relay dispatching method provided by an embodiment of the present application.

[0094] See also Figure 3 The freight relay 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 relay dispatching device is an application software; the freight relay dispatching device may be used to execute the corresponding steps in the freight relay dispatching method provided in the embodiment of the present application. The freight relay dispatching device provided in one embodiment of the present application includes:

[0095] The acquisition module 11 is used to acquire unallocated freight orders in a preset area, wherein the unallocated freight orders include good orders and bad orders, and the good orders and bad orders are determined according to order-related characteristics. Orders with relevant characteristics that meet preset rules are determined as good orders, and orders with relevant characteristics that do not meet preset rules are determined as bad orders;

[0096] An allocation module 12, for allocating a vehicle and a corresponding driver to each good order or bad order;

[0097] The recommendation module 13 is used to recommend a bad order for each good order according to a preset rule when the allocation module allocates a vehicle and a corresponding driver to each good order, or to recommend a good order for each bad order when the allocation module allocates a vehicle and a corresponding driver to each bad order. A good order and a bad order constitute a freight relay order pairing combination, and the preset rules include:

[0098] The volume of the assigned vehicle loaded with the completed order and the volume of the missing order shall not exceed the preset proportion of the vehicle's loadable volume;

[0099] The longest side of the compartment of the assigned vehicle is larger than the longest side of the cargo in the good order and the bad order;

[0100] The assigned vehicle arrives at the pickup point and unloading point of the good order first, and then arrives at the pickup point and unloading point of the bad order, and the estimated driving distance between the unloading point of the good order and the pickup point of the bad order is within a preset range, and the estimated driving time between the unloading point of the good order and the pickup point of the bad order is within a preset range; or, the assigned vehicle arrives at the pickup point and unloading point of the bad order first, and then arrives at the pickup point and unloading point of the good order, and the estimated driving distance between the unloading point of the bad order and the pickup point of the good order is within a preset range, and the estimated driving time between the unloading point of the bad order and the pickup point of the good order is within a preset range;

[0101] The assigned driver must meet the estimated hourly income of the driver for completing good and bad orders and not be less than the preset threshold;

[0102] The assigned vehicles must ensure that the estimated empty driving rate of completed good and bad orders is within the preset range.

[0103] The freight relay dispatching device provided in one embodiment of the present application and the freight relay 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.

[0104] 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 relay scheduling method provided in an embodiment of the present application are implemented.

[0105] Figure 4A 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 method for dispatching freight relays 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.

[0106] In this application, since the unassigned good orders and bad orders in the preset area are obtained, when assigning a vehicle and a corresponding driver to each good order, a bad order is recommended for each good order according to the preset rules, or, when assigning a vehicle and a corresponding driver to each bad order, a good order is recommended for each bad order, and a good order and a bad order form a freight relay order pairing combination. Therefore, it can increase the acceptance rate of orders with relatively low returns, improve the acceptance level of same-city freight orders and the transaction volume of the freight platform, reduce the driver's order acceptance operation and waiting time, improve the driver's income level, and increase the platform's attractiveness to drivers.

[0107] 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.

[0108] 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).

[0109] The technical features of the above embodiments may be combined arbitrarily. 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.

[0110] 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 relay, characterized in that: It includes the following steps: S101. Obtain unassigned freight orders within a preset area. The unassigned freight orders include good orders and bad orders, which are determined based on order-related characteristics. An order with order-related characteristics conforming to a preset rule is determined as a good order, and an order with order-related characteristics not conforming to the preset rule is determined as a bad order; S102. Assign a vehicle and a corresponding driver to each good order or bad order; S103. When S102 is to assign a vehicle and a corresponding driver to each good order, recommend a bad order for each good order according to a preset rule, or when S102 is to assign a vehicle and a corresponding driver to each bad order, recommend a good order for each bad order. A good order and a bad order form a freight relay order pairing combination. The preset rule includes: The volume of the goods of the good order and the volume of the goods of the bad order loaded by the assigned vehicle do not exceed a preset proportion of the loadable volume of the vehicle; The longest side of the carriage of the assigned vehicle is greater than the longest sides of the goods of the good order and the bad order; The assigned vehicle arrives at the pick-up point and the delivery point of the good order first, and then arrives at the pick-up point and the delivery point of the bad order, and the expected driving distance between the delivery point of the good order and the pick-up point of the bad order is within a preset range, and the expected driving time between the delivery point of the good order and the pick-up point of the bad order is within a preset range; or, the assigned vehicle arrives at the pick-up point and the delivery point of the bad order first, and then arrives at the pick-up point and the delivery point of the good order, and the expected driving distance between the delivery point of the bad order and the pick-up point of the good order is within a preset range, and the expected driving time between the delivery point of the bad order and the pick-up point of the good order is within a preset range; The assigned driver needs to meet the requirement that the estimated hourly income of the driver for completing the good order and the bad order is not less than a preset threshold; The assigned vehicle needs to meet the requirement that the empty driving rate for completing the good order and the bad order is within a preset range; Let order i be a good order and order j be a bad order; The volume of the goods of the good order and the volume of the goods of the bad order loaded by the assigned vehicle do not exceed a preset proportion of the loadable volume of the vehicle. The specific calculation formula is as follows: In i <αV0 Indicates that the volume of the goods of order i is less than the preset ratio of the assigned vehicle loadable volume V0, α represents the proportional coefficient, V i represents the cargo volume of order i, V0 represents the loadable volume of the assigned vehicle when it is empty; In j <αV0 Indicates that the volume of the goods of order j is less than a preset proportion of the loadable volume V0 of the assigned vehicle; The longest side of the carriage of the assigned vehicle is greater than the longest sides of the goods of the good order and the bad order. The specific calculation formula is as follows: L i <L d The longest side L of the goods of order i i Smaller than the longest side L of the compartment of the assigned vehicle d , L j <L d The longest side L representing the goods of order j j Smaller than the longest side L of the compartment of the assigned vehicle d ; The assigned driver needs to meet the requirement that the estimated hourly income of the driver for completing the good order and the bad order is not less than a preset threshold. The relevant formula is as follows: IPH ij ≥a0 IPH represents the hourly income after the combination of good order i and bad order j ij Not less than the preset threshold a0, the specific calculation logic and related formulas are as follows: IPH1=(v i +v j ) / (t i_1i_2 +t i_2j_1 +t j_1j_2 +l i +l j ) IPH2=(v i +v j ) / (t i_2j_1 +t j_2i_1 +t i_1i_2 +l i +l j ) IPH ij =max{IPH1,IPH2} Among them, IPH1 represents the hourly income when the cargo arrives at the pickup and unloading points of the good order first, and then arrives at the pickup and unloading points of the bad order; IPH2 represents the hourly income when the cargo arrives at the pickup and unloading points of the bad order first, and then arrives at the pickup and unloading points of the good order; v i and v j are the amounts of order i and order j respectively, l i and l j are the estimated loading and unloading time of order i and order j, respectively, i_1i_2 represents the estimated travel time from the loading point to the unloading point of order i, t i_2j_1 represents the estimated travel time from the unloading point of order i to the loading point of order j, t j_2i_1 represents the estimated travel time from the unloading point of order j to the loading point of order i, t j_1j_2 It represents the estimated travel time from the loading point of order j to the unloading point of order j; If IPH1≥IPH2, it is necessary to meet the requirement that the expected driving distance between the delivery point of the good order and the pick-up point of the bad order is within a preset range. The specific calculation formula is as follows: d i_2j_1 ≤d0 Indicates that the expected driving distance from the delivery point of good order i to the pick-up point of bad order j is within the preset range d0; If IPH1<IPH2, it is necessary to meet the requirement that the expected driving distance between the delivery point of the bad order and the pick-up point of the good order is within a preset range. The specific calculation formula is as follows: d j_2i_1 ≤d0 Indicates that the expected driving distance from the delivery point of bad order j to the pick-up point of good order i is within the preset range d0; If IPH1≥IPH2, it is necessary to meet the requirement that the expected driving time between the delivery point of the good order and the pick-up point of the bad order is within a preset range. The specific calculation formula is as follows: t i_2j_1 ≤t0 Indicates that the expected driving time from the delivery point of good order i to the pick-up point of bad order j is within the preset range t0; If IPH1 < IPH2, it is necessary to satisfy that the estimated driving time from the unloading point of the differential order to the pick-up point of the good order is within a preset range. The specific calculation formula is as follows: t j_2i_1 ≤t0 Indicates that the estimated driving time from the unloading point of differential order j to the pick-up point of good order i is within the preset range t0; The allocated vehicle needs to satisfy that the empty running rate of estimating the completion of good orders and differential orders is within a preset range. The relevant formula is as follows: b ij ≤b0 If IPH1 ≥ IPH2, then b ij =(d i_1i_2 +d i_2j_1 +d j_1j_2 ) / (d i_1i_2 +d j_1j_2 )-1 If IPH1 < IPH2, then b ij =(d j_1j_2 +d j_2i_1 +d i1i_2 ) / (d i_1i_2 +d j_1j_2 )-1 The empty driving rate after the combination of good order i and bad order j cannot exceed the specified value b0, where b ij represents the empty driving rate after the order i and order j are paired, d i_1i_2 represents the estimated travel distance from the loading point to the unloading point of order i, d i_2j_1 represents the estimated travel distance from the unloading point of order i to the loading point of order j, d j_2i_1 represents the estimated travel distance from the unloading point of order j to the loading point of order i, d j_1j_2 represents the estimated travel distance from the loading point of order j to the unloading point of order .

2. The method according to claim 1, characterized in that Judging the orders with order-related characteristics conforming to the preset rules as good orders and the orders with order-related characteristics not conforming to the preset rules as differential orders specifically as follows: Judging the order with an amount higher than the preset amount as a good order, the order with an amount lower than the preset amount as a differential order, the order with an hourly income higher than the preset value as a good order, the order with an hourly income lower than the preset value as a differential order, the order with someone taking the order within a predetermined time as a good order, and the order with no one taking the order within a predetermined time as a differential order, either one or any combination thereof.

3. The method according to claim 1, characterized in that In S103, when there are multiple differential orders that meet the preset rules, one good order forms multiple freight relay order pairing combinations with multiple differential orders respectively. Using a greedy algorithm sorted by weight from high to low, the optimal freight relay order pairing combination is selected. The judgment criterion for the optimal combination is to maximize the total pairing weight, which is expressed by the formula: Among them, let order i be a good order, order j be a bad order, x ij Indicates whether order i forms a freight relay order pairing combination with order j, 0 means no, 1 means yes, w ij Represents the pairing weights of good orders i and bad orders, A represents the set of good orders, and B represents the set of bad orders.

4. The method according to claim 3, characterized in that The specific method for selecting the optimal freight relay order pairing combination includes the following steps: S1021, traverse the plurality of freight relay order pairing combinations, and calculate the pairing weight of each freight relay order pairing combination, w ij =IPHi j , where w ij IPH represents the pairing weight of good order i and bad order j, ij It represents the hourly income after combining good orders and bad orders; S1022. Arrange the multiple freight relay order pairing combinations according to the pairing weight; S1023. Traverse the multiple freight relay order pairing combinations. If the freight relay order pairing combination is not in the output pairing list, output the freight relay order pairing combination and mark the freight relay order pairing combination as the output pairing until all freight relay order pairing combinations are traversed.

5. The method according to claim 4, characterized in that The specific content of S1022 is: Arrange the multiple freight relay order pairing combinations in descending order according to the size of the pairing weight; Arrange the multiple freight relay order pairing combinations in ascending order of completion time according to the pairing weight; Arrange the multiple freight relay order pairing combinations in ascending order of completion distance according to the pairing weight.

6. The method according to claim 1, characterized in that In S103, when there are multiple differential orders that meet the preset rules, one good order forms multiple freight relay order pairing combinations with multiple differential orders respectively. Use the neighborhood search algorithm or the bipartite graph algorithm to select the optimal freight relay order pairing combination and output it.

7. A dispatching device for freight relay, characterized in that: Including: An acquisition module for acquiring unallocated freight orders within a preset area. The unallocated freight orders include good orders and differential orders. Good orders and differential orders are determined according to order-related characteristics. The orders with order-related characteristics conforming to the preset rules are determined as good orders, and the orders with order-related characteristics not conforming to the preset rules are determined as differential orders; An allocation module for allocating vehicles and corresponding drivers to each good order or differential order; A recommendation module, which is used to recommend a bad order for each good order according to preset rules when the allocation module allocates a vehicle and a corresponding driver to each good order, or to recommend a good order for each bad order when the allocation module allocates a vehicle and a corresponding driver to each bad order. A good order and a bad order form a freight relay order pairing combination. The preset rules include: The volumes of the goods of the good order and the bad order loaded by the allocated vehicle do not exceed a preset ratio of the vehicle's loadable volume; The longest side of the carriage of the allocated vehicle is greater than the longest sides of the goods of the good order and the bad order; The allocated vehicle arrives at the pick-up point and the delivery point of the good order first, and then arrives at the pick-up point and the delivery point of the bad order, and the expected driving distance between the delivery point of the good order and the pick-up point of the bad order is within a preset range, and the expected driving time between the delivery point of the good order and the pick-up point of the bad order is within a preset range; or, the allocated vehicle arrives at the pick-up point and the delivery point of the bad order first, and then arrives at the pick-up point and the delivery point of the good order, and the expected driving distance between the delivery point of the bad order and the pick-up point of the good order is within a preset range, and the expected driving time between the delivery point of the bad order and the pick-up point of the good order is within a preset range; The allocated driver needs to meet the requirement that the estimated hourly income of the driver for completing the good order and the bad order is not less than a preset threshold; The allocated vehicle needs to meet the requirement that the estimated empty running rate for completing the good order and the bad order is within a preset range; Let order i be a good order and order j be a bad order; The volumes of the goods of the good order and the bad order loaded by the allocated vehicle do not exceed a preset ratio of the vehicle's loadable volume. The specific calculation formula is as follows: In i <αV0 Indicates that the volume of the goods of order i is less than the preset ratio of the assigned vehicle loadable volume V0, α represents the proportional coefficient, V i represents the cargo volume of order i, V0 represents the loadable volume of the assigned vehicle when it is empty; In j <αV0 Indicates that the volume of the goods of order j is less than the preset ratio of the loadable volume V0 of the allocated vehicle; The longest side of the carriage of the allocated vehicle is greater than the longest sides of the goods of the good order and the bad order. The specific calculation formula is as follows: L i <L d The longest side L of the goods of order i i Smaller than the longest side L of the compartment of the assigned vehicle d , L j <L d The longest side L representing the goods of order j j Smaller than the longest side L of the compartment of the assigned vehicle d ; The allocated driver needs to meet the requirement that the estimated hourly income of the driver for completing the good order and the bad order is not less than a preset threshold. The relevant formula is as follows: IPH ij ≥a0 IPH represents the hourly income after the combination of good order i and bad order j ij Not less than the preset threshold a0, the specific calculation logic and related formulas are as follows: IPH1=(v i +v j ) / (t i_1i_2 +t i_2j_1 +t j_1j_2 +l i +l j ) IPH2=(v i +v j ) / (t i_2j_1 +t j _ 2i_1 +t i_1i_2 +l i +l j ) IPH ij =max{IPH1,IPH2} Among them, IPH1 represents the hourly income when the cargo arrives at the pickup and unloading points of the good order first, and then arrives at the pickup and unloading points of the bad order; IPH2 represents the hourly income when the cargo arrives at the pickup and unloading points of the bad order first, and then arrives at the pickup and unloading points of the good order; v i and v j are the amounts of order i and order j respectively, l i and l j are the estimated loading and unloading time of order i and order j, respectively, i_1i_2 represents the estimated travel time from the loading point to the unloading point of order i, t i_2j_1 represents the estimated travel time from the unloading point of order i to the loading point of order j, t j_2i_1 represents the estimated travel time from the unloading point of order j to the loading point of order i, t j_1j_2 It represents the estimated travel time from the loading point of order j to the unloading point of order j; If IPH1≥IPH2, then it is necessary to meet the requirement that the expected driving distance between the delivery point of the good order and the pick-up point of the bad order is within a preset range. The specific calculation formula is as follows: d i_2j_1 ≤d0 Indicates that the expected driving distance from the delivery point of good order i to the pick-up point of bad order j is within the preset range d0; If IPH1<IPH2, then it is necessary to meet the requirement that the expected driving distance between the delivery point of the bad order and the pick-up point of the good order is within a preset range. The specific calculation formula is as follows: d j_2i_1 ≤d0 Indicates that the expected driving distance from the delivery point of bad order j to the pick-up point of good order i is within the preset range d0; If IPH1≥IPH2, then it is necessary to meet the requirement that the expected driving time between the delivery point of the good order and the pick-up point of the bad order is within a preset range. The specific calculation formula is as follows: t i_2j_1 ≤t0 Indicates that the expected driving time from the delivery point of good order i to the pick-up point of bad order j is within the preset range t0; If IPH1<IPH2, then it is necessary to meet the requirement that the expected driving time between the delivery point of the bad order and the pick-up point of the good order is within a preset range. The specific calculation formula is as follows: t j_2i_1 ≤t0 Indicates that the expected driving time from the delivery point of bad order j to the pick-up point of good order i is within the preset range t0; The allocated vehicle needs to meet the requirement that the estimated empty running rate for completing the good order and the bad order is within a preset range. The relevant formula is as follows: b ij ≤b0 If IPH1≥IPH2, then b ij =(d i_1i_2 +d i_2j_1 +d j_1j_2 ) / (d i_1i_2 +d j_1j_2 )-1 If IPH1 < IPH2, then b ij =(d j_1j_2 +d j_2i_1 +d i_1i_2 ) / (d i_1i_2 +d j_1j_2 )-1 The empty driving rate after the combination of good order i and bad order j cannot exceed the specified value b0, where b ij represents the empty driving rate after the order i and order j are paired, d i_1i_2 represents the estimated travel distance from the loading point to the unloading point of order i, d i_2j_1 represents the estimated travel distance from the unloading point of order i to the loading point of order j, d j_2i_1 represents the estimated travel distance from the unloading point of order j to the loading point of order i, d j_1j_2 It represents the estimated travel distance from the loading point of order j to the unloading point of order j.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, it implements the steps of the scheduling method for freight relay according to any one of claims 1 to 6.

9. A computer device, comprising: One or more processors; A memory; And One or more computer programs, wherein the processor and the memory are connected by a bus. The one or more computer programs are stored in the memory and configured to be executed by the one or more processors. It is characterized in that when the processor executes the computer program, it implements the steps of the scheduling method for freight relay according to any one of claims 1 to 6.

Citation Information

Patent Citations

  • Working method for carrying out optimal scheduling on goods orders and carrier vehicles based on scheduling requirements

    CN112418552A

  • Freight adjustment and control method for combined spelling

    CN112801336A