A system and method for planning the inbound and outbound paths of warehoused goods

Abstract

The present invention discloses a system and method for planning the inbound and outbound paths of warehouse goods, which relates to the technical field of intelligent warehousing. The method of the present invention includes establishing a three-dimensional space structure of the warehouse, generating a menu of goods to be stored and matching multiple storage schemes, assigning importance levels and priority rankings to the goods, calculating the remaining space and total weight of the warehouse, determining and optimizing the space and weight, and planning and optimizing the inbound and outbound paths. The present invention minimizes the total cost and maximizes the space utilization rate and access efficiency through mathematical programming methods. At the same time, it monitors the operation status in the warehouse in real time and dynamically adjusts the inbound and outbound paths to avoid congestion and conflicts. In addition, high-definition cameras and sensors are installed to ensure the safety management of the warehouse interior. The present invention realizes the intelligent planning of the inbound and outbound paths of warehouse goods, improves the warehouse management efficiency and space utilization rate, and ensures the safe storage and efficient inbound and outbound of goods.

Description

Technical Field

[0001] The present invention belongs to the technical field of intelligent warehousing, and particularly relates to a system and method for planning the inbound and outbound paths of warehoused goods. Background Art

[0002] In warehousing management, the planning of inbound and outbound paths of goods is a crucial link. With the rapid development of the logistics industry and the booming rise of e-commerce business, the storage demand and inbound and outbound frequency of warehouses have increased sharply, which puts forward higher requirements for the management efficiency and space utilization rate of warehouses. Traditional methods for planning inbound and outbound paths often rely on manual experience and fixed rules, and are difficult to adapt to complex and changeable warehousing environments and high-intensity operation requirements. Therefore, it is particularly important to develop an efficient and intelligent method for planning inbound and outbound paths.

[0003] Firstly, the complexity of the warehouse space structure poses challenges to the planning of inbound and outbound paths. The interior of a warehouse is usually divided into multiple functional areas, such as a shelf area, a passage area, a loading and unloading area, etc. Each functional area has its specific optimization requirements and limiting conditions. How to make reasonable use of this space to ensure the safe storage and efficient inbound and outbound of goods is a key issue that needs to be solved in the planning of inbound and outbound paths.

[0004] Secondly, the diversity and particularity of goods also put forward higher requirements for the planning of inbound and outbound paths. Different goods vary in terms of size, weight, shape, access frequency, special requirements, etc. These differences directly affect the selection of storage schemes and the planning of inbound and outbound paths. For example, fragile goods require special protection, and refrigerated goods require low-temperature storage. These special requirements must be fully considered in the planning of inbound and outbound paths.

[0005] In addition, with the development of big data and artificial intelligence technologies, warehousing management is gradually transforming towards an intelligent direction. By using historical data and real-time information, through machine learning algorithms and intelligent optimization technologies, it is possible to achieve accurate prediction and dynamic adjustment of inbound paths, thereby improving operation efficiency and resource utilization rate. This intelligent method for planning inbound and outbound paths can not only adapt to complex and changeable warehousing environments, but also continuously learn and optimize to meet the needs of future warehousing management.

[0006] The present invention proposes a method for planning the inbound and outbound paths of warehoused goods. This method realizes the intelligent planning and dynamic adjustment of inbound paths through steps such as establishing the three-dimensional space structure of the warehouse, generating a menu of goods to be stored and matching multiple storage schemes, assigning importance levels and priority rankings to goods, calculating the remaining space and total weight of the warehouse, determining whether to perform space optimization and weight optimization, and performing inbound and outbound path planning and optimization. This method not only improves the space utilization rate and operation efficiency of the warehouse, but also enhances the safety and intelligent level of warehousing management. Summary of the Invention

[0007] In order to overcome the disadvantages and deficiencies of the above-mentioned prior art, the first object of the present invention is to provide a system for planning the inbound and outbound paths of storage goods; the second object of the present invention is to provide a method for planning the inbound and outbound paths of storage goods.

[0008] The first object of the present invention adopts the following technical solutions:

[0009] A system for planning the inbound and outbound paths of storage goods, including

[0010] Warehouse three-dimensional space structure establishment module: According to the shape and size parameters of the warehouse, establish the three-dimensional space structure of the warehouse; divide the interior of the warehouse into multiple functional areas, including a shelf area, a passage area, and a loading and unloading area, and each functional area serves as an independent optimization unit;

[0011] To-be-stored menu generation and storage plan matching module: Collect the information of the goods to be warehoused, generate a to-be-stored menu, and assign a unique identifier to each kind of goods; match multiple storage plans for each kind of goods, evaluate the advantages and disadvantages of each plan, and select the optimal plan; the storage plans include shelf types, pallet types, stacking methods, and other storage equipment; the shelf types include heavy-duty shelves, medium-duty shelves, light-duty shelves, flow-through shelves, and automated stereoscopic warehouses; the pallet types include wooden pallets, plastic pallets, and metal pallets; the stacking methods include single-layer stacking, multi-layer stacking, staggered stacking, and gravity stacking; other storage equipment includes rotary shelves, hanging storage, and cold storages;

