Rack allocation method, device, equipment, storage medium and program product

Abstract

The embodiment of the present application discloses a material rack allocation method, device, equipment, storage medium and program product, wherein the method includes: determining a cache material 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, the first material is obtained by winding consumables on a roll, the second process is used to produce the second material and return the roll to the first process, and multiple cache material racks in the cache material rack set are used to cache the first material and / or the roll to be returned; determining 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 first efficiency, each second efficiency and the number of cache material racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each cache material rack. In the embodiment of the present application, dynamic allocation of each cache material rack can be achieved.

Description

Technical Field

[0001] The present application relates to but is not limited to the field of intelligent production technology, and in particular to a rack allocation method, device, equipment, storage medium and program product. Background Art

[0002] In modern manufacturing, the efficiency of material flow and storage between processes is crucial to the smoothness of the production process. Different processes can cache and transfer materials and other objects through shared racks. How to allocate the types of objects that can be stored in the racks during the production process has become a technical challenge. In related technologies, the types of objects that can be stored in each rack are manually configured based on experience, and dynamic allocation of racks cannot be achieved. Summary of the invention

[0003] In view of this, the embodiments of the present application at least provide a rack allocation method, device, equipment, storage medium and program product.

[0004] The technical solution of the embodiment of the present application is implemented as follows:

[0005] The present application provides a rack allocation method, the method comprising:

[0006] Determine a cache rack set shared by a first process and a second process on a 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 reel, the second process is used to consume consumables in the first material to produce the second material, and return the reel to the first process after the consumables in the first material are consumed, the cache rack set includes multiple cache racks, and the cache racks are used to cache the first materials to be consumed and / or the reels to be returned to the first process;

[0007] Determine a first efficiency of the first process for producing each type of the first material and a second efficiency of the second process for consuming each type of the first material;

[0008] 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, each cache rack is assigned a corresponding cacheable target material type and target roll type; the target state includes no material blockage in the first process and no material shortage in the second process.

[0009] In the embodiment of the present application, the first process produces multiple types of first materials, and each type of first material is obtained by winding consumables on the corresponding type of reel; the second process consumes the consumables in the first material to produce the second material, and returns the reel to the first process after the consumables in the first material are consumed; determine the cache material rack set shared by the first process and the second process on the production line, and multiple cache material racks in the cache material rack set can cache the first material to be consumed and / or the reel to be returned to the first process; determine the first efficiency of each type of first material and the second efficiency of consuming each type of first material, and based on each first efficiency, each second efficiency and the number of cache material racks, with the goal of maximizing the duration of the target state, allocate the corresponding cacheable target material type and target reel type to each cache material rack; the target state includes that the first process is not blocked and the second process is not short of material. In this way, according to the first efficiency of the first process producing the first material, the second efficiency of the second process consuming the first material and the number of cache material racks, with the goal of maximizing the duration of the first process without blocking and the second process without lack of material, the dynamic allocation of material types and reel types of the cache material racks can be achieved.

[0010] In some embodiments, the first process includes multiple first hosts, each first host is used to produce a corresponding type of first material; the second process includes multiple second hosts, each second host is used to consume consumables in the corresponding type of first material to produce a corresponding type of second material; based on each first efficiency, each second efficiency and the number of cache material racks, with the goal of maximizing the duration of the target state, a corresponding cacheable target material type and a target roll type are allocated to each cache material 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, and the number of cache material racks, with the goal of maximizing the duration of the target state, a corresponding cacheable target material type and a target roll type are allocated to each cache material rack.

[0011] In the above embodiment, 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 cache material racks, the corresponding cacheable target material type and target roll type are allocated to each cache material rack with the goal of maximizing the duration of the target state. This can fully consider 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 cache material racks on the material transportation process, thereby more reasonably realizing the dynamic allocation of material types and roll types of the cache material racks.

[0012] In some embodiments, each first host is bound to multiple first material racks, and the multiple first material racks are used to place the corresponding type of first materials produced by the first host and / or the corresponding type of rolls required by the first host; each second host is bound to multiple second material racks, and the multiple second material racks are used to place the corresponding type of first materials required by the second host and the rolls returned by 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 cache material racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each cache material 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 cache 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, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each cache material rack.

[0013] In the above embodiment, the multiple first material racks bound to each first host are used to place the corresponding type of first materials produced by the first host and / or the corresponding type of rolls required by the first host; the multiple second material racks bound to each second host are used to place the corresponding type of first materials required by the second host and the rolls returned by the second host; by according to the first efficiency of each first host in producing the corresponding type of first materials, the second efficiency of each second host in consuming the corresponding type of first materials, the number of cache 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, with the goal of maximizing the duration of no material blockage in the first process and no material shortage in the second process, the corresponding cacheable target material type and target roll type are allocated to each cache material rack, which can fully consider the impact of the number of first material racks bound to each first host and the number of second material racks bound to the second host on the material transportation process, thereby more reasonably realizing the dynamic allocation of material types and roll types of the cache material racks.

[0014] In some embodiments, the method also includes: in the event that the target host is shut down, multiple target material racks bound to the target host are added to the cache material rack set as new cache material racks to obtain an updated cache material 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 material racks in the updated cache material rack set, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each updated cache material rack.

[0015] In the above embodiment, when the target host is shut down, multiple target material racks bound to the target host are added to the cache material rack set as new cache material racks to obtain an updated cache material rack set, and each first efficiency, each second efficiency and the number of cache material racks in the updated cache material rack set are calculated, with the goal of maximizing the duration of the target state, and the target material type and target roll type are re-allocated to each updated cache material rack, which can improve the utilization and flexibility of the material racks.

[0016] In some embodiments, the production line also includes multiple transport carts, which are used to transport the first material and / or roll between the first host, the cache 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 cache racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each cache 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 cart, the number of transport carts and the number of cache racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each cache rack.

[0017] In the above embodiment, the production line also includes a plurality of transport carts, which are used to transport the first material and / or roll between the first host, the buffer rack and the second host. By allocating corresponding cacheable 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 cart, the number of transport carts and the number of buffer racks, the influence of the transport speed of the transport cart and the number of transport carts on the material transportation process can be fully considered, thereby realizing a more reasonable dynamic allocation of material types and roll types to the buffer racks.

[0018] In some embodiments, the transport cart is used to transport the first material produced by the first host to the second host that requires the first material, or a cache rack of a material type that can cache the first material, and to transport the first material in the cache rack to the second host that requires the first material; the transport cart is also used to transport the rolls returned from the second host to the first host that requires the rolls, or a cache rack of a roll type that can cache the rolls, and to transport the rolls on the cache rack to the first host that requires the rolls.

[0019] In the above embodiment, the first material produced by the first host is transported by a transport cart to the second host that requires the first material, or a cache rack of a material type that can cache the first material, and the first material in the cache rack is transported to the second host that requires the first material; the reel returned from the second host can also be transported by a transport cart to the first host that requires the reel, or a cache rack of a reel type that can cache the reel, and the reel on the cache rack is transported to the first host that requires the reel, thereby realizing the flow of the first material and the reel between the first process and the second process.

[0020] In some embodiments, based on each first efficiency, each second efficiency and the number of cache material racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each cache material rack, including: obtaining an initial set of rack allocation schemes, the rack allocation scheme set including multiple rack allocation schemes, the rack allocation schemes including cacheable material types and roll types corresponding to each cache material rack; based on the evaluation indicators of each rack allocation scheme in the rack allocation scheme set, updating the rack allocation scheme set for at least one round, and determining the target rack allocation scheme from the updated rack allocation scheme set; wherein, during the updating process, the evaluation indicators of each rack allocation scheme are 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 cache material racks; based on the target rack allocation scheme, determining the cacheable target material type and target roll type corresponding to each cache material rack.

[0021] In the above embodiment, the material rack allocation plan set is updated at least once based on the evaluation indicators of each material rack allocation plan in the material rack allocation plan set, and a better target material rack allocation plan is determined from the updated material rack allocation plan set. Based on the target material rack allocation plan, corresponding cacheable target material types and target roll types can be allocated to each cache material rack.

