Material rack allocation method and apparatus, device, storage medium, and program product

By optimizing the allocation of materials and roll types in the buffer rack set on the production line, and utilizing genetic algorithms and particle swarm optimization algorithms, the problem of material type allocation in the rack relying on human experience was solved, thereby improving the efficiency and flexibility of the production line.

WO2026081374A1PCT designated stage Publication Date: 2026-04-23CONTEMPORARY AMPEREX TECHNOLOGY CO LTD
View PDF 10 Cites 0 Cited by

Patent Information

Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
CONTEMPORARY AMPEREX TECHNOLOGY CO LTD
Filing Date
2025-01-13
Publication Date
2026-04-23

AI Technical Summary

Technical Problem

In existing technologies, the allocation of material types in the rack mainly relies on manual experience, which cannot achieve dynamic allocation, resulting in insufficient efficiency and flexibility in the production process.

Method used

By determining the set of buffer racks shared by the first and second processes on the production line, and based on the material efficiency and the number of buffer racks for each type of material, the allocation of the racks is optimized using genetic algorithms and particle swarm optimization algorithms to maximize the duration during which the first process is not blocked and the second process is not short of material.

Benefits of technology

It enables dynamic allocation of material types and roll types on the rack, improving the efficiency and flexibility of the production line and reducing the impact of rack utilization and material transportation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2025071995_23042026_PF_FP_ABST
    Figure CN2025071995_23042026_PF_FP_ABST
Patent Text Reader

Abstract

Disclosed in embodiments of the present disclosure are a material rack allocation method and apparatus, a device, a storage medium, and a program product. The method comprises: determining a set of temporary storage racks shared by a first process and a second process on a production line, wherein the first process is used for producing multiple types of first materials, the first materials are obtained by winding consumables onto reels, the second process is used for producing second materials and returning the reels to the first process, and the multiple temporary storage racks in the set of temporary storage racks are used for temporarily storing the first materials and / or the reels to be returned; determining a first efficiency at which each type of first material is produced in the first process and a second efficiency at which each type of first material is consumed in the second process; and on the basis of each first efficiency, each second efficiency, and the quantity of the temporary storage racks, with an objective of maximizing a duration of a target state, allocating to the temporary storage racks corresponding target material types and target reel types to be temporarily stored.
Need to check novelty before this filing date? Find Prior Art

Description

Material rack distribution methods, devices, equipment, storage media and process products

[0001] Cross-reference to related applications

[0002] This disclosure is based on and claims priority to Chinese Patent Application No. 202411454484.7, filed on October 17, 2024, entitled “Rack Dispensing Method, Apparatus, Equipment, Storage Medium and Program Product”, the entire contents of which are incorporated herein by reference. Technical Field

[0003] This disclosure relates to, but is not limited to, the field of intelligent manufacturing technology, and in particular to a material rack distribution method, apparatus, equipment, storage medium, and program product. Background Technology

[0004] In modern manufacturing, the efficiency of material flow and storage between processes is crucial to the smoothness of the production process. Different processes can use shared racks for buffering and transferring materials and other items. However, allocating the types of items that can be stored on these racks during production presents a technical challenge. Current technologies rely on manual configuration of the types of items that can be stored on each rack based on experience, making dynamic allocation of rack space impossible. Summary of the Invention

[0005] In view of the above, the present disclosure provides at least one rack distribution method, apparatus, device, storage medium, and program product.

[0006] The technical solution of this disclosure embodiment is implemented as follows:

[0007] This disclosure provides a material rack distribution method, the method comprising:

[0008] Determine the buffer rack set shared by the first and second processes on the production line; the first process is used to produce multiple types of first materials, each type of first material is obtained by winding consumables on the corresponding type of roll; the second process is used to consume the consumables in the first material to produce the second material, and after the consumables in the first material are consumed, the roll is returned to the first process; the buffer rack set includes multiple buffer racks, which are used to buffer the first material to be consumed and / or the roll to be returned to the first process;

[0009] Determine the first efficiency of the first process in producing each type of first material and the second efficiency of the second process in consuming each type of first material;

[0010] Based on each first efficiency, each second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding target material type and target roll type that can be buffered; the target state includes no material blockage in the first process and no material shortage in the second process.

[0011] In this embodiment, a first process produces multiple types of first materials by winding consumables onto corresponding types of rolls to obtain each type of first material. A second process consumes the consumables from the first materials to produce second materials, and after the consumables in the first materials are consumed, the rolls are returned to the first process. A buffer rack set shared by the first and second processes on the production line is determined. Multiple buffer racks in the buffer rack set can buffer the first materials to be consumed and / or the rolls to be returned to the first process. A first efficiency and a second efficiency for consuming each type of first material are determined. Based on each first efficiency, each second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, corresponding target material types and target roll types are assigned to each buffer rack. The target state includes no material blockage in the first process and no material shortage in the second process. In this way, based on the first efficiency of the first process in producing the first material, the second efficiency of the second process in consuming the first material, and the number of buffer racks, with the goal of maximizing the duration of no material blockage in the first process and no material shortage in the second process, the dynamic allocation of material types and roll types to the buffer racks can be achieved.

[0012] In some embodiments, the first process includes a plurality of first hosts, each first host being used to produce a first material of a corresponding type; the second process includes a plurality of second hosts, each second host being used to consume consumables in the first material of a corresponding type to produce a second material of a corresponding type; based on each first efficiency, each second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding cacheable target material type and target roll type, including: based on the first efficiency of each first host in producing the first material of a corresponding type, the second efficiency of each second host in consuming the first material of a corresponding type, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding cacheable target material type and target roll type.

[0013] In the above embodiments, by maximizing the duration of the target state based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, and the number of buffer racks, the corresponding target material type and target roll type are assigned to each buffer rack. This fully considers the impact of the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, and the number of buffer racks on the material transportation process, thereby achieving a more reasonable dynamic allocation of the material type and roll type of the buffer rack.

[0014] In some embodiments, each first host is bound to multiple first racks, which are used to place first materials of the corresponding type produced by the first host and / or rolls of the corresponding type required by the first host; each second host is bound to multiple second racks, which are used to place first materials of the corresponding type required by the second host and rolls returned by the second host; based on the first efficiency of each first host in producing first materials of the corresponding type, the second efficiency of each second host in consuming first materials of the corresponding type, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding cacheable target material type and target roll type, including: based on the first efficiency of each first host in producing first materials of the corresponding type, the second efficiency of each second host in consuming first materials of the corresponding type, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding cacheable target material type and target roll type.

[0015] In the above embodiments, each first host is bound to multiple first racks for placing the first material of the corresponding type produced by the first host and / or the roll of the corresponding type required by the first host; each second host is bound to multiple second racks for placing the first material of the corresponding type required by the second host and the roll of the second host returning; by allocating corresponding target material types and target roll types to each buffer rack based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, with the goal of maximizing the duration of the first process without material blockage and the second process without material shortage, the impact of the number of first racks bound to each first host and the number of second racks bound to each second host on the material transportation process can be fully considered, thereby achieving a more reasonable dynamic allocation of material types and roll types to the buffer racks.

[0016] In some embodiments, the method further includes: when the target host is down, adding multiple target racks bound to the target host as new cache racks to the cache rack set to obtain an updated cache rack set; the target host includes the first target host in the first process and / or the second target host in the second process; based on each first efficiency, each second efficiency and the number of cache racks in the updated cache rack set, with the goal of maximizing the duration of the target state, assigning corresponding cacheable target material type and target roll type to each updated cache rack.

[0017] In the above embodiments, when the target host is shut down, multiple target racks bound to the target host are added as new cache racks to the cache rack set to obtain an updated cache rack set. The number of cache racks in each first efficiency, each second efficiency, and the updated cache rack set are then used to maximize the duration of the target state. The target material type and target roll type are then reassigned to each updated cache rack, which can improve the utilization rate and flexibility of the racks.

[0018] In some embodiments, the production line further includes multiple transport trolleys for transporting the first material and / or rolls between the first host, the buffer rack, and the second host. Based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding bufferable target material type and target roll type. This includes: based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the transport speed of the transport trolleys, the number of transport trolleys, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding bufferable target material type and target roll type.

[0019] In the above embodiments, the production line also includes multiple transport trolleys, which are used to transport the first material and / or rolls between the first host, the buffer rack, and the second host. By assigning corresponding bufferable target material types and target roll types to each buffer rack based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the transport speed of the transport trolleys, the number of transport trolleys, and the number of buffer racks, the impact of the transport speed and the number of transport trolleys on the material transport process can be fully considered, thereby achieving a more reasonable dynamic allocation of material types and roll types to the buffer racks.

[0020] In some embodiments, the transport trolley is used to transport the first material produced by the first host to the second host that needs the first material, or to a buffer rack of a material type that can buffer the first material, and to transport the first material in the buffer rack to the second host that needs the first material; the transport trolley is also used to transport the reel returned by the second host to the first host that needs the reel, or to a buffer rack of a reel type that can buffer the reel, and to transport the reel on the buffer rack to the first host that needs the reel.

[0021] In the above embodiments, the first material produced by the first host is transported to the second host that needs the first material, or to a buffer rack of material type that can buffer the first material, by means of a transport trolley, and the first material in the buffer rack is transported to the second host that needs the first material; the roll returned by the second host can also be transported to the first host that needs the roll, or to a buffer rack of roll type that can buffer the roll, by means of a transport trolley, and the roll on the buffer rack is transported to the first host that needs the roll, thereby realizing the flow of the first material and the roll between the first process and the second process.

[0022] In some embodiments, based on each first efficiency, each second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding bufferable target material type and target roll type. This includes: obtaining an initial rack allocation scheme set, which includes multiple rack allocation schemes, each including the bufferable material type and roll type corresponding to each buffer rack; updating the rack allocation scheme set at least once based on the evaluation metrics of each rack allocation scheme in the rack allocation scheme set, and determining a target rack allocation scheme from the updated rack allocation scheme set; wherein, during the update process, the evaluation metrics of each rack allocation scheme are estimated based on the rack allocation scheme, each first efficiency, each second efficiency, and the number of buffer racks, to predict the duration of the target state; and determining the bufferable target material type and target roll type corresponding to each buffer rack based on the target rack allocation scheme.

[0023] In the above embodiments, the rack allocation scheme set is updated at least once by using the evaluation index of each rack allocation scheme in the rack allocation scheme set, and a better target rack allocation scheme is determined from the updated rack allocation scheme set. Based on the target rack allocation scheme, the corresponding cacheable target material type and target roll type can be assigned to each cache rack.