[0012] Assignment and sorting module: Assign an importance value to each good in the to-be-stored menu, and the larger the value, the more important the function of the good; sort the goods according to the importance value assignment to ensure that important goods are warehoused first and stored in easily accessible positions;

[0013] Space weight calculation module: Install each good in the three-dimensional space structure of the warehouse, calculate the remaining space value in the warehouse and the overall actual weight value of the warehouse; calculate the balance coefficient to evaluate the balance state of the warehouse space and weight;

[0014] Space weight optimization module: Judge whether space or weight optimization is required according to the balance coefficient. If optimization is required, adjust the distribution of the goods in the warehouse to ensure the overall balance and stability of the warehouse;

[0015] Inbound and outbound path planning optimization module: Collect the historical data of each inbound and outbound operation, analyze the common patterns and rules; according to the historical data and real-time situation, predict the future inbound and outbound requirements, and carry out path planning and resource allocation in advance; monitor the operation situation in the warehouse in real time, dynamically adjust the inbound and outbound paths, avoid congestion and conflicts, and improve the operation efficiency;

[0016] Real - time monitoring and management module: Install high - definition cameras and other sensors to monitor the operation status inside the warehouse in real time; ensure that each vehicle maintains a safe distance and pre - plan an emergency evacuation route; dynamically adjust the operation process to ensure a smooth and efficient inbound process.

[0017] The second object of the present invention adopts the following technical solutions:

[0018] A method for planning the inbound and outbound paths of warehoused goods, used to implement a system for planning the inbound and outbound paths of warehoused goods. The method process is as follows:

[0019] Step 1: Establish a three - dimensional space structure of the warehouse. According to the shape and size parameters of the warehouse, use 3D modeling software to construct the three - dimensional space structure of the warehouse and divide it into multiple functional areas, including a shelf area, a passage area, and a loading and unloading area. Each functional area serves as an independent optimization unit.

[0020] Step 2: Generate a menu of goods to be stored and match multiple storage plans, including collecting goods information, generating a menu of goods to be stored, matching multiple storage plans for each kind of goods, and evaluating the advantages and disadvantages of each storage plan.

[0021] Step 3: Assign a value to the importance of the goods. Assign a numerical value to the goods according to the functional importance of the goods, sort the goods according to the assigned importance value to ensure that important goods are preferentially stored in the warehouse and placed in easily accessible positions; record the detailed information of each kind of goods and the corresponding storage location, and store all goods information in a database for subsequent query and management.

[0022] Step 4: Determine whether to perform space optimization. By comparing the calculated balance coefficient with a preset threshold, decide whether to optimize the warehouse space and perform zoning optimization.

[0023] Step 5: Weight optimization. Calculate the difference between the overall actual weight and the standard weight of the warehouse and perform weight optimization until the standard is reached.

[0024] Step 6: Space optimization. Calculate the difference between the remaining space in the warehouse and the standard space and perform space optimization until the standard is reached.

[0025] Step 7: Inbound and outbound path planning and optimization. Collect historical data, use machine learning algorithms to analyze the data, predict future inbound and outbound demands, and dynamically adjust the inbound and outbound paths to avoid congestion and conflicts.

[0026] Step 8: Real - time monitoring and safety management. Install high - definition cameras and sensors to monitor the operation status inside the warehouse in real time and ensure the planning of safe distances and emergency evacuation routes.

[0027] Preferably, the evaluation in step 2 specifically includes:

[0028] Build an optimization model and use mathematical programming methods to minimize the total cost and maximize the space utilization rate and access efficiency. There are n storage schemes, and the evaluation indicators for each scheme include storage cost, access convenience, security, space utilization rate, and flexibility;

[0029] The objective function is as follows: Minimize Z = ω1C i + ω2A i + ω3S i - ω4U i - ω5F i ;

[0030] Where C i is the cost of the i-th storage scheme; A i is the access convenience of the i-th storage scheme, represented by time; S i is the security of the i-th storage scheme, represented by a risk score; U i is the space utilization rate of the i-th storage scheme, represented by a percentage; F i is the flexibility of the i-th storage scheme, represented by an adjustment ability score; ω1, ω2, ω3, ω4, ω5 are the weight coefficients of the evaluation indicators C i , A[[ID=३३]] i , S i , U i , F i respectively, reflecting the user's emphasis on different evaluation indicators;

[0031] The constraint conditions are as follows:

[0032] Space limit: The total available space V total of the warehouse cannot exceed the actual capacity V max of the warehouse: Where V i is the space occupied by the i-th storage scheme; x i is a binary variable (0 or 1) for selecting this scheme;

[0033] [[ID=5९]]Access frequency requirement: For goods with high access frequency, the access time A i [[ID=६१]]must be less than a certain threshold T threshold : A i ≤ T threshold ,

[0034] Security requirement: For fragile or dangerous goods, the safety risk S i must be lower than a certain threshold S threshold :