[0022] In some embodiments, the rack allocation plan set includes a first rack allocation plan set and a second rack allocation plan set, and the first rack allocation plan set and the second rack allocation plan set respectively include multiple rack allocation plans; based on the evaluation index of each rack allocation plan in the rack allocation plan set, the rack allocation plan set is updated for at least one round, and based on the evaluation index of each rack allocation plan in the updated rack allocation plan set, a target rack allocation plan is determined from the updated rack allocation plan set, including: based on a genetic algorithm and a particle swarm algorithm, the evaluation index of each rack allocation plan is used as the fitness of the corresponding rack allocation plan, and the first rack allocation plan set and the second rack allocation plan set are updated for at least one round until the update termination condition is met; the rack allocation plan with the highest fitness in the updated second rack allocation plan set is determined as the target rack allocation plan.

[0023] In the above embodiment, based on the genetic algorithm and the particle swarm algorithm, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme, and 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, and the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set is determined as the target rack allocation scheme. The diversity of the genetic algorithm solution and the global search capability of the particle swarm algorithm can be fully utilized to obtain a better target rack allocation scheme.

[0024] In some embodiments, based on a genetic algorithm and a particle swarm algorithm, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme, and 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, taking each rack allocation scheme in the first rack allocation scheme set as an individual, and updating the first rack allocation scheme set for at least one generation of individuals to obtain an updated first rack allocation scheme set; using a particle swarm algorithm, taking each rack allocation scheme in the second rack allocation scheme set as a particle, and updating the second rack allocation scheme set for at least one generation of particles to obtain an updated second rack allocation scheme set; using the rack allocation scheme with the highest fitness in the updated first rack allocation scheme set to update the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set again, to obtain an updated second rack allocation scheme set.

[0025] In the above embodiment, a genetic algorithm is used to perform at least one generation of individual updates on the first rack allocation plan set to obtain an updated first rack allocation plan set; a particle swarm algorithm is used to perform at least one generation of particle updates on the second rack allocation plan set to obtain an updated second rack allocation plan set; the rack allocation plan with the highest fitness in the updated first rack allocation plan set is used to update the rack allocation plan with the highest fitness in the updated second rack allocation plan set to obtain an updated second rack allocation plan set; the individual optimal solution of the genetic algorithm can be used to update the global optimal solution of the particle swarm algorithm, thereby improving the solution efficiency and solution accuracy of the particle swarm algorithm, thereby accelerating the acquisition of a better rack allocation plan.

[0026] In some embodiments, the evaluation index of the material rack allocation scheme is determined in the following manner: according to the material rack allocation scheme, based on each first efficiency, each second efficiency and the number of cache material racks, the duration of the first process without material blockage is estimated to obtain a first estimated duration; according to the material rack allocation scheme, based on each first efficiency, each second efficiency and the number of cache material 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 material rack allocation scheme is determined.

[0027] In the above embodiment, according to the material rack allocation plan, the duration of the first process without material blockage and the duration of the second process without material shortage are estimated respectively according to each first efficiency, each second efficiency and the number of cache material racks, to obtain the first estimated duration and the second estimated duration, and the evaluation index is determined according to the first estimated duration and the second estimated duration. The evaluation index of the material rack allocation plan can comprehensively consider the duration of the first process without material blockage and the duration of the second process without material shortage, so that optimizing the material rack allocation plan based on the evaluation index can obtain a more accurate and reasonable material rack allocation plan.

[0028] The present application provides a rack distribution device, which includes:

[0029] The first determination module is used to determine a cache rack set shared by a first process and a second process on a 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 reel, the second process is used to consume consumables in the first material to produce the second material, and return the reel to the first process after the consumables in the first material are consumed, and the cache rack set includes multiple cache racks, and the cache racks are used to cache the first materials to be consumed and / or the reels to be returned to the first process;

[0030] A second determination module is used to determine a first efficiency of the first process in producing each type of the first material and a second efficiency of the second process in consuming each type of the first material;

[0031] The first allocation module is used to allocate corresponding cacheable target material types and target roll types to each cache material rack based on each first efficiency, each second efficiency and the number of cache material 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.

[0032] An embodiment of the present application provides a computer device, including a memory and a processor, wherein the memory stores a computer program that can be run on the processor, and when the processor executes the program, some or all of the steps in the above method are implemented.

[0033] An embodiment of the present application provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, some or all of the steps in the above method are implemented.

[0034] An embodiment of the present application provides a computer program product, including a computer program or instructions. When the computer program or instructions are executed by a processor, some or all of the steps in the above method are implemented.

[0035] 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 the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] The drawings herein are incorporated into the specification and constitute a part of the specification. These drawings illustrate embodiments consistent with the present application and are used together with the specification to illustrate the technical solution of the present application.

[0037] Figure 1 A schematic diagram of material flow between processes on a production line provided in an embodiment of the present disclosure Figure 1 ;

[0038] Figure 2 A schematic diagram of the implementation flow of a rack allocation method provided in an embodiment of the present disclosure;

[0039] Figure 3 A schematic diagram of material flow between processes on a production line provided in an embodiment of the present disclosure Figure 2 ;

[0040] Figure 4 A schematic diagram of material flow between processes on a production line provided in an embodiment of the present disclosure Figure 3 ;

[0041] Figure 5 A schematic diagram of material flow between processes on a production line provided in an embodiment of the present disclosure Figure 4 ;

[0042] Figure 6A schematic diagram of a process flow of implementing a rack allocation method based on a genetic algorithm and a particle swarm algorithm provided in an embodiment of the present disclosure;

[0043] Figure 7 A schematic diagram of the structure of a rack distribution device provided in an embodiment of the present application;

[0044] Figure 8 A hardware entity diagram of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0045] In order to make the purpose, technical solutions and advantages of the present application clearer, the technical solutions of the present application are further elaborated in detail below in conjunction with the drawings and embodiments. The described embodiments should not be regarded as limiting the present application. All other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present application.

[0046] In the following description, reference is made to “some embodiments”, which describe a subset of all possible embodiments, but it will be 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.

[0047] The terms "first / second / third" involved are merely used to distinguish similar objects and do not represent a specific ordering of the objects. It is understandable that "first / second / third" can be interchanged with a specific order or sequence where permitted so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein.

[0048] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein are only for the purpose of describing this application and are not intended to limit this application.

[0049] The present application embodiment provides a rack allocation method. Figure 1 A schematic diagram of material flow between processes on a production line provided in an embodiment of the present application Figure 1 The first process 110 is used to produce multiple types of first materials 111, the second process 120 is used to consume consumables in the first material 111 to produce the second material, and after the consumables in the first material 111 are consumed, the reel 121 is returned to the first process 110, and the buffer rack 130 is used to buffer the first material 111 to be consumed and / or the reel 121 to be returned to the first process 110;

[0050] Figure 2 A schematic diagram of the implementation process of a rack allocation method provided in an embodiment of the present application is shown in FIG. Figure 1As shown, the method includes the following steps S201 to S203:

[0051] Step S201: determining a cache rack set shared by a first process and a second process on a 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 reel, the second process is used to consume consumables in the first material to produce the second material, and return the reel to the first process after the consumables in the first material are consumed, the cache rack set includes multiple cache racks, and the cache racks are used to cache the first materials to be consumed and / or the reels to be returned to the first process;

[0052] Here, the first process and the second process are two adjacent processes on the production line, wherein the second process is the next process of the first process, that is, the second process consumes the first material produced by the first process to produce the second material.

[0053] Multiple cache racks in the cache rack concentration are used to cache the first material produced in the first process and the rolls returned after the consumables in the first material are consumed in the second process. Each cache rack is configured with cacheable material types and roll types, and each cache rack can only cache first materials and rolls of the corresponding type.

[0054] In some embodiments, the types of rolls around which each type of first material is wound may be the same or different.

[0055] In some embodiments, the material type and the roll type configured for each buffer rack may or may not correspond one-to-one, that is, the roll type and the material type that each buffer rack can cache may or may not correspond one-to-one. In other words, each buffer rack can cache a material type and the roll type corresponding to the roll that can be used to produce the first material of this type.

[0056] In some embodiments, when a second process needs to consume a certain type of first material, the first material of that type is sent to the second process.

