Assembly line aided design method and system based on genetic algorithm, medium and equipment

By using a genetic algorithm-based method, the average time for a production line to complete a batch of products is quantified. Combined with the site area, this solves the problem of lack of quantitative evaluation in production line design, and improves the efficiency of production line optimization design and resource utilization.

CN120850728APending Publication Date: 2025-10-28武汉工商学院
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202510778518.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-11
Publication Date
2025-10-28

AI Technical Summary

Technical Problem

Existing technologies lack quantitative evaluation methods when designing production lines, making it difficult to obtain stable and efficient production line solutions with good operating efficiency.

Method used

Using a genetic algorithm-based approach, the average time for a production line to complete a batch of products is quantified, and the site area is used as a representative resource to calculate the optimal design scheme for the production line under various resource conditions.

Benefits of technology

It provides a series of efficient and quantitative pipeline optimization design schemes, which can optimize pipeline design under different resource conditions and improve resource utilization efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120850728A_ABST
    Figure CN120850728A_ABST
Patent Text Reader

Abstract

The invention discloses an assembly line aided design method and system based on a genetic algorithm, a medium and equipment. The method comprises the following steps: obtaining each process of an assembly line of batch products and all selectable candidate site areas; calculating a time result required for completing the batch of products in each process of the assembly line; and on the basis of a genetic algorithm and the time result, performing calculation to obtain an assembly line design scheme corresponding to each candidate site in all the candidate site areas. Therefore, the site area is used as a representative resource, and a series of assembly line optimization design schemes under various resource conditions can be provided by accurately quantifying the average time of completing batch products by the assembly line.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of pipeline design technology, and in particular to a pipeline-aided design method, system, medium, and device based on a genetic algorithm. Background Technology

[0002] An assembly line is a mode of operation that maintains continuous operation of facilities, personnel, and other resources as much as possible, and is widely used in product manufacturing, maintenance, and other fields. The process principle diagram of an assembly line addresses the question of "can the assembly line work?"; however, in the actual design of an assembly line scheme, it is also necessary to comprehensively consider costs and benefits to address the question of "is the assembly line efficient?". If we consider the resources involved in the assembly line, such as space, facilities, and personnel, as costs, and the performance of the assembly line as benefits, then the optimization design problem of the assembly line can be viewed as the optimization problem of how to obtain a higher-performance assembly line under the constraint of limited resources.

[0003] The process schematic diagram of an assembly line is often a highly complex flowchart, but it also contains many common local structural diagrams. Local diagrams with the same structure often have multiple design drawings with different structural forms. Generally, the smallest unit in the assembly line process schematic diagram is called a process step, while the smallest unit in the design drawing is called a module.

[0004] Currently, the design of production lines relies heavily on designers' subjective experience with front-line production lines. Evaluation of design schemes is largely qualitative, lacking methods for accurately evaluating production line schemes quantitatively. This makes it difficult to consistently and efficiently obtain production line solutions with good operational efficiency during the design and improvement process. Therefore, the question of how to design parallelizable processes in the process schematic into efficient operating modules on the production line is an urgent problem to be solved. Summary of the Invention

[0005] This invention provides a pipeline-aided design method, system, medium, and equipment based on a genetic algorithm. Using site area as a representative resource, it can provide a series of pipeline optimization design schemes under various resource conditions by accurately quantifying the average time for the pipeline to complete a batch of products. Firstly, a pipeline-aided design method based on a genetic algorithm is provided, comprising the following steps: Obtain the area of ​​each process in the production line for the batch of products and all available candidate sites; Calculate the time required for each process in the production line to complete the batch of products. Based on the genetic algorithm and the time results, the pipeline design scheme corresponding to each candidate site among all the candidate site areas is calculated.

