Order efficient processing method and system, terminal and storage medium
Through automated order processing methods, the road crossing and transportation paths are reasonably allocated according to the order type and crossing resource situation, the problem of inefficient order processing in large warehouses is solved and more efficient order processing is achieved.
Patent Information
- Application Number
- CN202411950765.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-27
- Publication Date
- 2025-04-25
AI Technical Summary
In large warehouses or logistics centers, due to the wide variety of orders, different quantity of goods, and limited resources in the intersection, the existing manual processing methods are inefficient, resulting in waste of intersection resources and redundant transportation paths, thereby reducing order processing efficiency.
By automatically obtaining the types and quantity of each order, dividing the order set, and reasonably allocating the intersection resources according to the quantity, location and quantity of the order set of goods, generating transportation paths and transportation strategies, and optimizing the binding process between the order and the intersection.
It improves efficient processing between different types of orders, ensures efficient processing of the same type of orders, optimizes transportation paths, solves the problem of uneven allocation of resources at the intersection, and further improves order processing efficiency.
Smart Images
Figure CN119886996A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of logistics warehousing technology, and in particular to an efficient order processing method, system, terminal and storage medium. Background Art
[0002] In logistics warehousing and distribution systems, processing a large number of orders is a complex and critical task. In the existing order processing process, it is usually done manually according to the type of order, such as inbound order, outbound order, or pick-and-return order, to divide the type of gate and then assign the order to the gate.
[0003] However, in large warehouses or logistics centers, due to the wide variety of orders, different quantities of goods, and limited resources at the checkpoints, this manual processing method is not only inefficient, but also lacks scientific data support, which can easily lead to waste of checkpoint resources and redundancy of transportation routes, thereby reducing order processing efficiency; for example, some checkpoints may be congested due to processing a large number of orders, while other checkpoints may be idle, resulting in uneven resource allocation. Summary of the invention
[0004] In order to solve the above problems and further improve the order processing efficiency, the present application provides an efficient order processing method, system, terminal and storage medium.
[0005] In the first aspect, the present application provides an efficient order processing method, which adopts the following technical solutions: Efficient order processing methods, including: Obtain the type and quantity of goods for each order, as well as the total number of idle crossings and the location of each idle crossing; Based on the type of each order, each order is divided into a corresponding order set; Based on the total number of idle intersections, the location of each idle intersection and the number of commodities corresponding to each order set, an idle intersection is allocated to each order set, and first allocation information between the order set and the idle intersection is generated; wherein the number of commodities corresponding to each order set is the sum of the number of commodities of all orders in the order set; Based on the first allocation information, allocate an idle crossing to the orders in each order set, and generate second allocation information between the orders and the idle crossings; Based on the second allocation information, planning a transportation path for each order from the loading point to the corresponding idle crossing, and generating an order transportation strategy; Based on the order shipping strategy, each order is shipped.
[0006] By adopting the above technical solution, the type and quantity of goods of each order are automatically obtained, and the orders are divided into different sets according to the order type. According to the number and location of idle crossings and the number of goods in each order set, the idle crossings are reasonably allocated to each order set, ensuring the efficient processing of different types of orders. On this basis, specific idle crossings are further allocated to each order in the order set to ensure the efficient processing of the same type of orders, and the corresponding transportation routes are planned. Finally, the order transportation strategy is generated and each order is transported accordingly. Through the coordinated processing of multiple types of orders, the binding process between orders and crossings is optimized, the problem of uneven distribution of crossing resources is solved, and the order processing efficiency is further improved.
[0007] In a specific possible implementation scheme, after each order is transported based on the order transportation strategy, the following steps are further included: Get the loading time t1, transportation time t2 and unloading time t3 of the corresponding orders at each idle intersection; Based on the loading time t1, the transportation time t2 and the unloading time t3, the processing efficiency y corresponding to the idle crossing is calculated. c ; Based on the processing efficiency y corresponding to each idle intersection c , adjust the first allocation information or the second allocation information.
[0008] By adopting the above technical solution, since the distance of the transportation route, the number of staff at the loading point and their proficiency in loading, the number of staff at the unloading point and their proficiency in unloading will all affect the processing efficiency, therefore, during the order transportation process, the processing efficiency y of the idle crossing is calculated by obtaining the time of the order at different stages in real time. c And by adjusting the first allocation information or the second allocation information in real time, the order processing efficiency is further guaranteed.
[0009] In a specific implementation scheme, based on the loading time t1, the transportation time t2 and the unloading time t3, the processing efficiency y corresponding to the idle crossing is calculated. c , specifically including: Among them, T1 is the standard loading time, T2 is the standard transportation time, and T3 is the standard unloading time; a, b, c are the first influence coefficients of loading time, transportation time and unloading time on processing efficiency respectively; m1, m2, m3 are the second influence coefficients of loading time, transportation time and unloading time on processing efficiency respectively; f1 is the correlation influence coefficient of loading time on transportation time, and f2 is the correlation influence coefficient of unloading time on transportation time.
[0010] In a specific implementation scheme, based on the processing efficiency y corresponding to each of the idle intersections c , adjusting the first allocation information, specifically including: Based on the processing efficiency y corresponding to each idle intersection c , determine the comprehensive processing efficiency y0 corresponding to each order set; Each order set is recorded as an inefficient order set or an efficient order set according to the comprehensive processing efficiency y0; One or more idle intersections are selected from the idle intersections corresponding to the efficient order set to allocate the orders in the inefficient order set.
[0011] By adopting the above technical solution, in order to further ensure the coordinated and efficient processing of different types of orders, after calculating the comprehensive processing efficiency y0 corresponding to each order set, each order set is divided into an efficient order set or an inefficient order set, and then a part of the idle crossings corresponding to the efficient order set is used to allocate the inefficient order set, so as to try to ensure the synchronous and efficient processing of various types of orders, maintain a balance in the processing speed of different types of order sets, and avoid congestion or idleness at the crossings.
[0012] In a specific implementation scheme, based on the processing efficiency y corresponding to each idle intersection c , adjusting the second allocation information, specifically including: The idle intersections corresponding to the same order set are divided according to the processing efficiency y c They are respectively recorded as inefficient idle intersections or efficient idle intersections; for the inefficient idle intersections and efficient idle intersections in the same order set, some orders are selected from the orders corresponding to the inefficient idle intersections and allocated to the efficient idle intersections; or, some idle intersections are selected from the efficient idle intersections to allocate orders to the inefficient idle intersections.
[0013] By adopting the above technical solution, in order to further ensure the coordinated and efficient processing of the same type of orders, for multiple idle intersections corresponding to the same order set, the idle intersections are divided according to the processing efficiency y corresponding to each idle intersection; then, a part of the orders are selected from the efficient idle intersections to be allocated to the inefficient idle intersections, or a part of the orders are selected from the inefficient idle intersections to be allocated to the efficient idle intersections, so as to maintain the balance of the processing efficiency of each order within the same type of order set.
[0014] In a specific possible implementation plan, after obtaining the loading time t1, transportation time t2 and unloading time t3 of the orders corresponding to each idle intersection, it also includes: If the loading time t1 exceeds the preset loading time threshold, a reminder is generated that additional personnel are needed at the loading point corresponding to the order at the idle crossing; If the transportation time t2 exceeds the preset transportation time threshold, a reminder is generated indicating that the transportation process of the order corresponding to the idle crossing is abnormal; If the unloading time t3 exceeds the preset unloading time threshold, a reminder is generated that additional personnel are needed at the unloading point corresponding to the order at the idle intersection.
[0015] In a specific implementation scheme, based on the processing efficiency y corresponding to each idle intersection c , after adjusting the first allocation information or the second allocation information, further comprising: The adjustment process of the first allocation information and the second allocation information is recorded to provide a basis for optimizing the generation process of the first allocation information and the second allocation information.
[0016] In a second aspect, the present application provides an efficient order processing system, which adopts the following technical solution: the efficient order processing system applies the efficient order processing method in the above-mentioned first aspect or any feasible implementation scheme of the first aspect.
[0017] Specifically, the order efficient processing system includes an information acquisition module, an information processing module, a crossing allocation module, a path planning module and a transportation execution module: The information acquisition module is used to obtain the type and quantity of goods of each order, as well as the total number of idle crossings and the position of each idle crossing; The information processing module is used to divide each order into a corresponding order set based on the type of each order; and is also used to allocate an idle intersection to each order set based on the total number of the idle intersections, the location of each idle intersection and the number of goods corresponding to each order set, and generate first allocation information between the order set and the idle intersection; wherein the number of goods corresponding to each order set is the sum of the numbers of goods of all orders in the order set; The crossing allocation module is used to allocate idle crossings to orders in each order set based on the first allocation information, and generate second allocation information between the orders and the idle crossings; The path planning module is used to plan the transportation path of each order from the loading point to the corresponding idle intersection based on the second allocation information, and generate an order transportation strategy; The transportation execution module is used to transport each order based on the order transportation strategy.
[0018] In a third aspect, the present application provides a terminal comprising: a processor, a memory and a communication bus; the communication bus is used to realize connection and communication between the processor and the memory, and the processor is used to execute one or more programs stored in the memory to realize the efficient order processing method as described in the above-mentioned first aspect or any possible implementation scheme of the first aspect.
[0019] In a fourth aspect, the present application provides a computer-readable storage medium, which stores instructions. When the instructions are executed, the efficient order processing method as described in the first aspect or any possible implementation scheme of the first aspect is executed.
[0020] One or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages: By automatically obtaining the type and quantity of goods for each order, the orders are divided into different sets according to the order type, and the idle crossings are reasonably allocated to each order set according to the number and location of the idle crossings and the number of goods in each order set, ensuring efficient processing between orders of different types. On this basis, specific idle crossings are further allocated to each order in the order set to ensure efficient processing between orders of the same type, and the corresponding transportation routes are planned. Finally, an order transportation strategy is generated and each order is transported accordingly. Through the coordinated processing of multiple types of orders, the binding process between orders and crossings is optimized, the problem of uneven allocation of crossing resources is solved, and the order processing efficiency is further improved. BRIEF DESCRIPTION OF THE DRAWINGS
[0021] Figure 1 It is a flowchart of steps S1-S6 of the efficient order processing method in the embodiment of the present application; Figure 2 It is a flow chart of steps S7-S9 of the efficient order processing method in the embodiment of the present application. DETAILED DESCRIPTION
[0022] The terms used in the following embodiments of the present application are only for the purpose of describing specific embodiments, and are not intended to be used as limitations to the present application. As used in the specification and appended claims of the present application, the singular expressions "one", "a kind of", "said", "above", "the" and "this" are intended to also include plural expressions, unless there is a clear indication to the contrary in the context. It should also be understood that the term "and / or" used in the present application refers to any or all possible combinations comprising one or more listed items.
[0023] In the following, the terms "first" and "second" are used for descriptive purposes only and are not to be understood as suggesting or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features, and in the description of the embodiments of the present application, unless otherwise specified, "plurality" means two or more.
[0024] The present application embodiment provides an efficient order processing method, such as Figure 1As shown, the method includes steps S1-S6.
[0025] S1, obtaining the type and quantity of goods of each order, as well as the total number of idle crossings and the location of each idle crossing.
[0026] S2, based on the type of each order, divide each order into a corresponding order set.
[0027] Generally speaking, orders of the same type correspond to the same loading point. Therefore, through this step, orders of the same type can be classified into the same order set, which is convenient for the subsequent resource allocation of idle crossings and the planning of transportation routes. Exemplarily, the types of orders include the first type, the second type and the third type; the first type is incoming warehousing, the second type is outgoing warehousing, and the third type is picking back to the warehouse; technicians in this field can set the type of order according to actual needs, and this application does not make specific limitations on this. In addition, it can be understood by those skilled in the art that the number of goods in an order is usually not one. For example, Company A’s order contains 200 items, and each item is a package, which corresponds to 200 packages that need to be transported.
[0028] S3, based on the total number of idle intersections, the location of each idle intersection and the number of goods corresponding to each order set, allocate idle intersections to each order set, and generate first allocation information between the order set and the idle intersections; wherein the number of goods corresponding to each order set is the sum of the numbers of goods of all orders in the order set.
[0029] Since in actual situations, there may be situations where the crossings are occupied, when processing newly added orders, it is necessary to first obtain the total number of free crossings and the location of each free crossing, and then allocate one or more free crossings to each order set in combination with the number of goods corresponding to each order set. In order to ensure overall efficiency during allocation, the principle of allocation based on the proportion of goods quantity and the principle of allocation in the nearest place can be adopted. That is, the proportion of the number of goods corresponding to the order set = the number of goods corresponding to the order set / the sum of the number of goods corresponding to all order sets, and then according to the proportion of the number of goods corresponding to the order set * the total number of free crossings, it is possible to obtain how many free crossings need to be allocated to the order set, and similarly, the number of free crossings corresponding to each order set can be obtained; at the same time, based on the distance of the transportation path between the loading point of the order set and the crossing, the corresponding free crossings are allocated to each order set according to the principle of allocation in the nearest place.
[0030] S4, based on the first allocation information, allocate idle crossings to the orders in each order set, and generate second allocation information between the orders and the idle crossings.
[0031] After the order set is bound to the idle intersection, since the order set contains one or more orders and there are also one or more idle intersections, it is necessary to bind the order to the corresponding intersection and generate the second allocation information between the order and the idle intersection to determine the specific order to be allocated to each intersection during subsequent transportation. Specifically, each order in the order set can still be allocated to the corresponding intersection according to the principle of allocation based on the proportion of the number of goods.
[0032] S5, based on the second allocation information, planning the transportation path of each order from the loading point to the corresponding idle intersection, and generating an order transportation strategy.
[0033] This step is to plan the transportation route of each order from the loading point to the corresponding idle crossing after binding the order with the idle crossing, so as to generate the order transportation strategy.
[0034] S6: transport each order based on the order transportation strategy.
[0035] Therefore, by automatically obtaining the type and quantity of goods of each order, the orders are divided into different sets according to the order type, and the idle crossings are reasonably allocated to each order set according to the number and location of the idle crossings and the number of goods in each order set, ensuring efficient processing between orders of different types. On this basis, specific idle crossings are further allocated to each order in the order set to ensure efficient processing between orders of the same type, and the corresponding transportation routes are planned. Finally, an order transportation strategy is generated and each order is transported accordingly. Through the coordinated processing of multiple types of orders, the binding process between orders and crossings is optimized, the problem of uneven allocation of crossing resources is solved, and the order processing efficiency is further improved.
[0036] In one possible implementation, combining Figure 2 , after the step S6 transports each order based on the order transportation strategy, it also includes steps S7-S9.
[0037] S7, obtaining the loading time t1, transportation time t2 and unloading time t3 of the orders corresponding to each idle intersection.
[0038] Among them, the loading time t1 is the time from the arrival of the order at the loading point to the completion of loading, the transportation time t2 is the time from the completion of loading to the transportation to the idle intersection, and the unloading time t3 is the time from the arrival of the order at the idle intersection to the completion of unloading. The three time parameters described here can be collected by random sampling to collect the loading time t1, transportation time t2 and unloading time t3 corresponding to the order in a certain transportation.
[0039] S8, based on the loading time t1, the transportation time t2 and the unloading time t3, calculate the processing efficiency y corresponding to the idle crossing c .
[0040] In a possible implementation, the processing efficiency y corresponding to the idle intersection is calculated based on the loading time t1, the transportation time t2, and the unloading time t3. c , specifically including: Among them, T1 is the standard loading time, T2 is the standard transportation time, and T3 is the standard unloading time; a, b, and c are the first influence coefficients of loading time, transportation time, and unloading time on processing efficiency, respectively; that is, they are used to adjust the direct influence of loading time, transportation time, and unloading time on the overall efficiency; m1, m2, and m3 are the second influence coefficients of loading time, transportation time, and unloading time on processing efficiency, respectively; that is, they are used to adjust the nonlinear influence of loading time, transportation time, and unloading time on the overall efficiency; f1 is the correlation influence coefficient of loading time on transportation time, and f2 is the correlation influence coefficient of unloading time on transportation time.
[0041] Furthermore, for the determination of these unknown coefficients, those skilled in the art can collect multiple groups of actual data and set the corresponding processing efficiency of each group, pre-process these data, and then use statistical software or mathematical tools to fit the formula to determine the specific values of coefficients a, b, c, m1, m2, m3, f1, and f2; in the fitting process, methods such as nonlinear regression can be used. Furthermore, the model obtained by fitting can be verified by methods such as the holdout method or cross-validation to ensure the accuracy and reliability of the model, and the coefficients can be further optimized based on the verification results.
[0042] It is understandable to those skilled in the art that if the loading and unloading time is long, resulting in a transport vehicle occupying the loading point or the vacant crossing, the next transport vehicle will have to wait, thereby increasing the transportation time. In other words, the loading and unloading time will affect the transportation time to a certain extent. Therefore, by taking f1 and f2 into account, the mutual influence between them is improved, thereby improving the processing efficiency. c Reliability of assessment.
[0043] S9, based on the processing efficiency y corresponding to each of the idle intersections c , adjust the first allocation information or the second allocation information.
[0044] Due to the uncertainty factors such as the distance of the transportation route, the number of staff at the loading point and their proficiency in loading, the number of staff at the unloading point and their proficiency in unloading, etc., which will affect the processing efficiency, therefore, in the order transportation process, by obtaining the time of the order at different stages in real time, the processing efficiency y of the idle crossing is calculated. c And by adjusting the first allocation information or the second allocation information in real time, the order processing efficiency is further guaranteed.
[0045] In a possible implementation, after obtaining the loading time t1, transportation time t2 and unloading time t3 of the orders corresponding to each idle intersection in step S7, the method further includes: If the loading time t1 exceeds the preset loading time threshold, a reminder is generated that additional personnel are needed at the loading point corresponding to the order at the idle crossing; If the transportation time t2 exceeds the preset transportation time threshold, a reminder is generated indicating that the transportation process of the order corresponding to the idle crossing is abnormal; If the unloading time t3 exceeds the preset unloading time threshold, a reminder is generated that additional personnel are needed at the unloading point corresponding to the order at the idle intersection.
[0046] In a possible implementation, step S9, based on the processing efficiency y corresponding to each idle intersection c , after adjusting the first allocation information or the second allocation information, further comprising: The adjustment process of the first allocation information and the second allocation information is recorded to provide a basis for optimizing the generation process of the first allocation information and the second allocation information.
[0047] In a possible implementation, step S9, based on the processing efficiency y corresponding to each idle intersection c , adjusting the first allocation information, specifically including steps A1-A3: A1, based on the processing efficiency y corresponding to each idle intersection c , determine the comprehensive processing efficiency y0 corresponding to each order set; In this step, for the order set corresponding to multiple idle intersections, the processing efficiency y corresponding to the multiple idle intersections can be calculated. c As the comprehensive processing efficiency y0, for the order set corresponding to only one idle intersection, it is only necessary to calculate the processing efficiency y corresponding to this idle intersection. c It can be taken as the comprehensive processing efficiency y0.
[0048] A2, record each order set as an inefficient order set or an efficient order set according to the comprehensive processing efficiency y0; specifically, in this step, the order set whose comprehensive processing efficiency y0 is lower than the first efficiency threshold can be recorded as an inefficient order set, and the order set whose comprehensive processing efficiency y0 is higher than the first efficiency threshold and the corresponding number of idle crossings is two or more can be recorded as an efficient order set.
[0049] A3, selecting one or more idle intersections from the idle intersections corresponding to the efficient order set, for allocating orders in the inefficient order set.
[0050] Therefore, in order to further ensure the coordinated and efficient processing of different types of orders, after calculating the comprehensive processing efficiency y0 corresponding to each order set, each order set is divided into an efficient order set or an inefficient order set, and then a part of the idle crossings corresponding to the efficient order set is used to allocate the inefficient order set, so as to try to ensure the synchronous and efficient processing of various types of orders, maintain the balance of processing efficiency of different types of order sets, and avoid congestion or idleness at the crossings. In this step, the nature of the crossings selected for allocating the inefficient order set has changed. For example, the crossing used for warehousing is adjusted to the crossing used for outbound storage.
[0051] In a possible implementation, step S9, based on the processing efficiency y corresponding to each idle intersection c , adjusting the second allocation information, specifically comprising steps B1-B2: B1, the idle intersections corresponding to the same order set are divided into two groups according to the processing efficiency y c They are recorded as inefficient idle crossings or efficient idle crossings respectively; Similarly, this step can still use the threshold comparison method to compare the processing efficiency y c The idle intersections below the third efficiency threshold are recorded as inefficient idle intersections, and the processing efficiency y c The idle intersections above the fourth efficiency threshold are recorded as high-efficiency idle intersections.
[0052] B2, for the inefficient idle intersections and efficient idle intersections in the same order set, select part of the orders corresponding to the inefficient idle intersections and allocate them to the efficient idle intersections; or, select part of the idle intersections from the efficient idle intersections to allocate orders to the inefficient idle intersections.
[0053] Therefore, in order to further ensure the coordinated and efficient processing of orders of the same type, for multiple idle intersections corresponding to the same order set, the idle intersections are divided according to the processing efficiency y corresponding to each idle intersection; then, a part of the orders for the inefficient idle intersections are selected from the efficient idle intersections, or a part of the orders for the inefficient idle intersections are selected and allocated to the efficient idle intersections, so as to maintain the balance of the processing efficiency of each order within the same type of order set. In this adjustment step, the nature of the intersection does not need to be changed, that is, the intersection used for outbound delivery is still used for outbound delivery, but the assigned orders have changed.
[0054] The embodiment of the present application provides an efficient order processing system, which applies the above-mentioned efficient order processing method.
[0055] Specifically, the efficient order processing system includes an information acquisition module, an information processing module, a crossing allocation module, a route planning module and a transportation execution module: The information acquisition module is used to obtain the type and quantity of goods of each order, as well as the total number of idle crossings and the position of each idle crossing; The information processing module is used to divide each order into a corresponding order set based on the type of each order; and is also used to allocate an idle intersection to each order set based on the total number of the idle intersections, the location of each idle intersection and the number of goods corresponding to each order set, and generate first allocation information between the order set and the idle intersection; wherein the number of goods corresponding to each order set is the sum of the numbers of goods of all orders in the order set; The crossing allocation module is used to allocate idle crossings to orders in each order set based on the first allocation information, and generate second allocation information between the orders and the idle crossings; The path planning module is used to plan the transportation path of each order from the loading point to the corresponding idle intersection based on the second allocation information between the order and the idle intersection, and generate an order transportation strategy; The transportation execution module is used to transport each order based on the order transportation strategy.
[0056] An embodiment of the present application provides a terminal, including: a processor, a memory and a communication bus; the communication bus is used to realize connection and communication between the processor and the memory, and the processor is used to execute one or more programs stored in the memory to realize the above-mentioned efficient order processing method.
[0057] An embodiment of the present application provides a computer-readable storage medium, which stores instructions. When the instructions are executed, the above-mentioned efficient order processing method is executed.
[0058] The above are all preferred embodiments of the present application, and the protection scope of the present application is not limited thereto. Therefore, any equivalent changes made according to the structure, shape, and principle of the present application should be included in the protection scope of the present application.
Claims
1. An efficient order processing method, characterized in that: include: Obtain the type and quantity of goods for each order, as well as the total number of idle crossings and the location of each idle crossing; Based on the type of each order, each order is divided into a corresponding order set; Based on the total number of idle intersections, the location of each idle intersection and the number of commodities corresponding to each order set, an idle intersection is allocated to each order set, and first allocation information between the order set and the idle intersection is generated; wherein the number of commodities corresponding to each order set is the sum of the number of commodities of all orders in the order set; Based on the first allocation information, allocate an idle crossing to the orders in each order set, and generate second allocation information between the orders and the idle crossings; Based on the second allocation information, planning a transportation path for each order from the loading point to the corresponding idle crossing, and generating an order transportation strategy; Based on the order shipping strategy, each order is shipped.
2. The efficient order processing method according to claim 1, characterized in that: Based on the order transportation strategy, after each order is transported, it also includes: Get the loading time t1, transportation time t2 and unloading time t3 of the corresponding orders at each idle intersection; Based on the loading time t1, the transportation time t2 and the unloading time t3, the processing efficiency y corresponding to the idle crossing is calculated. c ; Based on the processing efficiency y corresponding to each idle intersection c , adjust the first allocation information or the second allocation information.
3. The efficient order processing method according to claim 2 is characterized in that: Based on the loading time t1, the transportation time t2 and the unloading time t3, the processing efficiency y corresponding to the idle crossing is calculated. c , specifically including: Among them, T1 is the standard loading time, T2 is the standard transportation time, and T3 is the standard unloading time; a, b, c are the first influence coefficients of loading time, transportation time and unloading time on processing efficiency respectively; m1, m2, m3 are the second influence coefficients of loading time, transportation time and unloading time on processing efficiency respectively; f1 is the correlation influence coefficient of loading time on transportation time, and f2 is the correlation influence coefficient of unloading time on transportation time.
4. The efficient order processing method according to claim 2, characterized in that: Based on the processing efficiency y corresponding to each idle intersection c , adjusting the first allocation information, specifically including: Based on the processing efficiency y corresponding to each idle intersection c , determine the comprehensive processing efficiency y0 corresponding to each order set; Each order set is recorded as an inefficient order set or an efficient order set according to the comprehensive processing efficiency y0; One or more idle intersections are selected from the idle intersections corresponding to the efficient order set to allocate the orders in the inefficient order set.
5. The efficient order processing method according to claim 2, characterized in that: Based on the processing efficiency y corresponding to each idle intersection c , adjusting the second allocation information, specifically including: The idle intersections corresponding to the same order set are divided according to the processing efficiency y c They are respectively recorded as inefficient idle intersections or efficient idle intersections; for the inefficient idle intersections and efficient idle intersections in the same order set, some orders are selected from the orders corresponding to the inefficient idle intersections and allocated to the efficient idle intersections; or, some idle intersections are selected from the efficient idle intersections to allocate orders to the inefficient idle intersections.
6. The efficient order processing method according to claim 2, characterized in that: After obtaining the loading time t1, transportation time t2 and unloading time t3 of the orders corresponding to each idle intersection, it also includes: If the loading time t1 exceeds the preset loading time threshold, a reminder is generated that additional personnel are needed at the loading point corresponding to the order at the idle crossing; If the transportation time t2 exceeds the preset transportation time threshold, a reminder is generated indicating that the transportation process of the order corresponding to the idle crossing is abnormal; If the unloading time t3 exceeds the preset unloading time threshold, a reminder is generated that additional personnel are needed at the unloading point corresponding to the order at the idle crossing.
7. The efficient order processing method according to claim 1, characterized in that: Based on the processing efficiency y corresponding to each idle intersection c , after adjusting the first allocation information or the second allocation information, further comprising: The adjustment process of the first allocation information and the second allocation information is recorded to provide a basis for optimizing the generation process of the first allocation information and the second allocation information.
8. An efficient order processing system, characterized in that: It includes information acquisition module, information processing module, crossing allocation module, path planning module and transportation execution module: The information acquisition module is used to obtain the type and quantity of goods of each order, as well as the total number of idle crossings and the position of each idle crossing; The information processing module is used to classify each order into a corresponding order set based on the type of each order; It is also used to allocate idle intersections to each order set based on the total number of idle intersections, the location of each idle intersection and the number of goods corresponding to each order set, and generate first allocation information between the order set and the idle intersections; wherein the number of goods corresponding to each order set is the sum of the numbers of goods of all orders in the order set; The crossing allocation module is used to allocate idle crossings to orders in each order set based on the first allocation information, and generate second allocation information between the orders and the idle crossings; The path planning module is used to plan the transportation path of each order from the loading point to the corresponding idle intersection based on the second allocation information, and generate an order transportation strategy; The transportation execution module is used to transport each order based on the order transportation strategy.
9. A terminal, characterized in that: include: A processor, a memory and a communication bus; the communication bus is used to realize the connection and communication between the processor and the memory, and the processor is used to execute one or more programs stored in the memory to realize the efficient order processing method as described in any one of claims 1-7.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores instructions, and when the instructions are executed, the efficient order processing method according to any one of claims 1 to 7 is executed.