[0035]

[0036] Special storage requirements: For goods with special storage requirements, a storage plan that meets these requirements must be selected. If the goods need refrigeration, then i ∈ refrigerated storage plan.

[0037] Preferably, step four is specifically as follows: Balance coefficient PH xs Compared with the balance coefficient threshold PH min And PH max Conduct a comparative analysis; if PH min < PH xs < PH max Then the warehouse space is not optimized; if PH xs ≤ PH min Or PH xs ≥ PH max , then the warehouse is optimized;

[0038] Taking the main stress points of the warehouse as endpoints, divide the area formed by connecting these endpoints in sequence into y equal parts, and adjust the weight and remaining space of each partition in each equal - divided area to ensure the overall balance and stability of the warehouse.

[0039] Preferably, step five is specifically as follows: Calculate the actual total weight value Z of the warehouse lz The absolute value of the difference X from the standard weight value M of the warehouse bz , and compare it with the weight error value M mz ; if X wz ≤ M mz ≤ M wz , then the overall weight of the warehouse is not optimized; if X mz > M wz , then weight optimization is carried out; calculate the weight value M of each partition, according to the formula And Where, F mbz Is the weight standard value of each equal - divided area; F mwz Is the weight error value of each equal - divided area; Replace the partial assembled goods in the y equal - divided areas until F mbz - M < F mwz , the optimization is completed; Replace the corresponding goods in the order of increasing assignment of importance, replacing heavy - mass goods with light - mass goods.

[0040] Preferably, step six is specifically as follows: Calculate the remaining space value K of each partition, and compare the absolute value of the difference T between the remaining space value T in the warehouse jz And the standard space value T of the warehouse bz With the space error value T xz ; if T wz ≤ T xz ≤ Twz , the remaining space in the warehouse is not optimized; if T xz >T wz , space optimization is performed;

[0041] The space optimization process is as follows: Calculate the remaining space value M of each partition, according to the formula and where F tbz is the remaining space standard value of each equal - divided area; F twz is the remaining space error value of each equal - divided area; Reduce the volume of the assembled goods in y equal - divided areas until F tbz -K < F twz , and the optimization is completed; Reduce the corresponding assembled goods volume in the order of decreasing assembled goods volume and increasing assigned importance of the assembled goods.

[0042] Preferably, step seven further includes: aiming at minimizing the operation efficiency, while minimizing the operation time and resource consumption, the objective function is as follows: where n is the number of objectives; ω i is the weight of the i - th objective; f i (x i ) is the cost function of the i - th objective, including path length, operation time, resource consumption; x i is the decision variable of the i - th objective; The constraint conditions are the same as those in step two.

[0043] Preferably, step eight is specifically as follows: Install high - definition cameras and other sensors to monitor the operation conditions inside the warehouse in real time, ensure that each vehicle maintains a safe distance, and plan an emergency evacuation route in advance; When a certain transport vehicle has completed a% of the unloading, notify the next vehicle to prepare to enter the loading and unloading area.

[0044] In summary, due to the adoption of the above - mentioned technical solutions, the beneficial effects of the present invention are:

[0045] 1. The method of the present invention accurately constructs the warehouse space structure through 3D modeling software, generates multiple storage schemes based on the characteristics of goods, and uses mathematical programming methods for optimal selection. At the same time, prioritize according to the importance and access frequency of goods to ensure that important goods are stored in the warehouse first and in positions that are easy to access, improving the utilization rate of the storage space and reducing space waste. At the same time, by optimizing the goods access path, the access time is shortened and the overall operation efficiency is improved. This is of great significance for improving the operation efficiency of the warehouse and reducing costs.

[0046] 2. The method of the present invention introduces the concept of a balance coefficient. By calculating the balance state between the remaining space in the warehouse and the total weight, the warehouse is optimized. Based on the partition optimization, by adjusting the weight and remaining space of each partition, the overall balance and stability of the warehouse are ensured, which can avoid structural safety problems caused by uneven weight distribution in the warehouse, and at the same time improve the storage capacity and stability of the warehouse. In addition, through means such as cargo replacement and volume reduction for weight and space optimization, the storage efficiency and flexibility of the warehouse are further improved.

[0047] 3. The method of the present invention uses machine learning algorithms to analyze historical data, identify common patterns and rules of inbound and outbound operations, and predict future inbound and outbound requirements according to real-time situations. At the same time, by real-time monitoring and dynamically adjusting the inbound and outbound paths, congestion and conflicts are avoided, and the operation efficiency is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. 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 also be obtained based on these drawings.

[0049] Figure 1 Shows a module diagram of an inbound and outbound path planning system for storage goods according to the present invention;

[0050] Figure 2 Shows a flowchart of an inbound and outbound path planning method for storage goods according to the present invention;

[0051] Figure 3 Shows a flowchart of generating a menu to be stored and matching multiple storage solutions according to the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0052] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the drawings in the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, rather than all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present invention.