[0006] In some embodiments, the step of calculating the time required for each process in the production line to complete the batch of products includes: If the process The time required to complete one task follows an exponential distribution. When, the probability density function is Then the process The average time to complete a batch of products is The variance is ; If the process The time required to complete one task follows a gamma distribution. When, the probability density function is Then the process The average time to complete a batch of products is The variance is ; If the process The time required to complete one task follows a normal distribution. When, the probability density function is Then the process The average time to complete a batch of products is The variance is ; In the formula, For the batch product quantity; for the exponential distribution, It is the mean parameter; for the gamma distribution; These are shape parameters. It is a scale parameter; for a normal distribution, It is the mean parameter. It is the root variance parameter.

[0007] In some embodiments, the step of calculating the pipeline design scheme corresponding to each candidate site among all the candidate site areas based on the genetic algorithm and the time result includes: The pipeline is randomly decoded into including An array of process features, wherein the features in the array are 1~ Natural numbers between; A target pipeline is obtained based on a set of randomly decoded arrays; In a target production line, the average time required for the target production line to complete a batch of products is calculated based on the time required for a batch of products, and the total area required for the target production line is also calculated. Based on the total area and average time required for the target pipeline, calculate the fitness of the target pipeline in each candidate site for the candidate site area; In each candidate site, the target pipeline with the lowest fitness is selected to obtain the pipeline design scheme.

[0008] In some embodiments, the step of obtaining a target pipeline based on a set of randomly decoded arrays includes: Processes with the same characteristics are sequentially grouped into the same pipeline module, while processes with different characteristics are grouped into different pipeline modules, resulting in a target pipeline. The target pipeline includes multiple different pipeline modules.

[0009] In some embodiments, the method for calculating the average time required for the target production line to complete a batch of products based on the time required for the batch of products is shown in the following formula:

[0010] In the formula, The average time required for the target pipeline to complete a batch of products; K is the number of pipeline modules included in the target pipeline; k is a module number variable between 1 and K; This is the sum of the average times for all processes within one of the production line modules to complete a batch of products. This represents the sum of the time variances for all processes within one of the production line modules to complete a batch of products; x is the time variable for completing the batch of products.

[0011] In some embodiments, the method for calculating the fitness of the target pipeline in each candidate site for the candidate site area based on the total area required by the target pipeline and the average time is shown in the following formula: The total area required for the target pipeline As shown in the following formula:

[0012] One of the candidate sites in the candidate site area In the middle, comparison and ; If the total area required ,but Exceed degree ; If the total area required ,but Exceed degree As shown in the following formula:

[0013] Calculate the fitness of the target pipeline in each candidate site of the candidate site area. As shown in the following formula:

[0014] In the formula, K represents the number of pipeline modules included in the target pipeline. For one of the pipeline modules The maximum area occupied by all processes within the facility; It is a process in an assembly line; The number of processes; For process Average time to complete a batch of products; The average time required for the target production line to complete a batch of products.

[0015] In some embodiments, the method for selecting the target pipeline with the minimum fitness in each candidate site to obtain the pipeline design scheme is shown in the following formula:

[0016] In the formula, For the first Candidate sites The corresponding target pipeline design scheme; The total area required for the design scheme of the target production line; The average time required to complete a batch of products for the target production line design; An array corresponding to the target pipeline design scheme.

[0017] Secondly, a pipeline-aided design system based on a genetic algorithm is provided, including: The process acquisition module is used to acquire the area of ​​each process in the production line of a batch of products and all available candidate sites. The time calculation module, communicatively connected to the process acquisition module, is used to calculate the time required for each process in the production line to complete the batch of products; and, The scheme design module is communicatively connected to the process acquisition module and the time calculation module, and is used to calculate the production line design scheme corresponding to each candidate site among all the candidate site areas based on the genetic algorithm and the time result.

[0018] Thirdly, a computer-readable storage medium is provided, on which a computer program is stored, which, when executed by a processor, implements the pipeline-aided design method based on genetic algorithms as described above.

[0019] Fourthly, an electronic device is provided, including a storage medium, a processor, and a computer program stored in the storage medium and executable on the processor, characterized in that the processor, when running the computer program, implements the pipeline-aided design method based on the genetic algorithm as described above.