[0024] In some embodiments, the rack allocation scheme set includes a first rack allocation scheme set and a second rack allocation scheme set, each including multiple rack allocation schemes. Based on the evaluation metrics of each rack allocation scheme in the rack allocation scheme set, the rack allocation scheme set is updated for at least one round. Based on the evaluation metrics of each rack allocation scheme in the updated rack allocation scheme set, a target rack allocation scheme is determined from the updated rack allocation scheme set. This includes: updating the first and second rack allocation scheme sets for at least one round using a genetic algorithm and a particle swarm optimization algorithm, with the evaluation metrics of each rack allocation scheme used as the fitness of the corresponding rack allocation scheme, until the update termination condition is met; and determining the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set as the target rack allocation scheme.

[0025] In the above embodiments, by using genetic algorithms and particle swarm optimization algorithms, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme. The first rack allocation scheme set and the second rack allocation scheme set are updated for at least one round until the update termination condition is met. The rack allocation scheme with the highest fitness in the updated second rack allocation scheme set is determined as the target rack allocation scheme. This can give full play to the diversity of solutions of genetic algorithms and the global search capability of particle swarm optimization algorithms, and obtain a better target rack allocation scheme.

[0026] In some embodiments, based on genetic algorithms and particle swarm optimization, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme. The first rack allocation scheme set and the second rack allocation scheme set are updated for at least one round, including: using a genetic algorithm, with each rack allocation scheme in the first rack allocation scheme set as an individual, updating the first rack allocation scheme set for at least one generation to obtain an updated first rack allocation scheme set; using a particle swarm optimization algorithm, with each rack allocation scheme in the second rack allocation scheme set as a particle, updating the second rack allocation scheme set for at least one generation to obtain an updated second rack allocation scheme set; and using the rack allocation scheme with the highest fitness in the updated first rack allocation scheme set, updating the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set again to obtain a second updated second rack allocation scheme set.

[0027] In the above embodiments, a genetic algorithm is used to update the first rack allocation scheme set for at least one generation of individuals, resulting in an updated first rack allocation scheme set. A particle swarm optimization algorithm is used to update the second rack allocation scheme set for at least one generation of particles, resulting in an updated second rack allocation scheme set. The rack allocation scheme with the highest fitness in the updated first rack allocation scheme set is then used to update the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set, resulting in a further updated second rack allocation scheme set. This approach utilizes the individual optimal solutions of the genetic algorithm to update the global optimal solution of the particle swarm optimization algorithm, improving the solution efficiency and accuracy of the particle swarm optimization algorithm, thereby accelerating the acquisition of a better rack allocation scheme.

[0028] In some embodiments, the evaluation index of the rack allocation scheme is determined as follows: according to the rack allocation scheme, based on each first efficiency, each second efficiency, and the number of buffer racks, the duration of the first process without material blockage is estimated to obtain a first estimated duration; according to the rack allocation scheme, based on each first efficiency, each second efficiency, and the number of buffer racks, the duration of the second process without material shortage is estimated to obtain a second estimated duration; based on the first estimated duration and the second estimated duration, the evaluation index of the rack allocation scheme is determined.

[0029] In the above embodiments, according to the rack allocation scheme, the duration of the first process without material blockage and the duration of the second process without material shortage are estimated based on each first efficiency, each second efficiency, and the number of buffer racks, respectively, to obtain the first estimated duration and the second estimated duration. Evaluation indicators are determined based on the first estimated duration and the second estimated duration. The evaluation indicators of the rack allocation scheme can comprehensively consider the duration of the first process without material blockage and the duration of the second process without material shortage. Therefore, optimizing the rack allocation scheme based on the evaluation indicators can yield a more accurate and reasonable rack allocation scheme.

[0030] This disclosure provides a material rack dispensing device, the device comprising:

[0031] The first determining module is used to determine the buffer rack set shared by the first process and the second process on the production line; the first process is used to produce multiple types of first materials, each type of first material is obtained by winding consumables on the corresponding type of roll; the second process is used to consume the consumables in the first material to produce the second material and to return the roll to the first process after the consumables in the first material are consumed; the buffer rack set includes multiple buffer racks, which are used to buffer the first material to be consumed and / or the roll to be returned to the first process;

[0032] The second determining module is used to determine the first efficiency of the first process in producing each type of first material and the second efficiency of the second process in consuming each type of first material.

[0033] The first allocation module is used to allocate corresponding cacheable target material types and target roll types to each buffer rack based on each first efficiency, each second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state; the target state includes no material blockage in the first process and no material shortage in the second process.

[0034] This disclosure provides a computer device including a memory and a processor. The memory stores a computer program that can run on the processor. When the processor executes the program, it implements some or all of the steps in the above-described method.

[0035] This disclosure provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements some or all of the steps in the above-described method.

[0036] This disclosure provides a computer program product, including a computer program or instructions, which, when executed by a processor, implement some or all of the steps in the above-described method.

[0037] It should be understood that the above general description and the following detailed description are merely exemplary and explanatory, and are not intended to limit the technical solutions of this disclosure. Attached Figure Description

[0038] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the specification, serve to illustrate the technical solutions of this disclosure.

[0039] Figure 1 is a schematic diagram of material flow between processes on a production line according to an embodiment of this disclosure;

[0040] Figure 2 is a schematic diagram of the implementation process of a material rack allocation method provided in an embodiment of this disclosure;

[0041] Figure 3 is a schematic diagram of material flow between processes on a production line according to an embodiment of this disclosure;

[0042] Figure 4 is a schematic diagram of material flow between processes on a production line according to an embodiment of this disclosure;

[0043] Figure 5 is a schematic diagram of material flow between processes on a production line according to an embodiment of this disclosure;

[0044] Figure 6 is a schematic diagram of the implementation process of a material rack allocation method based on genetic algorithm and particle swarm algorithm provided in an embodiment of this disclosure;

[0045] Figure 7 is a schematic diagram of the composition structure of a material rack distribution device provided in an embodiment of this disclosure;

[0046] Figure 8 is a schematic diagram of the hardware entity of a computer device provided in an embodiment of this disclosure. Detailed Implementation

[0047] To make the objectives, technical solutions, and advantages of this disclosure clearer, the technical solutions of this disclosure are further described in detail below with reference to the accompanying drawings and embodiments. The described embodiments should not be regarded as limitations on this disclosure. All other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this disclosure.

[0048] In the following description, references are made to “some embodiments,” which describe a subset of all possible embodiments. However, it is understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.

[0049] The terms “first / second / third” are used merely to distinguish similar objects and do not represent a specific ordering of objects. It is understood that “first / second / third” may be interchanged in a specific order or sequence where permitted, so that the embodiments of this disclosure described herein can be implemented in an order other than that illustrated or described herein.

[0050] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs. The terminology used herein is for descriptive purposes only and is not intended to limit this disclosure.

[0051] This disclosure provides a material rack allocation method. Figure 1 is a schematic diagram of material flow between processes on a production line according to an embodiment of this disclosure. The first process 110 is used to produce various types of first materials 111. The second process 120 is used to consume the consumables in the first materials 111 to produce second materials and to return the roll 121 to the first process 110 after the consumables in the first materials 111 are consumed. The buffer rack 130 is used to buffer the first materials 111 to be consumed and / or the roll 121 to be returned to the first process 110.

[0052] Figure 2 is a schematic flowchart of a material rack allocation method provided in an embodiment of this disclosure. As shown in Figure 2, the method includes the following steps S201 to S203:

[0053] Step S201: Determine the buffer rack set shared by the first and second processes on the production line; the first process is used to produce multiple types of first materials, each type of first material is obtained by winding consumables on the corresponding type of roll; the second process is used to consume the consumables in the first material to produce the second material, and after the consumables in the first material are consumed, the roll is returned to the first process; the buffer rack set includes multiple buffer racks, which are used to buffer the first material to be consumed and / or the roll to be returned to the first process;

[0054] Here, the first process and the second process are two adjacent processes on the production line. The second process is the next process after the first process. In other words, the second process consumes the first material produced by the first process to produce the second material.

[0055] The buffer racks are used to buffer the first material produced in the first process and the reel that is returned after the consumables in the first material are consumed in the second process. Each buffer rack is configured with the material type and reel type that can be buffered, and each buffer rack can only buffer the first material and reel of the corresponding type.

[0056] In some implementations, the type of roll wound for each type of first material may be the same or different.

[0057] In some implementations, the material type and roll type configured for each buffer rack may or may not be in a one-to-one correspondence. That is, the roll type and material type that each buffer rack can buffer may or may not correspond. In other words, each buffer rack can buffer one material type and the roll type corresponding to the roll that can be used to produce the first material of that type.

[0058] In some implementations, if a certain type of first material is required in the second process, that type of first material is sent to the second process.

[0059] In some implementations, if the second process does not require the consumption of a certain type of first material, the first material of that type is sent to a buffer rack for caching.

[0060] In some implementations, the buffer rack operates on a first-in, first-out (FIFO) basis, where the first excess material or roll is sent to the corresponding type of buffer rack, and the first material or roll placed on the buffer rack is used preferentially.

[0061] Step S202: Determine the first efficiency of the first process in producing each type of first material and the second efficiency of the second process in consuming each type of first material;

[0062] In some implementations, assuming that the mainframes of each process are operating normally and that the racks and buffer racks bound to each mainframe are not malfunctioning, the first efficiency of the first process in producing each type of first material and the second efficiency of the second process in consuming each type of first material are fixed.

[0063] In some implementations, in the event of a failure in the operation of the host machine in each process, a failure in the rack attached to each host machine, or a failure in the buffer rack, it is necessary to redetermine the first efficiency of the first process in producing each type of first material and the second efficiency of the second process in consuming each type of first material.

[0064] Step S203: Based on each first efficiency, each second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, assign the corresponding target material type and target roll type that can be buffered to each buffer rack; the target state includes no material blockage in the first process and no material shortage in the second process.

[0065] Here, "material blockage in the first process" refers to the situation where the material rack is completely filled by the first material, leaving no place for the first material produced in the first process, thus causing material blockage in the first process.

[0066] The term "material shortage in the second process" refers to a situation where the second process needs to consume the first material, but there is no first material available for consumption in the second process.

[0067] In some implementations, based on each first efficiency, each second efficiency, and the material type and roll type configured in the current buffer rack, the duration during which the first process is not blocked and the second process is not short of material is calculated. The material type and roll type that can be buffered by each buffer rack are continuously updated with the goal of maximizing the duration, so as to obtain the final target material type and target roll type that can be buffered by each buffer rack.

