Method and device for intelligent dispatching of drop and hook

Abstract

This application discloses a method and apparatus for intelligent drop-and-hook dispatching. The method comprises pre-matching a vehicle's pending orders based on at least one vehicle's information, at least one pending order, constraints, and hooking conditions, obtaining at least one pre-matching solution; and determining the vehicle's pending orders and hooking method based on the optimal solution among the at least one pre-matching solution. This application aims to use drop-and-hook to more rationally assign orders to vehicles, achieve more intelligent freight dispatching, and improve efficiency.

Description

Technical Field

[0001] The present application relates to the field of logistics technology, and more specifically, to a method and device for intelligent dispatching of drop-and-hook systems. Background Art

[0002] In the field of logistics, especially truck freight, there are situations such as empty vehicles, low average daily orders, and long order intervals, which will cause a huge waste of transportation resources, increase freight costs, reduce logistics efficiency, and reduce carriers' income. Therefore, how to reduce the occurrence of these situations and enable carriers to complete the most orders at the lowest cost in the same time has become an urgent problem to be solved. Summary of the Invention

[0003] The main purpose of this application is to provide a method and device for intelligent dispatching of drop-and-hook, which uses drop-and-hook to more reasonably allocate orders to vehicles, achieve more intelligent freight dispatching, and improve efficiency.

[0004] In order to achieve the above-mentioned purpose, according to the first aspect of the present application, a method for intelligent scheduling of drop-and-hook is provided.

[0005] The method for intelligent dispatching of drop-and-hook according to the present application includes:

[0006] Pre-matching the vehicle's pending orders based on at least one vehicle information, at least one pending order information, constraints, and usage conditions to obtain at least one pre-matching solution;

[0007] The order to be executed and the hooking mode of the vehicle are obtained according to the optimal solution in at least one pre-matching solution.

[0008] Optionally, the hooking condition is a condition that limits the hooking form of the at least one vehicle information and the at least one order information to be allocated in the pre-matching.

[0009] Optionally, the hooking condition includes at least one of double-sided hooking, loading hooking, unloading hooking, and no hooking, characterized in that:

[0010] The judgment criteria for using double-sided drop-and-hook is that the time when the vehicle arrives at the unloading location of the currently executed order plus the rest time of the vehicle driver plus the driving time between the unloading location of the currently executed order and the loading location of the pre-matched order does not exceed the delivery time of the pre-matched order;

[0011] The judgment criteria for adopting the loading and unloading method are that the time when the vehicle completes the unloading task of the current order plus the rest time of the vehicle driver plus the driving time between the unloading location of the current order and the loading location of the pre-matched order does not exceed the delivery time of the pre-matched order;

[0012] The criteria for using unloading and dropping is that the time when the vehicle completes the unloading task of the current order plus the rest time of the vehicle driver plus the driving time between the unloading location of the current order and the loading location of the pre-matched order plus the pickup time does not exceed the delivery time of the pre-matched order;

[0013] The judgment condition for not dropping off the hook is that the time point when the vehicle completes the unloading task of the current order plus the rest time of the vehicle driver plus the driving time between the unloading place where the vehicle is executing the order and the loading place of the pre-matched order does not exceed the loading dock time point of the pre-matched order.

[0014] Optionally, the use and hook condition includes a condition, wherein pre-matching the to-be-executed orders of the vehicle based on at least one vehicle information, at least one to-be-allocated order information, the constraint condition, and the use and hook condition to obtain at least one pre-matching solution includes:

[0015] Obtain at least one vehicle information and at least one to-be-assigned order information;

[0016] In combination with the constraint condition, a vehicle that meets the constraint condition is selected from at least one vehicle information, and an order to be allocated that meets the constraint condition is selected from at least one order to be allocated information;

[0017] Determine whether the selected vehicle and the selected order to be assigned meet the conditions for use;

[0018] If the conditions are met, the pre-matching relationship between the vehicle and the order to be executed and the corresponding hooking form are recorded, and the hooking form corresponds to the hooking conditions.

[0019] Optionally, the use and hook conditions include two or more conditions, and pre-matching the vehicle's pending orders based on at least one vehicle information, at least one to-be-allocated order information, the constraint conditions, and the use and hook conditions to obtain at least one pre-matching solution includes:

[0020] Obtain at least one vehicle information and at least one to-be-assigned order information;

[0021] In combination with the constraint condition, a vehicle that meets the constraint condition is selected from at least one vehicle information, and an order to be allocated that meets the constraint condition is selected from at least one order to be allocated information;

[0022] Determine whether the selected vehicle and the selected order to be assigned meet the lowest priority condition among the conditions for using and hanging. Different conditions have different priorities.

[0023] If it is satisfied, after obtaining the highest priority condition among the use and hook conditions, the pre-matching relationship between the vehicle and the order to be executed and the use and hook form corresponding to the highest priority condition that can be met are recorded.

[0024] Optionally, before obtaining the to-be-executed order and the hooking method of the vehicle according to the optimal solution among at least one pre-matching solution, the method further includes:

[0025] Calculate the sum of the information corresponding to each type of information of all pre-matched orders to be allocated in each pre-matching solution;

[0026] The optimal solution is selected based on the sum of one or more information to maximize the overall benefit.

[0027] Furthermore, the sum of the information includes at least one of the sum of the transportation mileage of the pre-matched orders to be allocated, the sum of the quantities of the pre-matched orders to be allocated, and the sum of the prices of the pre-matched orders to be allocated.

[0028] In order to achieve the above-mentioned purpose, according to the second aspect of the present application, a device for intelligent scheduling of drop-and-hook is provided.

[0029] The device for intelligent dispatching of drop-and-hook according to the present application includes:

[0030] A data input unit, configured to input at least one vehicle information, at least one to-be-allocated order information, constraint conditions, and usage conditions into the pre-matching unit;

[0031] a pre-matching unit, configured to pre-match the vehicle's pending orders based on at least one vehicle information, at least one pending order information, constraints, and usage conditions, obtain at least one pre-matching solution, and input the at least one pre-matching solution into the selection unit;

[0032] A selection unit, configured to select an optimal solution from at least one pre-matching solution;

[0033] The matching unit is used to obtain the vehicle's pending orders and usage methods according to the optimal solution.

[0034] Optionally, the pre-matching unit includes:

[0035] A selection module is used to select a vehicle that meets the constraint conditions from at least one vehicle information and select an order to be allocated that meets the constraint conditions from at least one order to be allocated information in combination with the constraint conditions;

[0036] The judgment module is used to judge whether the vehicle selected by the selection module and the order to be assigned can meet the conditions for use;

[0037] The recording module is used to record the pre-matching relationship between the vehicle and the order to be executed and the corresponding hooking form if the hooking condition is met, and the hooking form corresponds to the hooking condition.