[0020] Compared with the prior art, the advantages of the present invention are as follows: by using site area as a representative resource and accurately quantifying the average time for a batch of products to be completed by the production line, a series of production line optimization design schemes under various resource conditions can be provided. Attached Figure Description

[0021] Figure 1 This is a flowchart illustrating an embodiment of a pipeline-aided design method based on a genetic algorithm according to the present invention. Figure 2 This is a schematic diagram of a process design scheme for an assembly line; Figure 3 This is another schematic diagram of the assembly line process design; Figure 4 This is a schematic diagram of the optimal pipeline design scheme selected from Table 3; Figure 5 This is a simulation verification of the average time for the production line to complete a batch of products. Detailed Implementation

[0022] Referring now to specific embodiments of the invention, examples of which are illustrated in the accompanying drawings. Although the invention will be described in conjunction with specific embodiments, it will be understood that it is not intended to limit the invention to the described embodiments. Rather, it is intended to cover variations, modifications, and equivalents included within the spirit and scope of the invention as defined by the appended claims. It should be noted that the method steps described herein can be implemented by any functional block or functional arrangement, and any functional block or functional arrangement can be implemented as a physical entity or a logical entity, or a combination of both.

[0023] To enable those skilled in the art to better understand the present invention, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0024] Note: The examples described below are merely specific examples and are not intended to limit the embodiments of the present invention to the specific steps, values, conditions, data, order, etc. Those skilled in the art can utilize the concept of the present invention to construct more embodiments not mentioned herein by reading this specification.

[0025] The process schematic diagram of an assembly line is often a highly complex flowchart, but it also contains many common local structural diagrams. Local diagrams with the same structure often have multiple design forms. For ease of description, this invention refers to the smallest unit in the assembly line process schematic diagram as a process step, and the smallest unit in the design diagram as a module.

[0026] Figure 2(a) is a common type of local branch structure in a production line diagram. It describes three parallel processes A, B, and C that can work simultaneously, and process Z, which can only begin after all three processes are completed. From a product maintenance perspective, a product component consists of parts A, B, and C. Processes A, B, and C are responsible for inspecting and adjusting the parameters of their respective parts. There is no specific order requirement between these three processes; they can be performed simultaneously. Process Z assembles the three qualified parts after processes A, B, and C have been completed. Each process consumes a certain amount of resources (space, personnel, special tools, etc.) during operation. This paper stipulates that parallel processes A, B, and C will "release" these resources when not in operation, and these idle resources can be used by other processes.

[0027] Figure 2 (b) is a design scheme diagram of the production line, in which module 1 includes process A and process B. Within this module, operation can only proceed in the order of completing process A first, followed by process B. Since process A and process B cannot be performed simultaneously, these two processes can share the resources of this module. , , , These are the area of ​​space required for processes A, B, C, and Z, respectively. , , , These are the completion times for each process in one operation.

[0028] but Figure 2 (a) The time for the assembly line to complete one component is The area occupied is . Figure 1 (b) The production line takes 1 hour to complete one component. The area occupied is .

[0029] Obviously Figure 2 (b) than Figure 2 (a) It requires less space and saves more resources, but it also increases the product completion time. Based on similar... Figure 1 Given the process flow diagram, and considering both resource costs and performance, how can we design a high-performance, cost-effective production line solution? Currently, production line design relies heavily on designers' subjective experience with front-line production lines. The evaluation of design solutions is mostly qualitative, lacking a quantitative method for accurately evaluating production line solutions. This makes it difficult to stably and efficiently obtain production line solutions with good operating efficiency during the design and improvement process.