[0057] In some embodiments, when a certain type of first material is not needed to be consumed in the second process, the first material of this type is sent to a buffer rack for buffering.

[0058] In some embodiments, the cache rack is first-in-first-out, and the first material or roll that comes out first is sent to the corresponding type of cache rack first, and the first material or roll placed on the cache rack first will be used first.

[0059] Step S202: determining a first efficiency of the first process for producing each type of the first material and a second efficiency of the second process for consuming each type of the first material;

[0060] In some embodiments, when the hosts of each process operate normally and the material racks and cache material racks bound to each host have no failures, 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.

[0061] In some embodiments, in the event of a failure in the operation of the host of each process, a failure in the material rack bound to each host, or a failure in the cache material 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.

[0062] Step S203: 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, corresponding cacheable target material types and target roll types are allocated to each cache rack; the target state includes no material jam in the first process and no material shortage in the second process.

[0063] Here, material blockage in the first process refers to that the first material fills up the material rack, resulting in no place to put the first material produced in the first process, so that the first process is blocked.

[0064] The second process is short of material when the second process needs to consume the first material and there is no consumable first material in the second process.

[0065] In some embodiments, based on each first efficiency, each second efficiency, and the material type and roll type of the current cache rack configuration, the duration during which the first process is not blocked and the second process is not short of material is calculated, and the material type and roll type that can be cached by each cache rack is continuously updated with the goal of maximizing the duration, to obtain the final target material type and target roll type that can be cached by each cache rack.

[0066] In some embodiments, a first material rack allocation plan set is randomly generated, and a target value corresponding to the target state is determined according to each first efficiency, each second efficiency, and the material type and roll type of the current cache material rack configuration, that is, the duration during which the first process is not blocked and the second process is not short of material. The first material rack allocation plan set is continuously iterated using a genetic algorithm, and each material rack allocation plan in the first material rack allocation plan set is evaluated using the target value as the fitness. When the genetic algorithm meets the convergence conditions, the final material rack allocation plan is obtained.

[0067] In some embodiments, a second material rack allocation scheme set is randomly generated, and a target value corresponding to the target state is determined according to each first efficiency, each second efficiency, and the material type and roll type of the current cache material rack configuration. Each material rack allocation scheme in the second material rack allocation scheme set is the position of each particle in the particle swarm algorithm. The first material rack allocation scheme set is continuously iterated using the particle swarm algorithm, and each material rack allocation scheme in the second material rack allocation scheme set is evaluated using the target value as the fitness. When the particle swarm algorithm meets the convergence conditions, the final material rack allocation scheme is obtained.

[0068] In some embodiments, based on each first efficiency, each second efficiency, the inventory of initial materials consumed in the first process for producing the first material, the number of rolls in the first process and the second process (i.e., rolls without wound consumables), the number of cache racks for placing the first material or rolls between the first process and the second process, and the material type and roll type currently configured in the cache rack, corresponding cacheable target material types and target roll types are assigned to each cache rack.

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

[0070] In some implementations, the production status of each host and all racks on the production line is collected in real time, and in the event of a failure of a host or rack, the material type and roll type of the cache rack are reallocated in a timely manner.

[0071] In the embodiment of the present application, the first process produces multiple types of first materials, and each type of first material is obtained by winding consumables on the corresponding type of reel; the second process consumes the consumables in the first material to produce the second material, and returns the reel to the first process after the consumables in the first material are consumed; determine the cache material rack set shared by the first process and the second process on the production line, and multiple cache material racks in the cache material rack set can cache the first material to be consumed and / or the reel to be returned to the first process; determine the first efficiency of each type of first material and the second efficiency of consuming each type of first material, and based on each first efficiency, each second efficiency and the number of cache material racks, with the goal of maximizing the duration of the target state, allocate the corresponding cacheable target material type and target reel type to each cache material rack; the target state includes that the first process is not blocked and the second process is not short of material. In this way, according to the first efficiency of the first process producing the first material, the second efficiency of the second process consuming the first material and the number of cache material racks, with the goal of maximizing the duration of the first process without blocking and the second process without lack of material, the dynamic allocation of material types and reel types of the cache material racks can be achieved.

[0072] In some embodiments, Figure 3 A schematic diagram of material flow between processes on a production line provided in an embodiment of the present application Figure 2 The first process 110 includes a plurality of first hosts 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 hosts 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;

[0073] The above step S203 may include the following step S211:

[0074] Step S211: 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 cache racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each cache rack.

[0075] In some embodiments, each first host in the first process may produce the same first material or different first materials.

[0076] In some embodiments, each second host in the second process may require the same type of first material, or may require a different type of first material.

[0077] In some embodiments, 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 types and roll types that can be cached by the current cache rack, the duration during which the first process is not blocked and the second process is not short of material is calculated, and the material types and roll types that can be cached by each cache rack are continuously updated with the goal of maximizing the duration, so as to obtain the final target material types and target roll types that can be cached by each cache rack.

[0078] In the above embodiment, 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 cache material racks, the corresponding cacheable target material type and target roll type are allocated to each cache material rack with the goal of maximizing the duration of the target state. This can fully consider 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 cache material racks on the material transportation process, thereby more reasonably realizing the dynamic allocation of material types and roll types of the cache material racks.

[0079] In some embodiments, Figure 4A schematic diagram of material flow between processes provided in an embodiment of the present application Figure 3 Each first host 112 is bound to a plurality of first material racks 113, and the plurality of first material racks 113 are used to place the first materials 111 of the corresponding type produced by the first host 112 and / or the rolls 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, and the plurality of second material racks 123 are used to place the first materials 111 of the corresponding type required by the second host 122 and the rolls 121 returned by the second host 122;

[0080] The above step S211 may include the following step S221:

[0081] Step S221: 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 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, corresponding cacheable target material types and target roll types are allocated to each cache rack.

[0082] The first efficiency refers to the production efficiency of the first host in producing the first material of the corresponding type; the second efficiency refers to the consumption efficiency of the second host in consuming the first material of the corresponding type. For example, if a first host is used to produce the first material of the first type, and if the first host can produce 30 first materials of the first type per hour, then the first efficiency corresponding to the first host is 30 per hour. For another example, if a second host is used to consume the first material of the second type, and if the second host can consume 20 first materials of the second type per hour, then the second efficiency corresponding to the second host is 20 per hour. The first efficiencies corresponding to each first host may be the same or different; the second efficiencies corresponding to each second host may be the same or different.

[0083] In some implementations, each first host may be bound to a plurality of first racks; and each second host may be bound to a plurality of second racks.

[0084] In some embodiments, each first material rack may be placed with one type of first material and roll, or may be placed with multiple types of first materials and rolls. That is, the first material may have multiple models. For example, a winding process is used to wind the positive electrode sheet, the separator and the negative electrode sheet on a winding needle or a winding drum in sequence to form a cylindrical structure, and the first material of the material type is a cylindrical battery; for another example, the positive electrode sheet, the negative electrode sheet and the separator are stacked together in a certain order and manner, and a winding machine is used to wind the stacked electrodes and separators to form a square structure, and the first material of the material type is a square battery.

[0085] In some embodiments, when there is a rack failure in each first rack, each second rack or each cache rack, the number of racks will decrease, and it is necessary to update the number of first racks, the number of second racks and the number of cache racks, and reconfigure the target material type and the target roll type of the cache rack, that is, 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 updated cache racks, the number of updated first racks, and the number of updated second racks, with the goal of maximizing the duration of the target state, each updated cache rack is assigned a corresponding cacheable target material type and target roll type to prevent material shortage or blockage.

[0086] In the above embodiment, the multiple first material racks bound to each first host are used to place the corresponding type of first materials produced by the first host and / or the corresponding type of rolls required by the first host; the multiple second material racks bound to each second host are used to place the corresponding type of first materials required by the second host and the rolls returned by the second host; by according to the first efficiency of each first host in producing the corresponding type of first materials, the second efficiency of each second host in consuming the corresponding type of first materials, the number of cache 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, with the goal of maximizing the duration of no material blockage in the first process and no material shortage in the second process, the corresponding cacheable target material type and target roll type are allocated to each cache material rack, which can fully consider the impact of the number of first material racks bound to each first host and the number of second material racks bound to the second host on the material transportation process, thereby more reasonably realizing the dynamic allocation of material types and roll types of the cache material racks.

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