[0053] In addition, the described features, structures, or characteristics may be combined in any suitable manner in one or more example embodiments. In the following description, numerous specific details are provided to give a thorough understanding of the example embodiments of the present disclosure. However, those skilled in the art will realize that the technical solutions of the present disclosure may be practiced without one or more of the specific details, or other methods, components, steps, etc. may be adopted. In other cases, well-known structures, methods, implementations, or operations are not shown or described in detail to avoid obscuring various aspects of the present disclosure.

[0054] Embodiment 1:

[0055] Referring to Figure 1 As shown, an inbound and outbound path planning system for storage goods in this embodiment includes a warehouse three-dimensional space structure establishment module, a to-be-stored menu generation and storage scheme matching module, an assignment and sorting module, a space weight calculation module, a space weight optimization module, an inbound and outbound path planning optimization module, and a real-time monitoring and management module.

[0056] Warehouse three-dimensional space structure establishment module: According to the shape and size parameters of the warehouse, use three-dimensional modeling software to establish the three-dimensional space structure of the warehouse; divide the interior of the warehouse into multiple functional areas, including a shelf area, a passage area, and a loading and unloading area, and each functional area serves as an independent optimization unit. Among them, the loading and unloading area includes a loading area and a unloading area.

[0057] To-be-stored menu generation and storage scheme matching module: Collect the information of the goods to be warehoused, generate a to-be-stored menu, and assign a unique identifier to each kind of goods; match multiple storage schemes for each kind of goods, evaluate the advantages and disadvantages of each scheme, and select the optimal scheme.

[0058] Assignment and sorting module: Assign an importance value to each good in the to-be-stored menu, and the larger the value, the more important the function of the good; sort the goods according to the importance value assignment to ensure that important goods are warehoused first and stored in easily accessible positions.

[0059] Space weight calculation module: Install each good in the three-dimensional space structure of the warehouse, calculate the remaining space value in the warehouse and the overall actual weight value of the warehouse; calculate the balance coefficient to evaluate the balance state of the warehouse space and weight.

[0060] Space weight optimization module: Judge whether space or weight optimization is required according to the balance coefficient. If optimization is required, adjust the distribution of the goods in the warehouse to ensure the overall balance and stability of the warehouse.

[0061] Inbound and Outbound Route Planning Optimization Module: Collect historical data of each inbound and outbound operation, analyze common patterns and rules; Based on historical data and real-time situations, predict future inbound and outbound requirements, and perform route planning and resource allocation in advance; Real-time monitor the operation status in the warehouse, dynamically adjust the inbound and outbound routes, avoid congestion and conflicts, and improve operation efficiency.

[0062] Real-time Monitoring and Management Module: Install high-definition cameras and other sensors to real-time monitor the operation status inside the warehouse; Ensure that each vehicle maintains a safe distance and pre-plan an emergency evacuation route; Dynamically adjust the operation process to ensure a smooth and efficient inbound process.

[0063] The beneficial effects of this embodiment are as follows: The system can significantly improve the efficiency of inbound and outbound operations, optimize the space and weight distribution, and ensure the overall balance and safety of the warehouse. The real-time monitoring and safety management mechanism effectively prevent accidents and ensure the safety of personnel and equipment. Intelligent route planning and resource allocation reduce congestion and conflicts, improve the smoothness of operations and response speed, and ultimately achieve efficient, safe, and intelligent warehousing management.

[0064] Embodiment 2:

[0065] Refer to Figure 2 As shown, a method for planning the inbound and outbound routes of warehoused goods in this embodiment is as follows:

[0066] Step 1: Establish the three-dimensional space structure of the warehouse.

[0067] According to the shape and size parameters of the warehouse, use 3D modeling software to establish the three-dimensional space structure of the warehouse and determine the space optimization areas inside the warehouse. Divide the inside of the warehouse into multiple functional areas including the shelf area, passage area, and loading and unloading area, and each functional area serves as an independent optimization unit.

[0068] Step 2: Generate a menu of goods to be stored and match multiple storage plans.

[0069] Refer to Figure 3 As shown, the specific process of generating a menu of goods to be stored and matching multiple storage plans is as follows:

[0070] S21: Collect information on the goods to be inbound, including the size, weight, shape, quantity, type (such as fragile goods, refrigerated goods, chemical goods, etc.), access frequency, special requirements (such as temperature control, moisture-proof, shock-proof, etc.), and the estimated arrival time.

[0071] S22: Generate a menu of goods to be stored, list all the goods that need to be inbound, and assign a unique identifier to each good.

[0072] S23. For each type of goods in the menu to be stored, match n different storage schemes, where n is an integer greater than 1. Generate candidate storage schemes, including shelf types, pallet types, stacking methods, and other storage equipment.

[0073] Shelf types include:

[0074] Heavy-duty shelves: Suitable for large and heavy goods, usually used to store palletized goods.

[0075] Medium-duty shelves: Suitable for medium-weight goods, suitable for storing small and medium-sized items.

[0076] Light-duty shelves: Suitable for light goods, suitable for storing small items.