[0030] To address the problem of designing parallelizable processes in process schematics into efficient modules for production lines, this invention provides a solution. Using site area as a representative resource, and by accurately quantifying the average time for a batch of products to be completed by the production line, it offers a series of optimized production line design schemes under various resource conditions. (See [link to relevant documentation]). Figure 1 As shown, this embodiment of the invention provides a pipeline-aided design method based on a genetic algorithm, comprising the following steps: S100, obtain the area of ​​each process in the production line of the batch of products and all available candidate sites; The number of parallel processes is process Required site area The distribution pattern (including distribution type and parameters) that the time required to complete one cycle follows. The production line needs to complete a batch of products of the following quantity: ; An array containing candidate values ​​for the total site area of ​​all production lines ,element Representing the Total area value.

[0031] Preferably, in another embodiment of this application, S200, the time required for each process of the production line to complete the batch of products is calculated.

[0032] Initialize the candidate values ​​for the total site area. The mean and variance of the time required for each process to complete a batch of products are calculated, and the results are stored in a matrix. middle.

[0033] If the process The time required to complete one task follows an exponential distribution. When, the probability density function is Then the process The average time to complete a batch of products is The variance is The matrix correlation results are .

[0034] If the process The time required to complete one task follows a gamma distribution. When, the probability density function is Then the process The average time to complete a batch of products is The variance is The matrix correlation results are .

[0035] If the process The time required to complete one task follows a normal distribution. When, the probability density function is Then the process The average time to complete a batch of products is The variance is The matrix correlation results are .

[0036] In the formula, For the batch product quantity; for the exponential distribution, It is the mean parameter; for the gamma distribution; These are shape parameters. It is a scale parameter; for a normal distribution, It is the mean parameter. It is the root variance parameter.

[0037] Preferably, in another embodiment of this application, step S300, which calculates the pipeline design scheme corresponding to each candidate site among all the candidate site areas based on the genetic algorithm and the time result, includes: In genetic algorithms, fitness is used to quantify "individual". The degree of excellence of "individual". In this article, "individual" refers to the degree of excellence of "indi The adaptability is determined by the average time it takes for the production line to complete a batch of products. and total area of ​​the production line Exceed The degree of composition.

[0038] S310, randomly decodes the pipeline into including An array of process characteristics (“individual”) The feature in the array is 1~ Natural numbers between; S320, a target pipeline is obtained based on a set of randomly decoded arrays; Processes with the same characteristics are sequentially grouped into the same pipeline module, while processes with different characteristics are grouped into different pipeline modules, resulting in a target pipeline. The target pipeline includes multiple different pipeline modules.

[0039] Specifically, in this embodiment, It is a collection An array of process characteristics, elements It's 1~ The natural numbers between these numbers guide the division of processes. Feature count to module: Elements with the same feature count have their corresponding processes executed sequentially within the same pipeline module. For example, if for This means that processes 1 and 4 are in one production line module, processes 2 and 5 are in another production line module, and process 3 forms the third production line module. The production line format is as follows: Figure 3 As shown.

[0040] S330, in a target production line, the average time required for the target production line to complete a batch of products is calculated based on the time required for a batch of products, and the total area required for the target production line is calculated. Assembly line module The sum of the average times for completing a batch of products across all processes within the module is taken as the average time for completing a batch of products in that module. ; module The sum of the time variances of all processes within the module for completing a batch of products is taken as the time variance of completing a batch of products for that module. The method for calculating the average time required for the target production line to complete a batch of products based on the required time for the batch of products is shown in the following formula:

[0041] In the formula, The average time required for the target production line to complete a batch of products; K is the number of production line modules included in the target production line; k is a module number variable between 1 and K; x is the time variable for completing the batch of products.

[0042] For example, Figure 3 Production line module 1 consists of process 1 and process 4. , Assembly line module 2 consists of process 2 and process 5, then , Assembly line module 3 consists of process 3, then , The average time for the production line to complete a batch of products is as follows:

[0043] S340, calculate the fitness of the target pipeline in each candidate site of the candidate site area based on the total area and average time required for the target pipeline; The total area required for the target pipeline As shown in the following formula:

[0044] One of the candidate sites in the candidate site area In the middle, comparison and ; If the total area required ,but Exceed degree ; If the total area required ,but Exceed degree As shown in the following formula:

[0045] Calculate the fitness of the target pipeline in each candidate site of the candidate site area. As shown in the following formula:

[0046] In the formula, K represents the number of pipeline modules included in the target pipeline. For one of the pipeline modules The maximum area occupied by all processes within the facility; It is a process in an assembly line; The number of processes; For process Average time to complete a batch of products; The average time required for the target production line to complete a batch of products.

[0047] For example Figure 3 Pipeline Module 1 Module 2 Module 3 Total area of ​​the assembly line .

[0048] The smaller the agreed fitness, the "individual" The more outstanding.

[0049] S350, therefore, select the target pipeline with the minimum fitness in each candidate site to obtain the pipeline design scheme.

[0050] The optimal individual output by the genetic algorithm After decoding, its pipeline structure diagram and the total area of ​​the pipeline can be obtained. and the average time to complete a batch of products Preserve resource constraints Relevant information is added to the result matrix. The Line, that is:

[0051] renew ,like The total site area candidate value array has not yet been exceeded. If the number of elements is not specified, then continue to select the target pipeline corresponding to the minimum fitness among the remaining candidate sites; otherwise, output the result matrix. To assist in selecting cost-effective production line design solutions. Based on the above method, the following specific implementation is given: Example: A batch of products contains 100 units. The production line for this product involves 10 processes. The required area for each process and the time distribution for one operation are shown in Table 1. The candidate values ​​for the total available area are 21, 28, 35, 42, 49, 56, and 63 m². 2 Using the methods described above, we completed the optimized design of the production line scheme under different site area conditions.

[0052] Table 1. Process-related information

[0053] Step 1: Input the known information.

[0054] The number of parallel processes is The required area and time for each process follow a distribution pattern; the number of batches of products that the assembly line needs to complete is... The array containing candidate values ​​for the total site area of ​​all production lines is: ; Step 2: Initialize the candidate values ​​for the total site area The mean and variance of the time required for each process to complete a batch of products were calculated, as shown in Table 2. The results were stored in a matrix. middle.

[0055] Table 2: Time Results for Completion of Batch Products in Each Process

[0056] For the candidate value array of total site area Elements A genetic algorithm is used to perform optimization design multiple times on the target pipeline in each candidate site with the corresponding fitness, resulting in a pipeline with a total area not exceeding [a certain value]. The pipeline design aims to minimize the time required to complete a batch of products. This involves selecting the target pipeline with the lowest fitness among each candidate site, obtaining the pipeline design scheme, and storing the results in a result matrix. For details, please refer to Table 3 below: Table 3 Optimization Result Matrix

[0057] Step 3: Output the result matrix This can help in selecting a cost-effective production line design. The results show that as the available space increases, the average time for the production line to complete a batch of products decreases. In this example, if all processes were converted into production line modules, the required space would be 69m². 2 The average time to complete a batch of products was 18,849 minutes. The last optimized solution in Table 3 requires only a 67m² site area. 2 This allows for the creation of a production line with performance nearly identical to its predecessor. Furthermore, when the available site area exceeds 49m²... 2 After that, the reduction in average completion time was no longer significant, and at this point, the actual site area for the fifth optimized production line scheme was 47m². 2 The corresponding pipeline structure is shown in [reference]. Figure 4 From the perspective of cost-effectiveness of resources, this production line solution can also be given priority.

[0058] The key to this invention lies in accurately evaluating the average time for a production line to complete a batch of products. The accuracy of this method can be verified using simulation. For the seven types of production lines listed in Table 3, Figure 5 The figure shows the average time for a production line to complete a batch of products, obtained by using both simulation and the evaluation method of this invention. The figure demonstrates that the errors of both methods are minimal and meet the requirements for engineering applications.