[0088] Step S231: when the target host is shut down, multiple target racks bound to the target host are added to the cache rack set as new cache racks 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;

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

[0090] Step S232: Based on each first efficiency, each second efficiency and the number of cache racks in the updated cache rack center, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each updated cache rack.

[0091] In some implementations, the updated cache rack set includes the previous cache rack and the target rack unbound from the shut down target host.

[0092] In the above embodiment, when the target host is shut down, multiple target material racks bound to the target host are added to the cache material rack set as new cache material racks to obtain an updated cache material rack set, and each first efficiency, each second efficiency and the number of cache material racks in the updated cache material rack set are calculated, with the goal of maximizing the duration of the target state, and the target material type and target roll type are re-allocated to each updated cache material rack, which can improve the utilization and flexibility of the material racks.

[0093] In some embodiments, the production line further includes a plurality of transport carts, which are used to transport the first material and / or roll between the first host, the buffer rack, and the second host;

[0094] The above step S211 may include the following step S241:

[0095] Step S241: 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 cart, the number of transport carts and the number of cache racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each cache rack.

[0096] In some embodiments, the material flow on the production line is achieved through multiple transport carts.

[0097] In some embodiments, the transport vehicle may be an Automatic Guided Vehicle (AGV).

[0098] In some embodiments, the transport vehicle transports the first material produced by the first process to a corresponding type of buffer rack or a second process, and transports the first material in the buffer rack to the second process.

[0099] In some embodiments, when the transport cart moves the first material to the buffer rack or the second process, it will detect whether there are rolls that have consumed the consumables in the first material. If there are rolls, the rolls will be returned to the first process for the production of the first material. This can improve the transportation efficiency and thus improve the efficiency of material flow on the entire production line.

[0100] In some embodiments, the transport vehicle receives a transport instruction, and the transport vehicle transports the first material or roll to a target location according to a driving path.

[0101] In some embodiments, the method is executed by a warehouse management system running on a host computer. In response to receiving a loading request sent by the second process, the warehouse management system sends a transport instruction to a transport cart, and the transport cart moves the first material of the corresponding type from the unloading position or the buffer rack of the first process to the loading position of the second process. When the warehouse management system detects the presence of a roll in the second process, the warehouse management system sends a transport instruction to the transport cart, and the transport cart moves the roll from the loading position of the second process to the unloading position or the buffer rack of the first process.

[0102] In some embodiments, in response to receiving a material unloading request sent by the first process, the warehouse management system sends a transport instruction to the transport vehicle, and the transport vehicle moves the first material from the unloading position of the first process to the buffer rack or the loading position of the second process.

[0103] In some embodiments, when the first material exists in the first process, the lower computer in the first process, such as a programmable logic controller (PLC), sends a transport instruction to the transport vehicle, and the transport vehicle transports the first material to the loading position or buffer rack of the second process.

[0104] In some embodiments, when the second process is short of material, the lower computer in the second process, such as a PLC, sends a transport instruction to the transport cart, and the transport cart moves the first material of the corresponding type in the unloading position or the cache rack in the first process to the loading position of the second process.

[0105] In some embodiments, when the second process requires the first material of the corresponding type, the transport vehicle preferentially transports the first material of the corresponding type on the first material rack to the second process; when the first material of the corresponding type does not exist on the first material rack, the first material of the corresponding type on the cache material rack is transported to the second process.

[0106] In some embodiments, the first material of the corresponding type on the cache rack may be preferentially transported to the second process. If the first material of the corresponding type does not exist on the cache rack, the first material of the corresponding type on the first rack may be transported to the second process.

[0107] In some embodiments, when the second process has no shortage of materials of the corresponding type, the transport vehicle can transport the first material to the buffer material rack.

[0108] In some embodiments, the rolls in the second process are preferentially transported to the first process, and when there is no empty space on the corresponding type of rack in the first rack, the transport vehicle transports the rolls to the corresponding type of cache rack.

[0109] In some embodiments, the first material produced in the first process is preferentially placed on the first material rack of the corresponding type, and when there is no empty space on the first material rack of the corresponding type, the first material is placed on the cache material rack of the corresponding type. In some embodiments, 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 cart, the number of transport carts, the number of cache material racks, and the material types and roll types that can be cached by the current cache material racks, the duration of the first process without material blockage and the second process without material shortage is solved, and the material types and roll types that can be cached by each cache material rack are continuously updated with the goal of maximizing the duration, so as to obtain the final target material types and roll types that can be cached by each cache material rack.

[0110] In the above embodiment, the production line also includes a plurality of transport carts, which are used to transport the first material and / or roll between the first host, the buffer rack and the second host. By allocating corresponding cacheable 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 cart, the number of transport carts and the number of buffer racks, the influence of the transport speed of the transport cart and the number of transport carts on the material transportation process can be fully considered, thereby realizing a more reasonable dynamic allocation of material types and roll types to the buffer racks.

[0111] In some embodiments, the transport cart is used to transport the first material produced by the first host to the second host that requires the first material, or a cache material rack of a material type that can cache the first material, and to transport the first material in the cache material rack to the second host that requires the first material;

[0112] The transport cart is also used to carry the rolls returned from the second host to the first host that requires the rolls, or to a roll-type cache rack that can cache the rolls, and to carry the rolls on the cache rack to the first host that requires the rolls.

[0113] In some embodiments, the transport cart is used to carry the first material and the roll between the first process, the second process and the buffer material rack.

[0114] In some embodiments, when a first material of a certain type is required in a second process, the transport vehicle transports the first material from the first process to the second process.

[0115] In some embodiments, when there is a roll in the second process that has consumed all the consumables in the first material, and there are empty positions of the corresponding type on the buffer rack or the first rack, the transport vehicle moves the roll to the first process or the buffer rack.

[0116] In the above embodiment, the first material produced by the first host is transported by a transport cart to the second host that requires the first material, or a cache rack of a material type that can cache the first material, and the first material in the cache rack is transported to the second host that requires the first material; the reel returned from the second host can also be transported by a transport cart to the first host that requires the reel, or a cache rack of a reel type that can cache the reel, and the reel on the cache rack is transported to the first host that requires the reel, thereby realizing the flow of the first material and the reel between the first process and the second process.

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

[0118] Step S281: obtaining an initial rack allocation plan set, wherein the rack allocation plan set includes a plurality of rack allocation plans, and the rack allocation plan includes cacheable material types and roll types corresponding to each cache rack;

[0119] In some implementations, a plurality of rack allocation solutions of a rack allocation solution set are initialized, for example, 100 rack allocation solutions are initialized.

[0120] In some embodiments, a material rack allocation plan includes material types and roll types corresponding to each cache material rack.

[0121] Step S282: Based on the evaluation index of each rack allocation scheme in the rack allocation scheme set, the rack allocation scheme set is updated for at least one round, and a target rack allocation scheme is determined from the updated rack allocation scheme set; wherein the evaluation index of each rack allocation scheme in the updating 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 cache racks;

[0122] In some embodiments, the evaluation indicators of each material rack allocation plan during the update process can also be obtained by estimating the duration of the target state according to the material rack allocation plan, 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 cache material racks.

[0123] In some embodiments, the evaluation indicators of each rack allocation plan during the update process can also be obtained by estimating the duration of the target state according to the rack allocation plan, 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 cache racks, the number of first racks bound to each first host, and the number of second racks bound to each second host.

[0124] In some embodiments, the evaluation indicators of each material rack allocation plan during the update process can also be obtained by estimating the duration of the target state according to the material rack allocation plan, 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 cart, the number of transport carts, and the number of cache material racks.

[0125] Step S283: Based on the target material rack allocation plan, determine the target material type and target roll type that can be cached corresponding to each cache material rack.

[0126] In the above embodiment, the material rack allocation plan set is updated at least once based on the evaluation indicators of each material rack allocation plan in the material rack allocation plan set, and a better target material rack allocation plan is determined from the updated material rack allocation plan set. Based on the target material rack allocation plan, corresponding cacheable target material types and target roll types can be allocated to each cache material rack.