[0068] In some implementations, a first set of material rack allocation schemes is randomly generated. Based on each first efficiency, each second efficiency, and the material type and roll type of the current buffer material rack configuration, a target value corresponding to the target state is determined, namely, the duration during which the first process does not experience material blockage and the second process does not experience material shortage. A genetic algorithm is used to iterate the first set of material rack allocation schemes. The target value is used as the fitness to evaluate each material rack allocation scheme in the first set of material rack allocation schemes. When the genetic algorithm meets the convergence condition, the final material rack allocation scheme is obtained.

[0069] In some implementations, a second rack allocation scheme set is randomly generated. Based on each first efficiency, each second efficiency, and the material type and roll type of the current buffer rack configuration, a target value corresponding to the target state is determined. Each rack allocation scheme in the second rack allocation scheme set is the position of each particle in the particle swarm optimization algorithm. The particle swarm optimization algorithm is used to iterate the first rack allocation scheme set continuously. The target value is used as the fitness to evaluate each rack allocation scheme in the second rack allocation scheme set. When the particle swarm optimization algorithm meets the convergence condition, the final rack allocation scheme is obtained.

[0070] In some implementations, each buffer rack is assigned a corresponding target material type and target roll type based on each first efficiency, each second efficiency, the initial material inventory consumed by the first process for producing the first material, the number of rolls in the first and second processes (i.e., rolls without winding consumables), the number of buffer racks for placing the first material or rolls between the first and second processes, and the material type and roll type currently configured in the buffer racks.

[0071] In some implementations, under limited conditions of first material and buffer rack, the material type and roll type of the buffer rack are allocated to achieve the longest possible time without material blockage in the first process and without material shortage in the second process.

[0072] In some implementations, the production status of each host machine and all material racks on the production line is collected in real time, and in the event of a host machine or material rack failure, the material type and roll type of the buffer material rack are promptly reassigned.

[0073] In this embodiment, a first process produces multiple types of first materials by winding consumables onto corresponding types of rolls to obtain each type of first material. A second process consumes the consumables from the first materials to produce second materials, and after the consumables in the first materials are consumed, the rolls are returned to the first process. A buffer rack set shared by the first and second processes on the production line is determined. Multiple buffer racks in the buffer rack set can buffer the first materials to be consumed and / or the rolls to be returned to the first process. A first efficiency and a second efficiency for consuming each type of first material are determined. Based on each first efficiency, each second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, corresponding target material types and target roll types are assigned to each buffer rack. The target state includes no material blockage in the first process and no material shortage in the second process. In this way, based on the first efficiency of the first process in producing the first material, the second efficiency of the second process in consuming the first material, and the number of buffer racks, with the goal of maximizing the duration of no material blockage in the first process and no material shortage in the second process, the dynamic allocation of material types and roll types to the buffer racks can be achieved.

[0074] In some embodiments, FIG3 is a schematic diagram of material flow between processes on a production line according to an embodiment of the present disclosure. The first process 110 includes a plurality of first host machines 112, each of which is used to produce a first material 111 of a corresponding type. The second process 120 includes a plurality of second host machines 122, each of which is used to consume consumables in the first material 111 of a corresponding type to produce a second material of a corresponding type.

[0075] Step S203 above may include the following step S211:

[0076] Step S211: Based on the first efficiency of each first host in producing the first material of the corresponding type, the second efficiency of each second host in consuming the first material of the corresponding type, and the number of buffer racks, with the goal of maximizing the duration of the target state, assign the corresponding cacheable target material type and target roll type to each buffer rack.

[0077] In some implementations, each first machine in the first process may produce the same first material or different first materials.

[0078] In some implementations, each second host in the second process may require the same type of first material or different types of first material.

[0079] In some implementations, based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, and the material type and roll type that the current buffer rack can buffer, the duration of the first process without material blockage and the second process without material shortage is calculated, and the material type and roll type that each buffer rack can buffer are continuously updated with the goal of maximizing the duration, so as to obtain the final target material type and target roll type that each buffer rack can buffer.

[0080] In the above embodiments, by maximizing the duration of the target state based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, and the number of buffer racks, the corresponding target material type and target roll type are assigned to each buffer rack. This fully considers the impact of the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, and the number of buffer racks on the material transportation process, thereby achieving a more reasonable dynamic allocation of the material type and roll type of the buffer rack.

[0081] In some embodiments, FIG4 is a schematic diagram of material flow between processes provided in this disclosure. Each first host 112 is bound to a plurality of first material racks 113, which are used to place the first material 111 of the corresponding type produced by the first host 112 and / or the roll 121 of the corresponding type required by the first host 112; each second host 122 is bound to a plurality of second material racks 123, which are used to place the first material 111 of the corresponding type required by the second host 122 and the roll 121 returned by the second host 122.

[0082] Step S211 above may include the following step S221:

[0083] Step S221: Based on the first efficiency of each first host producing the first material of the corresponding type, the second efficiency of each second host consuming the first material of the corresponding type, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, with the goal of maximizing the duration of the target state, assign the corresponding cacheable target material type and target roll type to each buffer rack.

[0084] The primary efficiency refers to the production efficiency of the primary machine in producing the corresponding type of primary material; the secondary efficiency refers to the consumption efficiency of the secondary machine in consuming the corresponding type of primary material. For example, if a primary machine is used to produce the primary material of the primary type, and it can produce 30 units of the primary material of the primary type per hour, then the primary efficiency of that primary machine is 30 units per hour. Similarly, if a secondary machine is used to consume the primary material of the secondary type, and it can consume 20 units of the primary material of the secondary type per hour, then the secondary efficiency of that secondary machine is 20 units per hour. The primary efficiencies of all primary machines can be the same or different; the secondary efficiencies of all secondary machines can also be the same or different.

[0085] In some implementations, each first host may be bound to multiple first racks; the second host may be bound to multiple second racks.

[0086] In some embodiments, each first material rack may hold one type of first material and a roll, or it may hold multiple types of first materials and rolls. That is, the first material may have multiple models. For example, using a winding process, the positive electrode sheet, separator, and negative electrode sheet are sequentially wound onto a winding needle or roll to form a cylindrical structure, resulting in the first material of a cylindrical battery type. Or, the positive electrode sheet, negative electrode sheet, and separator are stacked together in a certain order and manner, and a winding machine is used to wind the stacked electrodes and separator to form a square structure, resulting in the first material of a square battery type.

[0087] In some implementations, if a material rack malfunctions in any of the first, second, or buffer material racks, the number of material racks will decrease. It will be necessary to update the number of first, second, and buffer material racks, and reconfigure the target material type and target roll type for the buffer material racks. Specifically, based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the updated number of buffer material racks, the updated number of first material racks, and the updated number of second material racks, with the goal of maximizing the duration of the target state, each updated buffer material rack will be assigned a corresponding bufferable target material type and target roll type to prevent material shortages or blockages.

[0088] In the above embodiments, each first host is bound to multiple first racks for placing the first material of the corresponding type produced by the first host and / or the roll of the corresponding type required by the first host; each second host is bound to multiple second racks for placing the first material of the corresponding type required by the second host and the roll of the second host returning; by allocating corresponding target material types and target roll types to each buffer rack based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, with the goal of maximizing the duration of the first process without material blockage and the second process without material shortage, the impact of the number of first racks bound to each first host and the number of second racks bound to each second host on the material transportation process can be fully considered, thereby achieving a more reasonable dynamic allocation of material types and roll types to the buffer racks.

[0089] In some embodiments, the above method may further include the following steps S231 and S232:

[0090] Step S231: If the target host is down, add the multiple target racks bound to the target host as new cache racks to the cache rack set to obtain the updated cache rack set; the target host includes the first target host in the first process and / or the second target host in the second process;

[0091] In some implementations, when the target host is shut down, the target rack bound to the target host will be idle. In order to improve the utilization rate of the rack and the efficiency of material flow, the target rack is converted into a buffer rack.

[0092] Step S232: Based on each first efficiency, each second efficiency, and the number of cache racks in the updated cache rack centralization, with the goal of maximizing the duration of the target state, assign the corresponding cacheable target material type and target roll type to each updated cache rack.

[0093] In some implementations, the updated cache rack set includes the previous cache racks and the target racks unbound from the stopped target host.

[0094] In the above embodiments, when the target host is shut down, multiple target racks bound to the target host are added as new cache racks to the cache rack set to obtain an updated cache rack set. The number of cache racks in each first efficiency, each second efficiency, and the updated cache rack set are then used to maximize the duration of the target state. The target material type and target roll type are then reassigned to each updated cache rack, which can improve the utilization rate and flexibility of the racks.

[0095] In some embodiments, the production line also includes a plurality of transport trolleys for transporting the first material and / or the roll between the first host, the buffer rack, and the second host.

[0096] Step S211 above may include the following step S241:

[0097] Step S241: Based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer racks, with the goal of maximizing the duration of the target state, assign the corresponding bufferable target material type and target roll type to each buffer rack.

[0098] In some implementations, material flow on the production line is achieved through multiple transport trolleys.

[0099] In some implementations, the transport vehicle may be an automated guided vehicle (AGV).

[0100] In some implementations, the transport trolley moves the first material produced in the first process to a corresponding type of buffer rack or the second process, and moves the first material in the buffer rack to the second process.

[0101] In some implementations, when the transport trolley moves the first material to the buffer rack or the second process, it will detect whether there is a roll that has consumed all the consumables in the first material. If there is a roll, it will be returned to the first process for the production of the first material. This can improve transport efficiency and thus improve the efficiency of material flow on the entire production line.

[0102] In some implementations, the transport trolley receives a transport instruction and transports the first material or roll to the target location according to the travel path.

[0103] In some implementations, the method is executed by a warehouse management system running on a host computer. In response to receiving a loading request from the second process, the warehouse management system sends a transport instruction to a transport trolley, which moves the first material of the corresponding type from the unloading position or buffer rack of the first process to the loading position of the second process. If the warehouse management system detects the presence of a roll in the second process, it sends a transport instruction to the transport trolley, which moves the roll from the loading position of the second process to the unloading position or buffer rack of the first process.

[0104] In some implementations, in response to receiving a material unloading request from the first process, the warehouse management system sends a transport instruction to a transport trolley, which then moves the first material from the unloading position of the first process to a buffer rack or the loading position of the second process.

[0105] In some implementations, when a first material is present in the first process, the lower-level machine in the first process, such as a programmable logic controller (PLC), sends a transport instruction to the transport trolley, which then moves the first material to the loading position or buffer rack in the second process.

[0106] In some implementations, when there is a shortage of material in the second process, the lower-level machine in the second process, such as a PLC, sends a transport instruction to the transport trolley, which then moves the first material of the corresponding type from the unloading position or buffer rack in the first process to the loading position in the second process.