[0038] Optionally, the judgment module is further configured to:

[0039] Determine whether the vehicle selected by the selection module and the selected order to be assigned can meet the lowest priority condition among the conditions for use and suspension. Different conditions have different priorities.

[0040] The recording module is further configured to, if the condition with the lowest priority among the use and suspension conditions is met, obtain the condition with the highest priority among the use and suspension conditions that can be met, and then record the pre-matching relationship between the vehicle and the order to be executed and the use and suspension form corresponding to the condition with the highest priority that can be met.

[0041] In order to achieve the above-mentioned purpose, according to the third aspect of the present application, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the method for intelligent scheduling of drop-and-hook as described in any one of the above-mentioned first aspects.

[0042] In order to achieve the above-mentioned purpose, according to the fourth aspect of the present application, an electronic device is provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor executes the method for intelligent scheduling of drop-and-hook described in any one of the above-mentioned first aspects.

[0043] In an embodiment of the present application, a method and apparatus for intelligent drop-and-hook dispatching pre-matches a vehicle's pending orders based on at least one vehicle's information, at least one pending order's information, constraints, and hooking conditions, obtaining at least one pre-matching solution. The vehicle's pending orders and hooking method are then determined based on the optimal solution among the at least one pre-matching solution. This achieves intelligent matching of vehicles and orders, maximizes the use of drop-and-hook to improve the matching success rate of waybills, minimizes the increased transportation costs associated with drop-and-hook, and improves transportation efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] The drawings that constitute part of this application are used to provide a further understanding of this application and make other features, objects and advantages of this application more apparent. The illustrative embodiment drawings of this application and their descriptions are used to explain this application and do not constitute an improper limitation of this application. In the drawings:

[0045] Figure 1 This is a flow chart of a method for intelligent dispatching of drop-and-hook provided in accordance with an embodiment of the present application;

[0046] Figure 2 This is a block diagram of a device for intelligent dispatching of drop-and-hook operations according to an embodiment of the present application;

[0047] Figure 3 This is a block diagram of another device for intelligent dispatching of drop-and-hook vehicles provided according to an embodiment of the present application. DETAILED DESCRIPTION

[0048] In order to enable those skilled in the art to better understand the present invention, the following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of this application.

[0049] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present application described here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0050] It should be noted that, in the absence of conflict, the embodiments and features of the embodiments in this application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0051] According to an embodiment of the present application, a method for intelligent scheduling of drop-and-hook is provided, such as Figure 1 As shown, the method includes the following steps:

[0052] S101. Pre-match the vehicle's pending orders based on at least one vehicle information, at least one to-be-allocated order information, constraints, and usage conditions to obtain at least one pre-matching solution.

[0053] The vehicle information includes the information required to complete the pre-matching process, such as vehicle location information, vehicle identification information, vehicle current order execution information, etc.

[0054] Among them, the order information to be assigned includes the information required to complete the transportation task, such as the order identification information to be assigned, the loading location information of the order to be assigned, the loading time information of the order to be assigned, the unloading location information of the order to be assigned, the unloading time information of the order to be assigned, etc.

[0055] Constraints are conditions that constrain the pre-matching of at least one vehicle and at least one pending order, preventing logical errors. Constraints include at least one of the following conditions or a combination thereof: 1) Each pending order can be pre-matched with at most one vehicle in a pre-matching scenario; 2) Each vehicle can be pre-matched with at most one pending order in a pre-matching scenario.

[0056] The "use conditions" restrict the use of at least one vehicle and at least one pending order in the pre-matching process. This ensures timely order completion while minimizing the additional costs associated with drop-offs. Use conditions can be set before pre-matching.

[0057] The specific conditions for using the application are any one of the following or their combination, and different conditions have different priorities:

[0058] 1) Double-side drop-and-hook (priority 1): When the vehicle is unloading the current order and loading the pre-matched order later, the drop-and-hook method is used.

[0059] The specific judgment criteria for using double-sided drop-and-hook is that the time the vehicle arrives at the unloading location of the currently executed order plus the vehicle driver's rest time plus the driving time between the unloading location of the currently executed order and the loading location of the pre-matched order does not exceed the delivery time of the pre-matched order;

[0060] That is, the time point when the vehicle arrives at the unloading place of the currently executed order + the rest time of the vehicle driver + the driving time between the unloading place of the currently executed order and the loading place of the pre-matched order ≤ the shipping time point of the pre-matched order.

[0061] Among them, the time point when the vehicle arrives at the unloading place of the currently executed order can be obtained by: obtaining it from the order information (such as the time point when the vehicle arrives at the unloading place required in the vehicle's currently executed order information), or it can be combined with the vehicle position positioning system to obtain the time point when the vehicle arrives at the unloading place of the currently executed order through the driving time between the current position of the vehicle and the unloading place. There is no limitation on the acquisition method here, as long as the time point when the vehicle arrives at the unloading place of the currently executed order can be determined.

[0062] Among them, the vehicle driver's rest time can be obtained in accordance with relevant legal provisions or implementation standards. For example, after completing a certain mileage of driving, the driver needs to complete a corresponding rest time, and the specific value can be obtained using existing methods.

[0063] Among them, the driving time between the unloading place of the vehicle's current order execution and the loading place of the pre-matched order can be obtained by subtracting the difference between the unloading time point required in the vehicle's current order execution information and the delivery time point required in the pre-matched order information (that is, the pre-matched order information to be assigned). It can also be set manually, or it can be determined based on the driving time between the unloading place and the loading place in the navigation software. There is no restriction on the method of obtaining this time in this embodiment.

[0064] The delivery time point of the pre-matched order can be obtained by directly obtaining it from the pre-matched order information to be allocated. Each order information to be allocated contains the information required to complete the transportation task, and the required delivery time point is set in advance.

[0065] 2) Loading and Dropping (Priority 2): Dropping and hanging is only used when loading pre-matched orders, and is not used when unloading orders currently being executed by the vehicle.

[0066] The specific judgment conditions for using loading and dropping off are the time point when the vehicle completes the unloading task of the current order plus the vehicle driver's rest time plus the driving time between the unloading location of the current order and the loading location of the pre-matched order, which does not exceed the delivery time point of the pre-matched order.

[0067] That is, the time point when the vehicle completes the unloading task of the currently executed order + the rest time of the vehicle driver + the driving time between the unloading location of the currently executed order and the loading location of the pre-matched order ≤ the shipping time point of the pre-matched order.