[0059] Meanwhile, this invention provides a pipeline-aided design system based on a genetic algorithm, comprising: The process acquisition module is used to acquire the area of ​​each process in the production line of a batch of products and all available candidate sites. The time calculation module, communicatively connected to the process acquisition module, is used to calculate the time required for each process in the production line to complete the batch of products; and, The scheme design module is communicatively connected to the process acquisition module and the time calculation module, and is used to calculate the production line design scheme corresponding to each candidate site among all the candidate site areas based on the genetic algorithm and the time result.

[0060] In summary, current pipeline design relies heavily on designers' subjective experience with frontline production lines. Evaluation of design schemes is primarily qualitative, lacking methods for accurately evaluating pipeline schemes at the quantitative level. This makes it difficult to stably and efficiently obtain pipeline schemes with good operational efficiency during the design and improvement of pipelines.

[0061] Therefore, this paper presents a method for designing parallel processes in process schematics into efficient modules on a production line. Using site area as a representative resource, this method accurately quantifies the average time for a production line to complete a batch of products, and provides a series of production line optimization design schemes under various resource conditions.

[0062] Specifically, this embodiment corresponds one-to-one with the above method embodiments. The functions of each module have been described in detail in the corresponding method embodiments, so they will not be repeated here.

[0063] Based on the same inventive concept, embodiments of this application also provide a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements all or part of the method steps of the above method.

[0064] The present invention can implement all or part of the processes in the above methods, or it can be accomplished by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when executed by a processor, it can implement the steps of the various method embodiments described above. The computer program includes computer program code, which can be in the form of source code, object code, executable files, or certain intermediate forms. The computer-readable medium can include: any entity or device capable of carrying computer program code, recording media, USB flash drives, portable hard drives, magnetic disks, optical disks, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium can be appropriately added or removed according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, the computer-readable medium does not include electrical carrier signals and telecommunication signals.

[0065] Based on the same inventive concept, embodiments of this application also provide an electronic device, including a memory and a processor. The memory stores a computer program that runs on the processor. When the processor executes the computer program, it implements all or part of the method steps described above.

[0066] The processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor. The processor is the control center of the computer device, connecting all parts of the computer device through various interfaces and lines.

[0067] Memory can be used to store computer programs and / or modules. The processor performs various functions of the computer device by running or executing the computer programs and / or modules stored in the memory, and by accessing data stored in the memory. Memory can primarily include a program storage area and a data storage area. The program storage area can store the operating system and at least one application program required for a function (e.g., sound playback, image playback, etc.); the data storage area can store data created based on the use of the mobile phone (e.g., audio data, video data, etc.). Furthermore, memory can include high-speed random access memory, and can also include non-volatile memory, such as hard disks, RAM, plug-in hard disks, SmartMedia Cards (SMC), Secure Digital (SD) cards, Flash Cards, at least one disk storage device, flash memory device, or other volatile solid-state storage devices.

[0068] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, servers, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage and optical storage) containing computer-usable program code.

[0069] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), servers, and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0070] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0071] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0072] Obviously, those skilled in the art may make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if such changes and modifications fall within the scope of the claims and their equivalents, the present invention is intended to include such changes and modifications.

Claims

1. A pipeline-aided design method based on genetic algorithms, characterized in that, Includes the following steps: Obtain the area of ​​each process in the production line for the batch of products and all available candidate sites; Calculate the time required for each process in the production line to complete the batch of products. Based on the genetic algorithm and the time results, the pipeline design scheme corresponding to each candidate site among all the candidate site areas is calculated.

2. The pipeline-aided design method based on genetic algorithm as described in claim 1, characterized in that, The steps for calculating the time required for each process in the pipeline to complete the batch of products include: If the process The time required to complete one task follows an exponential distribution. When, the probability density function is Then the process The average time to complete a batch of products is , the variance is ; If the process The time required to complete one task follows a gamma distribution. When, the probability density function is Then the process The average time to complete a batch of products is , the variance is ; If the process The time required to complete one task follows a normal distribution. When, the probability density function is Then the process The average time to complete a batch of products is , the variance is ; In the formula, For the batch product quantity; for the exponential distribution, It is the mean parameter; for the gamma distribution; These are shape parameters. It is a scale parameter; for a normal distribution, It is the mean parameter. It is the root variance parameter.