[0077] Flow-through shelves: Suitable for goods with frequent inbound and outbound operations. Goods can flow in from one end and out from the other end, facilitating first-in, first-out (FIFO) management.

[0078] Automated stereoscopic warehouse: Suitable for large-scale and high-density storage. Usually equipped with an automated storage and retrieval system (AS / RS), suitable for storing large quantities of standardized goods.

[0079] Pallet types include:

[0080] Wooden pallets: Suitable for heavy goods, with low cost, but not water-resistant and easily damaged.

[0081] Plastic pallets: Suitable for light to medium-weight goods, durable, waterproof, and easy to clean, suitable for industries such as food and medicine.

[0082] Metal pallets: Suitable for ultra-heavy goods, strong and durable, but with high cost.

[0083] Stacking methods include:

[0084] Single-layer stacking: Suitable for fragile or irregularly shaped goods to avoid damage caused by stacking.

[0085] Multi-layer stacking: Suitable for goods with standard shapes, which can improve space utilization through multi-layer stacking.

[0086] Staggered stacking: Suitable for long-shaped goods, increasing stability through staggered arrangement.

[0087] Gravity stacking: Suitable for flow-through shelves. Goods slide in from one end and out from the other end, suitable for goods with fast turnover.

[0088] Other storage equipment includes:

[0089] Rotary shelves: Suitable for efficient access to small items, saving space.

[0090] Suspended storage: Suitable for long or irregularly shaped goods (such as pipes, fabrics, etc.), stored by suspension to save floor space.

[0091] Refrigerated warehouse: Suitable for goods that need to be stored at low temperatures (such as food, medicine, etc.).

[0092] S24. Storage scheme evaluation: Evaluate the advantages and disadvantages of each storage scheme, considering factors such as storage cost, access convenience, security, etc.

[0093] S25. Build an optimization model and use mathematical programming methods (such as linear programming, integer programming, mixed integer programming, etc.) to minimize the total cost and maximize space utilization and access efficiency. There are n storage schemes, and the evaluation indicators for each scheme include storage cost, access convenience, security, space utilization, and flexibility.

[0094] The objective function is as follows:

[0095] Minimize Z =ω1C i +ω2A i +ω3S i -ω4U i -ω5F i ;

[0096] Where C i is the cost of the i-th storage scheme; A i is the access convenience of the i-th storage scheme, expressed in time; S i is the security of the i-th storage scheme, expressed in risk score; U i is the space utilization of the i-th storage scheme, expressed as a percentage; F i is the flexibility of the i-th storage scheme, expressed in adjustment ability score; ω1, ω2, ω3, ω4, ω5 are the weight coefficients of the evaluation indicators C i , A i , S i , U i , F i respectively, reflecting the user's attention to different evaluation indicators.

[0097] The constraint conditions are as follows:

[0098] Space limitation:

[0099] The total available space V total of the warehouse cannot exceed the actual capacity V max of the warehouse:

[0100]

[0101] Where Vi is the space occupied by the i-th storage solution; x i is a binary variable (0 or 1) that selects the option.

[0102] Access frequency requirements:

[0103] For goods that are stored and retrieved frequently, the access time A i Must be less than a certain threshold T threshold :

[0104] A i ≤T threshold ,

[0105] Security requirements:

[0106] For fragile or dangerous goods, the safety risk S i Must be below a certain threshold S threshold :

[0107] S i ≤S threshold ,

[0108] Special storage requirements:

[0109] For goods with special storage requirements (such as refrigeration, moisture-proof, etc.), a storage solution that meets these requirements must be selected:

[0110] If the goods need to be refrigerated, then i∈ refrigerated storage solution.

[0111] Step 3: Assign importance to the goods.

[0112] Importance assignment: Assign importance to each item in the storage menu. The larger the value, the more important the function of the item (such as high-value items, urgently needed supplies, etc.).

[0113] Prioritization: Prioritize goods according to their importance to ensure that important goods are warehoused first and stored in easily accessible locations.

[0114] Record detailed information about each shipment, including volume, weight, storage plan, and corresponding storage location. Store all shipment information in a database for easy query and management.

[0115] Step 6. Calculate the remaining space and total weight in the warehouse.

[0116] Remaining space calculation: Install each item in the three-dimensional space structure of the warehouse and calculate the remaining space value T in the warehouse jz And the actual weight value Z of the warehouse as a whole tz ;

[0117] Calculation of balance coefficient: Through formulaic analysis, the balance coefficient PH is calculated xs , which is used to evaluate the balance state of warehouse space and weight.

[0118] Step Four: Determine whether to optimize the space.

[0119] The balance coefficient PH xs is compared and analyzed with the balance coefficient threshold PH min and PH max for comparative analysis.

[0120] If PH min < PH xs < PH max then the warehouse space is not optimized;

[0121] If PH xs ≤ PH min or PH xs ≥ PH max , then the warehouse is optimized.