[0068] The time point at which the vehicle completes the unloading task of the currently executed order can be obtained by: obtaining it from the order information (such as the time point at which the vehicle is required to complete unloading in the vehicle's currently executed order information), or by adding the time point at which the vehicle arrives at the unloading location of the currently executed order to the unloading time. There is no limitation on the obtaining method here, as long as it is the time point at which the vehicle can complete the unloading task of the currently executed order. It should be noted that the unloading time is the time taken by the vehicle to unload the currently executed order. This time can be determined based on the time taken in previous similar orders, or it can be set manually. There is no limitation on the method of obtaining the unloading time here.

[0069] Among them, the method of obtaining the vehicle driver's rest time, the method of obtaining the driving time between the unloading place of the vehicle's current order and the loading place of the pre-matched order, and the method of obtaining the delivery time point of the pre-matched order can all be referred to the corresponding acquisition method in bilateral drop and pull, and will not be repeated here.

[0070] 3) Unloading and Drop-and-Hook (Priority 3): Drop-and-hook is only used when the vehicle is unloading the current order, and is not used when loading the pre-matched order.

[0071] Specific judgment conditions for adopting unloading and dropping the hook: when the time point when the vehicle completes the unloading task of the current order plus the vehicle driver's rest time plus the driving time between the unloading location of the current order and the loading location of the pre-matched order plus the pickup time does not exceed the delivery time point of the pre-matched order, unloading and dropping the hook is adopted.

[0072] That is, the time point when the vehicle completes the unloading task of the current order + the rest time of the vehicle driver + the driving time between the unloading location of the current order to the loading location of the pre-matched order + the pickup time ≤ the shipping time of the pre-matched order.

[0073] The method for obtaining the suspension time can be: manually set, or determined based on the time taken in previous similar orders. The method for obtaining the suspension time is not limited here.

[0074] Among them, the method for obtaining the time point when the vehicle completes the unloading task of the current order can refer to the corresponding acquisition method in loading and unloading, which will not be repeated here.

[0075] Among them, the methods for obtaining the vehicle driver's rest time, the driving time between the unloading location of the vehicle's current order and the loading location of the pre-matched order, and the delivery time point of the pre-matched order can all be referred to the corresponding acquisition methods in bilateral drop-and-hook, and will not be repeated here.

[0076] 4) No drop-and-hook (priority 4): Whether loading a pre-matched order or unloading an order currently being executed by the vehicle, no drop-and-hook is used.

[0077] The specific judgment conditions for adopting the non-dropping and hooking method are: when the time point when the vehicle completes the unloading task of the current order plus the vehicle driver's rest time plus the driving time between the unloading location where the vehicle is executing the order and the loading location of the pre-matched order does not exceed the loading dock time point of the pre-matched order, the non-dropping and hooking method is adopted.

[0078] That is, the time point when the vehicle completes the unloading task of the currently executed order + the rest time of the vehicle driver + the driving time between the unloading location of the currently executed order and the loading location of the pre-matched order ≤ the loading time point of the pre-matched order.

[0079] The loading time of the pre-matched order can be obtained by directly obtaining it from the pre-matched order information to be allocated. Each order information to be allocated contains the information required to complete the transportation task, and the required loading time is set in advance.

[0080] Among them, the method for obtaining the time point when the vehicle completes the unloading task of the current order can refer to the corresponding acquisition method in loading and unloading, which will not be repeated here.

[0081] Among them, the methods for obtaining the vehicle driver's rest time and the driving time between the unloading location of the vehicle's current order and the loading location of the pre-matched order can refer to the corresponding methods for obtaining it in bilateral drop-and-hook, and will not be repeated here.

[0082] It should be noted that the priorities of the four aforementioned conditions are ranked by the cost of the condition. The higher the cost, the lower the priority of the condition. In other words, the priority order from low to high is: Priority 1 < Priority 2 < Priority 3 < Priority 4. In practice, the lower the cost, the lower the priority of the condition. This is not a limitation in this application.

[0083] Specifically, "pre-matching the vehicle's pending orders based on at least one vehicle information, at least one pending order information, constraints, and usage conditions to obtain at least one pre-matching solution" includes the following two solutions:

[0084] The first solution uses a hanging condition that contains only one condition. The implementation process can be:

[0085] At least one vehicle information and at least one pending order information are retrieved from a system or storage device. Based on the constraints, a vehicle that satisfies the constraints is selected from the at least one vehicle information, and an order that satisfies the constraints is selected from the at least one pending order information. A determination is made as to whether the selected vehicle and the selected pending order meet the usage conditions. If so, the pre-matching relationship between the vehicle and the pending order and the corresponding usage form are recorded. This process is repeated until a stop condition is met, or until at least one vehicle information item no longer meets the constraints, or until at least one pending order information no longer meets the constraints. This completes a pre-matching solution. If additional pre-matching solutions are required, the process can be repeated until all pre-matching solutions are identified.

[0086] Let's take a specific example to illustrate:

[0087] Assume that there are currently vehicle 1 and vehicle 2, and orders need to be assigned to the two vehicles; in addition, there are pending orders 1, pending orders 2, and pending orders 3, and the three pending orders can be assigned.

[0088] The constraints are: each order to be assigned can be pre-matched with at most one vehicle in a pre-matching solution, or each vehicle can be pre-matched with at most one order to be assigned in a pre-matching solution.

[0089] The conditions for using the hook are: the conditions for loading and dropping the hook, that is, when the time point when the vehicle completes the unloading task of the current order plus the vehicle driver's rest time plus the driving time between the unloading place of the current order and the loading place of the pre-matched order does not exceed the shipping time point of the pre-matched order, loading and dropping the hook is used.

[0090] Here we assume that

[0091] The time when vehicle 1 completes the unloading task of the current order plus the rest time of vehicle 1's driver plus the driving time between the unloading location of vehicle 1 and the loading location of pending order 1 does not exceed the shipping time of pending order 1. Therefore, vehicle 1 meets the hooking conditions during the pre-matching process with pending order 1.

[0092] The time when vehicle 1 completes the unloading task of the current order plus the rest time of vehicle 1's driver plus the driving time between the unloading location of the current order and the loading location of pending order 2 exceeds the delivery time of pending order 2. Therefore, vehicle 1 cannot meet the hooking conditions during the pre-matching process with pending order 2.

[0093] The time when vehicle 1 completes the unloading task for the currently executed order, plus the rest time of vehicle 1's driver, plus the driving time between the unloading location of vehicle 1 and the loading location of pending order 3, exceeds the shipping time of pending order 3. Therefore, vehicle 1 cannot meet the hooking conditions during the pre-matching process with pending order 3.

[0094] The time when vehicle 2 completes the unloading task for the currently executed order, plus the rest time of vehicle 2's driver, plus the driving time between the unloading location of vehicle 2 and the loading location of pending order 1, exceeds the delivery time of pending order 1. Therefore, vehicle 2 cannot meet the hooking conditions during the pre-matching process with pending order 1.