[0107] In some implementations, if the second process requires the first material of the corresponding type, the transport trolley will prioritize moving the first material of the corresponding type from the first material rack to the second process; if the first material of the corresponding type is not on the first material rack, the first material of the corresponding type from the buffer material rack will be moved to the second process.

[0108] In some implementations, the first material of the corresponding type on the buffer rack may be transferred to the second process first, and if the first material of the corresponding type is not on the buffer rack, the first material of the corresponding type on the first rack may be transferred to the second process.

[0109] In some implementations, if the second process does not lack the corresponding type of material, the transport trolley can move the first material to the buffer rack.

[0110] In some implementations, the rolls from the second process are preferentially transported to the first process. If there are no empty spaces on the corresponding type of rack in the first rack, the transport trolley transports the rolls to the corresponding type of buffer rack.

[0111] In some implementations, the first material produced in the first process is preferentially placed on the first rack of the corresponding type. If there is no empty space on the first rack of the corresponding type, the first material is placed on the buffer rack of the corresponding type. In some implementations, based on the first efficiency of each first host in producing the first material of the corresponding type, the second efficiency of each second host in consuming the first material of the corresponding type, the transport speed of the transport trolley, the number of transport trolleys, the number of buffer racks, and the material types and roll types that the current buffer racks can buffer, the duration for which the first process does not experience material blockage and the second process does not experience material shortage is calculated. The material types and roll types that each buffer rack can buffer are continuously updated with the goal of maximizing the duration, resulting in the final target material types and target roll types that each buffer rack can buffer.

[0112] In the above embodiments, the production line also includes multiple transport trolleys, which are used to transport the first material and / or rolls between the first host, the buffer rack, and the second host. By assigning corresponding bufferable target material types and target roll types to each buffer rack based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the transport speed of the transport trolleys, the number of transport trolleys, and the number of buffer racks, the impact of the transport speed and the number of transport trolleys on the material transport process can be fully considered, thereby achieving a more reasonable dynamic allocation of material types and roll types to the buffer racks.

[0113] In some embodiments, the transport trolley is used to transport the first material produced by the first host to the second host that needs the first material, or to the buffer rack of the material type that can buffer the first material, and to transport the first material in the buffer rack to the second host that needs the first material.

[0114] The transport trolley is also used to move the reels returned from the second host to the first host that needs the reels, or to a buffer rack of the reel type that can buffer the reels, and to move the reels on the buffer rack to the first host that needs the reels.

[0115] In some implementations, a transport trolley is used to move the first material and the roll between the first process, the second process, and the buffer rack.

[0116] In some implementations, when a second process requires a first material of a certain type, a transport trolley moves the first material from the first process to the second process.

[0117] In some implementations, when there is a roll in the second process that has consumed all the consumables in the first material, and there is an empty space of the corresponding type on the buffer rack or the first rack, the transport trolley moves the roll to the first process or the buffer rack.

[0118] In the above embodiments, the first material produced by the first host is transported to the second host that needs the first material, or to a buffer rack of material type that can buffer the first material, by means of a transport trolley, and the first material in the buffer rack is transported to the second host that needs the first material; the roll returned by the second host can also be transported to the first host that needs the roll, or to a buffer rack of roll type that can buffer the roll, by means of a transport trolley, and the roll on the buffer rack is transported to the first host that needs the roll, thereby realizing the flow of the first material and the roll between the first process and the second process.

[0119] In some embodiments, step S203 may include the following steps S281 to S283:

[0120] Step S281: Obtain the initial rack allocation scheme set. The rack allocation scheme set includes multiple rack allocation schemes. Each rack allocation scheme includes the cacheable material type and roll type corresponding to each cache rack.

[0121] In some implementations, multiple rack allocation schemes of the rack allocation scheme set are initialized, for example, 100 rack allocation schemes are initialized.

[0122] In some implementations, a rack allocation scheme includes the material type and roll type corresponding to each buffer rack.

[0123] Step S282: Based on the evaluation indicators of each rack allocation scheme in the rack allocation scheme set, update the rack allocation scheme set at least once, and determine the target rack allocation scheme from the updated rack allocation scheme set; wherein, the evaluation indicator of each rack allocation scheme during the update process is obtained by estimating the duration of the target state according to the rack allocation scheme, based on each first efficiency, each second efficiency and the number of buffer racks.

[0124] In some implementations, the evaluation index of each rack allocation scheme during the update process can also be estimated based on the rack allocation scheme, the first efficiency of each first host in producing the first material of the corresponding type, the second efficiency of each second host in consuming the first material of the corresponding type, and the number of buffer racks, to predict the duration of the target state.

[0125] In some implementations, the evaluation index of each rack allocation scheme during the update process can also be estimated based on the rack allocation scheme, taking into account the first efficiency of each first host producing the first material of the corresponding type, the second efficiency of each second host consuming the first material of the corresponding type, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, to estimate the duration of the target state.

[0126] In some implementations, the evaluation index of each rack allocation scheme during the update process can also be estimated based on the rack allocation scheme, taking into account the first efficiency of each first host in producing the first material of the corresponding type, the second efficiency of each second host in consuming the first material of the corresponding type, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer racks, to estimate the duration of the target state.

[0127] Step S283: Based on the target material rack allocation scheme, determine the target material type and target roll type that can be cached for each buffer material rack.

[0128] In the above embodiments, the rack allocation scheme set is updated at least once by using the evaluation index of each rack allocation scheme in the rack allocation scheme set, and a better target rack allocation scheme is determined from the updated rack allocation scheme set. Based on the target rack allocation scheme, the corresponding cacheable target material type and target roll type can be assigned to each cache rack.

[0129] In some embodiments, the rack allocation scheme set includes a first rack allocation scheme set and a second rack allocation scheme set, and the first rack allocation scheme set and the second rack allocation scheme set each include a plurality of rack allocation schemes;

[0130] Step S282 above may include the following steps S251 and S252:

[0131] Step S251: Based on the genetic algorithm and particle swarm optimization algorithm, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme. The first rack allocation scheme set and the second rack allocation scheme set are updated for at least one round until the update termination condition is met.

[0132] In some implementations, the rack allocation scheme set includes a first rack allocation scheme set and a second rack allocation scheme set.

[0133] In some implementations, the first rack allocation scheme set and the second rack allocation scheme set are updated at least once using genetic algorithms and particle swarm optimization algorithms, respectively.

[0134] In some implementations, the population size of the genetic algorithm is initialized, for example, 50 individuals, each individual being a shelf allocation scheme from a first set of shelf allocation schemes.

[0135] In some implementations, the particle swarm size of the particle swarm algorithm is initialized, for example, 50 particles, and the position of each particle represents a rack allocation scheme in the second rack allocation scheme set.

[0136] In some implementations, the initialization of the particle swarm optimization algorithm also requires initializing the position and velocity of each particle. The initialization method can be randomized or otherwise; this disclosure does not impose any limitations on this.

[0137] In some implementations, the number of rounds corresponding to the genetic algorithm and the number of rounds corresponding to the particle swarm algorithm can be set according to actual needs, and this disclosure does not impose any restrictions on this.

[0138] In some implementations, a genetic algorithm is used to update the set of rack allocation schemes for at least one generation until the genetic algorithm meets the convergence condition, resulting in an updated set of rack allocation schemes. The updated set of rack allocation schemes is then used as the starting point for a particle swarm optimization (PSO) algorithm, which is used to continue updating the updated set of rack allocation schemes for at least one generation until the PSO algorithm meets the convergence condition, resulting in a final set of rack allocation schemes. The rack allocation scheme with the highest fitness in the final set of rack allocation schemes is then selected as the target rack allocation scheme.

[0139] Step S252: Select the updated second rack allocation scheme with the highest adaptability as the target rack allocation scheme.

[0140] In some implementations, if the genetic algorithm and the particle swarm optimization algorithm meet the convergence conditions, the rack allocation scheme with the highest fitness is selected as the target rack allocation scheme.

[0141] In the above embodiments, by using genetic algorithms and particle swarm optimization algorithms, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme. The first rack allocation scheme set and the second rack allocation scheme set are updated for at least one round until the update termination condition is met. The rack allocation scheme with the highest fitness in the updated second rack allocation scheme set is determined as the target rack allocation scheme. This can give full play to the diversity of solutions of genetic algorithms and the global search capability of particle swarm optimization algorithms, and obtain a better target rack allocation scheme.

[0142] In some embodiments, step S251 may include steps S261 to S263 as follows:

[0143] Step S261: Using a genetic algorithm, each material rack allocation scheme in the first material rack allocation scheme set is taken as an individual, and the first material rack allocation scheme set is updated for at least one generation of individuals to obtain the updated first material rack allocation scheme set.

[0144] In some embodiments, the genetic operations in the genetic algorithm include selection, crossover, and mutation operations, and the methods of selection, crossover, and mutation operations are not limited in this disclosure.

[0145] In some embodiments, the selection operation is to select the individual with the best fitness value in each generation of the genetic algorithm as the parent individual.

[0146] In some embodiments, a roulette wheel selection method can be used for the selection operation.

[0147] In some implementations, the material type and roll type of the buffer rack in each rack allocation scheme are used as the genes of each individual in the genetic algorithm. Two individuals are randomly selected for pairing and a crossover point is generated. The genes before the crossover point remain unchanged, and the genes after the crossover point exchange the genes at corresponding positions of the two individuals.

[0148] In some implementations, a mutation rate is selected, and the values ​​of some genes are randomly changed, i.e., the material type and roll type of the buffer rack are randomly changed.

[0149] Step S262: Using the particle swarm optimization algorithm, each material rack allocation scheme in the second material rack allocation scheme set is used as a particle to update the second material rack allocation scheme set by at least one generation of particles, so as to obtain the updated second material rack allocation scheme set.

[0150] In some implementations, the position of each particle in the particle swarm optimization algorithm represents a rack allocation scheme.

[0151] Step S263: Using the shelf allocation scheme with the highest fitness in the updated first shelf allocation scheme set, update the shelf allocation scheme with the highest fitness in the updated second shelf allocation scheme set again to obtain the updated second shelf allocation scheme set.

[0152] In some implementations, the shelf allocation scheme with the highest fitness value in the first shelf allocation scheme set after each round of updates is compared with the shelf allocation scheme with the highest fitness value in the second shelf allocation scheme set after the same round of updates. If the fitness value of the shelf allocation scheme in the first shelf allocation scheme set is greater than the fitness value of the shelf allocation scheme in the second shelf allocation scheme set, the shelf allocation scheme with the highest fitness value in the first shelf allocation scheme set is determined as the shelf allocation scheme with the highest fitness value in the second shelf allocation scheme set, and the next round of updates continues.