[0122] Partition optimization: Taking the main stress points of the warehouse as endpoints (such as the four corners or main support columns of the warehouse), the area formed by connecting these endpoints in sequence is equally divided into y equal parts (for example, y = 4).

[0123] Adjust the weight and remaining space of each partition within each equally divided area to ensure the overall balance and stability of the warehouse.

[0124] Step Five: Weight optimization.

[0125] The specific method of weight optimization is as follows:

[0126] Weight difference comparison: Calculate the absolute value of the difference X lz between the actual overall weight value Z bz of the warehouse and the standard weight value M mz of the warehouse, and compare it with the weight error value M wz for comparison.

[0127] If X mz ≤ M wz , then the overall weight of the warehouse is not optimized;

[0128] If X mz > M wz , then weight optimization is carried out.

[0129] Weight optimization process: Calculate the weight value M of each partition, according to the formula and where, F mbz is the weight standard value of each equally divided area; F mwzIt is the weight error value for each equal division area.

[0130] Replace the partial assembled goods in the 4 equal division areas until F mbz -M < F mwz , and the optimization is completed.

[0131] Goods replacement order: Replace the corresponding assembled goods in the order of increasing assigned importance, replacing the goods with heavy mass with the goods with light mass.

[0132] Step Six: Space optimization.

[0133] Space difference comparison: Calculate the remaining space value K for each partition, and compare the absolute value T of the difference between the remaining space value T in the warehouse jz and the standard space value T of the warehouse bz with the space error value T xz and the space error value T wz for comparison.

[0134] If T xz ≤ T wz , then do not optimize the remaining space in the warehouse.

[0135] If T xz > T wz , then perform space optimization.

[0136] The space optimization process is as follows:

[0137] Calculate the remaining space value M for each partition, according to the formulas and where, F tbz is the remaining space standard value for each equal division area; F twz is the remaining space error value for each equal division area.

[0138] Reduce the volume of the partial assembled goods in the 4 equal division areas until F tbz -K < F twz , and the optimization is completed.

[0139] Volume replacement order: Reduce the volume of the corresponding assembled goods in the order of decreasing volume of the assembled goods and increasing assigned importance of the assembled goods.

[0140] Step Seven: Inbound and outbound path planning and optimization.

[0141] S71: Collect the historical data of each inbound and outbound operation, including goods information, storage information, storage location, inbound and outbound path, operation time, and abnormal situations.

[0142] Goods information: including the type, size, weight, quantity, type (such as fragile goods, refrigerated goods, etc.), access frequency, special requirements (such as temperature control, moisture-proof, shock-proof, etc.) and estimated arrival time.

[0143] Storage location: including the specific storage location of the goods (such as shelf number, layer number, column number, etc.), and the attributes of the storage area (such as whether it is a refrigerated area, shock-proof area, etc.).

[0144] Inbound and outbound path: including the actual path of each inbound and outbound operation, recording the driving route of the vehicle or handling equipment, the passages passed through, the stopping points, etc.

[0145] Operation time: including the start time, end time and total duration of each inbound and outbound operation.

[0146] Abnormal situations: record the abnormal situations encountered during the operation, such as equipment failures, passage blockages, human errors, etc.

[0147] S72. Use machine learning algorithms (such as decision trees, neural networks, etc.) to analyze historical data and identify common patterns and regularities.

[0148] S73. According to historical data and real-time situations, predict future inbound and outbound requirements, and perform path planning and resource allocation in advance.

[0149] The goal is to minimize the operation efficiency, while minimizing the operation time and resource consumption. The objective function is as follows:

[0150]

[0151] Among them, n is the number of objectives; ω i is the weight of the i-th objective; f i (x i ) is the cost function of the i-th objective (such as path length, operation time, resource consumption, etc.); x i is the decision variable of the i-th objective.

[0152] The constraint conditions are the same as those in Step 2 and will not be elaborated here.

[0153] S74. Dynamically adjust the inbound and outbound path to avoid congestion and conflicts and improve operation efficiency.

[0154] Real-time monitoring: Real-time monitor the operation situation in the warehouse through sensors and cameras to obtain information such as the current inventory status, passage occupancy, equipment operation status, etc.

[0155] Path Re - planning: If abnormal situations (such as channel blockage, equipment failure, etc.) are detected, the system will immediately re - plan the path to ensure that the operation is not affected. For example, use the shortest path algorithm (such as Dijkstra algorithm or A* algorithm) to recalculate the optimal path:

[0156] New Path=arg min(Path Length(p)+Obstacle Cost(p));

[0157] p∈All Paths;

[0158] Where Path Length(p) is the length of the path; Obstacle Cost(p) is the cost of obstacles on the path.

[0159] Use online learning algorithms (such as incremental learning, stream learning, etc.) to update the model parameters to adapt to the changing environment. Use the reward mechanism in reinforcement learning to encourage the system to choose more efficient paths:

[0160] Reward=α·Efficiency Gain+β·Safety Improvement;

[0161] Where α and β are weight coefficients, representing the degree of emphasis on efficiency and safety respectively.