[0127] In some embodiments, the rack allocation solution set includes a first rack allocation solution set and a second rack allocation solution set, and the first rack allocation solution set and the second rack allocation solution set respectively include a plurality of rack allocation solutions;

[0128] The above step S282 may include the following steps S251 and S252:

[0129] Step S251: Based on the genetic algorithm and the particle swarm algorithm, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme, and 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;

[0130] In some embodiments, the rack allocation solution set includes a first rack allocation solution set and a second rack allocation solution set.

[0131] In some implementations, the first rack allocation solution set and the second rack allocation solution set are updated at least once using a genetic algorithm and a particle swarm algorithm, respectively.

[0132] In some implementations, the population size of the genetic algorithm is initialized to, for example, 50 individuals, each of which is a rack allocation solution in the first rack allocation solution set.

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

[0134] In some implementations, the initialization of the particle swarm algorithm also requires initializing the position and velocity of each particle. The initialization method can be random generation or other methods, which are not limited in this application.

[0135] In some implementations, one round corresponding to the genetic algorithm and one round corresponding to the particle swarm algorithm can be set according to actual needs, and this application does not impose any restrictions on this.

[0136] In some embodiments, a genetic algorithm is used to perform at least one generation of individual updates on a rack allocation plan set until the genetic algorithm meets the convergence condition, thereby obtaining an updated rack allocation plan set; the updated rack allocation plan set is used as the starting position of a particle swarm algorithm, and the particle swarm algorithm is used to continue to perform at least one generation of individual updates on the updated rack allocation plan set until the particle swarm algorithm meets the convergence condition, thereby obtaining a final rack allocation plan set, and the rack allocation plan with the highest fitness in the final rack allocation plan set is selected as the target rack allocation plan.

[0137] Step S252: Collect the updated second rack allocation plans and determine the rack allocation plan with the highest adaptability as the target rack allocation plan.

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

[0139] In the above embodiment, based on the genetic algorithm and the particle swarm algorithm, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme, and 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, and the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set is determined as the target rack allocation scheme. The diversity of the genetic algorithm solution and the global search capability of the particle swarm algorithm can be fully utilized to obtain a better target rack allocation scheme.

[0140] In some embodiments, the above step S251 may include the following steps S261 to S263:

[0141] Step S261: using a genetic algorithm, taking 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 of individuals, and obtaining an updated first rack allocation scheme set;

[0142] 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 application.

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

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

[0145] In some embodiments, the material type and roll type of the cache 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.

[0146] In some embodiments, a mutation rate is selected and the values ​​of some genes are randomly changed, that is, the material type and roll type of the cache rack are randomly changed.

[0147] Step S262: using a particle swarm algorithm, taking each rack allocation scheme in the second rack allocation scheme set as a particle, updating the second rack allocation scheme set by at least one generation of particles, and obtaining an updated second rack allocation scheme set;

[0148] In some implementations, the position of each particle in the particle swarm algorithm represents a rack allocation solution.

[0149] Step S263: using the rack allocation scheme with the highest fitness in the updated first rack allocation scheme set, the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set is updated again to obtain a second rack allocation scheme set that is updated again.

[0150] In some embodiments, the rack allocation scheme with the highest fitness value in the first rack allocation scheme set after each round of update is compared with the fitness value of the rack allocation scheme with the highest fitness value in the second rack allocation scheme set after the round of update. When the fitness value of the rack allocation scheme in the first rack allocation scheme set is greater than the fitness value of the rack allocation scheme in the second rack allocation scheme set, the rack allocation scheme with the largest fitness value in the first rack allocation scheme set is determined as the rack allocation scheme with the highest fitness value in the second rack allocation scheme set, and the next round of updating is continued.

[0151] In the above embodiment, a genetic algorithm is used to perform at least one generation of individual updates on the first rack allocation plan set to obtain an updated first rack allocation plan set; a particle swarm algorithm is used to perform at least one generation of particle updates on the second rack allocation plan set to obtain an updated second rack allocation plan set; the rack allocation plan with the highest fitness in the updated first rack allocation plan set is used to update the rack allocation plan with the highest fitness in the updated second rack allocation plan set to obtain an updated second rack allocation plan set; the individual optimal solution of the genetic algorithm can be used to update the global optimal solution of the particle swarm algorithm, thereby improving the solution efficiency and solution accuracy of the particle swarm algorithm, thereby accelerating the acquisition of a better rack allocation plan.

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

[0153] Step S271: according to the rack allocation plan, based on each first efficiency, each second efficiency and the number of cache racks, the duration of the first process without material blockage is estimated to obtain a first estimated duration;

[0154] In some embodiments, according to the rack allocation plan, the duration of the first process without material blockage is estimated based on each first efficiency, each second efficiency, the number of cache racks, the handling rate of the transport cart, and the number of available transport carts to obtain a first estimated duration.

[0155] Step S272: according to the rack allocation plan, based on each first efficiency, each second efficiency and the number of cache racks, estimating the duration of the second process without material shortage to obtain a second estimated duration;

[0156] In some embodiments, according to the material rack allocation plan, the duration of the second process without material shortage is estimated based on each first efficiency, each second efficiency, the number of cache material racks, the transport rate of the transport cart, and the number of available transport carts to obtain the second estimated duration.

[0157] Step S273: Determine the evaluation index of the rack allocation plan based on the first estimated duration and the second estimated duration.

[0158] 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):

[0159] (1);

[0160] In formula (1), is the second estimated duration; is the first estimated duration;α , β is the weight parameter.

[0161] In some implementations, the larger the first estimated duration and the second estimated duration, the larger the fitness value, and the corresponding rack allocation solution is more optimal.

[0162] In the above embodiment, according to the material rack allocation plan, the duration of the first process without material blockage and the duration of the second process without material shortage are estimated respectively according to each first efficiency, each second efficiency and the number of cache material racks, to obtain the first estimated duration and the second estimated duration, and the evaluation index is determined according to the first estimated duration and the second estimated duration. The evaluation index of the material rack allocation plan can comprehensively consider the duration of the first process without material blockage and the duration of the second process without material shortage, so that optimizing the material rack allocation plan based on the evaluation index can obtain a more accurate and reasonable material rack allocation plan.

[0163] The following describes the application of the embodiments of the present application in actual scenarios.

[0164] In modern manufacturing, the efficiency of material flow and storage between processes is crucial to the smoothness of the production process. Especially in the environment of using automatic guided vehicles, how to manage and plan the types of objects that can be stored in the rack during the production process has become a technical challenge. The related technologies rely on manual or simple automation systems, which often lead to poor material flow due to host shutdown or rack failure, affecting the overall production efficiency.

[0165] In the related art, for process A and process B, each host in process A (corresponding to the first process in the aforementioned embodiment) will be bound to n host racks (corresponding to the first rack in the aforementioned embodiment), and each host in process B (corresponding to the second process in the aforementioned embodiment) will be bound to m host racks (corresponding to the second rack in the aforementioned embodiment), and the host rack is only bound to this host. There are p common cache racks between processes A and B, and each cache rack is manually configured with the type of materials and empty roll types that can be placed before production based on experience. Therefore, the following situations may occur: when a host in process A or process B stops working, the n or m host racks bound to the host will be locked and no longer 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 rack fails, the total number of racks available to the corresponding host is reduced, which may cause material blockage or shortage; for the cache racks, the configuration has been determined before the production of materials. If modification is required, it is necessary to manually determine how many cache racks are required for each material based on experience and reconfigure, which lacks flexibility and emergency response capabilities.

[0166] Based on the above description, the embodiment of the present application proposes a rack allocation method based on genetic algorithm and particle swarm algorithm. This method can solve the problems of rack resource waste and inflexible cache rack configuration caused by host shutdown or rack failure in the related art, and improve the efficiency of material circulation and storage.

[0167] The specific implementation of the rack allocation method based on genetic algorithm and particle swarm algorithm proposed in the embodiment of the present application may include the following three parts:

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

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

[0170] The parameter settings in the system are as follows:

[0171] 1) There are n unloading racks bound to one A process host, and m loading racks bound to one B process host. Each rack can only hold one pallet of material or one pallet of rolls, and materials or rolls can only be delivered to this rack when the rack is empty. Each rack bound to A and B processes is configured with the roll type and material type that can be stored (one material type corresponds to one roll type), and the material type of each rack bound to the host is the same as the material type produced by the host.

[0172] 2) There are k hosts in process A and h hosts in process B.

[0173] 3) There are p shared cache racks (not bound to the host) between process A and process B, which can be used to store materials or empty rolls. Each cache rack is configured with the roll type and material type that can be stored (one material type corresponds to one roll type), and the cache rack is in first-in-first-out mode. The first extra material or roll that meets the conditions will be sent to the cache area (i.e., cache rack) first, filling up the rack.

[0174] 4) For any type of material, if process B needs to feed materials (the material racks of some hosts of process B meet the feeding condition F, that is, the host of process B does not run out of materials), then the materials on the material racks or cache material racks of the host of process A will be sent to the material racks of process B equipped with this material type; if the host of process B does not need to feed materials, and the cache material racks equipped with this material type have empty positions, the materials of this material type produced by the host of process A will be sent to the cache material racks. The same is true for reels. First, the reels on the material racks of the host of process B are sent to the material racks of the host of process A (the material racks of some hosts of process A meet the empty return condition D, that is, there are empty positions on the loading racks of some hosts of process A); if process A does not meet the empty return condition D, the reels on the material racks of the host of process B are sent to the cache material racks.

[0175] 5) Each host in process A may produce the same material or different materials. The roll types of each material may be the same or different. Only one material can be produced at the same time, which can be configured according to production needs.

[0176] 6) Each host in process B may require the same material or different materials. Only one type of material is required at the same time.

[0177] 7) The material delivery and roll delivery between process A, process B and the buffer rack share x sets of automatic guided vehicles, which can be used to transport materials or rolls. After the vehicle transports materials to a host in process B, if this host has rolls that meet the empty return condition D (that is, there are empty rolls), and process A or the buffer rack has empty racks, it will transport the empty rolls to process A or the buffer rack.

[0178] 8) The feeding condition F and the empty return condition D are system content logic, which are generally fixed and can be configured by personnel according to the on-site conditions. Other lowercase letters (the number of material racks bound to one host in process A n\the number of material racks bound to one host in process B m\the number of cache racks p\the number of hosts in process A k\the number of hosts in process B h\the number of automatic guided vehicles x) are determined before the system goes online according to different bases and are generally not modified.

[0179] Part II: System Logic;

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

[0181] 2) Shutdown processing: When the host shuts down, the system automatically converts its rack to a cache rack (which is then rebound to the host rack when the host restarts).

[0182] 3) Algorithm optimization: Combining genetic algorithm and particle swarm optimization algorithm, the system analyzes the following information of process A, process B and cache racks: inventory and storage racks of each material, number of each roll and storage rack, number of empty racks, number of tasks being executed, number of available automatic guided vehicles, efficiency of materials produced by each machine in process A, efficiency of materials consumed by each machine in process B, and speed of automatic guided vehicles between each available rack. The cache racks (including p cache racks that are cache racks themselves and cache racks allocated in the second step of shutdown processing) are reallocated (the number of hosts decreases, the number of cache racks increases, and reallocation is required), that is, the system automatically reconfigures the waiting material type and roll type of each empty cache rack, so as to ensure that under the conditions of limited number of automatic guided vehicles and limited materials and racks, each machine in process B can reach the longest time without lack of materials, and each host in process A can reach the maximum time without blocking materials (blocking material definition: when the materials fill up the racks and the host has no place to put the materials produced by the host, the host will be blocked and production will stop).

[0183] Part III: Optimization algorithm steps.

[0184] The rack allocation method based on genetic algorithm and particle swarm algorithm is as follows Figure 6 As shown, it may include steps S601 to S608:

[0185] Step S601: define the problem and the objective function;

[0186] Goal: To ensure that the main machine of the downstream process is not short of materials for a long time and the main machine of the upstream process is not blocked by materials.

[0187] Objective function: Assume that the objective function is f(X) ,in X For a rack allocation plan, each rack allocation plan may include [(Rack1, Type1, Drum1), ...], where Rack1 is rack number 1, Type1 is required material type 1, and Drum1 is required drum type.

[0188] The material type may include Type[100, 200, 300, ...], where Type1 may be the subscript of a material type in Type[]; the drum type may include Drum[10, 20, 30, ...], where Drum1 may be the subscript of a drum type in Drum[].

[0189] Objective Function f(X) is defined as the weighted sum of multiple sub-goals, see formula (1). In formula (1), is the duration of time during which the main machine of process B is not short of materials (corresponding to the second estimated duration in the above embodiment); is the duration of time during which the main machine of process A is not blocked (corresponding to the first estimated duration in the above embodiment); α , β is the weight parameter, such as α =0.8, β =0.2.

[0190] According to 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 is not blocked and process B is not short of material. Determine the target value based on the estimated duration during which process A is not blocked and process B is not short of material.

[0191] Step S602: Initialization;

[0192] 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 of a rack. N GA The initial population of the genetic algorithm is obtained by using individuals.

[0193] Particle swarm algorithm initialization: Initialize the particle swarm size of the particle swarm algorithm to N PSO (e.g. 50 particles), the position of the particles X i Indicates the rack distribution plan, speed V i Represents the adjustment amount, initializes the position and speed of the particle (randomly generates the initial position and adjustment amount of each particle).

[0194] Step S603: Evaluate fitness;

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

[0196] Step S604: genetic algorithm operation;

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

[0198] Calculate the relative fitness of each individual p i :

[0199] (2);

[0200] According to the relative fitness of each individual p i , calculate the cumulative probability (the sum of the selection probabilities of all individuals before each individual) c i :

[0201] (3);

[0202] Generate random numbers r In the interval [0, 1), select the first one that makes the cumulative probability Individual i When reproducing as a parent individual, the greater the fitness of each individual, the greater the probability that the individual will be selected.

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

[0204] Select the crossover rate p c ,like p c = 0.8, randomly pair individuals and generate a crossover point at which genes are exchanged. For example, for two selected parent individuals A and B, the crossover point is k , generate new individuals A' and B', see formula (4) and formula (5) respectively:

[0205] (4);

[0206] (5);

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

[0208] Select mutation rate P m ,like p m = 0.05, perform gene mutation operations on some individuals and randomly change individual gene values. For example, select the gene position of individual A k , randomly changing it to A k ' .

[0209] The above selection, crossover and mutation operations are performed sequentially.

[0210] Step S605: Particle swarm algorithm operation;

[0211] The velocity update of each particle can be found in formula (6):

[0212] (6);

[0213] in, w is the inertia weight, such as 0.5; γ 1 and γ 2 are the individual learning factor and the group learning factor, respectively. γ 1=1.5, γ 1=1.5; r 1 and r 2 is a random number in the range of [0, 1]; p i,best For particles i The historical optimal position (individual optimality); G best is the global optimal position; X i (t) It is i The scheme is t The position update of each particle can refer to formula (7):

[0214] (7);

[0215] The position of the particle at time t+1 is determined based on the position of the particle at time t and the adjustment amount at time t+1 (i.e., the speed at time t+1).

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

[0217] If the best position among all particles is improved, the global best position is updated G best .

[0218] Step S606: Algorithm fusion

[0219] After each round of genetic algorithm is completed, the optimal individual in the genetic algorithm is updated to the global optimal position of the particle swarm algorithm. G best .

[0220] The specific steps are as follows:

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

[0222] 2) Continue to run the particle swarm algorithm for several generations (such as 20 generations) and take X GA_best and G best The better one is G best , guiding the particle swarm to search for a better solution;

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

[0224] Step S607: determining the termination condition;

[0225] Maximum number of iterations: Check whether the maximum number of iterations is reached, such as 200.

[0226] Solution stability: Checks whether the quality of the solution has stabilized or is no longer improving significantly.

[0227] When the maximum number of iterations is reached or the stability of the solution is reached, it is determined that the genetic algorithm and the particle swarm algorithm meet the termination condition, and the process proceeds to step S608; when the maximum number of iterations is not reached and the stability of the solution is not reached, it is determined that the genetic algorithm and the particle swarm algorithm do not meet the termination condition, and the process proceeds to step S604.