[0095] The time when vehicle 2 completes the unloading task for the currently executed order plus the rest time of vehicle 2's driver plus the driving time between the unloading location of vehicle 2 and the loading location of pending order 2 does not exceed the shipping time of pending order 1. Therefore, vehicle 2 meets the hooking conditions during the pre-matching process with pending order 2.

[0096] The time when vehicle 2 completes the unloading task for the currently executed order, plus the rest time of vehicle 2's driver, plus the driving time between the unloading location of vehicle 2 and the loading location of pending order 3, exceeds the shipping time of pending order 3. Therefore, vehicle 2 cannot meet the hooking conditions during the pre-matching process with pending order 3.

[0097] This results in a total of six pre-matching solutions.

[0098] Solution 1: Vehicle 1 executes order 1 in the form of loading and unloading, and vehicle 2 executes order 2 in the form of loading and unloading.

[0099] Solution 2: Vehicle 1 executes order 1 to be assigned in the form of cargo drop-and-hook, and vehicle 2 does not complete the pre-matching (because vehicle 2 cannot execute order 3 to be assigned in the form of cargo drop-and-hook).

[0100] Solution 3: Vehicle 1 fails to complete pre-matching (because vehicle 1 cannot execute order 2 to be assigned in the form of drop-and-hook), and vehicle 2 fails to complete pre-matching (because vehicle 2 cannot execute order 1 to be assigned in the form of drop-and-hook).

[0101] Solution 4: Vehicle 1 fails to complete pre-matching (because vehicle 1 cannot execute order 2 to be assigned in the form of drop-and-hook), and vehicle 2 fails to complete pre-matching (because vehicle 2 cannot execute order 3 to be assigned in the form of drop-and-hook).

[0102] Solution 5: Vehicle 1 fails to complete pre-matching (because vehicle 1 cannot execute order 3 to be assigned in the form of drop-and-hook), and vehicle 2 fails to complete pre-matching (because vehicle 2 cannot execute order 1 to be assigned in the form of drop-and-hook).

[0103] Solution 6: Vehicle 1 fails to complete pre-matching (because Vehicle 1 cannot execute Order 3 in the form of cargo drop-and-hook), and Vehicle 2 executes Order 2 in the form of cargo drop-and-hook.

[0104] The second solution is to use a hanging condition that includes two or more conditions. The implementation process can be:

[0105] At least one vehicle information and at least one pending order information are obtained from a system or storage device; based on the constraints, a vehicle that satisfies the constraints is selected from the at least one vehicle information, and an order that satisfies the constraints is selected from the at least one pending order information; a determination is made as to whether the selected vehicle and the selected order satisfy the lowest priority condition among the hooking conditions (corresponding to the priority 1 double-sided hooking condition, if the hooking conditions are used). If so, the highest priority condition that can be satisfied among the hooking conditions is obtained, and the pre-matching relationship between the vehicle and the pending order and the hooking form corresponding to the highest priority condition that can be satisfied are recorded. The above process is repeated until a stop condition is met, or until no vehicle in the vehicle information satisfies the constraints, or until no order in the pending order information satisfies the constraints. This completes a pre-matching solution. If additional pre-matching solutions are required, the above process can be repeated until all pre-matching solutions are obtained.

[0106] The following is a specific example to illustrate:

[0107] Assume that there are currently vehicle 1 and vehicle 2, and orders need to be assigned to the two vehicles; in addition, there are order 1 to be assigned, order 2 to be assigned, and order 3 to be assigned, and the three orders to be assigned can be assigned.

[0108] The constraints are: each order to be assigned can be pre-matched with at most one vehicle in a pre-matching solution, or each vehicle can be pre-matched with at most one order to be assigned in a pre-matching solution.

[0109] The conditions for using the hook are: the above four conditions, bilateral hooking and dropping (priority 1), loading hooking and dropping (priority 2), unloading hooking and dropping (priority 3), and no hooking and dropping (priority 4).

[0110] Here we assume that

[0111] If vehicle 1 is pre-matched with order 1 to be assigned, loading drop-and-hook (priority 2), unloading drop-and-hook (priority 3) and no drop-and-hook (priority 4) are not satisfied; but bilateral drop-and-hook (priority 1) is satisfied.

[0112] Right now:

[0113] The time when vehicle 1 completes the unloading task of the current order plus the rest time of vehicle 1's driver plus the driving time between the unloading location of vehicle 1 and the loading location of pending order 1 exceeds the delivery time of pending order 1. Therefore, vehicle 1 cannot meet the conditions for loading and unloading during the pre-matching process with pending order 1.

[0114] The time when vehicle 1 completes the unloading task of the current order plus the rest time of vehicle 1's driver plus the driving time between the unloading location of vehicle 1 and the loading location of pending order 1 plus the pickup time exceeds the delivery time of pending order 1. Therefore, vehicle 1 cannot meet the unloading and drop-hook conditions during the pre-matching process with pending order 1.

[0115] The time when vehicle 1 completes the unloading task of the current order plus the rest time of vehicle 1's driver plus the driving time between the unloading location of the order being executed and the loading location of pending order 1 exceeds the loading docking time of pending order 1. Therefore, vehicle 1 cannot meet the conditions for using the hook without dropping the hook during the pre-matching process with pending order 1.

[0116] The time point when vehicle 1 arrives at the unloading location of its current order plus the rest time of the driver of vehicle 1 plus the driving time between the unloading location of the current order of vehicle 1 and the loading location of the to-be-assigned order 1 does not exceed the shipping time point of the to-be-assigned order 1. Therefore, vehicle 1 can meet the conditions for bilateral drop-and-hook during the pre-matching process with the to-be-assigned order 1.

[0117] Here, it is determined whether the selected vehicle and the selected order to be assigned can meet the lowest priority condition (double-sided drop-and-hook) among the use and hook conditions. In this example, the use and hook conditions of double-sided drop-and-hook can be met, and other use and hook conditions are not met. Therefore, double-sided drop-and-hook is the condition with the highest priority that can be met among the use and hook conditions. Therefore, vehicle 1 and order to be assigned 1 can complete the pre-matching in the form of double-sided drop-and-hook.

[0118] More assumptions are given below, and their corresponding descriptions are not expanded. The specific assumptions are as follows:

[0119] If vehicle 1 is pre-matched with order 1 to be assigned, it does not meet the requirements for loading and unloading (priority 2), unloading and unloading (priority 3), and no unloading (priority 4); but it meets the requirements for bilateral unloading (priority 1).

[0120] If vehicle 1 is pre-matched with order 2, it does not meet the requirements for unloading and hooking (priority 3) and no hooking and hooking (priority 4); but it meets the requirements for bilateral hooking and hooking (priority 1) and loading and hooking (priority 2).