[0153] In the above embodiments, a genetic algorithm is used to update the first rack allocation scheme set for at least one generation of individuals, resulting in an updated first rack allocation scheme set. A particle swarm optimization algorithm is used to update the second rack allocation scheme set for at least one generation of particles, resulting in an updated second rack allocation scheme set. The rack allocation scheme with the highest fitness in the updated first rack allocation scheme set is then used to update the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set, resulting in a further updated second rack allocation scheme set. This approach utilizes the individual optimal solutions of the genetic algorithm to update the global optimal solution of the particle swarm optimization algorithm, improving the solution efficiency and accuracy of the particle swarm optimization algorithm, thereby accelerating the acquisition of a better rack allocation scheme.

[0154] In some embodiments, the method for determining the evaluation indicators of the rack allocation scheme may include the following steps S271 to S273:

[0155] Step S271: According to the material rack allocation scheme, based on each first efficiency, each second efficiency and the number of buffer material racks, estimate the duration of the first process without material blockage, and obtain the first estimated duration.

[0156] In some implementations, according to the material rack allocation scheme, the duration of the first process without material blockage is estimated based on each first efficiency, each second efficiency, the number of buffer material racks, the transport speed of the transport trolley, and the number of transport trolleys, to obtain the first estimated duration.

[0157] Step S272: According to the material rack allocation scheme, based on each first efficiency, each second efficiency and the number of buffer material racks, estimate the duration of the second process without material shortage, and obtain the second estimated duration.

[0158] In some implementations, according to the material rack allocation scheme, based on the first efficiency, the second efficiency, the number of buffer material racks, the transport speed of the transport trolley, and the number of transport trolleys, the duration of the second process without material shortage is estimated to obtain the second estimated duration.

[0159] Step S273: Based on the first estimated duration and the second estimated duration, determine the evaluation index of the rack allocation scheme.

[0160] In some implementations, the duration of the target state is a weighted sum of the first estimated duration and the second estimated duration, as shown in formula (1): f(X)=α×shortage(X)+β×blockage(X) (1);

[0161] In formula (1), shortenage(X) is the second estimated duration; blockage(X) is the first estimated duration; α and β are weight parameters.

[0162] In some implementations, the larger the first estimated duration and the second estimated duration, the greater the fitness value, and the better the corresponding rack allocation scheme.

[0163] In the above embodiments, according to the rack allocation scheme, the duration of the first process without material blockage and the duration of the second process without material shortage are estimated based on each first efficiency, each second efficiency, and the number of buffer racks, respectively, to obtain the first estimated duration and the second estimated duration. Evaluation indicators are determined based on the first estimated duration and the second estimated duration. The evaluation indicators of the rack allocation scheme can comprehensively consider the duration of the first process without material blockage and the duration of the second process without material shortage. Therefore, optimizing the rack allocation scheme based on the evaluation indicators can yield a more accurate and reasonable rack allocation scheme.

[0164] In some embodiments, the first process includes a plurality of first hosts, each of which is used to produce a first material of a corresponding type; the second process includes a plurality of second hosts, each of which is used to consume consumables in the first material of a corresponding type to produce a second material of a corresponding type.

[0165] Step S271 above may include the following step S281:

[0166] Step S281: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer material racks, the duration of the first process without material blockage is estimated to obtain the first estimated duration.

[0167] Step S272 above may include the following step S282:

[0168] Step S282: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer material racks, the duration of the second process without material shortage is estimated to obtain the second estimated duration.

[0169] In some embodiments, each first host is bound to a plurality of first racks, which are used to place first materials of the corresponding type produced by the first host and / or rolls of the corresponding type required by the first host; each second host is bound to a plurality of second racks, which are used to place first materials of the corresponding type required by the second host and rolls returned by the second host.

[0170] Step S281 above may include the following step S291:

[0171] Step S291: According to the rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, the duration of the first process without material blockage is estimated to obtain the first estimated duration.

[0172] Step S282 above may include the following step S292:

[0173] According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, the duration of the second process without material shortage is estimated to obtain the second estimated duration.

[0174] In some embodiments, the production line also includes a plurality of transport trolleys for transporting the first material and / or the roll between the first host, the buffer rack, and the second host.

[0175] Step S281 above may include the following step S293:

[0176] Step S293: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer racks, the duration of the first process without material blockage is estimated to obtain the first estimated duration.

[0177] Step S282 above may include the following step S294:

[0178] Step S294: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer racks, the duration of the second process without material shortage is estimated to obtain the second estimated duration.

[0179] The following describes the application of the embodiments of this disclosure in real-world scenarios.

[0180] In modern manufacturing, the efficiency of material flow and storage between processes is crucial to the smoothness of the production process. This is especially true in environments using automated guided vehicles (AGVs). Managing and planning the types of items that can be stored on racks during production has become a technical challenge. Related technologies that rely on manual labor or simple automated systems often experience disruptions in material flow due to main machine downtime or rack malfunctions, impacting overall production efficiency.

[0181] In related technologies, for processes A and B, each host machine in process A (corresponding to the first process in the aforementioned embodiments) is bound to n host machine racks (corresponding to the first racks in the aforementioned embodiments), and each host machine in process B (corresponding to the second process in the aforementioned embodiments) is bound to m host machine racks (corresponding to the second racks in the aforementioned embodiments). Each host machine rack is only bound to that host machine. There are p shared buffer racks between processes A and B. The types of materials that can be placed and the types of empty rolls are manually configured for each buffer rack before production based on experience. Therefore, the following situations may occur: when a host machine in process A or B stops, the n or m host machine racks bound to that host machine will be locked and will no longer be used by the automatic program, resulting in these locked racks being idle, but there is a lack of available rack resources on site; when a host machine rack fails, the total number of racks that can be used by the corresponding host machine decreases, which may cause material blockage or material shortage; for buffer racks, the configuration is determined before the production material is produced. If it needs to be modified, it is necessary to manually determine how many buffer racks are needed for each type of material again based on experience and reconfigure them, which lacks flexibility and emergency response capability.

[0182] Based on the above description, this disclosure proposes a rack allocation method based on genetic algorithms and particle swarm optimization. This method can solve the problems of rack resource waste and inflexible buffer rack configuration caused by host downtime or rack failure in related technologies, thereby improving the efficiency of material flow and storage.

[0183] The specific implementation of the rack allocation method based on genetic algorithm and particle swarm optimization proposed in this disclosure can include the following three parts:

[0184] Part 1: System initialization (corresponding to the warehouse management system in the above embodiments);

[0185] As shown in Figure 5, the material flow process between processes in the system is as follows: There are processes A and B. Process A includes multiple main units (corresponding to the first main unit 112 in the aforementioned embodiment), and process B includes multiple main units (corresponding to the second main unit 122 in the aforementioned embodiment). The main unit of process A places the produced material 504 on the main unit rack 501 of process A (corresponding to the first rack 113 in the aforementioned embodiment). The system gives the automatic guided vehicle a command to transport the material 504 (corresponding to the first material 111 in the aforementioned embodiment) to the main unit rack 502 of process B (corresponding to the second rack 123 in the aforementioned embodiment) or the buffer rack 130 shared by processes A and B, and to transport the material 504 on the buffer rack 130 to the main unit rack 502 of process B. After process B consumes the material 504 sent from process A for production, the empty roll 505 (corresponding to roll 121 in the aforementioned embodiment) that has consumed the consumables is placed on the main material rack 502 of process B. The system gives the automatic guide trolley a command to transport the empty roll 505 back to the main material rack 501 or buffer rack 130 of process A, and to transport the empty roll 505 on the buffer rack 130 back to the main material rack 501 of process A.

[0186] The system parameters are set as follows:

[0187] 1) A main unit in process A has n feed racks attached to it, and a main unit in process B has m feed racks attached to it. Each rack can only hold one pallet of material or one pallet of rolls. Material or rolls can only be fed to the rack when it is empty. Each rack attached to processes A and B is configured with the types of rolls and materials that can be stored (one material type corresponds to one roll type). The material type of the rack attached to each main unit is the same as the material type produced by that main unit.

[0188] 2) Process A has k mainframes and process B has h mainframes.

[0189] 3) There are p shared buffer racks (not bound to the host) between process A and process B. These racks can be used to store materials or empty rolls. Each buffer rack is configured with the types of rolls and materials that can be stored (one material type corresponds to one roll type). The buffer racks operate on a first-in, first-out (FIFO) model. If the excess material or roll meets the conditions, it will be sent to the buffer area (i.e., the buffer rack) first, filling the rack.

[0190] 4) For any material type, if process B requires feeding (the material racks of some main units in process B meet the feeding condition F, i.e., process B's main units are not short of material), then the material from the main unit racks or buffer racks in process A will be sent to the racks in process B configured with that material type. If the main unit in process B does not require feeding, and the buffer racks configured with that material type have empty spaces, the material of that material type produced by the main unit in process A will be sent to the buffer racks. The same applies to rolls: first, the rolls on the main unit racks in process B are sent to the main unit racks in process A (the material racks of some main units in process A meet the empty return condition D, i.e., the loading racks of some main units in process A have empty spaces); if process A does not meet the empty return condition D, the rolls on the main unit racks in process B are sent to the buffer racks.

[0191] 5) In process A, each machine may produce the same material or different materials. The type of roll for each material may be the same or different. Only one type of material can be produced at a time, and the configuration can be adjusted according to production needs.

[0192] 6) In process B, each main unit may require the same material or different materials. Only one type of material is required at any given time.

[0193] 7) x automated guided vehicles are used for material delivery and roll delivery between process A, process B, and the buffer rack. The vehicles can be used to transport materials or rolls. After a vehicle transports material to a main machine in process B, if that main machine has a roll that meets the empty return condition D (i.e., there is an empty roll), and process A or the buffer rack has an empty rack, it will transport the empty roll to process A or the buffer rack.

[0194] 8) The feeding condition F and the empty return condition D are system logic and are generally fixed, but can be configured by personnel according to the site conditions. Other lowercase letters (number of host racks bound to one host in process A n, number of host racks bound to one host in process B m, number of buffer racks p, number of hosts in process A k, number of hosts in process B h, number of automated guided vehicles x) are determined before the system goes live, depending on the specific site, and are generally not modified.

[0195] Part Two: System Logic;

[0196] 1) System monitoring: Real-time collection of production and material rack status of each process host.