[0162] Step Eight: Real - time Monitoring and Safety Management.

[0163] High - definition Cameras and Sensors:

[0164] Install high - definition cameras and other sensors to monitor the operation inside the warehouse in real - time, ensure that each vehicle maintains a safe distance (such as 200 meters), and pre - plan an emergency evacuation route to inform each staff member how to evacuate quickly in case of an emergency.

[0165] Dynamic Adjustment: When a transport vehicle has completed 80% of the unloading, notify the next vehicle to prepare to enter the loading and unloading area to ensure a smooth and efficient warehousing process.

[0166] The beneficial effects of this embodiment are as follows: Through intelligent 3D modeling, multi - scheme matching and evaluation, mathematical optimization, and machine learning technologies, the efficiency of inbound and outbound operations is improved, the space and weight distribution are optimized, and the overall balance and safety of the warehouse are ensured. The system can dynamically adjust the path, avoid congestion and conflicts, monitor the operation situation in real - time, respond quickly to anomalies, and ensure the safety of personnel and equipment. It realizes efficient, intelligent, and safe warehouse management and reduces the operation cost.

[0167] As described above, it is only the preferred specific embodiment of the present invention, 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, according to the technical solution and inventive concept of the present invention, making equivalent substitutions or changes, should be covered within the protection scope of the present invention.

[0168] The preferred embodiments of the present invention disclosed above are only used to help illustrate the present invention. The preferred embodiments do not describe all the details in detail, nor do they limit the present invention to only the specific embodiments. Obviously, many modifications and variations can be made according to the content of this specification. This specification selects and specifically describes these embodiments in order to better explain the principle and practical application of the present invention, so that those skilled in the art can well understand and utilize the present invention. The present invention is only limited by the claims and their full scope and equivalents.

Claims

1. A system for planning the inbound and outbound paths of storage goods, characterized in that, The system includes Warehouse three-dimensional space structure establishment module: Establish the three-dimensional space structure of the warehouse according to the shape and size parameters of the warehouse; Divide the interior of the warehouse into multiple functional areas, including the shelf area, the passage area, and the loading and unloading area, and each functional area serves as an independent optimization unit; To-be-stored menu generation and storage plan matching module: Collect the information of the goods to be stored in the warehouse, generate the to-be-stored menu, and assign a unique identifier to each kind of goods; Match multiple storage plans for each kind of goods, evaluate the advantages and disadvantages of each plan, and select the optimal plan; Assignment and sorting module: Assign an importance value to each good in the to-be-stored menu, and the larger the value, the more important the function of the good; Sort the goods according to the importance value assignment to ensure that important goods are stored in the warehouse first and in easily accessible positions; Space weight calculation module: Install each good in the three-dimensional space structure of the warehouse, and calculate the remaining space value in the warehouse and the overall actual weight value of the warehouse; Calculate the balance coefficient and evaluate the balance state of the warehouse space and weight; Space weight optimization module: Judge whether space or weight optimization is required according to the balance coefficient. If optimization is required, adjust the distribution of the goods in the warehouse to ensure the overall balance and stability of the warehouse; Inbound and outbound path planning and optimization module: Collect the historical data of each inbound and outbound operation, and analyze the common patterns and rules; According to the historical data and real-time situation, predict the future inbound and outbound requirements, and conduct path planning and resource allocation in advance; Monitor the operation situation in the warehouse in real time, dynamically adjust the inbound and outbound paths, avoid congestion and conflicts, and improve the operation efficiency; Real-time monitoring and management module: Install high-definition cameras and other sensors to monitor the operation situation inside the warehouse in real time; Ensure that each vehicle maintains a safe distance and pre-plan the emergency evacuation route; Dynamically adjust the operation process to ensure a smooth and efficient inbound process; The storage plan includes shelf type, pallet type, stacking method and other storage equipment; The shelf types include heavy-duty shelves, medium-duty shelves, light-duty shelves, flow-through shelves and automated stereoscopic warehouses; The pallet types include wooden pallets, plastic pallets and metal pallets; The stacking methods include single-layer stacking, multi-layer stacking, staggered stacking and gravity stacking; Other storage equipment includes rotary shelves, hanging storage and cold storage.