[0121] If vehicle 1 is pre-matched with order 3 to be assigned, it does not meet the conditions of bilateral drop-and-hook (priority 1), drop-and-hook for loading (priority 2), drop-and-hook for unloading (priority 3), or no drop-and-hook (priority 4).

[0122] If vehicle 2 is pre-matched with order 1, it does not meet the conditions of bilateral drop-and-hook (priority 1), loading drop-and-hook (priority 2), unloading drop-and-hook (priority 3), and no drop-and-hook (priority 4).

[0123] If vehicle 2 is pre-matched with order 2 to be assigned, it does not meet the conditions of bilateral drop-and-hook (priority 1), loading drop-and-hook (priority 2), unloading drop-and-hook (priority 3), and no drop-and-hook (priority 4).

[0124] If vehicle 2 and order 3 to be assigned are pre-matched, they meet the requirements of bilateral drop-and-hook (priority 1), loading drop-and-hook (priority 2), unloading drop-and-hook (priority 3) and no drop-and-hook (priority 4).

[0125] S102. Obtain the vehicle's pending orders and usage mode based on the optimal solution among at least one pre-matching solution.

[0126] After completing step S101, at least one pre-matching solution can be obtained for the pre-matched vehicles and the pre-matched orders to be allocated. If only one pre-matching solution is obtained, it can be used as the optimal solution.

[0127] When multiple pre-matching options are available, the optimal pre-matching option needs to be selected as the optimal option. The selection is based on maximizing overall benefits. Specifically, information such as mileage, empty miles, order quantity, order price, and transportation cost can be used to select the optimal pre-matching option. Alternatively, mileage, empty miles, and order quantity can be combined to select the optimal pre-matching option. Alternatively, mileage, empty miles, order quantity, and order price can be combined to select the optimal pre-matching option. Alternatively, mileage, order quantity, and transportation cost can be combined to select the optimal pre-matching option. In practical applications, one or more of these information types can be used to select the optimal pre-matching option.

[0128] This embodiment uses the transportation mileage to select the optimal pre-matching solution as an example to illustrate how to select the optimal solution using one type of information:

[0129] For each pre-matching scheme, the sum of the transportation mileage of all pre-matched orders to be allocated in each pre-matching scheme is calculated separately. Therefore, each scheme can obtain a corresponding value, and the pre-matching scheme with the largest value is selected as the optimal scheme.

[0130] The sum of the transportation mileage of all pre-matched orders to be allocated in each pre-matching solution can be calculated according to the following formula:

[0131] This embodiment is described with only one hanging condition:

[0132] When there is only one hanging condition, the corresponding calculation formula can be expressed as follows

[0133]

[0134] Among them, f n represents the sum of the transport mileage of the nth pre-matching solution, i represents the vehicle, j represents the order to be assigned, and k represents the priority of the drop-and-hook condition (as described in the previous example, k can be set from 1 to 4 according to the priority. Since there is only one drop-and-hook condition in this example, k in the formula is a fixed value); y ijk It is expressed as whether vehicle i and order j to be assigned are matched and whether the priority of the hook is k (if vehicle i and order j to be assigned can be pre-matched and the priority of the hook is k, then y ijk =1, otherwise 0); p represents the number of vehicles, q represents the number of orders to be assigned; T j Represents the transportation mileage of order j to be assigned.

[0135] The following is a specific example to illustrate:

[0136] Assume that there are currently 2 vehicles and 3 orders to be assigned, and the loading and unloading condition is loading and unloading. Among them, vehicle 1 and orders 2 and 3 to be assigned do not meet the loading and unloading condition (i.e., y 122 =0 and y 132 =0);

[0137] Vehicle 2 and pending order 1 and pending order 3 do not meet the loading and unloading conditions (i.e. 212 =0 and y 232 =0).

[0138] Six pre-matching solutions are obtained according to the method for obtaining the pre-matching solution in S101:

[0139] Solution 1: Vehicle 1 is pre-matched with order 1 (i.e., vehicle i and order j can be pre-matched and the priority of the hook is k, so y 112 =1), vehicle 2 is pre-matched with order 3 to be assigned, but not completed (although vehicle 2 is pre-matched with order 3 to be assigned, vehicle 2 and order 3 to be assigned do not meet the loading and unloading conditions, so y 232 =0);

[0140] After calculation, we get f1=T1.

[0141] In Solution 1, vehicle 1 and order 1 to be assigned have completed pre-matching, while the others have not completed pre-matching.

[0142] Solution 2: Vehicle 1 is pre-matched with order 2 but not completed (i.e., y 122 =0), vehicle 2 is pre-matched with order 3 to be assigned but not completed (i.e., y 232 =0);

[0143] After calculation, we find that f2=0.

[0144] Solution 3: Vehicle 1 and order 1 to be assigned have completed pre-matching (i.e. y 112 =1), vehicle 2 has completed pre-matching with order 2 to be assigned (i.e., y 222 =1);

[0145] After calculation, we get f3=T1+T2.

[0146] Scenario 4: Vehicle 1 is pre-matched with order 2 but not completed (i.e., y 122 =0), vehicle 2 is pre-matched with order 1 to be assigned but not completed (i.e., y 212 =0);

[0147] After calculation, we find that f4=0.

[0148] Scenario 5: Vehicle 1 is pre-matched with order 3 but not completed (i.e., y 132 =0), vehicle 2 is pre-matched with order 1 to be assigned but not completed (i.e., y 212 =0);

[0149] After calculation, we find that f5=0.

[0150] Scenario 6: Vehicle 1 is pre-matched with order 3 but not completed (i.e., y 132 =0), vehicle 2 has completed pre-matching with order 2 to be assigned (i.e., y 222 =1);

[0151] After calculation, we get f6=T2.

[0152] Next, the solution with the largest value from f1 to f6 is selected and determined as the optimal solution. In this example, f3 is the largest, making solution three the optimal solution. Finally, order 1 is assigned to vehicle 1, and when executing order 1, vehicle 1 uses a drop-and-hook loading method. Order 2 is assigned to vehicle 2, and when executing order 2, vehicle 2 uses a drop-and-hook loading method. The vehicles can then execute their assigned orders according to the configured drop-and-hook method.

[0153] In addition, the process of selecting the optimal pre-matching solution by using the number of pre-matched orders to be allocated or the price of pre-matched orders to be allocated is similar to the process of selecting the optimal pre-matching solution by using the transportation mileage. It only needs to replace "the sum of the transportation mileage of the pre-matched orders to be allocated" with "the sum of the number of pre-matched orders to be allocated" or "the sum of the prices of the pre-matched orders to be allocated". j It can be defined as the number of orders j to be allocated or the price of orders j to be allocated. In addition, when the sum of the number of pre-matched orders to be allocated is used to select the optimal solution, T j It is a constant value of 1.