[0228] Step S608: Output the final solution.

[0229] The global optimal particle of the particle swarm algorithm is selected as the final solution.

[0230] Based on the foregoing embodiments, the embodiments of the present application provide a material rack distribution device, which includes the modules included, and the units included in the modules, etc., which can be implemented by a processor in a computer device; of course, it can also be implemented by a specific logic circuit; in the implementation process, the processor can be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP) or a field programmable gate array (FPGA), etc.

[0231] Figure 7 A schematic diagram of the structure of a rack distribution device provided in an embodiment of the present application is shown in FIG. Figure 7 As shown, the rack allocation device 700 includes: a first determination module 701, a second determination module 702 and a first allocation module 703, wherein:

[0232] The first determination module 701 is used to determine a cache rack set shared by a first process and a second process on a 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 reel, the second process is used to consume consumables in the first material to produce the second material, and return the reel to the first process after the consumables in the first material are consumed, and the cache rack set includes multiple cache racks, and the cache racks are used to cache the first materials to be consumed and / or the reels to be returned to the first process;

[0233] A second determination module 702 is used to determine a first efficiency of producing each type of first material in the first process and a second efficiency of consuming each type of first material in the second process;

[0234] The first allocation module 703 is used to allocate corresponding cacheable target material types and target roll types to each cache material rack based on each first efficiency, each second efficiency and the number of cache material 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.

[0235] In some embodiments, the first process includes multiple first hosts, each first host is used to produce a corresponding type of first material; the second process includes multiple second hosts, each second host is used to consume consumables in the corresponding type of first material to produce a corresponding type of second material; the first allocation module includes: a first allocation unit, which is used to allocate corresponding cacheable target material types and target roll types to each cache material 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, and the number of cache material racks, with the goal of maximizing the duration of the target state.

[0236] In some embodiments, each first host is bound to multiple first racks, and the multiple first racks are used to place the corresponding type of first materials produced by the first host and / or the corresponding type of rolls required by the first host; each second host is bound to multiple second racks, and the multiple second racks are used to place the corresponding type of first materials required by the second host and the rolls returned by the second host; the first allocation unit includes an allocation sub-unit, which is used to allocate corresponding cacheable target material types and target roll types to each cache rack based on the first efficiency of each first host in producing the corresponding type of first materials, the second efficiency of each second host in consuming the corresponding type of first materials, 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.

[0237] In some embodiments, a joining module is used to add multiple target material racks bound to the target host as new cache material racks to the cache material rack set when the target host is shut down, so as to obtain an updated cache material 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 corresponding cacheable target material types and target roll types to each updated cache material rack based on each first efficiency, each second efficiency and the number of cache material racks in the updated cache material rack set, with the goal of maximizing the duration of the target state.

[0238] In some embodiments, the production line also includes multiple transport carts, which are used to transport the first material and / or roll between the first host, the cache rack and the second host; the first distribution module also includes a second distribution unit, which is used to allocate the corresponding cacheable target material type and target roll type to each cache 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 cart, the number of transport carts and the number of cache racks, with the goal of maximizing the duration of the target state.

[0239] In some embodiments, the transport cart is used to transport the first material produced by the first host to the second host that requires the first material, or a cache rack of a material type that can cache the first material, and to transport the first material in the cache rack to the second host that requires the first material; the transport cart is also used to transport the rolls returned from the second host to the first host that requires the rolls, or a cache rack of a roll type that can cache the rolls, and to transport the rolls on the cache rack to the first host that requires the rolls.

[0240] In some embodiments, the first allocation module includes: an acquisition unit, used to acquire an initial material rack allocation plan set, the material rack allocation plan set includes multiple material rack allocation plans, and the material rack allocation plan includes cacheable material types and roll types corresponding to each cache material rack; an update unit, used to update the material rack allocation plan set for at least one round based on the evaluation indicators of each material rack allocation plan in the material rack allocation plan set, and determine the target material rack allocation plan from the updated material rack allocation plan set; wherein, the evaluation indicator of each material rack allocation plan during the update process is obtained by estimating the duration of the target state according to the material rack allocation plan, based on each first efficiency, each second efficiency and the number of cache material racks; a determination unit, used to determine the cacheable target material type and target roll type corresponding to each cache material rack based on the target material rack allocation plan.

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

[0242] In some embodiments, the update subunit is used to adopt a genetic algorithm, taking each rack allocation scheme in the first rack allocation scheme set as an individual, and performing at least one generation of individual updates on the first rack allocation scheme set to obtain an updated first rack allocation scheme set; adopt a particle swarm algorithm, taking each rack allocation scheme in the second rack allocation scheme set as a particle, and performing at least one generation of particle updates on the second rack allocation scheme set to obtain an updated second rack allocation scheme set; use the rack allocation scheme with the highest fitness in the updated first rack allocation scheme set to update the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set again to obtain an updated second rack allocation scheme set.

[0243] In some embodiments, the update unit also includes a first estimation subunit, which is used to estimate the duration of the first process without material blockage according to the material rack allocation plan based on each first efficiency, each second efficiency and the number of cache material racks, so as to obtain a first estimated duration; a second estimation subunit, which is used to estimate the duration of the second process without material shortage according to the material rack allocation plan based on each first efficiency, each second efficiency and the number of cache material racks, so as to obtain a second estimated duration; and a second determination subunit, which is used to determine the evaluation index of the material rack allocation plan based on the first estimated duration and the second estimated duration.

[0244] The description of the above device embodiment is similar to the description of the above method embodiment, and has similar beneficial effects as the method embodiment. In some embodiments, the functions or modules included in the device provided in the embodiment of the present application can be used to execute the method described in the above method embodiment. For technical details not disclosed in the device embodiment of the present application, please refer to the description of the method embodiment of the present application for understanding.

[0245] It should be noted that in the embodiments of the present application, if the above method is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application can be essentially or partly reflected in the form of a software product that contributes to the relevant technology. The software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods of each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a disk or an optical disk. In this way, the embodiments of the present application are not limited to any specific hardware, software or firmware, or any combination of hardware, software, and firmware.

[0246] An embodiment of the present application provides a computer device, including a memory and a processor, wherein the memory stores a computer program that can be run on the processor, and when the processor executes the program, some or all of the steps in the above method are implemented.

[0247] The embodiment of the present application provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, some or all of the steps in the above method are implemented. The computer-readable storage medium can be transient or non-transient.

[0248] An embodiment of the present application provides a computer program, including a computer-readable code. When the computer-readable code is run in a computer device, a processor in the computer device executes some or all of the steps for implementing the above method.

[0249] The embodiment of the present application provides a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program, and when the computer program is read and executed by a computer, some or all of the steps in the above method are implemented. The computer program product can be implemented in hardware, software, or a combination thereof. In some embodiments, the computer program product is specifically embodied as a computer storage medium, and in other embodiments, the computer program product is specifically embodied as a software product, such as a software development kit (SDK), etc.

[0250] It should be noted here that the description of the various embodiments above tends to emphasize the differences between the various embodiments, and the same or similar aspects can be referenced to each other. The description of the above device, storage medium, computer program and computer program product embodiments is similar to the description of the above method embodiment, and has similar beneficial effects as the method embodiment. For technical details not disclosed in the embodiments of the device, storage medium, computer program and computer program product of this application, please refer to the description of the method embodiment of this application for understanding.

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

[0252] Processor 801 generally controls the overall operation of computer device 800 .

[0253] The communication interface 802 enables the computer device to communicate with other terminals or servers through a network.

[0254] The memory 803 is configured to store instructions and applications executable by the processor 801, and can also cache data to be processed or processed by the processor 801 and each module in the computer device 800 (for example, image data, audio data, voice communication data, and video communication data), which can be implemented by flash memory (FLASH) or random access memory (Random Access Memory, RAM). Data can be transmitted between the processor 801, the communication interface 802, and the memory 803 through the bus 804.