3. The pipeline-aided design method based on genetic algorithm as described in claim 1, characterized in that, The step of calculating the pipeline design scheme corresponding to each candidate site among all the candidate site areas based on the genetic algorithm and the time results includes: The pipeline is randomly decoded into including An array of process features, wherein the features in the array are 1~ Natural numbers between; A target pipeline is obtained based on a set of randomly decoded arrays; In a target production line, the average time required for the target production line to complete a batch of products is calculated based on the time required for a batch of products, and the total area required for the target production line is also calculated. Based on the total area and average time required for the target pipeline, calculate the fitness of the target pipeline in each candidate site for the candidate site area; In each candidate site, the target pipeline with the lowest fitness is selected to obtain the pipeline design scheme.

4. The pipeline-aided design method based on genetic algorithm as described in claim 3, characterized in that, The step of obtaining a target pipeline based on a set of randomly decoded arrays includes: Processes with the same characteristics are sequentially grouped into the same pipeline module, while processes with different characteristics are grouped into different pipeline modules, resulting in a target pipeline. The target pipeline includes multiple different pipeline modules.

5. The pipeline-aided design method based on genetic algorithm as described in claim 3, characterized in that, The method for calculating the average time required for the target production line to complete a batch of products based on the time required for the batch of products is shown in the following formula: In the formula, The average time required for the target pipeline to complete a batch of products; K is the number of pipeline modules included in the target pipeline; k is a module number variable between 1 and K; This is the sum of the average times for all processes within one of the production line modules to complete a batch of products. This represents the sum of the time variances for all processes within one of the production line modules to complete a batch of products; x is the time variable for completing the batch of products.

6. The pipeline-aided design method based on genetic algorithm as described in claim 3, characterized in that, The method for calculating the fitness of the target pipeline in each candidate site for the candidate site area based on the total area and average time required for the target pipeline is shown in the following formula: The total area required for the target pipeline As shown in the following formula: One of the candidate sites in the candidate site area In the middle, comparison and ; If the total area required ,but Exceed degree ; If the total area required ,but Exceed degree As shown in the following formula: Calculate the fitness of the target pipeline in each candidate site of the candidate site area. As shown in the following formula: In the formula, K represents the number of pipeline modules included in the target pipeline. For one of the pipeline modules The maximum area occupied by all processes within the facility; It is a process in an assembly line; The number of processes; For process Average time to complete a batch of products; The average time required for the target production line to complete a batch of products.

7. The pipeline-aided design method based on genetic algorithm as described in claim 3, characterized in that, The method for selecting the target pipeline with the minimum fitness among each candidate site to obtain the pipeline design scheme is shown in the following formula: In the formula, For the first Candidate sites The corresponding target pipeline design scheme; The total area required for the design scheme of the target production line; The average time required to complete a batch of products for the target production line design; An array corresponding to the target pipeline design scheme.

8. A pipeline-aided design system based on a genetic algorithm, characterized in that, include: The process acquisition module is used to acquire the area of ​​each process in the production line of a batch of products and all available candidate sites. The time calculation module, communicatively connected to the process acquisition module, is used to calculate the time required for each process in the production line to complete the batch of products; and, The scheme design module is communicatively connected to the process acquisition module and the time calculation module, and is used to calculate the production line design scheme corresponding to each candidate site among all the candidate site areas based on the genetic algorithm and the time result.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the pipeline-aided design method based on genetic algorithms as described in any one of claims 1 to 7.

10. An electronic device comprising a storage medium, a processor, and a computer program stored in the storage medium and executable on the processor, characterized in that, When the processor runs the computer program, it implements the pipelined design method based on genetic algorithms as described in any one of claims 1 to 7.

Citation Information

Cited By

  • Pipelined quadratic optimization design method and system, electronic terminal and storage medium

    CN122367080A