[0197] 2) Shutdown handling: When the host stops, the system automatically converts its rack into a cache rack (which is rebound to the host rack when the host restarts).

[0198] 3) Algorithm Optimization: Combining genetic algorithms and particle swarm optimization algorithms, the system analyzes the following information for processes A, B, and buffer racks: inventory and storage racks for each material, quantity and storage racks for each type of roll, number of empty racks, number of tasks currently executing, number of available automated guided vehicles (AGVs), efficiency of material production per machine in process A, efficiency of material consumption per machine in process B, and AGV transport speed between available racks. For buffer racks (including p buffer racks that are themselves buffer racks, and buffer racks allocated during the second-step shutdown process), reallocation is performed (due to a decrease in mainframes and an increase in buffer racks, reallocation is necessary). Specifically, the system automatically reconfigures the waiting material type and roll type for each empty buffer rack to ensure that, under the conditions of a limited number of AGVs and limited materials and racks, each machine in process B has no material shortage for the longest possible time, and each mainframe in process A does not experience material blockage (blockage is defined as: when materials fill all racks, leaving no place for the mainframe to store the produced material, the mainframe will stop production due to blockage).

[0199] Part Three: Optimization Algorithm Steps.

[0200] The rack allocation method based on genetic algorithm and particle swarm optimization algorithm is shown in Figure 6, and may include steps S601 to S608:

[0201] Step S601: Define the problem and objective function;

[0202] Objective: To ensure that the main machine in the downstream process does not run out of material for a long time and that the main machine in the upstream process does not get clogged.

[0203] Objective function: Assume the objective function is f(X), where X is a rack allocation scheme. Each rack allocation scheme can include [(Rack1, Type1, Drum1), ...], where Rack1 is rack number 1, Type1 is required material type 1, and Drum1 is required drum type.

[0204] Material types can include Type[100, 200, 300, ...], where Type1 can be the index of a material type in Type[]. Drum types can include Drum[10, 20, 30, ...], where Drum1 can be the index of a drum type in Drum[].

[0205] The objective function f(X) is defined as a weighted sum of multiple sub-objectives, see formula (1). In formula (1), shortage(X) is the duration during which the main machine of process B does not run out of material (corresponding to the second estimated duration in the aforementioned embodiment); blockage(X) is the duration during which the main machine of process A does not run out of material (corresponding to the first estimated duration in the aforementioned embodiment); α and β are weight parameters, such as α = 0.8 and β = 0.2.

[0206] Based on the efficiency of process A in producing each type of material, the efficiency of process B in producing each type of material, and the number of buffer racks, estimate the duration during which process A will not experience material blockage and process B will not experience material shortage. Determine the target value based on the estimated duration of process A without material blockage and process B without material shortage.

[0207] Step S602: Initialization;

[0208] Genetic algorithm initialization: Initialize the population size of the genetic algorithm to N. GA (e.g., 50 individuals), each individual represents a rack allocation scheme, and each gene represents the corresponding material type and roll type for a rack. N is randomly generated. GA Each individual yields the initial population for the genetic algorithm.

[0209] Particle Swarm Optimization Initialization: Initialize the particle swarm size of the particle swarm optimization algorithm to N. PSO (e.g., 50 particles), the particle's position X i This indicates the material rack allocation scheme, speed V. i This represents the adjustment amount, which initializes the position and velocity of the particles (randomly generating the initial position and adjustment amount for each particle).

[0210] Step S603: Assess fitness;

[0211] For each individual in the genetic algorithm and each particle in the particle swarm algorithm, calculate its objective function value f(X) as its fitness value.

[0212] Step S604: Genetic algorithm operation;

[0213] 1) Selection operation, taking the roulette wheel selection method as an example:

[0214] Calculate the relative fitness p for each individual. i See formula (2):

[0215] Based on the relative fitness p of each individual i Calculate the cumulative probability (the sum of the selection probabilities of all individuals before each individual) c. i :

[0216] Generate random numbers r in the interval [0, 1), and select the first one that results in a cumulative probability. Individual i is used as the parent individual for reproduction. The higher the fitness of each individual, the greater the probability that the individual will be selected.

[0217] 2) Crossover operation, taking single-point crossover as an example:

[0218] Choose crossover rate p c , such as p c =0.8, randomly pair individuals, generate crossover points, and exchange genes at these points. For example, for two selected parent individuals A and B, the genes in individual A include A1, A2, ..., A... k And A k+1 A n The genes in individual B include B1, B2, ..., B k And B k+1 B n The intersection point is k, where k is a positive integer greater than 1 and less than or equal to n, and n is the number of genes in individuals A and B. New individuals A' and B' are generated, as shown in formulas (4) and (5) respectively: A'=(A1,A2,…,A k B k+1 ,…,B n (4); B' = (B1, B2, ..., B k A k+1 ,…,A n (5);

[0219] 3) Mutation operation, taking random mutation as an example:

[0220] Choose the variability P m , such as p m =0.05, performing gene mutation operations on a subset of individuals, randomly changing individual gene values. For example, selecting gene locus k of individual A and randomly changing it to A k '.

[0221] Perform the selection, crossover, and mutation operations described above in sequence.

[0222] Step S605: Particle swarm optimization algorithm operation;

[0223] The velocity update for each particle can be found in formula (6): V i (t+1)=w·V i (t)+γ1·r1·(p i best-X i(t))+γ2·r2·(G best -X i (t)) (6);

[0224] Where w is the inertia weight, such as 0.5; γ1 and γ2 are the individual learning factor and the group learning factor, respectively, such as γ1 = 1.5 and γ2 = 1.5; r1 and r2 are random numbers, ranging from [0, 1]; p i,best G represents the historical best position (individual best) of particle i; best The globally optimal position; X i (t) is the i-th scheme at time t. The position update of each particle can be found in formula (7): X i (t+1)=X i (t)+V i (t+1) (7);

[0225] The position of the particle at time t+1 is determined by the position of the particle at time t and the adjustment amount at time t+1 (i.e., the velocity at time t+1).

[0226] Update of individual optimal position and global optimal position: If the particle's new position X i If (t+1) has a better fitness value, then update its optimal position p. i,best .

[0227] If the optimal position among all particles improves, then update the global optimal position G. best .

[0228] Step S606: Algorithm Fusion

[0229] After each round of the genetic algorithm, the best individual from the genetic algorithm is updated to the global optimal position G of the particle swarm optimization algorithm. best .

[0230] The specific operating steps are as follows:

[0231] 1) Run a round (several generations) of the genetic algorithm (e.g., 10 generations) to obtain the best individual X in the current generation. GA_best ;

[0232] 2) Continue running the particle swarm optimization algorithm for several generations (e.g., 20 generations), and then select X. GA_best and G best The better one in G best This guides the particle swarm to search for a better solution.

[0233] 3) Repeatedly run the genetic algorithm and particle swarm algorithm until the termination condition is met.

[0234] Step S607: Determine the termination condition;

[0235] Maximum number of iterations: Check if the maximum number of iterations has been reached, such as 200.

[0236] Solution stability: Check whether the quality of the solution has stabilized or no longer shows significant improvement.

[0237] If the maximum number of iterations is reached or the solution is stable, the genetic algorithm and particle swarm optimization algorithm are determined to meet the termination conditions, and the process proceeds to step S608; if the maximum number of iterations is not reached or the solution is not stable, the genetic algorithm and particle swarm optimization algorithm are determined to not meet the termination conditions, and the process proceeds to step S604.

[0238] Step S608: Output the final solution.

[0239] The globally optimal particle in the particle swarm optimization algorithm is chosen as the final solution.

[0240] Based on the foregoing embodiments, this disclosure provides a rack distribution device, which includes various modules and units included in each module, and can be implemented by a processor in a computer device; of course, it can also be implemented by specific logic circuits; in the implementation process, the processor can be a central processing unit (CPU), a microprocessor unit (MPU), a digital signal processor (DSP), or a field programmable gate array (FPGA), etc.

[0241] Figure 7 is a schematic diagram of the composition structure of a material rack distribution device provided in an embodiment of this disclosure. As shown in Figure 7, the material rack distribution device 700 includes: a first determining module 701, a second determining module 702, and a first distribution module 703, wherein:

[0242] The first determining module 701 is used to determine the buffer rack set shared by the first process and the second process on the production line; the first process is used to produce multiple types of first materials, each type of first material is obtained by winding consumables on the corresponding type of roll; the second process is used to consume the consumables in the first material to produce the second material and return the roll to the first process after the consumables in the first material are consumed; the buffer rack set includes multiple buffer racks, which are used to buffer the first material to be consumed and / or the roll to be returned to the first process;

[0243] The second determining module 702 is used to determine the first efficiency of the first process in producing each type of first material and the second efficiency of the second process in consuming each type of first material.

[0244] The first allocation module 703 is used to allocate corresponding cacheable target material type and target roll type to each cache rack based on each first efficiency, each second efficiency and the number of cache racks, with the goal of maximizing the duration of the target state; the target state includes no material blockage in the first process and no material shortage in the second process.

[0245] In some embodiments, the first process includes a plurality of first hosts, each first host being used to produce a first material of a corresponding type; the second process includes a plurality of second hosts, each second host being used to consume consumables in the first material of a corresponding type to produce a second material of a corresponding type; the first allocation module includes: a first allocation unit, used to allocate a corresponding cacheable target material type and target roll type to each cache rack based on a first efficiency of each first host in producing the first material of a corresponding type, a second efficiency of each second host in consuming the first material of a corresponding type, and the number of cache racks, with the goal of maximizing the duration of the target state.

[0246] In some embodiments, each first host is bound to multiple first racks, which are used to place first materials of the corresponding type produced by the first host and / or rolls of the corresponding type required by the first host; each second host is bound to multiple second racks, which are used to place first materials of the corresponding type required by the second host and rolls returned by the second host; the first allocation unit includes an allocation subunit, which is used to allocate corresponding cacheable target material type and target roll type to each cache rack based on a first efficiency of each first host producing first materials of the corresponding type, a second efficiency of each second host consuming first materials of the corresponding type, the number of cache racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, with the goal of maximizing the duration of the target state.

[0247] In some embodiments, the addition module is used to add multiple target racks bound to the target host as new cache racks to the cache rack set when the target host is down, so as to obtain an updated cache rack set; the target host includes the first target host in the first process and / or the second target host in the second process; the second allocation module is used to allocate the corresponding cacheable target material type and target roll type to each updated cache rack based on each first efficiency, each second efficiency and the number of cache racks in the updated cache rack set, with the goal of maximizing the duration of the target state.