[0154] Furthermore, after the optimal solution is determined, the allocation of the orders to be allocated is completed according to the matching relationship between the vehicles and the orders to be allocated recorded in this optimal solution and the corresponding hanging method. For example, the driver or manager corresponding to the vehicle can view the information of the orders to be executed assigned to the vehicle on the client and complete the order or transportation task according to the information.

[0155] From the above description, it can be seen that in the method for intelligent dispatching by drop-and-hook in the embodiment of the present application, based on at least one vehicle information, at least one pending order information, constraints, and hooking conditions, the vehicle's pending orders are pre-matched to obtain at least one pre-matching solution; and based on the optimal solution among the at least one pre-matching solution, the vehicle's pending orders and hooking method are obtained. This achieves intelligent matching of vehicles and orders, and can maximize the use of drop-and-hook to improve the matching success rate of waybills, minimize the transportation costs increased by drop-and-hook, and improve transportation efficiency.

[0156] Furthermore, in step S102, when there are multiple (two or more) conditions for using the hook, the sum of the transportation mileage of all pre-matched orders to be allocated in each pre-matching solution can be calculated according to the following formula:

[0157]

[0158] Among them, f n represents the sum of the transport mileage of the nth pre-matching solution, i represents the vehicle, j represents the order to be assigned, and k represents the priority of the drop-and-hook condition (as described in the previous example, k can be set between 1 and 4 according to the priority); y ijk It is expressed as whether vehicle i and order j to be assigned are matched and whether the priority of the hook is k (if vehicle i and order j to be assigned can be pre-matched and the priority of the hook is k, then y ijk =1, otherwise 0); p represents the number of vehicles, q represents the number of orders to be assigned, and m represents the number of drop-and-hook conditions; T j It is represented as the transportation mileage of order j to be assigned.

[0159] Let's take a specific example to illustrate:

[0160] Assume that there are currently 2 vehicles and 3 orders to be assigned, and the hooking conditions are bilateral hooking, loading hooking, unloading hooking, and no hooking.

[0161] If vehicle 1 is pre-matched with order 1 to be assigned, it does not meet the requirements for loading and unloading (priority 2), unloading and unloading (priority 3), and no unloading (priority 4), but it meets the requirements for bilateral unloading (priority 1).

[0162] If vehicle 1 is pre-matched with order 2, it does not meet the requirements for unloading and hooking (priority 3) and no hooking and hooking (priority 4), but it meets the requirements for bilateral hooking and hooking (priority 1) and loading and hooking (priority 2).

[0163] If vehicle 1 is pre-matched with order 3 to be assigned, it does not meet the conditions of bilateral drop-and-hook (priority 1), drop-and-hook for loading (priority 2), drop-and-hook for unloading (priority 3), or no drop-and-hook (priority 4).

[0164] If vehicle 2 is pre-matched with order 1, it does not meet the conditions of bilateral drop-and-hook (priority 1), loading drop-and-hook (priority 2), unloading drop-and-hook (priority 3), and no drop-and-hook (priority 4).

[0165] If vehicle 2 is pre-matched with order 2 to be assigned, it does not meet the conditions of bilateral drop-and-hook (priority 1), loading drop-and-hook (priority 2), unloading drop-and-hook (priority 3), and no drop-and-hook (priority 4).

[0166] If vehicle 2 and order 3 to be assigned are pre-matched, they meet the requirements of bilateral drop-and-hook (priority 1), loading drop-and-hook (priority 2), unloading drop-and-hook (priority 3) and no drop-and-hook (priority 4).

[0167] Six pre-matching solutions are obtained in the same manner as in step S101:

[0168] Solution 1: Vehicle 1 is pre-matched with order 1 to be assigned, and vehicle 2 is pre-matched with order 2 to be assigned;

[0169] Finally, vehicle 1 and order 1 to be assigned are pre-matched in a bilateral drop-and-hook manner.

[0170] Vehicle 2 and order 2 to be assigned do not meet any of the hook conditions, so the pre-matching is not completed.

[0171] After calculation, we get f1=y 111 ×T1+0×T2+0×T3+0×T1+0×T2+0×T3=T1.

[0172] Solution 2: Vehicle 1 is pre-matched with order 1 to be assigned, and vehicle 2 is pre-matched with order 3 to be assigned;

[0173] As a result, vehicle 1 and order 1 to be assigned were pre-matched in a bilateral drop-and-hook manner, while vehicle 2 and order 3 to be assigned were pre-matched in a non-drop-and-hook manner.

[0174] After calculation, we get f2=y 111 ×T1+0×T2+0×T3+0×T1+0×T2+y 234 ×T3=T1+T3.

[0175] Solution 3: Vehicle 1 is pre-matched with order 2 to be assigned, and vehicle 2 is pre-matched with order 1 to be assigned;

[0176] Finally, vehicle 1 and order 2 to be assigned are pre-matched in a loading and unloading manner.

[0177] Vehicle 2 and order 1 to be assigned do not meet any of the hook conditions, so the pre-matching is not completed.

[0178] After calculation, we get f3=0×T1+y 122 ×T2+0×T3+0×T1+0×T2+0×T3=T2.

[0179] Solution 4: Vehicle 1 is pre-matched with order 2 to be assigned, and vehicle 2 is pre-matched with order 3 to be assigned;

[0180] As a result, vehicle 1 and order 2 to be assigned are pre-matched in a loading and unloading mode, while vehicle 2 and order 3 to be assigned are pre-matched in a non-loading and unloading mode.

[0181] After calculation, we get f4=0×T1+y 122 ×T2+0×T3+0×T1+0×T2+y 234 ×T3=T2+T3.

[0182] Solution 5: Vehicle 1 is pre-matched with order 3, and vehicle 2 is pre-matched with order 1.

[0183] Finally, vehicle 1 and order 3 to be assigned did not complete the pre-matching because they did not meet any of the hook conditions.

[0184] Vehicle 2 and order 1 to be assigned do not meet any of the hook conditions, so the pre-matching is not completed.

[0185] After calculation, it is obtained that f5=0×T1+0×T2+0×T3+0×T1+0×T2+0×T3=0.

[0186] Solution 6: Vehicle 1 is pre-matched with order 3 to be assigned, and vehicle 2 is pre-matched with order 3 to be assigned;

[0187] Finally, vehicle 1 and order 3 to be assigned did not complete the pre-matching because they did not meet any of the hook conditions.

[0188] Vehicle 2 and order 3 to be assigned are pre-matched in a non-drop-and-hook manner.

[0189] After calculation, we get f6 = 0 × T1 + 0 × T2 + 0 × T3 + 0 × T1 + 0 × T2 + y 234 ×T3=T3.

