Goods delivery management method and system
By constructing a batch allocation model for outbound goods and setting the objective function, and optimizing outbound solutions using optimization algorithms, the decision-making deviation and high transportation costs caused by relying on experience in the existing technology are solved, and efficient and accurate outbound management is achieved.
Patent Information
- Application Number
- CN202510378259.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-03-28
- Publication Date
- 2025-07-11
AI Technical Summary
The existing cargo outbound management methods rely on experience or fixed rules, lack flexibility, and are susceptible to human factors, leading to decision-making deviations, increasing transportation costs and resource waste, and reducing operational efficiency and economic benefits.
Build a batch allocation model for goods outbound, set clear objective functions, optimize outbound plans through optimization algorithms, consider actual constraints and goals, prioritize emergency orders, and reduce transportation costs.
Through data-driven decision-making, human deviations are eliminated, outbound efficiency and decision-making accuracy are improved, transportation costs are reduced, and economic benefits are optimized.
Smart Images
Figure CN120297875A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of data processing, and particularly to a method and system for managing the outbound of goods. Background Art
[0002] With the continuous development of modern logistics industry, the efficiency and accuracy of warehouse management become particularly important. The outbound management of goods is a key link in warehouse management, which directly affects the operation efficiency of enterprises, customer satisfaction and the control of logistics costs. In the process of outbound management, how to efficiently and accurately pick up goods from the warehouse and perform accurate distribution is an urgent problem to be solved in the logistics industry.
[0003] Currently, many warehouse management systems (WMS) rely on experience or fixed rules and adopt an order-driven picking method for the outbound operation of goods. In this mode, pickers select goods one by one according to customer orders, usually through manual or semi-automatic methods. This method usually adopts the "single order picking" or "batch order picking" method. Pickers will find the specified goods in the warehouse according to the order content, load them onto the transportation tools, and finally pack and ship them out.
[0004] However, the existing methods rely on experience or fixed rules to determine the outbound plan, without using optimization algorithms to make data-driven decisions based on actual constraints and objectives. This approach not only lacks flexibility and is easily affected by human factors, resulting in decision-making deviations, thus reducing efficiency and increasing the risk of errors. In addition, due to the failure to fully optimize transportation costs, it leads to waste of resources and unreasonable expenditures during transportation, resulting in excessive transportation costs and affecting the overall operation efficiency and economic benefits. Summary of the Invention
[0005] In order to solve the technical problems that the existing methods rely on experience or fixed rules to determine the outbound plan, without using optimization algorithms to make data-driven decisions based on actual constraints and objectives. This approach not only lacks flexibility and is easily affected by human factors, resulting in decision-making deviations, thus reducing efficiency and increasing the risk of errors. In addition, due to the failure to fully optimize transportation costs, it leads to waste of resources and unreasonable expenditures during transportation, resulting in excessive transportation costs and affecting the overall operation efficiency and economic benefits, the present invention provides a method and system for managing the outbound of goods.
[0006] The technical solutions provided by the embodiments of the present invention are as follows:
[0007] First aspect:
[0008] A method for managing the outbound of goods provided by an embodiment of the present invention includes:
[0009] S1: Obtain multiple shipping orders;
[0010] S2: Calculate the shipping urgency value of each of the shipping orders;
[0011] S3: Determine whether the shipping urgency value of each of the shipping orders is 0; if so, notify the production department of the goods shortage information; otherwise, sort the shipping urgency values of each of the shipping orders in descending order;
[0012] S4: Construct a goods outbound batch allocation model with the goal of minimizing transportation costs and preferentially selecting shipping orders with high shipping urgency values;
[0013] S5: Determine the objective function and constraints of the goods outbound batch allocation model;
[0014] S6: Under the constraints of the constraints, with the goal of minimizing the function value of the objective function, optimize the goods outbound batch allocation model through an optimization algorithm, and output the optimal outbound plan;
[0015] S7: Carry out the outbound of goods according to the optimal outbound plan.
[0016] Second aspect:
[0017] A goods outbound management system provided by an embodiment of the present invention includes:
[0018] A processor;
[0019] A memory, on which computer-readable instructions are stored, and when the computer-readable instructions are executed by the processor, the goods outbound management method described in the first aspect is implemented.
[0020] Third aspect:
[0021] A computer-readable storage medium provided by an embodiment of the present invention, on which a computer program is stored, and when the program is executed by a processor, the goods outbound management method described in the first aspect is implemented.
[0022] The beneficial effects brought by the technical solution provided by the embodiment of the present invention at least include:
[0023] (1) In the embodiment of the present invention, by constructing a goods outbound batch allocation model and setting a clear objective function, with the goal of minimizing transportation costs and preferentially processing urgent orders, decision-making relying on experience and fixed rules is avoided. Through optimization by an optimization algorithm, the system can make flexible, data-driven decisions according to actual constraints and goals, eliminate human biases, and improve decision-making accuracy and outbound efficiency.
[0024] (2) In the embodiments of the present invention, based on considering the constraint conditions, the optimization algorithm minimizes the transportation cost and performs precise calculation and solution optimization, which not only improves the operation efficiency, ensures the smooth progress of outbound, but also effectively reduces the transportation cost and further optimizes the economic benefits. Brief Description of the Drawings
[0025] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can be obtained based on these drawings.
[0026] Figure 1 It is a schematic flow chart of a method for managing the outbound of goods provided by an embodiment of the present invention;
[0027] Figure 2 It is a schematic structural diagram of a system for managing the outbound of goods provided by an embodiment of the present invention. Detailed Embodiments
[0028] The following will describe the technical solutions in the present invention with reference to the drawings.
[0029] In the embodiments of the present invention, words such as "exemplarily" and "for example" are used to give examples, illustrations or explanations. Any embodiment or design solution described as "example" in the present invention should not be construed as more preferred or more advantageous than other embodiments or design solutions. Exactly, the use of the word "example" aims to present concepts in a specific way. In addition, in the embodiments of the present invention, the meaning expressed by "and / or" can be both, or either one of the two.
[0030] In the embodiments of the present invention, "image" and "picture" can sometimes be used interchangeably. It should be noted that when not emphasizing the difference, their intended meanings are the same. "(of)", "corresponding" and "corresponding" can sometimes be used interchangeably. It should be noted that when not emphasizing the difference, their intended meanings are the same.
[0031] In the embodiments of the present invention, sometimes subscripts such as W1 may be written in a non-subscript form such as W1. When not emphasizing the difference, their intended meanings are the same.
[0032] To make the technical problems, technical solutions and advantages to be solved by the present invention clearer, the following will be described in detail with reference to the drawings and specific embodiments.
[0033] Refer to the attached drawings of the specification Figure 1, which shows a schematic flow diagram of a goods outbound management method provided by an embodiment of the present invention.
[0034] An embodiment of the present invention provides a goods outbound management method, which can be implemented by a goods outbound management device. The goods outbound management device can be a terminal or a server. The processing flow of the goods outbound management method can include the following steps:
[0035] S1: Obtain multiple shipping orders.
[0036] It should be noted that the shipping order includes an order number, customer information, order amount, delivery time, product information, inventory status, and customer level.
[0037] S2: Calculate the urgency value of each shipping order.
[0038] Among them, the urgency value of the shipping order is a key indicator used to measure the priority of each shipping order during processing and shipping. It usually comprehensively considers multiple factors, such as delivery time, order amount, customer level, and inventory availability, to ensure that the most urgent or important orders can be processed first.
[0039] In a possible implementation manner, the calculation method of the urgency value of the shipping order is:
[0040] P k =(ω1T k +ω2Q k +ω3C k )M
[0041] Among them, P k represents the urgency value of the kth shipping order, ω1 represents the weight represented by the delivery time value of the kth shipping order, T k represents the delivery time value of the kth shipping order, ω2 represents the weight represented by the order amount value of the kth shipping order, Q k represents the order amount value of the kth shipping order, ω3 represents the weight represented by the customer level of the kth shipping order, C k represents the customer level of the kth shipping order, and M represents the binary value of inventory availability. M = 1 indicates sufficient inventory, and M = 0 indicates insufficient inventory.
[0042] Optionally, the specific calculation method of the delivery time value is:
[0043]
[0044] Among them, T k represents the delivery time value of the kth shipping order, T r represents the agreed delivery time, and T now represents the current time.
[0045] It should be noted that the maximum delivery time may not depend on a single order, but is a standard time stipulated by the system.
[0046] Optionally, the order amount value of the shipping order is calculated as follows:
[0047]
[0048] where Q k represents the order amount value of the k-th shipping order, Q s represents the amount of the order, and Q max represents the maximum order amount among all shipping orders.
[0049] In the present invention, by comprehensively considering factors such as delivery time, order amount, customer level, and inventory availability, the priority of each shipping order can be scientifically determined. In this way, an enterprise can ensure that the most urgent or important orders are processed first, avoiding delays in large customer or urgent orders, thereby improving customer satisfaction. At the same time, by introducing a binary variable for inventory availability, the impact of inventory sufficiency on the shipping plan can be taken into account. If the inventory is insufficient, the system can automatically set the shipping urgency value to 0, thus avoiding processing orders that cannot be shipped, ensuring that the production and logistics departments can timely replenish the shortage of goods, and reducing errors in the shipping plan.
[0050] S3: Determine whether the shipping urgency value of each shipping order is 0. If so, notify the production department of the goods shortage information. Otherwise, sort the shipping urgency values of each shipping order in descending order.
[0051] In the present invention, by determining whether the shipping urgency value is 0, the system can automatically identify orders with insufficient inventory and avoid including orders that cannot be shipped in time in the processing flow. If the inventory is insufficient, the goods shortage information is promptly notified to the production department, which can prevent waste of time and resources and focus on processing orders that can be completed in time. At the same time, sorting the shipping urgency values of each shipping order in descending order can accurately identify which shipping order needs to be shipped first, ensuring the maximization of the enterprise's economic benefits.
[0052] In a possible implementation manner, after S3, it further includes:
[0053] After the production department replenishes the shortage of goods in the shipping order with goods shortage, recalculate the shipping urgency value of the shipping order with the replenished goods.
[0054] It should be noted that if the shipping urgency value of the shipping order is 0, it proves that the inventory in the current shipping order is insufficient and not enough for outbound, so the shortage of goods needs to be replenished before outbound.
[0055] In the present invention, once the production department replenishes the shortage of goods, the system will recalculate the urgency values of these orders and adjust their priorities. This means that production and the warehouse can adjust the shipping plan in real-time and dynamic situations, giving priority to processing urgent orders or orders from important customers. Recalculating the urgency values can ensure a response to the latest situation, enhancing flexibility and the ability to handle changes.
[0056] S4: With the goal of minimizing transportation costs and preferably selecting shipping orders with high urgency values for shipment, construct a goods outbound batch allocation model.
[0057] Among them, the goods outbound batch allocation model is an optimization model designed to reasonably allocate the goods outbound batches according to various factors (such as order urgency, inventory location, transportation costs, etc.). Its main purpose is to minimize costs, optimize resource utilization, and improve customer satisfaction on the premise of ensuring efficient and smooth outbound operations.
[0058] S5: Determine the objective function and constraint conditions of the goods outbound batch allocation model.
[0059] In a possible implementation manner, the objective function is specifically:
[0060]
[0061] Among them, min represents minimization, F represents the objective function, μ represents the weight factor, I represents the set of storage locations, J represents the set of packages, T represents the set of time periods, dis mm′ represents the distance between the i-th storage location and the i'-th storage location, Cost mm′t represents the unit distance transfer cost between the i-th and i'-th storage locations in the t-th time period, Y ii′jt represents whether the j-th package moves from the i-th storage location to the i'-th storage location in the t-th time period, Y mm′jt =1 means that the j-th package moves from the i-th storage location to the i'-th storage location in the t-th time period, Y mm′jt =0 means that the j-th package does not move from the i-th storage location to the i'-th storage location in the t-th time period, V represents the set of transport vehicles, R vt represents the fixed cost of the v-th transport vehicle in the t-th time period, No vt represents the number of transport vehicles v required in the t-th time period, K represents the set of orders, t k represents the picking time period of the k-th order, t k ={t|X jkt =1}, X jkt =1 means that the k-th order is assigned to the j-th package in the t-th time period, Pk Represents the shipping urgency value of the k-th order.
[0062] It should be noted that in the mathematical model, packages are considered to integrate the joint order batching strategy and prevent pickers from collecting orders in multiple trips. These two are very important in the joint order batching problem. In addition, we not only require pickers to collect orders in one trip, but our goal is to minimize the distance for pickers to pick up packages on the warehouse shelves. At the same time, we regard the transportation cost as an uncertain parameter that may have a key impact on the system. For this reason, the possibility programming model solves the unit transportation cost and the capacity of the transport vehicle.
[0063] In the present invention, the method of comprehensively considering the transportation cost and the order urgency helps to ensure that not only the transportation cost is minimized, but also urgent orders are given priority to meet customer needs in a timely manner. At the same time, by introducing the order urgency into the objective function, the system can automatically sort the orders, giving priority to those orders with approaching delivery times, large amounts, or high customer levels, thereby reducing delays and ensuring that the needs of key customers are met in a timely manner.
[0064] In a possible implementation manner, the constraint conditions specifically include:
[0065] Ensure that picking of the j-th package starts from the i-th storage location in the t-th time period:
[0066]
[0067] Where Z ijt Represents whether picking of the j-th package starts from the i-th storage location in the t-th time period. Z ijt =1 indicates that picking of the j-th package starts from the i-th storage location in the t-th time period, and Z ijt =0 indicates that picking of the j-th package does not start from the i-th storage location in the t-th time period.
[0068] It should be noted that the meaning of the formula is to help ensure that the picking task of each package starts from a specific location and this location is available.
[0069] Ensure that the i'-th storage location can be the destination of the j-th package in the t-th time period:
[0070]
[0071] Where Z i′jt Represents that the j-th package selects the i'-th storage location as the destination in the t-th time period. Z i′jt =1 indicates that the j-th package selects the i'-th storage location as the destination in the t-th time period, and Z i′jt= 0 indicates that the j-th parcel in the t-th time period does not select the i'-th storage location as the destination.
[0072] It should be noted that the meaning of the formula is that if parcel j is picked from storage location i within time period t and reaches storage location i' through a path, then storage location i' must be the destination of parcel j to ensure that the path and destination in the picking process are consistent and prevent incomplete paths or situations that do not meet the destination requirements.
[0073] Prevent unreasonable movement of the transport vehicle in the picking path:
[0074]
[0075] Among them, l represents the l-th storage location.
[0076] It should be noted that the meaning of the formula is that only when the i-th storage location is selected (Z ijt = 1), is it allowed for the transport vehicle to start picking from this location and move to other storage locations. If the i-th storage location is not selected, there will be no unnecessary movement, thus avoiding the ineffective circulation of the transport vehicle in the warehouse.
[0077] Ensure that within time period t, the i-th storage location determined by the k-th order in the j-th parcel can only be picked once:
[0078]
[0079] Among them, A ikt represents whether the k-th order is picked from the i-th storage location in the t-th time period. A ikt = 1 indicates that the k-th order is picked from the i-th storage location in the t-th time period. A ikt = 0 indicates that the k-th order is not picked from the i-th storage location in the t-th time period. X jkt represents whether the k-th order is assigned to the j-th parcel in the t-th time period. X jkt = 1 indicates that the k-th order is assigned to the j-th parcel in the t-th time period. X jkt = 0 indicates that the k-th order is not assigned to the j-th parcel in the t-th time period. K represents the set of orders.
[0080] It should be noted that the meaning of the formula is that by ensuring Z ijt ≥ A ikt X jkt to avoid the same storage location i being repeatedly selected within time period t to meet the needs of different orders, so as to ensure that each storage location i can only be satisfied once within time period t, avoid the problem of multiple pickings, and ensure the efficiency of warehouse operations.
[0081] Ensure that in the t-th time period, the k-th order can only be assigned to the j-th package:
[0082]
[0083] It should be noted that the meaning of the formula is that this constraint ensures that each order k can only be assigned to one package j within the time period t, rather than multiple packages. This helps prevent the same order from being repeatedly assigned, ensuring the correctness and efficiency of warehouse operations.
[0084] Ensure that the transportation vehicle v can pick up the j-th package of the k-th order in the t-th time period:
[0085]
[0086] Among them, W kt represents the weight of the k-th order in the t-th time period, Cap ν represents the capacity limit of the transportation vehicle v, No vt represents the number of transportation vehicles v used in the t-th time period.
[0087] It should be noted that the meaning of the formula is to ensure that each order k can only select one package j within the time period t, and the package j will be picked up by the transportation vehicle v, ensuring the efficiency and accuracy of order processing and avoiding the situation where multiple packages are assigned to the same order.
[0088] Ensure that the number of transportation vehicles in the t-th time period does not exceed the maximum number of available transportation vehicles:
[0089]
[0090] Among them, AN t represents the maximum number of available transportation vehicles in the t-th time period.
[0091] Ensure that the transportation vehicle arrives at the i-th storage location only once:
[0092]
[0093] Among them, Y iijt represents that in the t-th time period, there is no path from the i-th storage location to the same storage location for the j-th package.
[0094] Ensure that the number of transportation vehicles v is of integer type:
[0095]
[0096] Among them, integer represents the integer type.
[0097] In the present invention, by introducing these constraint conditions, the model can ensure the accuracy, efficiency, and maximization of resource utilization in warehouse operations. It optimizes the picking process, the allocation of transportation resources, and the distribution of orders, reduces errors and ineffective links in warehouse operations, thereby improving the overall operating efficiency of the supply chain. These constraints not only ensure the precision and efficiency of operations but also enhance the flexibility of the system, enabling it to respond to different business requirements and changes, ultimately improving customer satisfaction and reducing potential delays and costs.
[0098] S6: Under the constraints of the constraint conditions, with the goal of minimizing the function value of the objective function, optimize the goods outbound batch allocation model through an optimization algorithm, and output the optimal outbound plan.
[0099] In a possible implementation manner, the optimization algorithm is specifically: the sparrow search algorithm improved based on fireflies.
[0100] In a possible implementation manner, use the reciprocal of the objective function as the fitness function of the sparrow search algorithm improved based on fireflies.
[0101] Optionally, the steps of the sparrow search algorithm improved based on fireflies specifically include:
[0102] S601: Initialize the sparrow population, and set the maximum number of iterations, the proportions of discoverers, followers, and vigilant birds.
[0103] S602: Calculate the fitness values of each sparrow, sort the fitness values of each sparrow at the same time, and select the sparrows represented by the best and worst current fitness values.
[0104] S603: Update the positions of the discoverers in the sparrow population:
[0105]
[0106] where H F,W represents the position of the W-th discoverer after the t-th iteration update, represents the n-dimensional position of the m-th sparrow in the population after the h-th iteration update, n = 1, 2, 3,..., d, d represents the total number of dimensions, α represents the factor controlling the exploration behavior of the sparrow, U represents a constant, m represents the index of the current sparrow in the population, t represents the number of iterations, λ represents the step factor controlling the position update, L represents the offset, R2 represents a randomly generated value, and SU represents the threshold for determining the size of the sparrow position update.
[0107] S604: Update the positions of the followers in the sparrow population:
[0108]
[0109] Among them, H G,W represents the position of the W-th follower after the t-th iteration update, and H' W represents the position of the previous generation of the discoverer, and H' m,n represents the current position of the m-th follower sparrow in the n-th dimension, h represents the current iteration number, represents the updated reference position, and A + represents the weight factor for position update.
[0110] S605: Update the positions of the vigilant sparrows in the sparrow population, calculate the fitness values of the sparrows at the new positions, and perform an update if the fitness value is better than the current optimal value:
[0111]
[0112] Among them, H J,W represents the position of the W-th vigilant sparrow after the t-th iteration update, represents the current optimal position, and f m represents the fitness value of the m-th sparrow, and f g represents the fitness value of the optimal sparrow, and f W represents the fitness value of the position of the vigilant sparrow, G represents the weight factor of the vigilant sparrow's behavior, B represents the factor controlling the position update of the vigilant sparrow, and ε represents a constant.
[0113] S606: Introduce the firefly algorithm. At this time, the search particles are equivalent to fireflies. According to the individual positions after the previous iteration, calculate the fitness values and use them as the maximum fluorescence brightness of each firefly.
[0114] S607: Calculate the fluorescence brightness and attractiveness of the fireflies to determine the search direction of the population:
[0115]
[0116] Among them, E represents, E0 represents the initial fluorescence brightness, γ represents the factor controlling the light attenuation, β0 represents the initial attractiveness, β represents the attractiveness, and r a,b represents the distance between the a-th firefly and the b-th firefly.
[0117] In the present invention, by calculating the light brightness (related to the fitness) and attractiveness of each firefly, it is ensured that the search direction in the solution space is guided according to the light brightness difference. This process enables the search particles to perform intelligent search based on the position of the optimal individual, attracting the fireflies to move in the direction of higher fitness.
[0118] S608: Randomly perturb the firefly individuals at the optimal position and update the individual positions of the population:
[0119] xa = x a + β(x b - x a ) + α(rand - 1 / 2)
[0120] Wherein, x a represents the position of the a-th firefly, and x b represents the position of the b-th firefly, and rand represents a random number.
[0121] In the present invention, by perturbing the individuals at the optimal position and updating their positions, the global and randomness of the search can be enhanced. This process combines the attractiveness and random perturbation, which not only maintains the attraction from the optimal solution position but also avoids premature convergence through random perturbation, increasing the flexibility and diversity of exploration.
[0122] S609: Calculate the fitness values of each updated individual, retain the position of the optimal individual, and output the position of the optimal individual.
[0123] Judge whether the maximum number of iterations is reached. If so, output the position of the optimal individual as the optimal goods outbound batch allocation scheme. Otherwise, return to S602.
[0124] S7: Carry out the outbound of goods according to the optimal outbound plan.
[0125] In a possible implementation manner, after S7, it further includes:
[0126] Track the execution status of each outbound order through the monitoring system to ensure the smooth progress of the outbound task.
[0127] In a possible implementation manner, after S7, it further includes:
[0128] Summarize and record the outbound data for the management personnel to consult.
[0129] In the present invention, by tracking the execution status of the outbound order through the monitoring system, it can ensure that all outbound tasks are carried out smoothly according to the plan, and any delay and misoperation problems can be discovered and processed in a timely manner, thus avoiding potential supply chain disruptions. At the same time, summarizing the data of each outbound is convenient for the management personnel to conduct subsequent analysis. Through regular statistics and analysis of the outbound data, the manager can identify potential operation bottlenecks, resource waste, and opportunities for efficiency improvement.
[0130] The beneficial effects brought by the technical solution provided by the embodiment of the present invention at least include:
[0131] (1) In the embodiments of the present invention, by constructing a goods outbound batch allocation model and setting a clear objective function, with the goal of minimizing transportation costs and giving priority to processing urgent orders, it avoids decisions relying on experience and fixed rules. Through optimization by an optimization algorithm, the system can make flexible, data-driven decisions based on actual constraints and objectives, eliminating human biases and improving decision-making accuracy and outbound efficiency.
[0132] (2) In the embodiments of the present invention, based on considering constraint conditions through an optimization algorithm, it minimizes transportation costs and performs precise calculations and scheme optimizations, not only improving operational efficiency and ensuring smooth outbound operations, but also effectively reducing transportation costs and further optimizing economic benefits.
[0133] Refer to the attached Figure 2 illustrates a schematic structural diagram of a goods outbound management system provided by the present invention.
[0134] The present invention also provides a goods outbound management system 20, which is applied to the above-mentioned goods outbound management method and includes:
[0135] A processor 201.
[0136] A memory 202, on which computer-readable instructions are stored. When the computer-readable instructions are executed by the processor 201, the goods outbound management method as in the method embodiments is implemented.
[0137] The goods outbound management system 20 provided by the present invention can execute the above-mentioned goods outbound management method and achieve the same or similar technical effects. To avoid repetition, the present invention will not elaborate further.
[0138] The beneficial effects brought by the technical solutions provided in the embodiments of the present invention at least include:
[0139] (1) In the embodiments of the present invention, by constructing a goods outbound batch allocation model and setting a clear objective function, with the goal of minimizing transportation costs and giving priority to processing urgent orders, it avoids decisions relying on experience and fixed rules. Through optimization by an optimization algorithm, the system can make flexible, data-driven decisions based on actual constraints and objectives, eliminating human biases and improving decision-making accuracy and outbound efficiency.
[0140] (2) In the embodiments of the present invention, based on considering constraint conditions through an optimization algorithm, it minimizes transportation costs and performs precise calculations and scheme optimizations, successfully achieving cost reduction. This not only improves operational efficiency but also effectively reduces transportation costs and further optimizes economic benefits.
[0141] It should be understood that the processor in the embodiments of the present invention may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
[0142] It should also be understood that the memory in the embodiments of the present invention may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable ROM (PROM), an erasable programmable ROM (EPROM), an electrically erasable programmable ROM (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of random access memory (RAM) are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchlink DRAM (SLDRAM), and direct rambus RAM (DR RAM).
[0143] The above embodiments can be implemented in whole or in part by software, hardware (such as circuits), firmware, or any combination thereof. When implemented using software, the above embodiments can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the processes or functions described in the embodiments of the present invention are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wired (such as infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that contains one or more collections of available media. The available media can be magnetic media (such as floppy disks, hard disks, magnetic tapes), optical media (such as DVDs), or semiconductor media. The semiconductor media can be a solid-state drive.
[0144] It should be understood that the term "and / or" in this document is merely a description of the association relationship between associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone. Here, A and B can be singular or plural. In addition, the character " / " in this document generally represents an "or" relationship between the associated objects before and after, but it may also represent an "and / or" relationship, which can be specifically understood by referring to the context before and after.
[0145] In the present invention, "at least one" means one or more, and "a plurality" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b, or c can represent: a, b, c, a - b, a - c, b - c, or a - b - c, where a, b, and c can be single or multiple.
[0146] It should be understood that in various embodiments of the present invention, the magnitudes of the sequence numbers of the above processes do not mean the order of execution. The order of execution of each process should be determined by its function and internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
[0147] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in connection with the embodiments disclosed herein can be implemented in electronic hardware, or in a combination of computer software and electronic hardware. Whether these functions are executed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may use different methods for each specific application to implement the described functions, but such implementation should not be considered to exceed the scope of the present invention.
[0148] Those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working processes of the devices, apparatuses, and units described above can refer to the corresponding processes in the foregoing method embodiments, and will not be described herein again.
[0149] In several embodiments provided by the present invention, it should be understood that the disclosed devices, apparatuses, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces, and the indirect couplings or communication connections of the devices or units can be in electrical, mechanical, or other forms.
[0150] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0151] In addition, the functional units in each embodiment of the present invention can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit.
[0152] When the above-mentioned functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs that can store program codes.
[0153] An embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, it implements the goods outbound management method as described in the method embodiment.
[0154] The computer-readable storage medium provided by the present invention can implement the steps and effects of the goods outbound management method in the above method embodiment. To avoid repetition, the present invention will not elaborate further.
[0155] The beneficial effects brought by the technical solution provided by the embodiment of the present invention at least include:
[0156] (1) In the embodiment of the present invention, by constructing a goods outbound batch allocation model and setting a clear objective function, with the goal of minimizing transportation costs and giving priority to processing urgent orders, the decision-making that relies on experience and fixed rules is avoided. Through optimization by an optimization algorithm, the system can make flexible, data-driven decisions according to actual constraints and objectives, eliminate human biases, and improve decision-making accuracy and outbound efficiency.
[0157] (2) In the embodiment of the present invention, based on considering constraint conditions through an optimization algorithm, the transportation cost is minimized and accurate calculations and scheme optimizations are carried out. This not only improves the operation efficiency, ensures the smooth progress of outbound, but also effectively reduces the transportation cost and further optimizes the economic benefits.
[0158] As described above, only the specific embodiments of the present invention are provided, but the protection scope of the present invention is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present invention can easily think of changes or substitutions, which should all be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.
[0159] The following points need to be explained:
[0160] (1) The accompanying drawings of the embodiments of the present invention only relate to the structures involved in the embodiments of the present invention, and other structures can refer to the general design.
[0161] (2) For clarity, in the accompanying drawings used to describe the embodiments of the present invention, the thickness of layers or regions is enlarged or reduced, that is, these drawings are not drawn to actual scale. It can be understood that when an element such as a layer, film, region, or substrate is referred to as being "on" or "under" another element, the element can be "directly" on or under the other element or there can be intermediate elements.
[0162] (3) Without conflict, the embodiments of the present invention and the features in the embodiments can be combined with each other to obtain new embodiments.
[0163] The above is only the specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. The protection scope of the present invention shall be subject to the protection scope of the claims.
Claims
1. A method for managing the outbound of goods, characterized in that, Including: S1: Obtain multiple shipping orders; S2: Calculate the shipping urgency value of each of the shipping orders; S3: Determine whether the shipping urgency value of each of the shipping orders is 0; if so, notify the production department of the goods shortage information; otherwise, sort the shipping urgency values of each of the shipping orders in descending order; S4: With the goal of minimizing transportation costs and preferentially selecting the shipping orders with high shipping urgency values, construct a goods outbound batch allocation model; S5: Determine the objective function and constraint conditions of the goods outbound batch allocation model; S6: Under the constraints of the constraint conditions, with the goal of minimizing the function value of the objective function, optimize the goods outbound batch allocation model through an optimization algorithm, and output the optimal outbound plan; S7: Carry out the outbound of goods according to the optimal outbound plan.
2. The goods outbound management method according to claim 1, wherein, The calculation method of the shipping urgency value is: P k = (ω1T k + ω2Q k + ω3C k )M; Among them, P k represents the shipping urgency value of the k-th shipping order, ω1 represents the weight represented by the delivery time value of the k-th shipping order, T k represents the delivery time value of the k-th shipping order, ω2 represents the weight represented by the order amount value of the k-th shipping order, Q k represents the order amount value of the k-th shipping order, ω3 represents the weight represented by the customer level of the k-th shipping order, C k represents the customer level of the k-th shipping order, M represents the binary value of inventory availability, M = 1 indicates sufficient inventory, and M = 0 indicates insufficient inventory.
3. The goods outbound management method according to claim 1, wherein After S3, it further includes: After the production department replenishes the shortage goods in the goods shortage shipping order, recalculate the shipping urgency value of the shipping order for the replenished goods.
4. The goods outbound management method according to claim 1, wherein, The specific objective function is: Among them, min represents minimization, F represents the objective function, μ represents the weight factor, I represents the set of storage locations, J represents the set of packages, T represents the set of time periods, dis ii′ represents the distance between the i-th storage location and the i'-th storage location, Cost ii′t represents the unit distance transfer cost between the i-th and i'-th storage locations in the t-th time period, Y ii′jt represents whether the j-th package moves from the i-th storage location to the i'-th storage location in the t-th time period, Y ii′jt = 1 indicates that the j-th package moves from the i-th storage location to the i'-th storage location in the t-th time period, Y ii′jt = 0 indicates that the j-th package does not move from the i-th storage location to the i'-th storage location in the t-th time period, V represents the set of transport vehicles, R vt represents the fixed cost of the v-th transport vehicle in the t-th time period, No vt represents the number of transport vehicles v required in the t-th time period, K represents the set of orders, t k represents the picking time period of the k-th order, t k = {t|X jkt = 1}, X jkt = 1 indicates that the k-th order is assigned to the j-th package in the t-th time period, P k represents the shipping urgency value of the k-th order.
5. The goods outbound management method according to claim 4, wherein The specific constraint conditions include: Ensure that the picking of the j-th package starts from the i-th storage location at the t-th time period; Ensure that the i'-th storage location can be the destination of the j-th package at the t-th time period; Prevent the transportation vehicle from making unreasonable movements in the picking path; Ensure that within the time period t, the i-th storage location determined by the k-th order in the j-th package can only be picked once; Ensure that at the t-th time period, the k-th order can only be assigned to the j-th package; Ensure that the transportation vehicle v can pick up the j-th package of the k-th order at the t-th time period; Ensure that the number of transportation vehicles does not exceed the maximum number of available transportation vehicles at the t-th time period; Ensure that the transportation vehicle arrives at the i-th storage location only once; Ensure that the number of transportation vehicles v is of integer type.
6. The goods outbound management method according to claim 1, characterized in that The specific optimization algorithm is: The sparrow search algorithm improved based on fireflies.
7. The goods outbound management method according to claim 6, wherein Use the reciprocal of the objective function as the fitness function of the sparrow search algorithm improved based on fireflies.
8. The goods outbound management method according to claim 1, wherein After S7, it further includes: Through the monitoring system, track the execution status of each of the outbound orders to ensure the smooth progress of the outbound task.
9. The goods outbound management method according to claim 1, wherein After S7, it further includes: Summarize and record the outbound data for the management personnel to consult.
10. A goods outbound management system, characterized in that, Including: A processor; A memory, on which computer-readable instructions are stored. When the computer-readable instructions are executed by the processor, the goods outbound management method described in any one of claims 1 to 9 is implemented.