[0248] In some embodiments, the production line further includes multiple transport trolleys for transporting the first material and / or rolls between the first host, the buffer rack, and the second host; the first allocation module further includes a second allocation unit for allocating corresponding bufferable target material types and target roll types to each buffer rack based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the transport speed of the transport trolleys, the number of transport trolleys, and the number of buffer racks, with the goal of maximizing the duration of the target state.

[0249] In some embodiments, the transport trolley is used to transport the first material produced by the first host to the second host that needs the first material, or to a buffer rack of a material type that can buffer the first material, and to transport the first material in the buffer rack to the second host that needs the first material; the transport trolley is also used to transport the reel returned by the second host to the first host that needs the reel, or to a buffer rack of a reel type that can buffer the reel, and to transport the reel on the buffer rack to the first host that needs the reel.

[0250] In some embodiments, the first allocation module includes: an acquisition unit, configured to acquire an initial rack allocation scheme set, the rack allocation scheme set including multiple rack allocation schemes, each rack allocation scheme including the cacheable material type and roll type corresponding to each buffer rack; an update unit, configured to update the rack allocation scheme set at least once based on the evaluation index of each rack allocation scheme in the rack allocation scheme set, and determine a target rack allocation scheme from the updated rack allocation scheme set; wherein, during the update process, the evaluation index of each rack allocation scheme is estimated based on the rack allocation scheme, each first efficiency, each second efficiency, and the number of buffer racks, to predict the duration of the target state; and a determination unit, configured to determine the cacheable target material type and target roll type corresponding to each buffer rack based on the target rack allocation scheme.

[0251] In some embodiments, the rack allocation scheme set includes: a first rack allocation scheme set and a second rack allocation scheme set, each including multiple rack allocation schemes; the update unit includes: an update subunit, used to update the first rack allocation scheme set and the second rack allocation scheme set for at least one round based on a genetic algorithm and a particle swarm optimization algorithm, using the evaluation index of each rack allocation scheme as the fitness of the corresponding rack allocation scheme, until the update termination condition is met; and a first determination subunit, used to determine the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set as the target rack allocation scheme.

[0252] In some embodiments, the updating subunit is used to employ a genetic algorithm to update the first rack allocation scheme set with each rack allocation scheme in the first rack allocation scheme set as an individual, thereby obtaining an updated first rack allocation scheme set; employing a particle swarm optimization algorithm to update the second rack allocation scheme set with each rack allocation scheme in the second rack allocation scheme set as a particle, thereby obtaining an updated second rack allocation scheme set; and using the rack allocation scheme with the highest fitness in the updated first rack allocation scheme set, updating the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set again, thereby obtaining a second updated second rack allocation scheme set.

[0253] In some embodiments, the updating unit further includes a first estimation subunit, configured to estimate the duration of the first process without material blockage based on each first efficiency, each second efficiency, and the number of buffer racks, according to the rack allocation scheme, to obtain a first estimated duration; a second estimation subunit, configured to estimate the duration of the second process without material shortage based on each first efficiency, each second efficiency, and the number of buffer racks, according to the rack allocation scheme, to obtain a second estimated duration; and a second determination subunit, configured to determine the evaluation index of the rack allocation scheme based on the first estimated duration and the second estimated duration.

[0254] In some embodiments, the first process includes a plurality of first hosts, each first host being used to produce a first material of a corresponding type; the second process includes a plurality of second hosts, each second host being used to consume consumables in the first material of a corresponding type to produce a second material of a corresponding type; the first estimation subunit is further configured to, according to the rack allocation scheme, estimate the duration of the first process without material blockage based on the first efficiency of each first host in producing the first material of a corresponding type, the second efficiency of each second host in consuming the first material of a corresponding type, and the number of buffer racks, to obtain a first estimated duration; the second estimation subunit is further configured to, according to the rack allocation scheme, estimate the duration of the second process without material shortage based on the first efficiency of each first host in producing the first material of a corresponding type, the second efficiency of each second host in consuming the first material of a corresponding type, and the number of buffer racks, to obtain a second estimated duration.

[0255] In some embodiments, each first host is bound to multiple first racks, which are used to place first materials of the corresponding type produced by the first host and / or rolls of the corresponding type required by the first host; each second host is bound to multiple second racks, which are used to place first materials of the corresponding type required by the second host and rolls returned by the second host; the first estimation subunit is further configured to estimate the duration of the first process without material blockage according to the rack allocation scheme, based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, to obtain a first estimated duration; the second estimation subunit is further configured to estimate the duration of the second process without material shortage according to the rack allocation scheme, based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, to obtain a second estimated duration.

[0256] In some embodiments, the production line further includes multiple transport trolleys for transporting the first material and / or rolls between the first host, the buffer rack, and the second host; the first estimation subunit is further configured to estimate the duration of the first process without material blockage according to the rack allocation scheme, based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer racks, to obtain a first estimated duration; the second estimation subunit is further configured to estimate the duration of the second process without material shortage according to the rack allocation scheme, based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer racks, to obtain a second estimated duration.

[0257] The descriptions of the apparatus embodiments above are similar to those of the method embodiments above, and have similar beneficial effects. In some embodiments, the functions or modules included in the apparatus provided in this disclosure can be used to perform the methods described in the method embodiments above. For technical details not disclosed in the apparatus embodiments of this disclosure, please refer to the descriptions of the method embodiments of this disclosure for understanding.

[0258] It should be noted that, in the embodiments of this disclosure, if the above methods are implemented as software functional modules and sold or used as independent products, they can also be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of this disclosure, or the parts that contribute to related technologies, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the methods of the various embodiments of this disclosure. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), magnetic disks, or optical disks. Thus, the embodiments of this disclosure are not limited to any specific hardware, software, or firmware, or any combination of hardware, software, and firmware.

[0259] This disclosure provides a computer device including a memory and a processor. The memory stores a computer program that can run on the processor. When the processor executes the program, it implements some or all of the steps in the above-described method.

[0260] This disclosure provides a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements some or all of the steps in the above-described method. The computer-readable storage medium can be transient or non-transient.

[0261] This disclosure provides a computer program including computer-readable code. When the computer-readable code is executed in a computer device, a processor in the computer device performs some or all of the steps in the above-described method.

[0262] This disclosure provides a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program. When the computer program is read and executed by a computer, it implements some or all of the steps in the above-described method. This computer program product can be implemented specifically through hardware, software, or a combination thereof. In some embodiments, the computer program product is specifically embodied as a computer storage medium; in other embodiments, the computer program product is specifically embodied as a software product, such as a software development kit (SDK), etc.

[0263] It should be noted that the descriptions of the various embodiments above tend to emphasize the differences between them, while their similarities or commonalities can be referenced interchangeably. The descriptions of the above embodiments of the device, storage medium, computer program, and computer program product are similar to the descriptions of the above method embodiments and have similar beneficial effects. For technical details not disclosed in the embodiments of the device, storage medium, computer program, and computer program product of this disclosure, please refer to the descriptions of the method embodiments of this disclosure for understanding.

[0264] It should be noted that Figure 8 is a schematic diagram of a hardware entity of a computer device in an embodiment of this disclosure. As shown in Figure 8, the hardware entity of the computer device 800 includes: a processor 801, a communication interface 802, and a memory 803, wherein:

[0265] Processor 801 typically controls the overall operation of computer device 800.

[0266] The communication interface 802 enables computer devices to communicate with other terminals or servers over a network.

[0267] The memory 803 is configured to store instructions and applications executable by the processor 801, and can also cache data to be processed or already processed (e.g., image data, audio data, voice communication data, and video communication data) in the processor 801 and various modules in the computer device 800. It can be implemented using flash memory or random access memory (RAM). Data transfer between the processor 801, the communication interface 802, and the memory 803 can be performed via bus 804.

[0268] It should be understood that the phrase "an embodiment" or "one embodiment" throughout the specification means that a specific feature, structure, or characteristic related to the embodiment is included in at least one embodiment of this disclosure. Therefore, "in one embodiment" or "one embodiment" appearing throughout the specification does not necessarily refer to the same embodiment. Furthermore, these specific features, structures, or characteristics can be combined in any suitable manner in one or more embodiments. It should be understood that in the various embodiments of this disclosure, the sequence numbers of the above steps / processes do not imply a sequential order of execution; the execution order of each step / process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this disclosure. The sequence numbers of the above embodiments of this disclosure are merely descriptive and do not represent the superiority or inferiority of the embodiments.

[0269] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0270] In the several embodiments provided in this disclosure, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely illustrative. For example, the division of units is only a logical functional division, and in actual implementation, there may be other division methods, such as: multiple units or components may be combined, or integrated into another system, or some features may be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the various components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0271] The units described above as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; they may be located in one place or distributed across multiple network units; some or all of the units may be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, the functional units in the embodiments of this disclosure may all be integrated into one processing unit, or each unit may be a separate unit, or two or more units may be integrated into one unit; the integrated unit may be implemented in hardware or in a combination of hardware and software functional units.

[0272] Those skilled in the art will understand that all or part of the steps of the above method embodiments can be implemented by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it performs the steps of the above method embodiments. The aforementioned storage medium includes various media that can store program code, such as mobile storage devices, read-only memory (ROM), magnetic disks, or optical disks.

[0273] Alternatively, if the integrated units described above are implemented as software functional modules and sold or used as independent products, they can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this disclosure, or the part that contributes to related technologies, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the methods of the various embodiments of this disclosure. The aforementioned storage medium includes various media capable of storing program code, such as mobile storage devices, ROMs, magnetic disks, or optical disks.

[0274] The above are merely embodiments of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this disclosure should be included within the scope of protection of this disclosure.

Claims

1. A material rack distribution method, the method comprising: A buffer rack set shared by the first and second processes on the production line is determined; the first process is used to produce multiple types of first materials, each type of first material is obtained by winding consumables on a corresponding type of roll; the second process is used to consume the consumables in the first material to produce the second material and to return the roll to the first process after the consumables in the first material are consumed; the buffer rack set includes multiple buffer racks, which are used to buffer the first material to be consumed and / or the roll to be returned to the first process; Determine the first efficiency of the first process in producing each type of first material and the second efficiency of the second process in consuming each type of first material; Based on each of the first efficiency, each of the second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding target material type and target roll type that can be buffered; the target state includes no material blockage in the first process and no material shortage in the second process.

2. The rack dispensing method of claim 1, wherein, The first process includes multiple first main units, each of which is used to produce a first material of a corresponding type; the second process includes multiple second main units, each of which is used to consume consumables from the first material of a corresponding type to produce a second material of a corresponding type. Based on each of the first efficiency, each of the second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, the method of assigning corresponding bufferable target material types and target roll types to each buffer rack includes: Based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding cacheable target material type and target roll type.