[0190] Afterwards, the solution with the largest value is selected from f1 to f6, and the solution with the largest value is determined as the optimal solution. Assuming T1>T2, then the final value of f1=T1+T3 is the largest, and solution 2 is determined as the optimal solution. Finally, vehicle 1 and order 1 to be assigned are matched using a bilateral drop-and-hook method. When vehicle 1 completes the unloading of the order being executed, it uses the unloading drop-and-hook method. When executing order 1 to be assigned, it uses the loading drop-and-hook method when loading. Vehicle 2 and order 3 to be assigned are matched using a non-drop-and-hook method. When vehicle 2 completes the unloading of the order being executed, it uses the non-drop-and-hook method. When executing order 1 to be assigned, it uses the non-drop-and-hook method when loading.

[0191] It should be noted that the number of vehicles, the number of orders to be allocated, and hypothetical situations in the above examples are only examples for the convenience of explanation.

[0192] Furthermore, in step S102, this embodiment uses the method of selecting the optimal pre-matching solution by combining transport mileage, idle mileage, and order quantity as an example to illustrate how to select the optimal solution using multiple pieces of information:

[0193] First, the sum of the transport mileage, the sum of the empty mileage, and the sum of the quantity for all pre-matched pending orders in each pre-matching scenario are calculated. These three values are then mathematically calculated, and the optimal pre-matching scenario is selected based on the results.

[0194] Specifically, perform mathematical operations according to the following formula, and select the optimal pre-matching solution based on the operation results:

[0195] G=w1f1-w2f2+w3f3

[0196] G is the result of the calculation; f1, f2, and f3 are the sum of the mileage of the pre-matched pending orders, the sum of the idle miles of the pre-matched pending orders, and the sum of the number of pre-matched pending orders, respectively; w1, w2, and w3 are the weights. Regarding weights: These weights can be set manually. For example, if business needs require a larger proportion of the total mileage of all pre-matched pending orders, the value of w1 can be increased. These weights can also be adjusted dynamically based on factors such as the current vehicle operation rate.

[0197] For each pre-allocation scheme, a G can be obtained, and then the corresponding pre-matching scheme with the largest G value is taken as the optimal pre-matching scheme.

[0198] It should be noted that the calculation formulas for "calculating the sum of the transport mileage of the pre-matched orders to be allocated, the sum of the empty mileage of the pre-matched orders to be allocated, and the sum of the number of pre-matched orders to be allocated" can all be calculated with reference to the aforementioned formula for calculating the sum of the transport mileage of the pre-matched orders to be allocated, and will not be repeated here.

[0199] In addition, f1, f2, and f3 can also be the sum of the transportation mileage of the pre-matched orders to be allocated, the sum of the transportation costs of the pre-matched orders to be allocated, and the sum of the number of pre-matched orders to be allocated; of course, there can be other combinations, which will not be repeated here.

[0200] Finally, the beneficial effects of the method for intelligent dispatching of drop-and-hook vehicles of this application are summarized as follows:

[0201] 1. The drop-and-hook method can be used to maximize the matching success rate of waybills;

[0202] 2. Reduce the transportation costs caused by using drop-and-hook as much as possible and improve transportation efficiency.

[0203] It should be noted that the steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and that, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0204] According to an embodiment of the present application, there is also provided a method for implementing the above Figure 1 Method for intelligent dispatching of drop and hook, such as Figure 2 As shown, the device includes:

[0205] The data input unit 21 is used to input at least one vehicle information, at least one to-be-assigned order information, constraint conditions, and usage conditions into the pre-matching unit;

[0206] A pre-matching unit 22 is configured to pre-match the vehicle's pending orders based on at least one vehicle information, at least one pending order information, constraints, and usage conditions, obtain at least one pre-matching solution, and input the at least one pre-matching solution into the selection unit;

[0207] A selection unit 23, configured to select an optimal solution from at least one pre-matching solution;

[0208] The matching unit 24 is used to obtain the vehicle's pending orders and usage methods according to the optimal solution.

[0209] From the above description, it can be seen that the apparatus for intelligent dispatching by drop-and-hook in the embodiment of the present application pre-matches the vehicle's pending orders based on at least one vehicle's information, at least one pending order's information, constraints, and hooking conditions, obtaining at least one pre-matching solution. The vehicle's pending orders and hooking method are then determined based on the optimal solution among the at least one pre-matching solution. This achieves intelligent matching of vehicles and orders, maximizes the use of drop-and-hook to improve the matching success rate of waybills, minimizes the increased transportation costs associated with drop-and-hook, and improves transportation efficiency.

[0210] Further, such as Figure 3 As shown, the pre-matching unit 22 includes:

[0211] The selection module 221 is configured to select a vehicle that satisfies the constraint conditions from at least one vehicle information and select an order that satisfies the constraint conditions from at least one order to be allocated information in combination with the constraint conditions;

[0212] The judgment module 222 is used to judge whether the vehicle selected by the selection module and the selected order to be assigned meet the hooking conditions;

[0213] The recording module 223 is used to record the pre-matching relationship between the vehicle and the order to be executed and the corresponding hooking form if the hooking condition is met, and the hooking form corresponds to the hooking condition.

[0214] Further, such as Figure 3 As shown, the judgment module 222 is further configured to:

[0215] Determine whether the vehicle selected by the selection module and the selected order to be assigned can meet the lowest priority condition among the conditions for use and suspension. Different conditions have different priorities.

[0216] The recording module 223 is further configured to, if the lowest priority condition among the use and suspension conditions is satisfied, obtain the highest priority condition among the use and suspension conditions that can be satisfied, and then record the pre-matching relationship between the vehicle and the order to be executed and the use and suspension form corresponding to the highest priority condition that can be satisfied.

[0217] Specifically, the specific process of each unit and module in the device of the embodiment of the present application to achieve its function can be found in the relevant description in the method embodiment, which will not be repeated here.

[0218] According to an embodiment of the present application, a computer-readable storage medium is further provided, characterized in that the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the method of intelligent scheduling of drop-and-hook in the above method embodiment.

[0219] According to an embodiment of the present application, an electronic device is also provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor executes the method for intelligent scheduling of drop-and-hook in the above-mentioned method embodiment.

[0220] Obviously, those skilled in the art should understand that the modules or steps of the present application described above can be implemented using a general-purpose computing device. They can be concentrated on a single computing device or distributed across a network consisting of multiple computing devices. Alternatively, they can be implemented using program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, or they can be fabricated into separate integrated circuit modules, or multiple modules or steps can be fabricated into a single integrated circuit module for implementation. Thus, the present application is not limited to any specific combination of hardware and software.

[0221] The above description is merely a preferred embodiment of the present application and is not intended to limit the present application. Various modifications and variations are possible for those skilled in the art. Any modifications, equivalent substitutions, or improvements made within the spirit and principles of the present application shall be included within the scope of protection of the present application.