[0255] It should be understood that "one embodiment" or "an embodiment" mentioned throughout the specification means that specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, "in one embodiment" or "in an embodiment" appearing throughout the specification does not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It should be understood that in various embodiments of the present application, the size of the serial number of each step / process mentioned above does not mean the order of execution, and 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 embodiment of the present application. The serial numbers of the embodiments of the present application mentioned above are for description only and do not represent the advantages and disadvantages of the embodiments.

[0256] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

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

[0258] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units; they may be located in one place or distributed on multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. In addition, the functional units in the embodiments of the present application may be all integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above integrated units may be implemented in the form of hardware or in the form of hardware plus software functional units.

[0259] A person skilled in the art can understand that: all or part of the steps of implementing the above method embodiment can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps of the above method embodiment; and the aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, read-only memories (ROM), magnetic disks or optical disks.

[0260] Alternatively, if the above-mentioned integrated unit of the present application is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can essentially or in other words, the part that contributes to the relevant technology can be embodied in the form of a software product, which is stored in a storage medium and includes a number of instructions for a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the methods of each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROMs, magnetic disks, or optical disks.

[0261] The above is only an implementation method of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by any technician familiar with the technical field within the technical scope disclosed in the present application should be included in the protection scope of the present application.

Claims

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

2. The rack distribution method according to claim 1, characterized in that: 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; Based on each of the first efficiencies, each of the second efficiencies, and the number of the cache racks, with the goal of maximizing the duration of the target state, the corresponding cacheable target material type and target roll type are allocated to each of the cache racks, including: Based on the first efficiency of each of the first hosts in producing the corresponding type of first material, the second efficiency of each of the second hosts in consuming the corresponding type of first material, and the number of the cache racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each of the cache racks.

3. The rack distribution method according to claim 2, characterized in that: Each of the first hosts is bound with a plurality of first material racks, and the plurality of first material racks are used to place first materials of corresponding types produced by the first hosts and / or rolls of corresponding types required by the first hosts; each of the second hosts is bound with a plurality of second material racks, and the plurality of second material racks are used to place first materials of corresponding types required by the second hosts and rolls returned by the second hosts; Based on the first efficiency of each of the first hosts producing the first material of the corresponding type, the second efficiency of each of the second hosts consuming the first material of the corresponding type, and the number of the cache racks, and with the goal of maximizing the duration of the target state, the corresponding cacheable target material type and target roll type are allocated to each of the cache racks, including: Based on the first efficiency of each of the first hosts in producing the corresponding type of first material, the second efficiency of each of the second hosts in consuming the corresponding type of first material, the number of the cache racks, the number of the first racks bound to each of the first hosts, and the number of the second racks bound to each of the second hosts, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each of the cache racks.

4. The rack distribution method according to claim 3, characterized in that: The method further comprises: In the case where the target host is shut down, multiple target racks bound to the target host are added to the cache rack set as new cache racks 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 of the first efficiency, each of the second efficiency and the number of concentrated cache racks in the updated cache racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each of the updated cache racks.

5. The rack distribution method according to claim 2, characterized in that: The production line further includes a plurality of transport carts, which are used to transport the first material and / or the roll between the first host, the buffer rack and the second host; Based on the first efficiency of each of the first hosts producing the first material of the corresponding type, the second efficiency of each of the second hosts consuming the first material of the corresponding type, and the number of the cache racks, and with the goal of maximizing the duration of the target state, the corresponding cacheable target material type and target roll type are allocated to each of the cache racks, including: Based on the first efficiency of each of the first hosts in producing the corresponding type of first material, the second efficiency of each of the second hosts in consuming the corresponding type of first material, the transport speed of the transport cart, the number of the transport carts and the number of the cache racks, with the goal of maximizing the duration of the target state, corresponding cacheable target material types and target roll types are allocated to each of the cache racks.

6. The rack distribution method according to claim 5, characterized in that: The transport trolley is used to transport the first material produced by the first host to the second host that requires the first material, or to a cache rack of a material type that can cache the first material, and to transport the first material in the cache rack to the second host that requires the first material; The transport cart is also used to carry the rolls returned from the second host to the first host that requires the rolls, or to a roll-type cache rack that can cache the rolls, and to carry the rolls on the cache rack to the first host that requires the rolls.

7. The rack distribution method according to any one of claims 1 to 6, characterized in that: Based on each of the first efficiencies, each of the second efficiencies, and the number of the cache racks, with the goal of maximizing the duration of the target state, the corresponding cacheable target material type and target roll type are allocated to each of the cache racks, including: Acquire an initial rack allocation scheme set, wherein the rack allocation scheme set includes a plurality of rack allocation schemes, and the rack allocation schemes include cacheable material types and roll types corresponding to each cache rack; Based on the evaluation index of each rack allocation scheme in the rack allocation scheme set, the rack allocation scheme set is updated for at least one round, and a target rack allocation scheme is determined from the updated rack allocation scheme set; wherein the evaluation index of each rack allocation scheme in the updating 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 cache racks; Based on the target material rack allocation scheme, the target material type and target roll type that can be cached corresponding to each cache material rack are determined.

8. The rack distribution method according to claim 7, characterized in that: The rack allocation scheme set includes a first rack allocation scheme set and a second rack allocation scheme set, wherein the first rack allocation scheme set and the second rack allocation scheme set respectively include a plurality of rack allocation schemes; The step of updating the rack allocation scheme set for at least one round based on the evaluation index 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 based on the evaluation index of each rack allocation scheme in the updated rack allocation scheme set includes: Based on the genetic algorithm and the particle swarm algorithm, the evaluation index of each rack allocation scheme is used as the fitness of the corresponding rack allocation scheme, and 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 rack allocation scheme with the highest adaptability among the second rack allocation schemes is determined as the target rack allocation scheme.

9. The rack distribution method according to claim 8, characterized in that: The method based on the genetic algorithm and the particle swarm algorithm, taking the evaluation index of each rack allocation scheme as the fitness of the corresponding rack allocation scheme, and updating the first rack allocation scheme set and the second rack allocation scheme set for at least one round, comprises: Using a genetic algorithm, taking 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, and obtaining an updated first rack allocation scheme set; Using a particle swarm algorithm, taking each rack allocation scheme in the second rack allocation scheme set as a particle, updating the second rack allocation scheme set by at least one generation of particles, and obtaining an updated second rack allocation scheme set; The rack allocation scheme with the highest fitness in the updated first rack allocation scheme set is used to update the rack allocation scheme with the highest fitness in the updated second rack allocation scheme set again to obtain a second rack allocation scheme set that is updated again.

10. The rack distribution method according to claim 7, characterized in that: The evaluation index of the rack allocation scheme is determined in the following manner: According to the rack allocation scheme, based on each of the first efficiencies, each of the second efficiencies, and the number of the cache racks, the duration of the first process without material blockage is estimated to obtain a first estimated duration; According to the rack allocation plan, based on each of the first efficiencies, each of the second efficiencies, and the number of the cache 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, an evaluation index of the material rack allocation plan is determined.

11. A rack distribution device, characterized in that: include: The first determination module is used to determine a cache rack set shared by a first process and a second process on a production line; the first process is used to produce multiple types of first materials, each type of the first material is obtained by winding consumables on a corresponding type of reel, the second process is used to consume consumables in the first material to produce the second material, and return the reel to the first process after the consumables in the first material are consumed, the cache rack set includes multiple cache racks, and the cache racks are used to cache the first materials to be consumed and / or the reels to be returned to the first process; A second determination module is used to determine a first efficiency of the first process in producing each type of the first material and a second efficiency of the second process in consuming each type of the first material; The first allocation module is used to allocate corresponding cacheable target material types and target roll types to each cache material rack based on each of the first efficiency, each of the second efficiency and the number of the cache material racks, with the goal of maximizing the duration of the target state; the target state includes that the first process has no material jam and the second process has no material shortage.

12. A computer device comprising a memory and a processor, wherein the memory stores a computer program executable on the processor, wherein: When the processor executes the program, the steps in the method according to any one of claims 1 to 10 are implemented.

13. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps in the method according to any one of claims 1 to 10 are implemented.

14. A computer program product comprising a computer program or instructions, characterized in that When the computer program or instruction is executed by a processor, the steps in the method according to any one of claims 1 to 10 are implemented.

Images