3. The rack dispensing method of claim 2, wherein, Each first host is bound to multiple first material racks, which are used to place first materials of the corresponding type produced by the first host and / or rolls of the corresponding type required by the first host; each second host is bound to multiple second material racks, which are used to place first materials of the corresponding type required by the second host and rolls returned by the second host. The method, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer racks, aims to maximize the duration of the target state by assigning corresponding bufferable target material types and target roll types to each buffer rack, including: Based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the number of buffer racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding cacheable target material type and target roll type.

4. The rack dispensing method of claim 3, wherein, The method further includes: If the target host is down, multiple target racks bound to the target host are added as new cache racks to the cache rack set to obtain an updated cache rack set; the target host includes the first target host in the first step and / or the second target host in the second step. Based on each of the first efficiency, each of the second efficiency, and the number of cache racks in the updated cache rack set, with the goal of maximizing the duration of the target state, each of the updated cache racks is assigned a corresponding cacheable target material type and target roll type.

5. The rack distribution method according to any one of claims 2 to 4, wherein, The production line also includes multiple transport trolleys, which are used to transport the first material and / or the roll between the first host, the buffer rack and the second host; The method, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer racks, aims to maximize the duration of the target state by assigning corresponding bufferable target material types and target roll types to each buffer rack, including: Based on the first efficiency of each first host in producing the corresponding type of first material, the second efficiency of each second host in consuming the corresponding type of first material, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer racks, with the goal of maximizing the duration of the target state, each buffer rack is assigned a corresponding bufferable target material type and target roll type.

6. The rack dispensing method of claim 5, wherein, The transport trolley is used to transport the first material produced by the first host to the second host that needs the first material, or to the buffer rack of the material type that can buffer the first material, and to transport the first material in the buffer rack to the second host that needs the first material. The transport trolley is also used to transport the reel returned by the second host to the first host that needs the reel, or a buffer rack of the reel type that can buffer the reel, and to transport the reel on the buffer rack to the first host that needs the reel.

7. The rack dispensing method of any one of claims 1 to 6, wherein, Based on each of the first efficiency, each of the second efficiency, and the number of buffer racks, with the goal of maximizing the duration of the target state, the method of assigning corresponding bufferable target material types and target roll types to each buffer rack includes: Obtain an initial set of rack allocation schemes, which includes multiple rack allocation schemes, each of which includes the cacheable material type and roll type corresponding to each cache rack. Based on the evaluation indicators of each rack allocation scheme in the rack allocation scheme set, the rack allocation scheme set is updated at least once, and a target rack allocation scheme is determined from the updated rack allocation scheme set; wherein, the evaluation indicator of each rack allocation scheme during the update process is obtained by estimating the duration of the target state according to the rack allocation scheme, based on each first efficiency, each second efficiency and the number of buffer racks. Based on the target material rack allocation scheme, the target material type and target roll type that can be cached are determined for each buffer material rack.

8. The rack dispensing method of claim 7, wherein, The rack allocation scheme set includes a first rack allocation scheme set and a second rack allocation scheme set, and the first rack allocation scheme set and the second rack allocation scheme set each include multiple rack allocation schemes; The step of updating the rack allocation scheme set at least once based on the evaluation indicators of each rack allocation scheme in the rack allocation scheme set, and determining the target rack allocation scheme from the updated rack allocation scheme set based on the evaluation indicators of each rack allocation scheme in the updated rack allocation scheme set, includes: Based on genetic algorithm and particle swarm optimization algorithm, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme. The first rack allocation scheme set and the second rack allocation scheme set are updated for at least one round until the update termination condition is met. The updated second rack allocation scheme with the highest adaptability is determined as the target rack allocation scheme.

9. The rack dispensing method of claim 8, wherein, The method, based on genetic algorithm and particle swarm optimization, uses the evaluation index of each rack allocation scheme as the fitness of the corresponding rack allocation scheme, and updates the first rack allocation scheme set and the second rack allocation scheme set for at least one round, including: Using a genetic algorithm, each rack allocation scheme in the first rack allocation scheme set is taken as an individual, and the first rack allocation scheme set is updated for at least one generation of individuals to obtain the updated first rack allocation scheme set. Using the particle swarm optimization algorithm, each rack allocation scheme in the second rack allocation scheme set is used as a particle, and the second rack allocation scheme set is updated by at least one generation of particles to obtain the updated second rack allocation scheme set. Using the shelf allocation scheme with the highest fitness in the updated first shelf allocation scheme set, the shelf allocation scheme with the highest fitness in the updated second shelf allocation scheme set is updated again to obtain the updated second shelf allocation scheme set.

10. The rack dispensing method of any one of claims 7-9, wherein, The evaluation criteria for the material rack allocation scheme are determined in the following manner: According to the material rack allocation scheme, based on each first efficiency, each second efficiency and the number of buffer material racks, the duration of the first process without material blockage is estimated to obtain the first estimated duration. According to the material rack allocation scheme, based on each first efficiency, each second efficiency and the number of buffer material racks, the duration of the second process without material shortage is estimated to obtain the second estimated duration. Based on the first estimated duration and the second estimated duration, the evaluation index of the material rack allocation scheme is determined.

11. The rack dispensing method of claim 10, wherein, The first process includes multiple first main units, each of which is used to produce a first material of a corresponding type; the second process includes multiple second main units, each of which is used to consume consumables from the first material of a corresponding type to produce a second material of a corresponding type. According to the material rack allocation scheme, based on each of the first efficiency, each of the second efficiency, and the number of buffer material racks, the duration of the first process without material blockage is estimated to obtain a first estimated duration, including: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer material racks, the duration of the first process without material blockage is estimated to obtain the first estimated duration. According to the material rack allocation scheme, based on each of the first efficiency, each of the second efficiency, and the number of buffer material racks, the duration of the second process without material shortage is estimated to obtain a second estimated duration, including: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer material racks, the duration of the second process without material shortage is estimated to obtain the second estimated duration.

12. The rack dispensing method of claim 11, wherein, Each first host is bound to multiple first material racks, which are used to place first materials of the corresponding type produced by the first host and / or rolls of the corresponding type required by the first host; each second host is bound to multiple second material racks, which are used to place first materials of the corresponding type required by the second host and rolls returned by the second host. According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer racks, the duration of the first process without material blockage is estimated to obtain a first estimated duration, including: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the number of buffer material racks, the number of first material racks bound to each first host, and the number of second material racks bound to each second host, the duration of the first process without material blockage is estimated to obtain the first estimated duration. According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer racks, the duration of the second process without material shortage is estimated to obtain a second estimated duration, including: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the number of buffer material racks, the number of first material racks bound to each first host, and the number of second material racks bound to each second host, the duration of the second process without material shortage is estimated to obtain the second estimated duration.

13. The rack dispensing method of claim 11 or 12, wherein, The production line also includes multiple transport trolleys, which are used to transport the first material and / or the roll between the first host, the buffer rack and the second host; According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer racks, the duration of the first process without material blockage is estimated to obtain a first estimated duration, including: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer racks, the duration of the first process without material blockage is estimated to obtain the first estimated duration. According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of buffer racks, the duration of the second process without material shortage is estimated to obtain a second estimated duration, including: According to the material rack allocation scheme, based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the transport speed of the transport trolley, the number of transport trolleys, and the number of buffer material racks, the duration of the second process without material shortage is estimated to obtain the second estimated duration.

14. A material rack dispensing device, comprising: The first determining module is used to determine a buffer rack set shared by the first process and the second process on the production line; the first process is used to produce multiple types of first materials, each type of first material is obtained by winding consumables on a corresponding type of roll; the second process is used to consume the consumables in the first material to produce second material and to return the roll to the first process after the consumables in the first material are consumed; the buffer rack set includes multiple buffer racks, which are used to buffer the first material to be consumed and / or the roll to be returned to the first process; The second determining module is used to determine the first efficiency of the first process in producing each type of first material and the second efficiency of the second process in consuming each type of first material. The first allocation module is used to allocate corresponding cacheable target material type and target roll type to each of the buffer racks based on each of the first efficiency, each of the second efficiency and the number of the buffer racks, with the goal of maximizing the duration of the target state; the target state includes no material blockage in the first process and no material shortage in the second process.

15. The rack dispensing apparatus of claim 14, wherein, The first process includes multiple first main units, each of which is used to produce a first material of a corresponding type; the second process includes multiple second main units, each of which is used to consume consumables from the first material of a corresponding type to produce a second material of a corresponding type. The first allocation module includes a first allocation unit, which is used to allocate corresponding cacheable target material type and target roll type to each of the cache racks based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, and the number of cache racks, with the goal of maximizing the duration of the target state.

16. The rack dispensing apparatus of claim 15, wherein, Each first host is bound to multiple first material racks, which are used to place first materials of the corresponding type produced by the first host and / or rolls of the corresponding type required by the first host; each second host is bound to multiple second material racks, which are used to place first materials of the corresponding type required by the second host and rolls returned by the second host. The first allocation unit includes an allocation subunit, which is used to allocate corresponding cacheable target material type and target roll type to each cache rack based on the first efficiency of each first host producing the corresponding type of first material, the second efficiency of each second host consuming the corresponding type of first material, the number of cache racks, the number of first racks bound to each first host, and the number of second racks bound to each second host, with the goal of maximizing the duration of the target state.

17. The rack distribution device of claim 16, wherein, The material rack distribution device further includes: The module is used to add multiple target racks bound to the target host as new cache racks to the cache rack set when the target host is down, thus obtaining an updated cache rack set; the target host includes the first target host in the first process and / or the second target host in the second process; The second allocation module is used to allocate the corresponding cacheable target material type and target roll type to each updated cache rack based on each first efficiency, each second efficiency, and the number of cache racks in the updated cache rack centralization, with the goal of maximizing the duration of the target state.

18. A computer device comprising a memory and a processor, the memory storing a computer program executable on the processor, the processor executing the program to implement the steps of the method of any one of claims 1 to 13.

19. A computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method according to any one of claims 1 to 13.

20. A computer program product comprising computer programs or instructions, which when executed by a processor, implement the steps of the method of any one of claims 1 to 13.

Citation Information

Patent Citations

  • Intelligent warehouse between production processes and control method thereof

    CN114313727A

  • Caching equipment, caching method and caching system for battery cells

    CN117068745A

  • Intelligent production line and intelligent production line cache scheduling method

    CN117923092A

  • Tower type battery cell online caching system and method

    CN118597825A

  • Transmission line material distribution device and distribution control method

    CN118723511A