2. A method for planning the inbound and outbound paths of warehouse goods, which is used to implement an inbound and outbound path planning system for warehouse goods as described in claim 1, characterized in that, The method process is as follows: Step 1: Establish the three-dimensional space structure of the warehouse. According to the shape and size parameters of the warehouse, use 3D modeling software to construct the three-dimensional space structure of the warehouse, and divide it into multiple functional areas, including the shelf area, the passage area, and the loading and unloading area. Each functional area serves as an independent optimization unit; Step 2: Generate the to-be-stored menu and match multiple storage plans, including collecting goods information, generating the to-be-stored menu, matching multiple storage plans for each kind of goods, and evaluating the advantages and disadvantages of each storage plan; Step 3: Assign importance values to the goods. Allocate numerical values to the goods according to their functional importance, and sort the goods by priority based on the assigned importance values to ensure that important goods are stored in the warehouse first and in easily accessible locations. Record the detailed information of each type of goods and the corresponding storage locations, and store all goods information in the database for subsequent query and management. Step 4: Determine whether to optimize the space. Compare the calculated balance coefficient with the preset threshold to decide whether to optimize the warehouse space and perform zoning optimization. Step 5: Weight optimization. Calculate the difference between the overall actual weight and the standard weight of the warehouse and perform weight optimization until the standard is reached. Step 6: Space optimization. Calculate the difference between the remaining space in the warehouse and the standard space and perform space optimization until the standard is reached. Step 7: Inbound and outbound route planning and optimization. Collect historical data, analyze the data using machine learning algorithms, predict future inbound and outbound requirements, and dynamically adjust the inbound and outbound routes to avoid congestion and conflicts. Step 8: Real-time monitoring and safety management. Install high-definition cameras and sensors to monitor the internal operations of the warehouse in real time, and ensure the planning of safe distances and emergency evacuation routes.

3. The method for planning the inbound and outbound paths of storage goods according to claim 2, wherein, The specific evaluation in Step 2 includes: Build an optimization model and use mathematical programming methods to minimize the total cost and maximize space utilization and access efficiency. There are storage schemes, and the evaluation indicators for each scheme include storage cost, access convenience, security, space utilization, and flexibility; The objective function is as follows: ; Among them, is the cost of the th storage scheme; is the access convenience of the th storage scheme, represented by time; is the security of the th storage scheme, represented by a risk score; is the space utilization rate of the th storage scheme, represented by a percentage; is the flexibility of the th storage scheme, represented by an adjustment ability score; , , , , are the weight coefficients of the evaluation indicators , , , , respectively, reflecting the importance degree of users for different evaluation indicators; The constraints are as follows: Space limit: the total available space of the warehouse shall not exceed the actual capacity of the warehouse : ; where is the space occupied by the th storage plan; is a binary variable for selecting this plan, 0 or 1; Access frequency requirement: For goods with high-frequency access, the access time must be less than a certain threshold : , ; Safety requirements: For fragile or dangerous goods, the safety risk must be lower than a certain threshold : ， ； Special storage requirements: For goods with special storage requirements, a storage solution that meets these requirements must be selected: If the goods need to be refrigerated, then a refrigerated storage solution.

4. A method for planning the inbound and outbound paths of storage goods according to claim 2, characterized in that, Step 4 is specifically as follows: the balance coefficient is compared and analyzed with the balance coefficient threshold and ; if then the warehouse space is not optimized; if or , then the warehouse is optimized; Taking the main stress points of the warehouse as endpoints, equally divide the area formed by connecting these endpoints in sequence. Make equal divisions, and adjust the weight and remaining space of each partition within each equally divided area to ensure the overall balance and stability of the warehouse.

5. The method for planning the inbound and outbound paths of storage goods according to claim 2, wherein, The specific steps of step five are as follows: Calculate the overall actual weight value of the warehouse and the standard weight value of the warehouse to obtain the absolute value of the difference , and compare it with the weight error value ; if , then do not optimize the overall weight of the warehouse; if , then perform weight optimization; calculate the weight value of each partition , according to the formulas and , where is the weight standard value of each equally divided area; is the weight error value of each equally divided area; Replace the partial assembled goods in y equally divided areas until , and the optimization is completed; Replace the corresponding goods in the order of increasing importance assignment, replacing the heavy-quality goods with light-quality goods.

6. The method for planning the inbound and outbound paths of storage goods according to claim 2, wherein The specific steps of Step 6 are as follows: Calculate the remaining space value of each partition , and calculate the absolute value of the difference between the remaining space value in the warehouse and the standard space value of the warehouse , and compare it with the space error value ; if , do not optimize the remaining space in the warehouse; if , perform space optimization; The space optimization process is as follows: calculate the remaining space value of each partition , according to the formula and , where is the remaining space standard value of each equal division area; is the remaining space error value of each equal division area; reduce the partial assembled cargo volume of y equal division areas until , the optimization is completed; reduce the corresponding assembled cargo volume in the order of decreasing assembled cargo volume and increasing assigned importance of the assembled cargo.

7. A method for planning the inbound and outbound paths of storage goods according to claim 2, characterized in that, Step 7 further includes: aiming to minimize the operation efficiency while minimizing the operation time and resource consumption, and the objective function is as follows: ; where is the number of objectives; is the weight of the th objective; is the cost function of the th objective, including path length, operation time, and resource consumption; is the decision variable of the th objective; The constraint conditions are the same as those in Step 2.

8. The method for planning the inbound and outbound paths of storage goods according to claim 2, wherein, The specific content of Step 8 is as follows: Install high-definition cameras and other sensors to monitor the internal operations of the warehouse in real time, ensure that each vehicle maintains a safe distance, and pre-plan an emergency evacuation route; when a vehicle has completed a% of unloading, notify the next vehicle to prepare to enter the loading and unloading area.

Images