Claims

1. A method for intelligent dispatching of drop-and-hook vehicles, characterized in that: The method comprises: Pre-matching the vehicle's pending orders based on at least one vehicle's information, at least one pending order's information, constraints, and usage conditions to obtain at least one pre-matching solution, wherein the constraints include at least one of the following conditions or a combination thereof: each pending order is pre-matched with at most one vehicle in a pre-matching solution; each vehicle is pre-matched with at most one pending order in a pre-matching solution; Obtaining a pending order and a vehicle usage method based on the optimal solution among at least one pre-matching solution; According to at least one vehicle information, at least one pending order information, constraints, and usage conditions, the pending orders of the vehicle are pre-matched to obtain at least one pre-matching solution, including the following two solutions: the first solution, the usage condition includes only one condition; the second solution, the usage condition includes two or more conditions; The hooking conditions are any of the following and their combinations, with different hooking conditions having different priorities: bilateral hooking and dropping, which means that the vehicle uses hooking and dropping when unloading the current order and loading the pre-matched order later; loading hooking, which means that the vehicle uses hooking and dropping only when loading the pre-matched order, but not when unloading the current order; unloading hooking, which means that the vehicle uses hooking and dropping only when unloading the current order, but not when loading the pre-matched order; no hooking and dropping, which means that the vehicle does not use hooking and dropping when loading the pre-matched order or when unloading the current order; The pre-matching of the vehicle's pending orders based on at least one vehicle information, at least one pending order information, the constraint conditions, and the use and hook conditions to obtain at least one pre-matching solution includes: obtaining at least one vehicle information and at least one pending order information; selecting a vehicle that satisfies the constraint conditions from the at least one vehicle information, and selecting an pending order that satisfies the constraint conditions from the at least one pending order information in combination with the constraint conditions; determining whether the selected vehicle and the selected pending order can satisfy the lowest priority condition among the use and hook conditions, with different use and hook conditions having different priorities; if so, obtaining the highest priority condition among the use and hook conditions that can be satisfied, and recording the pre-matching relationship between the vehicle and the pending order and the use and hook form corresponding to the highest priority condition that can be satisfied; The judgment criteria for using bilateral drop-and-hook is that the time point when the vehicle arrives at the unloading place of the currently executed order plus the rest time of the vehicle driver plus the driving time between the unloading place of the currently executed order and the loading place of the pre-matched order does not exceed the shipping time point of the pre-matched order; the judgment criteria for using loading drop-and-hook is that the time point when the vehicle completes the unloading task of the currently executed order plus the rest time of the vehicle driver plus the driving time between the unloading place of the currently executed order and the loading place of the pre-matched order does not exceed the shipping time point of the pre-matched order; the judgment criteria for using unloading drop-and-hook is that the time point when the vehicle completes the unloading task of the currently executed order plus the rest time of the vehicle driver plus the driving time between the unloading place of the currently executed order and the loading place of the pre-matched order plus the pick-up time does not exceed the shipping time point of the pre-matched order; the judgment criteria for using no drop-and-hook is that the time point when the vehicle completes the unloading task of the currently executed order plus the rest time of the vehicle driver plus the driving time between the unloading place of the currently executed order and the loading place of the pre-matched order does not exceed the loading docking time point of the pre-matched order.

2. The method for intelligent dispatching of drop-and-hook according to claim 1, characterized in that: The usage condition is a condition that limits the usage form of the at least one vehicle information and the at least one to-be-allocated order information in the pre-matching.

3. The method for intelligent dispatching of drop-and-hook according to claim 1, characterized in that: The pre-matching of the vehicle's pending orders based on at least one vehicle information, at least one pending order information, the constraint conditions, and the usage conditions to obtain at least one pre-matching solution includes: Obtain at least one vehicle information and at least one to-be-assigned order information; In combination with the constraint condition, a vehicle that meets the constraint condition is selected from at least one vehicle information, and an order to be allocated that meets the constraint condition is selected from at least one order to be allocated information; Determine whether the selected vehicle and the selected order to be assigned meet the conditions for use; If the conditions are met, the pre-matching relationship between the vehicle and the order to be executed and the corresponding hooking form are recorded, and the hooking form corresponds to the hooking conditions.

4. The method for intelligent dispatching of drop-and-hook according to claim 1, characterized in that: Before obtaining the vehicle's pending order and hooking method according to the optimal solution among at least one pre-matching solution, the method further includes: Calculate the sum of the information corresponding to each type of information of all pre-matched orders to be allocated in each pre-matching solution; The optimal solution is selected based on the sum of one or more information to maximize the overall benefit.

5. The method for intelligent dispatching of drop-and-hook according to claim 4, characterized in that: The sum of the information includes at least one of the sum of the transportation mileage of the pre-matched orders to be allocated, the sum of the quantities of the pre-matched orders to be allocated, and the sum of the prices of the pre-matched orders to be allocated.

6. A device for intelligent dispatching of drop-and-hook, characterized in that: The device comprises: A data input unit, configured to input at least one vehicle information, at least one to-be-allocated order information, constraint conditions, and usage conditions into the pre-matching unit; a pre-matching unit, configured to pre-match the vehicle's pending orders based on at least one vehicle information, at least one pending order information, constraints, and usage conditions, obtain at least one pre-matching solution, and input the at least one pre-matching solution into the selection unit; A selection unit, configured to select an optimal solution from at least one pre-matching solution; A matching unit, configured to obtain a pending order and a hooking method for the vehicle according to the optimal solution; The pre-matching unit includes: A selection module is used to select a vehicle that meets the constraint conditions from at least one vehicle information and select an order to be allocated that meets the constraint conditions from at least one order to be allocated information in combination with the constraint conditions; The judgment module is used to judge whether the vehicle selected by the selection module and the order to be assigned can meet the conditions for use; a recording module configured to record the pre-matching relationship between the vehicle and the order to be executed and the corresponding hooking form if the hooking condition is met, wherein the hooking form corresponds to the hooking condition; The judgment module is further used for: Determine whether the vehicle selected by the selection module and the selected order to be assigned can meet the lowest priority condition among the conditions for use and suspension. Different conditions have different priorities. The recording module is further configured to, if the condition with the lowest priority among the use and suspension conditions is met, obtain the condition with the highest priority among the use and suspension conditions, and record the pre-matching relationship between the vehicle and the order to be executed and the use and suspension form corresponding to the condition with the highest priority that can be met.

7. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the method for intelligent scheduling of drop-and-hook according to any one of claims 1 to 5.

8. An electronic device, characterized in that: include: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor executes the method for intelligent scheduling of drop-and-hook according to any one of claims 1 to 5.

Images