Production line layout confirmation method, electronic device and computer-readable storage medium

Abstract

The present application relates to the field of automation, and in particular to a production line layout confirmation method, electronic device, and computer-readable storage medium. The method comprises: obtaining the initial iteration coordinates of each unit to be laid out, the setback distance between each two units to be laid out, the size of each unit to be laid out, the setback distance of the loading and unloading ports of each unit to be laid out, the position coordinates of the fixed modules in the plant area, and the size of the plant area; determining the target constraint conditions according to the setback distance between each two units to be laid out, the size of the plant area, the size of each unit to be laid out, and the setback distance of the loading and unloading ports of each unit to be laid out; using the target cost function and the target constraint conditions, iteratively optimizing the obtained initial iteration coordinates of each unit to be laid out until the iteration stop condition is met, obtaining the position coordinates of each unit to be laid out and the position coordinates of the loading and unloading ports of the unit to be laid out, and generating a layout result according to the target optimized coordinates of each unit to be laid out, which can improve the efficiency and accuracy of the production line layout.

Description

Technical Field

[0001] The present application relates to the field of automation, and in particular to a production line layout confirmation method, an electronic device, and a computer-readable storage medium. Background Art

[0002] With the continuous improvement of production capacity, new production lines (referred to as production lines) need to be constantly planned and deployed. The current production line layout confirmation method has problems with both low layout efficiency and low layout accuracy. Summary of the Invention

[0003] The present application provides a production line layout confirmation method, electronic device and computer-readable storage medium, which can improve the efficiency and accuracy of production line layout.

[0004] To achieve the above objectives, this application adopts the following technical solutions:

[0005] In a first aspect, a method for confirming a production line layout is provided, wherein the production line includes a plurality of units to be laid out, and the production line is used to produce a plurality of products, each of which includes at least one production process, including:

[0006] Obtain the original location information of the cells to be laid out and the factory area information of the production line. The original location information includes the initial iteration coordinates of each cell to be laid out, the setback distance between each two cells to be laid out, the dimensions of each cell to be laid out, and the setback distance of the loading and unloading ports of each cell to be laid out. The factory area information includes the dimensions of the factory area and the location coordinates of the fixed modules in the factory area.

[0007] Determine the target constraint conditions based on the setback distance between each two units to be arranged, the factory area size, the size of each unit to be arranged, the position coordinates of the fixed modules in the factory area, and the setback distance of the loading and unloading ports of each unit to be arranged;

[0008] Using the target cost function and the target constraint conditions, the initial iterative coordinates of each unit to be arranged are iteratively optimized until the iteration stop condition is met, thereby obtaining the target optimized coordinates of each unit to be arranged; wherein the target cost function represents the minimum sum of the production path distances corresponding to all production processes of multiple products produced on the production line, and the production path distances are calculated based on the production paths corresponding to the production processes and the positions of each unit to be arranged; the target optimized coordinates of the unit to be arranged include the position coordinates of the unit to be arranged and the position coordinates of the loading and unloading ports of the unit to be arranged;

[0009] Based on the target optimization coordinates of each unit to be laid out, the layout results of multiple units to be laid out on the production line are generated.

[0010] In the above scheme, the target constraints determined by the size of each unit to be arranged, the setback of the loading and unloading ports of each unit to be arranged, the size of the plant, the position coordinates of the fixed modules in the plant, and the setback between every two units to be arranged are iteratively optimized through the target constraints and the target cost function. Therefore, based on the target optimized coordinates of each unit to be arranged, the layout results of multiple units to be arranged in the production line are generated. There is no need to complete the production line planning in the drawing software based on experience and spend a lot of time. Instead, the production line layout is planned by iterating the coordinates of each unit to be arranged through the target cost function, thereby improving the layout efficiency of the production line layout. In addition, the minimum value of the sum of the production path distances of all production processes of multiple products is used as the target of iterative optimization, so that the generated production line layout results can meet the production path requirements of multiple products, thereby improving the accuracy of the production line layout.

[0011] In one implementation of the first aspect, the target constraint condition is determined based on the setback distance between each two cells to be arranged, the size of the factory area, the position coordinates of the fixed modules in the factory area, the size of each cell to be arranged, and the setback distance of the loading and unloading port of each cell to be arranged, including:

[0012] Determine the distance constraints between devices based on the setback distance between each two cells to be laid out, the coordinate position of the fixed module, and the size of each cell to be laid out;

[0013] Determine the plant area constraints based on the plant area size and the size of each unit to be laid out;

[0014] Determine the rotation constraint conditions based on the back-off distance of the loading and unloading ports of each unit to be laid out;

[0015] The target constraints are obtained by combining the distance constraints between equipment, the plant area constraints, and the rotation constraints.

[0016] In the above scheme, the target constraints include the distance constraints between equipment, the plant range constraints and the rotation constraints, so that the production line can be laid out according to the specified setback requirements, the specified plant range and the specified setback requirements of the loading and unloading ports, reducing the situation where the iterative target optimization coordinates of each unit to be laid out do not meet the specified setback requirements, the specified plant range and the specified setback requirements of the loading and unloading ports, thereby further improving the effectiveness of the production line layout.

[0017] In an implementation of the first aspect, determining the inter-device distance constraint condition based on the backoff distance between each two cells to be laid out, the coordinate position of the fixed module, and the size of each cell to be laid out includes:

[0018] Determine the first shortest distance and the second shortest distance in the horizontal direction, and the third shortest distance and the fourth shortest distance in the vertical direction, between each two cells to be arranged according to the setback distance between the two cells to be arranged and the size of each cell to be arranged;

[0019] Determine the overlapping relationship between each unit to be laid out and the fixed module according to the coordinates of the unit to be laid out and the coordinate position of the fixed module;

[0020] Determine the positional relationship between every two cells to be laid out according to the coordinates of the cells to be laid out;

[0021] The distance constraint between devices is determined according to the overlapping relationship between each unit to be arranged and the fixed module, the position relationship between every two units to be arranged, and the first shortest distance, the second shortest distance, the third shortest distance, and the fourth shortest distance.

[0022] In the above scheme, the inter-device distance constraint is determined based on the relationship between the first shortest distance, the second shortest distance, the third shortest distance, and the fourth shortest distance in the vertical direction between each two units to be arranged, the position of the fixed module, and the setback between each two units to be arranged. This ensures that units to be arranged of different sizes have corresponding setback requirements, and thus accurately constrains the distance between units to be arranged, thereby improving the accuracy of the inter-device distance constraint.

[0023] In one implementation of the first aspect, determining the plant area constraint conditions based on the plant area size and the size of each unit to be laid out includes:

[0024] Determine the horizontal and vertical extents of the plant area based on the plant area dimensions;

[0025] Determine the horizontal and vertical positions of the cells to be arranged according to the coordinates and sizes of the cells to be arranged;

[0026] The horizontal position of each unit to be arranged is within the horizontal range, and the vertical position of each unit to be arranged is within the vertical range, which are determined as factory range constraints.

[0027] In an implementation of the first aspect, determining the rotation constraint condition according to the setback distance of the loading and unloading ports of each unit to be arranged includes:

[0028] Determine the corresponding setback distance of each unit to be arranged in each direction according to the setback distance of the loading and unloading port of each unit to be arranged;

[0029] According to the corresponding setback distances in each direction of each cell to be laid out, the rotation constraint conditions corresponding to each rotation angle are determined.

[0030] In an implementation of the first aspect, generating layout results of multiple units to be laid out on a production line according to target optimized coordinates of each unit to be laid out includes:

[0031] A layout diagram of multiple cells to be arranged is drawn according to the target optimization coordinates of each cell to be arranged and the acquired size of each cell to be arranged, and the optimized path distance between every two cells to be arranged in the production line in the layout diagram is determined.

[0032] In the above scheme, when the target optimized coordinates of each unit to be laid out are reached in the last iteration, the layout diagram of the factory area can be automatically drawn, and the optimized path distance between every two units to be laid out in the factory area can also be determined in the layout diagram of the factory area. There is no need for planners to draw the layout diagram of each unit to be laid out in the factory area one by one in the drawing software, and there is no need for planners to obtain the path distance between every two units to be laid out in the factory area by measuring the layout diagram, thereby improving the efficiency of layout result output.

[0033] In an implementation of the first aspect, generating layout results of multiple units to be laid out on a production line according to target optimized coordinates of each unit to be laid out further includes:

[0034] Mark the optimized paths corresponding to different production processes for different products on the layout diagram.

[0035] In the above scheme, when the target optimization coordinates of each unit to be laid out are reached in the last iteration, the layout diagram of the factory can be automatically drawn, the optimized path distance between each two units to be laid out in the factory can be determined, and the production path after optimization of different production processes for each product in the production line can be determined. There is no need for planners to draw the layout diagram of each unit to be laid out in the factory one by one in the drawing software, and there is no need for planners to obtain the path distance between each two units to be laid out in the factory by measuring the layout diagram. This makes it easier for business personnel to compare the specific optimization distances of each product and equipment, thereby improving the efficiency of layout result output.

[0036] In one implementation of the first aspect, the target cost function and the target constraint condition are used to iteratively optimize the initial iteration coordinates of each cell to be laid out until an iteration stop condition is satisfied, thereby obtaining the target optimized coordinates of each cell to be laid out, including:

[0037] Encoding the target cost function and the target constraint conditions according to a preset encoding method;

[0038] The initial iterative coordinates of the cells to be arranged are input into the solver, so that the solver solves the target optimized coordinates of each cell to be arranged according to the encoded target cost function and the encoded target constraint condition.

[0039] In a second aspect, a production line layout confirmation device is provided, wherein the production line includes a plurality of units to be laid out, the production line is used to produce a plurality of products, and the products include at least one production process. The production line layout confirmation device includes:

[0040] An acquisition unit is configured to acquire the original position information of the cells to be arranged and the factory area information of the production line. The original position information includes the initial iteration coordinates of each cell to be arranged, the setback distance between each two cells to be arranged, the size of each cell to be arranged, and the setback distance of the loading and unloading ports of each cell to be arranged. The factory area information includes the size of the factory area and the position coordinates of the fixed modules in the factory area.

[0041] The constraint unit is used to determine the target constraint conditions based on the setback distance between each two units to be arranged, the factory area size, the size of each unit to be arranged, the position coordinates of the fixed modules in the factory area, and the setback distance of the loading and unloading ports of each unit to be arranged;

[0042] A solver, configured to iteratively optimize the initial iteration coordinates of each unit to be laid out using a target cost function and target constraints until the iteration stop condition is met, thereby obtaining the target optimized coordinates of each unit to be laid out. The target cost function represents the minimum sum of the production path distances corresponding to all production processes for multiple products produced on the production line. The production path distances are calculated based on the production paths corresponding to the production processes and the positions of each unit to be laid out.

[0043] The result generating unit is used to generate layout results of multiple units to be arranged on the production line according to the target optimization coordinates of each unit to be arranged.

[0044] In a third aspect, an embodiment of the present application provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the production line layout confirmation method as described in any one of the first aspects above is implemented.

[0045] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the production line layout confirmation method as described in any one of the above-mentioned first aspects is implemented.

[0046] In a fifth aspect, an embodiment of the present application provides a computer program product. When the computer program product is run on an electronic device, the electronic device executes the production line layout confirmation method described in any one of the first aspects above.

[0047] It can be understood that the beneficial effects of the second to fifth aspects mentioned above can be found in the relevant description of the first aspect mentioned above, and will not be repeated here.

[0048] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] Various other advantages and benefits will become apparent to those skilled in the art upon reading the detailed description of the preferred embodiment below. The accompanying drawings are for illustration purposes only and are not to be considered as limiting the present application. The same reference numerals are used throughout the drawings to represent the same components. In the drawings:

[0050] Figure 1 This is a flow chart of a production line layout confirmation method provided by an embodiment of the present application;

[0051] Figure 2 This is a flow chart of a production line layout confirmation method provided by another embodiment of the present application;

[0052] Figure 3 This is a flow chart of a production line layout confirmation method provided by another embodiment of the present application;

[0053] Figure 4 This is a structural block diagram of a production line layout confirmation device provided in an embodiment of the present application;

[0054] Figure 5 It is a structural diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0055] The following embodiments of the technical solution of the present application will be described in detail with reference to the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solution of the present application and are therefore only examples and are not intended to limit the scope of protection of the present application.

[0056] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which this application belongs; the terms used herein are only for the purpose of describing specific embodiments and are not intended to limit this application; the terms "including" and "having" and any variations thereof in the specification and claims of this application and the above-mentioned figure descriptions are intended to cover non-exclusive inclusions.

[0057] In the description of the embodiments of this application, the technical terms "first" and "second" are used only to distinguish different objects and should not be understood to indicate or imply relative importance or implicitly specify the quantity, specific order, or primary and secondary relationship of the indicated technical features. In the description of the embodiments of this application, the meaning of "plurality" is more than two, unless otherwise clearly and specifically defined.

[0058] References herein to "embodiments" mean that a particular feature, structure, or characteristic described in connection with the embodiments may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor does it constitute an independent or alternative embodiment that is mutually exclusive of other embodiments. It is understood, both explicitly and implicitly, by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0059] In the description of the embodiments of this application, the term "and / or" is simply a description of the association relationship between associated objects, indicating that three relationships can exist. For example, A and / or B can represent the following three situations: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character " / " in this document generally indicates that the associated objects are in an "or" relationship.

[0060] In the description of the embodiments of the present application, the term "multiple" refers to more than two (including two). Similarly, "multiple groups" refers to more than two groups (including two groups), and "multiple pieces" refers to more than two pieces (including two pieces).

[0061] In the description of the embodiments of the present application, the technical terms "center", "longitudinal", "lateral", "length", "width", "thickness", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside", "clockwise", "counterclockwise", "axial", "radial", "circumferential", etc., indicating the orientation or position relationship, are based on the orientation or position relationship shown in the accompanying drawings, and are only for the convenience of describing the embodiments of the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the embodiments of the present application.

[0062] In the description of the embodiments of the present application, unless otherwise expressly specified or limited, technical terms such as "installed," "connected," "connected," and "fixed" should be understood in a broad sense. For example, they can refer to fixed connections, detachable connections, or integration; mechanical connections or electrical connections; direct connections or indirect connections through an intermediate medium; internal connections between two components or interactions between two components. Those skilled in the art can understand the specific meanings of the above terms in the embodiments of the present application based on specific circumstances.

[0063] As production capacity continues to increase, new production lines (referred to as production lines) need to be constantly planned and deployed. Currently, production line layout is primarily accomplished by planners using drawing software based on the needs of various departments and their own experience. Planning requires consideration of factors such as the intensity of logistics between different equipment and the length of material flow paths. However, production line layout planning typically consumes a significant amount of planners' time. After completing the layout diagram, the distances for logistics, information flow, and personnel flow must be manually measured in the drawing software, further increasing the workload and consuming both time and effort. Consequently, production line layout suffers from low layout efficiency.

[0064] Due to individual differences among planners, even when faced with the same needs, different planners may propose different layout plans, and the layout planning by the planners may not produce the optimal layout results. In order to improve the efficiency and accuracy of layout, genetic algorithms can currently be used to solve layout planning, optimize the equipment layout, and find the global optimal solution within a reasonable time, thereby improving the efficiency and effectiveness of equipment layout planning. However, when currently using methods such as genetic algorithms for production line layout planning, layout optimization is usually only performed based on the production path of one product. In reality, a production line may need to produce multiple products, so the production line layout planned by the planner may not be the optimal solution.

[0065] In summary, the current production line layout confirmation method has the problem of low layout efficiency and low layout accuracy.

[0066] Based on this, an embodiment of the present application provides a production line layout confirmation method, which iteratively optimizes the coordinates of the units to be laid out through a target cost function, thereby generating layout results of multiple units to be laid out in the production line based on the target optimization coordinates of each unit to be laid out. There is no need to complete the production line planning in the drawing software based on experience and spend a lot of time. Instead, the production line layout planning is completed by iteratively optimizing the coordinates of each unit to be laid out through a target cost function, thereby improving the layout efficiency of the production line layout; in addition, the minimum value of the sum of the production path distances of multiple products is used as the target of iterative optimization, so that the generated production line layout results can meet the production path requirements of multiple products, thereby improving the accuracy of the production line layout.

[0067] See also Figure 1, is a flow chart of the production line layout confirmation method provided in the embodiment of the present application. The production line layout confirmation method provided in the embodiment of the present application can be applied to electronic equipment on the production line, and can also be applied to other electronic equipment with built-in processors, or on-board analysis capabilities or artificial intelligence analysis capabilities. The electronic equipment involved in the embodiment of the present application may include but is not limited to servers, laptops, ultra-mobile personal computers (UMPCs), and other electronic devices that can implement the production line layout confirmation method. The embodiment of the present application does not make a single limitation on this. As an example and not a limitation, Figure 1 As shown, the production line layout confirmation method may include the following steps:

[0068] S101, obtaining the original location information of the unit to be laid out and the factory information of the factory where the production line is located.

[0069] In this embodiment of the present application, the original position information may include the initial iteration coordinates of each unit to be arranged, the setback distance between each unit to be arranged, the dimensions of each unit to be arranged, and the setback distance of the loading and unloading ports of each unit to be arranged. The factory area information may include the factory area dimensions and the position coordinates of fixed modules in the factory area.

[0070] In the embodiment of the present application, the above-mentioned unit to be arranged refers to the production equipment whose placement position needs to be determined in the production line.

[0071] In some embodiments, the information that needs to be determined about the cells to be arranged may specifically include the coordinates of the cells to be arranged and the position coordinates of the loading and unloading ports.

[0072] In specific applications, since the position setting of the loading and unloading ports of the equipment will also affect the production efficiency of the production line, the embodiment of the present application not only takes the placement position of the unit to be laid out as the optimization object, but also takes the position coordinates of the loading and unloading ports of each unit to be laid out as the optimization object, thereby providing a more accurate layout plan.

[0073] It should be noted that the embodiments of the present application do not limit the scenarios of the production line layout. For example, the production line can be a production line in the new energy industry, such as a battery production line; for another example, the production line can also be a production line in other fields.

[0074] In a specific application, the initial iterative coordinates of the above-mentioned units to be laid out can be randomly generated by the solver that performs the production line layout optimization. That is, at the very beginning of searching for the target optimization coordinates of the units to be laid out, the solver can automatically and randomly generate the initial iterative coordinates of each unit to be laid out. The initial iterative coordinates of each unit to be laid out randomly generated by the solver are the objects obtained in S101.

[0075] Here, the solver is a mathematical optimization solver provided in the electronic device for performing optimal solution of the coordinates of the units to be laid out and the position coordinates of the loading and unloading ports.

[0076] In an embodiment of the present application, the initial iteration coordinates of the units to be arranged may include the coordinates of each unit to be arranged in the production line layout plan designed by the planner.

[0077] In specific applications, setting the coordinates of each unit to be laid out in the production line layout plan designed by the planner as the initial iteration coordinates of the unit to be laid out and hot starting the solver can effectively speed up the convergence of the solver, thereby improving the efficiency of production line layout.

[0078] Among them, the setback distance between each two units to be arranged refers to the minimum distance between each two units to be arranged. By setting the setback distance between each two units to be arranged, the minimum distance between each two units to be arranged in the target optimization coordinates can be greater than or equal to the required setback distance, thereby making the production line arranged according to the target optimization coordinates meet the setback requirements.

[0079] The required setback between two units to be deployed can be determined based on transportation requirements, turning requirements, and safety distance requirements. Transportation requirements can specifically refer to the distance required for transportation equipment, such as an Automated Guided Vehicle (AGV). Turning requirements can refer to the distance reserved for turning each piece of transportation equipment. Safety distance requirements can refer to the safety distance required for transportation. For example, the setback between each of the two units to be deployed can be determined based on information such as the AGV's size, turning radius, and safety distance standards.

[0080] Among them, fixed modules within the factory specifically refer to modules whose position coordinates do not change, such as columns, firewalls, etc.

[0081] For example, the setback distance between every two cells to be arranged in the production line may be pre-planned, or may be obtained from a database.

[0082] For example, the size of each unit to be laid out, the position coordinates of the fixed modules in the factory area, and the size of the factory area may be obtained from a database, or may be pre-planned.

[0083] Among them, the setback distance of the loading and unloading ports of each unit to be arranged can refer to the minimum distance required to be reserved for the loading port position of each unit to be arranged and the minimum distance required to be reserved for the unloading port. By setting the setback distance of the loading and unloading ports of each unit to be arranged, the minimum distance of the loading and unloading ports of each unit to be arranged can be made greater than or equal to the required setback distance, thereby making the production line laid out according to the target optimized coordinates meet the setback requirements required for the loading and unloading ports.

[0084] In some embodiments, the setbacks of the loading and unloading ports of the above-mentioned cells to be arranged can be recorded in various data formats such as dictionaries, arrays, etc. For example, they can be recorded in a dictionary of setbacks of the loading and unloading ports.

[0085] In some embodiments, the setback distances of the loading and unloading ports of the above-mentioned units to be arranged may be pre-planned, or may be obtained from a database.

[0086] S102 , determining target constraints based on the setback distance between each two cells to be arranged, the factory area size, the size of each cell to be arranged, the position coordinates of the fixed modules in the factory area, and the setback distance of the loading and unloading ports of each cell to be arranged.

[0087] Among them, the objective constraints are used to limit the decision variables.

[0088] In one embodiment of the present application, the decision variables are the coordinates of the above-mentioned units to be arranged and the position coordinates of the loading and unloading ports.

[0089] It can be understood that the embodiment of the present application sets the position coordinates of the loading and unloading ports as decision variables, which can more accurately represent the production path and further improve the accuracy of the production line layout.

[0090] S103 , using the target cost function and the target constraint condition, iteratively optimize the obtained initial iteration coordinates of each unit to be arranged until the iteration stop condition is met, thereby obtaining the target optimization coordinates of each unit to be arranged.

[0091] In specific applications, the production line layout is planned based on a mixed integer programming model. The target cost function of the mixed integer programming model can be expressed as the minimum value of the sum of the production path distances of all production processes of the multiple products produced by the production line to be laid out. The production path distance is calculated based on the production distance corresponding to the production process and the position of each unit to be laid out.

[0092] The production path distance may include but is not limited to the Manhattan distance. The decision variables of the mixed integer programming model are the coordinates of each unit to be laid out and the position coordinates of the loading and unloading ports.

[0093] In specific applications, the production paths of different products may differ, and the production paths of different production processes for the same product may also differ. A production path can specifically be a technical path that specifies the processing steps, operation sequence, equipment used, and working hours required for a product during production. It can be used to describe the entire production process from raw materials or semi-finished products to finished products, including information such as the order of each process and the equipment required.

[0094] It is understood that a production line can include multiple production equipment, with different production equipment responsible for different production steps. The differences in production paths can be specifically expressed as different production equipment corresponding to some steps. For example, the production process of different products may start or end with different equipment. The production process of the same type of product with different production processes may start or end with different equipment, or even with different intermediate equipment. Therefore, different production processes will result in different production distances.

[0095] It is understandable that as the coordinates of each two units to be laid out change, the Manhattan distance between each two units to be laid out will also change, and accordingly, the production path distance will also change. For example, the solution to the production path of a production process of any one of the multiple products in the production line can be specifically: determined according to the coordinates of each unit to be laid out in the production line obtained in each iteration, specifically, the Manhattan distance between the upstream and downstream devices in the production path can be calculated based on the production path, and then the Manhattan distances between all the upstream and downstream devices in the production path of the product are summed to obtain the Manhattan distance corresponding to the production path of the product (i.e., the production path distance). The corresponding production path distance is solved for each product in the above manner, and then the production path distances of each production process of each product of the production line are summed or weighted to obtain the sum of the production path distances of all the production processes of the above multiple products. Among them, the distance between the upstream and downstream devices can be specifically calculated from the unloading port of the upstream device to the loading port of the downstream device. Therefore, as the coordinates of each unit to be laid out are continuously updated, the sum of the production path distances of all production processes of the corresponding multiple products will also change. By using the solver to perform iterative optimization based on the target cost function, the target optimized coordinates of each unit to be laid out can be obtained.

[0096] The target optimization coordinates of the cells to be arranged may include the position coordinates of the cells to be arranged and the position coordinates of the loading and unloading ports of the cells to be arranged.

[0097] In specific applications, the above-mentioned conditions for stopping iteration may include but are not limited to the following: the same optimal solution appears for a preset number of consecutive times; the running time of the iterative optimization exceeds the preset running time; the number of iterations of the iterative optimization reaches the preset number of iterations; the optimal solution iterated meets the first business requirement.

[0098] Illustratively, in one embodiment of the present application, satisfying the iteration stop condition includes the number of iterations of the iterative optimization reaching a preset number of iterations.

[0099] It should be noted that the above-mentioned first business requirement can be a distance requirement for the sum of production paths of all production processes of multiple production lines set by the user, or a requirement for the number of products produced within a fixed period, etc.

[0100] The target optimized coordinates of the cells to be arranged may be the coordinates of each cell to be arranged obtained in the last round of iteration when it is determined that the stopping condition of the first iteration is satisfied.

[0101] S104 , generating layout results of multiple units to be arranged on the production line according to the target optimized coordinates of each unit to be arranged.

[0102] In specific applications, the layout results of multiple units to be arranged on the production line can include a layout diagram of the multiple units to be arranged within the production line, the position coordinates of each unit to be arranged within the production line, the loading and unloading port positions of each unit to be arranged, and the production path corresponding to the production process of each product.

[0103] For example, the layout results of the plurality of cells to be arranged in the factory area may be generated according to the target optimization coordinates of each cell to be arranged and the size of each cell to be arranged.

[0104] From the above, it can be seen that the production line layout confirmation method provided in the embodiment of the present application determines the target constraints through the size of each unit to be arranged, the setback of the loading and unloading ports of each unit to be arranged, the size of the plant, the position coordinates of the fixed module in the plant, and the setback between every two units to be arranged. The coordinates of the units to be arranged are iteratively optimized through the target constraints and the target cost function, so that the layout results of multiple units to be arranged in the production line are generated based on the target optimization coordinates of each unit to be arranged. There is no need to complete the production line planning in the drawing software based on experience and spend a lot of time. Instead, the production line layout planning is completed by iterating the coordinates of each unit to be arranged through the target cost function, thereby improving the layout efficiency of the production line layout; in addition, the minimum value of the sum of the production path distances of all production processes of multiple products is used as the target of iterative optimization, so that the generated production line layout results can meet the production path requirements of multiple products, thereby improving the accuracy of the production line layout.

[0105] In some embodiments, the above-mentioned target constraint conditions are determined based on the setback distance between each two units to be arranged, the factory area size, the position coordinates of the fixed module in the factory area, the size of each unit to be arranged, and the setback distance of the loading and unloading ports of each unit to be arranged. This can be achieved in the following ways: according to the setback distance between each two units to be arranged, the coordinate position of the fixed module and the size of each unit to be arranged, the distance constraint conditions between devices are determined; according to the factory area size and the size of each unit to be arranged, the factory area range constraint conditions are determined; according to the setback distance of the loading and unloading ports of each unit to be arranged, the rotation constraint conditions are determined; and the target constraint conditions are obtained by combining the distance constraint conditions between devices, the factory area range constraint conditions and the rotation constraint conditions.

[0106] Taking into account the overlapping constraints of the fixed module, the overlapping constraints of the optimization module (i.e., the position of the unit to be laid out and the position of the loading and unloading ports), and the distance constraints reserved between equipment, the above-mentioned distance constraints between equipment require that the setback distance between every two units to be laid out in the production line meet the setback requirements and must meet the overlapping constraints of the fixed module. The setback requirements can be based on the logistics distance reserved for AGV logistics.

[0107] Among them, the plant scope constraint requires that each unit to be laid out in the plant must be within the plant scope.

[0108] Among them, the rotation constraint condition requires that the rotation angle of each unit to be laid out meets the back-off distance requirement of the loading and unloading ports.

[0109] In the technical solution of the embodiment of the present application, the target constraints include equipment distance constraints, plant range constraints and rotation constraints, so that the production line can be laid out according to the specified setback requirements, the specified plant range and the specified setback requirements of the loading and unloading ports, reducing the situation where the iterated target optimization coordinates of each unit to be laid out do not meet the specified setback requirements, the specified plant range and the specified setback requirements of the loading and unloading ports, thereby further improving the effectiveness of the production line layout.

[0110] In some embodiments, the distance constraint between devices is determined based on the back-off distance between each two cells to be laid out, the coordinate position of the fixed module, and the size of each cell to be laid out. This can be achieved by: determining the first shortest distance and the second shortest distance between each two cells to be laid out in the horizontal direction (for example, the horizontal direction may also include the x-axis direction) based on the coordinates of each two cells to be laid out and the size of each two cells to be laid out, wherein the first shortest distance may be the distance between the two cells to be laid out ( i and j ) in a unit to be laid out ( i ) to the other unit to be laid out ( j )’s shortest distance in the horizontal direction ( ), the second shortest distance can be the monomer to be laid out ( j ) to the feed port of the unit to be laid out ( i )’s shortest distance in the horizontal direction ( ); Determine the third shortest distance and the fourth shortest distance in the vertical direction (for example, the vertical direction may also include the y-axis direction), wherein the third shortest distance is the distance between two cells to be laid out ( i and j ) to be laid out in the monomer ( i ) to the other unit to be laid out ( j )’s shortest distance in the longitudinal direction ( ), the fourth shortest distance to be laid out monomer ( j) to the feed port of the unit to be laid out ( i )’s shortest distance in the longitudinal direction ( ); Determine the overlapping relationship between each unit to be laid out and the fixed module based on the coordinates of the unit to be laid out and the coordinate position of the fixed module; Determine the positional relationship between every two units to be laid out based on the coordinates of the unit to be laid out; Determine the distance constraint conditions between devices based on the overlapping relationship between the unit to be laid out and the fixed module, the first shortest distance, the second shortest distance, the third shortest distance, the fourth shortest distance, and the relationship between the backoff distances.

[0111] In specific applications, since the embodiment of the present application also considers the rotation of the cells to be arranged, when determining the setback distances of cells to be arranged i and j, the setback requirements in the four directions of up, down, left and right need to be considered.

[0112] It should be understood that the four directions of "up, down, left, and right" in the embodiments of the present application are relative. In specific applications, the position coordinates of the units to be laid out can be determined based on the world coordinate system. In the world coordinate system, "up, down, left, and right" can generally be represented by the directions of the coordinate axes: Up: In two dimensions, "up" can correspond to the positive direction of the y-axis. Down: The opposite of "up", corresponding to the negative direction of the y-axis (in two dimensions). Left: Generally corresponds to the negative direction of the x-axis. Right: The opposite of "left", corresponding to the positive direction of the x-axis.

[0113] In the embodiment of the present application, the y-axis corresponds to the width direction of the device, and the x-axis corresponds to the length direction of the device.

[0114] It should be noted that in the embodiment of the present application, the monomer to be laid out can be equivalent to a rectangular monomer, so only the two dimensions of length and width are considered, that is, the monomer to be laid out is equivalent to a two-dimensional rectangular monomer. The length direction of the above-mentioned device can specifically refer to the horizontal direction of the equivalent rectangular monomer, and the width direction can specifically refer to the vertical direction of the equivalent rectangular monomer.

[0115] For example, assuming that the cell to be laid out i The required setback distance on the left is the first distance , monomer to be laid out i The required setback distance on the right is the second distance , monomer to be laid out i The required retreat distance above is the third distance , monomer to be laid out i The required retreat distance below is the fourth distance , monomer to be laid out j The required setback distance on the left is the fifth distance , monomer to be laid out j The required retreat distance on the right is the sixth distance , monomer to be laid out jThe required retreat distance above is the seventh distance , monomer to be laid out j The required retreat distance below is the eighth distance .

[0116] In the unit to be laid out i Located in the unit to be laid out j In the case on the left, the monomer to be laid out i With the monomer to be laid out j The retreat distance The second distance and the fifth distance The larger distance between the two; i Located in the unit to be laid out j In the case on the right, the monomer to be laid out i With the monomer to be laid out j The retreat distance The first distance and the sixth distance The larger distance between the two; i Located in the unit to be laid out j In the case below, the monomer to be laid out i With the monomer to be laid out j The retreat distance The third distance and the eighth distance The larger distance between the two; i Located in the unit to be laid out j In the above case, the monomer to be laid out i With the monomer to be laid out j The retreat distance The fourth distance and the seventh distance The larger distance.

[0117] In some embodiments, the first shortest distance between two units to be arranged in the horizontal direction is greater than or equal to the first distance constraint value, which is determined as the first constraint condition; the second shortest distance between the two units to be arranged in the horizontal direction is greater than or equal to the second distance constraint value, which is determined as the second constraint condition; the third shortest distance between the two units to be arranged in the vertical direction is greater than or equal to the third distance constraint value, which is determined as the third constraint condition; the fourth shortest distance between the two units to be arranged in the vertical direction is greater than or equal to the fourth distance constraint value, which is determined as the fourth constraint condition; the union of the first constraint condition, the second constraint condition, the third constraint condition and the fourth constraint condition is determined as the distance constraint condition between devices.

[0118] Among them, the first distance constraint value, the second distance constraint value, the third distance constraint value and the fourth distance constraint value can be determined based on the length of the two units to be laid out, the width of the two units to be laid out, the length of the factory area, the width of the factory area, the position information of the two units to be laid out, the overlapping relationship with the fixed module and the retreat distance between the two units to be laid out.

[0119] For example, the first distance constraint value L1 and the third distance constraint value L3 can be calculated according to the following formulas:

[0120] L1= ;

[0121] L3= ;

[0122] in, Indicates the monomer to be laid out i length; Indicates the monomer to be laid out j length; Indicates the monomer to be laid out j width; L Indicates the length of the plant area; W Indicates the width of the factory area; Indicates the monomer to be laid out i With the monomer to be laid out j Position relationship, if the monomer to be laid out i In the unit to be laid out j On the left side, is 1, otherwise 0; Indicates the monomer to be laid out i With the monomer to be laid out j Position relationship, if the monomer to be laid out i In the unit to be laid out j Below, is 1, otherwise 0; Indicates the monomer to be laid out i With the monomer to be laid out j Overlapping relationship with fixed modules, if the monomer to be laid out i With the monomer to be laid out j If it overlaps with the fixed module, it is 1, otherwise it is 0; Indicates the monomer to be laid out i Located in the unit to be laid out j In the case on the left, the monomer to be laid out i With the monomer to be laid out j The retreat distance; Indicates the monomer to be laid out i Located in the unit to be laid out j In the case below, the monomer to be laid out i With the monomer to be laid outj The retreat distance.

[0123] In the technical solution of the embodiment of the present application, the distance constraint conditions between devices are determined based on the first shortest distance, the second shortest distance, the third shortest distance and the fourth shortest distance in the vertical direction between each two units to be laid out, the position of the fixed module, and the relationship between the setback distance between each two units to be laid out. This enables units to be laid out of different sizes to have corresponding setback requirements, and thus enables the distance between the units to be laid out to be accurately constrained, thereby improving the accuracy of the distance constraint conditions between devices.

[0124] In some embodiments, the plant range constraint is determined based on the plant size and the size of each unit to be arranged, which can be achieved in the following ways: determine the horizontal range and vertical range of the plant based on the plant size; determine the horizontal position and vertical position of each unit to be arranged based on the coordinates of each unit to be arranged and the size of each unit to be arranged; and determine that the horizontal position of each unit to be arranged is within the horizontal range, and the vertical position of each unit to be arranged is within the vertical range, as plant range constraints.

[0125] In some embodiments, the first maximum point and the first minimum point of each to-be-arranged unit in the horizontal direction, as well as the second maximum point and the second minimum point of each to-be-arranged unit in the vertical direction can be determined based on the coordinates of each to-be-arranged unit and the size of each to-be-arranged unit; the first maximum point is less than or equal to the length in the factory size, and the first minimum point is greater than or equal to 0, which are determined as the fifth constraint condition; the second maximum point is less than or equal to the width in the factory size, and the second minimum point is greater than or equal to 0, which are determined as the sixth constraint condition; the union of the fifth constraint condition and the sixth constraint condition is determined as the factory range constraint condition.

[0126] For example, if the center coordinates of a cell to be laid out are ( , ), the size of the unit to be laid out includes length and width The length of the factory is , with a width of , then the first maximum point and the first minimum point of the unit to be laid out in the horizontal direction are and The second maximum point and the second minimum point of the unit to be laid out in the vertical direction are and .

[0127] In the technical solution of the embodiment of the present application, the horizontal position of each unit to be arranged is within the horizontal range of the factory area, and the vertical position of each unit to be arranged is within the vertical range of the factory area, which are determined as factory area range constraints. Therefore, units to be arranged of different sizes can have corresponding range requirements, and the position of the unit to be arranged can be accurately constrained within the horizontal range and vertical range of the factory area, thereby improving the accuracy of the determined factory area range constraints.

[0128] In some embodiments, the rotation angle of the cell to be arranged can be 0 degrees, 90 degrees, 180 degrees, and 270 degrees. Determining the rotation constraint condition based on the setback distance of the loading and unloading port of each cell to be arranged can include: determining the setback distance corresponding to each direction of the cell to be arranged based on the setback distance of the loading and unloading port of each cell to be arranged, and determining the rotation constraint condition corresponding to each rotation angle based on the setback distance corresponding to each direction of the cell to be arranged.

[0129] It is understandable that different rotation angles of the units to be arranged will result in different loading and unloading port locations, which in turn will affect the entire production path distance. By constraining the rotation angle of the units to be arranged by the setback requirements of the loading and unloading ports, the final optimized loading and unloading port locations of the units to be arranged can meet the rotation angle requirements and the requirement of minimizing the total production path distance.

[0130] Specifically, any one of the following conditions, namely, the left setback of the to-be-arranged monomer k is equal to the bottom setback of the to-be-arranged monomer k, the right setback of the to-be-arranged monomer k is equal to the top setback of the to-be-arranged monomer k, the top setback of the to-be-arranged monomer k is equal to the left setback of the to-be-arranged monomer k, and the bottom setback of the to-be-arranged monomer k is equal to the right setback of the to-be-arranged monomer k, is determined as the seventh constraint condition. The seventh constraint condition is the constraint condition corresponding to the rotation angle of the to-be-arranged monomer k being 90 degrees; the top setback of the to-be-arranged monomer k is equal to the bottom setback of the to-be-arranged monomer k, or the right setback of the to-be-arranged monomer k is equal to the left setback of the to-be-arranged monomer k, is determined as the eighth constraint condition. The eighth constraint condition is the constraint condition corresponding to the rotation angle of the to-be-placed cell k being 180 degrees; any one of the following conditions: the left setback of the to-be-placed cell k is equal to the upper setback of the to-be-placed cell k, the right setback of the to-be-placed cell k is equal to the lower setback of the to-be-placed cell k, the upper setback of the to-be-placed cell k is equal to the right setback of the to-be-placed cell k, and the lower setback of the to-be-placed cell k is equal to the left setback of the to-be-placed cell k, is determined as the ninth constraint condition. The ninth constraint condition is the constraint condition corresponding to the rotation angle of the to-be-placed cell k being 270 degrees. The seventh constraint condition, the eighth constraint condition, and the ninth constraint condition are combined to determine the above-mentioned rotation constraint condition.

[0131] In an embodiment of the present application, the rotation constraint conditions of the monomer to be arranged are determined based on the setback conditions of the loading and unloading ports of the monomer to be arranged in various directions, so that the monomers to be arranged with different rotation angles can meet the setback requirements of the loading and unloading ports, thereby improving the accuracy of the determined rotation constraint conditions.

[0132] In some embodiments of the present application, the initial iteration coordinates of each cell to be placed are iteratively optimized using a target cost function and target constraints until an iteration stop condition is satisfied. Specifically, the target optimized coordinates of each cell to be placed can be obtained by temporarily removing the integer constraints in the MIP model, converting it into a linear programming (LP) problem, i.e., a relaxed problem. A linear programming algorithm (such as the simplex method or interior point method) is used to solve the relaxed problem.

[0133] In some embodiments, in the process of solving the integer solution, a branch and bound method can be used for the solution, that is, the target to be solved is divided into multiple sub-problems, and the process of solving the relaxation problem and branching is repeated for each sub-problem.

[0134] In some embodiments, a cutting plane method can also be used to solve the objective. By adding additional linear constraints (cutting planes) to the relaxed problem, the feasible region is gradually narrowed, causing the solution to the relaxed problem to ultimately fall on an integer point. The cutting planes are constructed based on the integer constraints of the original problem and the solution to the relaxed problem. After each cutting plane is added, the relaxed problem is resolved until an integer solution is obtained.

[0135] If the solution to the relaxed problem is an integer, it is the optimal solution to the original problem and serves as both an upper and lower bound. If the solution to the relaxed problem is not an integer, the objective function value of the relaxed problem is used as the upper bound of the optimal solution to the original problem, and the objective function value of a feasible integer solution to the original problem (using the coordinates of each unit to be laid out in the manually designed production line layout) is used as the lower bound. If no feasible integer solution is known, the lower bound can be set to negative infinity.

[0136] In the non-integer solutions to the relaxed problem, select one or more non-integer variables as branching variables. Create two subproblems for each selected branching variable. Solve the relaxed problem for each subproblem separately, obtaining the relaxed solution and objective function value. Compare the objective function values ​​of all relaxed solutions to the current upper bound, and take the smallest objective function value as the new upper bound (if it is smaller than the current upper bound). For the lower bound, if a relaxed solution to a subproblem is an integer solution and its objective function value is greater than the current lower bound, update the lower bound to the objective function value of the integer solution.

[0137] Based on the bounding results, each subproblem is judged. If the objective function value of the relaxed solution of the subproblem is greater than or equal to the current upper bound, or the feasible region of the subproblem is empty (that is, the relaxed problem has no solution), then the subproblem can be pruned and no further branching or solving is performed on it, because it is impossible for the subproblem to contain the optimal solution of the original problem.

[0138] Repeat the branch, bound, and prune steps until all subproblems are pruned or the optimal integer solution is found. When all unpruned subproblems have been explored and the current upper and lower bounds are equal, the optimal solution to the original mixed integer programming problem has been found.

[0139] When searching for integer solutions using branch-and-bound or other methods, an optimal integer solution is found when all unexplored subproblems have been pruned (through bounding) or all possible branches have been exhausted. If the relaxation problem is found to be unbounded during the solution process, the original MIP problem is also unbounded; if the relaxation problem has no solution, the original MIP problem also has no solution. Analyze the optimal solution to check whether it meets the logic and constraints of the actual problem. Substitute the optimal solution into the constraints of the original problem to verify that all constraints are met.

[0140] In practical applications, professional mathematical programming solvers (such as CPLEX, Gurobi, SCIP, etc.) are usually used to implement the above solution process. These solvers integrate efficient algorithms and optimization techniques and can solve large-scale MIP models quickly and effectively.

[0141] See also Figure 2 , Figure 2 The flowchart of another production line layout confirmation method provided by the embodiment of the present application is shown. Figure 1 , Figure 2 In the production line layout confirmation method shown, S103 may include S1031 and S1032.

[0142] S1031 , drawing a layout diagram of multiple cells to be arranged according to the target optimized coordinates of each cell to be arranged and the acquired size of each cell to be arranged, and determining the optimized path distance between every two cells to be arranged in the production line in the layout diagram.

[0143] Illustratively, the electronic device automatically draws a layout diagram of multiple units to be arranged within the factory area according to the target optimized coordinates of each unit to be arranged and the acquired size of each unit to be arranged, without the need for planners to draw on drawing software.

[0144] Among them, the optimized path distance between every two cells to be arranged in the production line in the layout diagram can be achieved in the following way: according to the target optimization coordinates of each cell to be arranged, the optimized path distance between every two cells to be arranged in the production line in the layout diagram is determined.

[0145] S1032: Determine the union of the layout diagram of the plurality of units to be arranged in the factory area and the optimized path distance between every two units to be arranged in the production line as the layout result of the plurality of units to be arranged in the production line.

[0146] In some embodiments, the optimized path distance between every two cells to be arranged in the production line may be marked in the layout diagram to obtain a layout result of multiple cells to be arranged in the production line.

[0147] In some embodiments, the optimized paths corresponding to different production processes of different products can be marked in the layout diagram to generate layout results of multiple units to be arranged within the production line corresponding to different production processes of different products.

[0148] In other embodiments, a file corresponding to a layout diagram of the plurality of units to be arranged within the production line and a file corresponding to the optimized path distance between each pair of units to be arranged within the production line can be determined as the layout result of the plurality of units to be arranged within the factory. For example, the layout diagram can be converted into a file output in a preset format, such as a PDF format, etc., the optimized path distance between each pair of units to be arranged within the production line can be converted into a file output in a predetermined format, and the optimized production path for each product within the production line can also be converted into a file output in a predetermined format, such as a table format.

[0149] In the technical solution of the embodiment of the present application, when the target optimization coordinates of each unit to be laid out are reached in the last iteration, the layout diagram of the factory area can be automatically drawn, the optimized path distance between each two units to be laid out in the factory area in the layout diagram can be determined, and the optimized production path of each production process of each product in the production line can be determined. There is no need for planners to draw the layout diagram of each unit to be laid out in the factory area one by one in the drawing software, and there is no need for planners to obtain the path distance between each two units to be laid out in the factory area by measuring the layout diagram. This makes it convenient for business personnel to compare the specific optimization distances of each product and equipment, thereby improving the efficiency of layout result output.

[0150] See also Figure 3 , Figure 3 FIG. 1 shows a flow chart of another method for confirming production line layout provided by an embodiment of the present application. Figure 3 As shown, the production line layout confirmation method provided in the embodiment of the present application may specifically include the following steps:

[0151] In S301: obtain input data.

[0152] In some embodiments, algorithms require input from various sources. To ensure the algorithm receives the correct input, data validity checks are required after the input. The primary data processing step involves organizing data fields, such as structured tables and database records, into appropriate data structures, making them standard inputs for the program.

[0153] The input data may specifically include the coordinates of the fixed module, the coordinates of the optimization module, the coordinates of the loading and unloading ports, the process routes of each product, etc.

[0154] In S302: Check whether the input data is abnormal.

[0155] For example, if the input data does not conform to a preset format, the input data is determined to be abnormal. Another example is if there are conflicting data in the input data, the conflicting data is determined to be abnormal. For example, multiple related table fields are checked for matching. If the check fails, an error message is displayed and the application is returned for correction. Another example is if the input data does not conform to preset requirements, the input data is determined to be abnormal.

[0156] If the input data is abnormal, an instruction may be given to modify the abnormal data; if the input data is normal, execute S303.

[0157] In S303: the target optimization coordinates of each unit to be laid out are solved by a mixed integer programming model.

[0158] In specific applications, this step may include coding, modeling, solving iterations, and outputting target optimization coordinates upon convergence.

[0159] Among them, in coding and modeling, how to use a reasonable coding method to determine the decision variables is the key. The decision variables of the embodiment of the present application are the placement positions of each unit to be laid out and the setting positions of the loading and unloading ports, that is, the decision variables can be the center coordinates of each unit to be laid out and the position optimization of the loading and unloading ports.

[0160] Therefore, the encoding scheme is as follows:

[0161] x represents the coordinate of the center point of the device in the X-axis direction;

[0162] y represents the Y-axis coordinate of the center point of the device;

[0163] α ij Represents the left-right relationship. If the monomer to be laid out i In the unit to be laid out j On the left side, then α ij is 1, otherwise 0;

[0164] β ij Represents the upper and lower relationships. If the monomer to be laid out i In the unit to be laid out j Below, β ij is 1, otherwise 0;

[0165] R represents the rotation, which is 0 degrees, 90 degrees, 180 degrees, and 270 degrees respectively.

[0166] The target cost function can be set as the minimum value of the sum of the production path distances of N types of products produced by the production line to be laid out, where N is the type of product produced by the production line.

[0167] The specific target cost function can be expressed as: , where i, j represent different monomers to be laid out, and I represents the set of all monomers to be laid out. Indicates the Manhattan distance in the X direction represents the Manhattan distance in the Y direction, represents the proportion of different products to all products, M represents the set of all products, Represents (i starting point, j starting point) of product m.

[0168] Target constraints may include the aforementioned equipment distance constraints, plant area constraints, and rotation constraints.

[0169] In some embodiments, a solver is used to solve the content of the optimization module (ie, decision variables), and outputs the target optimization coordinates when convergence stops.

[0170] In S304: determine whether a new solution is needed.

[0171] If the target optimized coordinates of each unit to be laid out do not satisfy the constraints, a constraint contradiction is determined and a new solution is required. Alternatively, if the solution result indicates that no feasible solution exists, a new solution is required.

[0172] If a new solution is required, the data is modified and the process returns to S303 . If a new solution is not required, S305 is executed.

[0173] In S305: output the target optimization coordinates of each unit to be laid out.

[0174] The embodiment of the present application adopts a mixed integer programming model for layout planning, which solves the fixed building overlap constraints, the optimal building overlap constraints, and the reserved distance constraints between equipment. It can obtain a better overall plan layout plan than manual design, reduce the requirements for layout personnel, improve layout efficiency, and accelerate layout freezing.

[0175] In some embodiments, the above S103 may specifically include:

[0176] The target cost function and target constraints are encoded according to a preset encoding method.

[0177] In the embodiment of the present application, the preset encoding method is the encoding scheme described in S303.

[0178] The initial iteration coordinates of the cells to be laid out are input into the solver, so that the solver solves the target optimization coordinates of each cell to be laid out according to the encoded target cost function and the encoded target constraint conditions.

[0179] The embodiment of the present application accurately represents the target cost function and target constraints based on the coding scheme, which can effectively improve the accuracy and efficiency of the solver in solving the target optimization coordinates and improve the efficiency of the production line layout.

[0180] Corresponding to the production line layout confirmation method described in the above embodiment, Figure 4 This is a structural block diagram of the production line layout confirmation device provided in an embodiment of the present application. The production line includes multiple units to be laid out. The production line is used to produce multiple products. The products include at least one production process. For ease of explanation, only the parts related to the embodiment of the present application are shown.

[0181] Reference Figure 4 , the production line layout confirmation device includes:

[0182] The acquisition unit 401 is used to obtain the original position information of the units to be arranged and the factory area information of the production line. The original position information includes the initial iteration coordinates of each unit to be arranged, the setback distance between each two units to be arranged, the size of each unit to be arranged, and the setback distance of the loading and unloading port of each unit to be arranged. The factory area information includes the size of the factory area and the position coordinates of the fixed modules in the factory area.

[0183] The constraint unit 402 is used to determine the target constraint conditions based on the setback distance between each two units to be arranged, the factory area size, the size of each unit to be arranged, the position coordinates of the fixed modules in the factory area, and the setback distance of the loading and unloading ports of each unit to be arranged.

[0184] Solving unit 403 is used to iteratively optimize the initial iteration coordinates of each unit to be arranged using a target cost function and target constraints until the iteration stop condition is met, thereby obtaining the target optimized coordinates of each unit to be arranged. The target cost function represents the minimum sum of the production path distances corresponding to all production processes of multiple products produced on the production line. The production path distance is calculated based on the production path corresponding to the production process and the position of each unit to be arranged.

[0185] The result generating unit 404 is used to generate layout results of multiple units to be arranged on the production line according to the target optimized coordinates of each unit to be arranged.

[0186] The acquisition unit 401 in the production line layout confirmation device can be used to obtain the setback distance between each two units to be arranged, the factory area size, the position coordinates of the fixed modules in the factory area, the size of each unit to be arranged, and the setback distance of the loading and unloading ports of each unit to be arranged; the above-mentioned production line layout confirmation device can also include a constraint determination unit, which is used to determine the target constraint condition based on the setback distance between each two units to be arranged, the factory area size, the position coordinates of the fixed modules in the factory area, the size of each unit to be arranged, and the setback distance of the loading and unloading ports of each unit to be arranged. The above-mentioned solution unit 403 can be specifically used to use the target cost function and the target constraint condition to iteratively optimize the initial iterative coordinates of each unit to be arranged until the iteration stop condition is met, and obtain the target optimized coordinates of each unit to be arranged.

[0187] In some implementations, the constraint determination unit can be specifically used to determine the distance constraint between devices based on the setback between each two units to be laid out, the coordinate position of the fixed module, and the size of each unit to be laid out; determine the plant range constraint based on the plant size and the size of each unit to be laid out; determine the rotation constraint based on the setback of the loading and unloading ports of each unit to be laid out; and combine the distance constraint between devices, the plant range constraint, and the rotation constraint to obtain the target constraint.

[0188] In some implementations, the constraint determination unit may be specifically configured to determine, based on the setback distance between each two cells to be laid out and the size of each cell to be laid out, the first shortest distance and the second shortest distance in the horizontal direction, and the third shortest distance and the fourth shortest distance in the vertical direction; determine, based on the coordinates of the cells to be laid out and the coordinate position of the fixed module, the overlapping relationship between each cell to be laid out and the fixed module; determine, based on the coordinates of the cells to be laid out, the positional relationship between each two cells to be laid out; and determine, based on the overlapping relationship between each cell to be laid out and the fixed module, the positional relationship between each two cells to be laid out, and the first shortest distance, the second shortest distance, the third shortest distance, and the fourth shortest distance, the distance constraint between devices.

[0189] In some implementations, the constraint determination unit may be specifically used to determine the horizontal and vertical ranges of the plant area based on the plant size; determine the horizontal and vertical positions of each unit to be laid out based on the coordinates of each unit to be laid out and the size of each unit to be laid out; and determine that the horizontal position of each unit to be laid out is within the horizontal range, and the vertical position of each unit to be laid out is within the vertical range, as plant range constraints.

[0190] In some implementations, the constraint determination unit can be specifically used to determine the setback corresponding to each direction of each unit to be arranged based on the setback of the loading and unloading ports of each unit to be arranged; and determine the rotation constraint corresponding to each rotation angle based on the setback corresponding to each direction of each unit to be arranged.

[0191] In some implementations, the result generation unit 404 is specifically used to draw a layout diagram of multiple units to be laid out based on the target optimization coordinates of each unit to be laid out and the obtained size of each unit to be laid out, and determine the optimized path distance between every two units to be laid out in the production line in the layout diagram.

[0192] Optionally, the result generating unit 404 is further configured to: mark the optimization paths corresponding to different products in the layout diagram.

[0193] In some implementations, the solving unit 403 is specifically used to encode the target cost function and the target constraint conditions according to a preset encoding method; the initial iterative coordinates of the units to be laid out are input into the solver, so that the solver solves the target optimization coordinates of each unit to be laid out according to the encoded target cost function and the encoded target constraint conditions.

[0194] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of this application. Their specific functions and technical effects can be found in the method embodiment section and will not be repeated here.

[0195] Based on this, the production line layout confirmation device provided in the embodiment of the present application can also iteratively optimize the coordinates of the units to be laid out through the target cost function, thereby generating layout results of multiple units to be laid out in the production line based on the target optimization coordinates of each unit to be laid out. There is no need to complete the production line planning in the drawing software based on experience and spend a lot of time. Instead, the production line layout planning is completed by iterating the coordinates of each unit to be laid out through the target cost function, thereby improving the layout efficiency of the production line layout; in addition, the minimum value of the sum of the production path distances of multiple products is used as the target of iterative optimization, so that the generated production line layout result can meet the production path requirements of multiple products, thereby improving the accuracy of the production line layout.

[0196] in addition, Figure 4 The production line layout confirmation device shown can be a software unit, a hardware unit, or a combination of software and hardware units built into an existing electronic device, or it can be integrated into the electronic device as an independent pendant, or it can exist as an independent electronic device.

[0197] Those skilled in the art can clearly understand that, for the convenience and brevity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In actual applications, the above-mentioned functions can be distributed and completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated into one processing unit, or each unit can exist physically alone, or two or more units can be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0198] Figure 5 Schematic diagram of the structure of the electronic device provided in the embodiment of the present application. Figure 5 As shown, the electronic device 5 of this embodiment includes: at least one processor 50 ( Figure 5 Only one is shown in the figure) a processor, a memory 51, and a computer program 52 stored in the memory 51 and executable on the at least one processor 50, wherein the processor 50 implements the steps of any of the above-mentioned production line layout confirmation method embodiments when executing the computer program 52.

[0199] The electronic device may be a computing device such as a desktop computer, a notebook, a PDA, or a cloud server. The electronic device may include, but is not limited to, a processor and a memory. Those skilled in the art will understand that Figure 5 This is merely an example of the electronic device 5 and does not constitute a limitation on the electronic device 5 . The electronic device 5 may include more or fewer components than shown in the figure, or a combination of certain components, or different components. For example, it may also include input and output devices, network access devices, etc.

[0200] The processor 50 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. A general-purpose processor may be a microprocessor or any conventional processor.

[0201] In some embodiments, the memory 51 may be an internal storage unit of the electronic device 5, such as a hard drive or memory of the electronic device 5. In other embodiments, the memory 51 may also be an external storage device of the electronic device 5, such as a plug-in hard drive, a Smart Media Card (SMC), a Secure Digital (SD) card, a flash memory card, etc. equipped on the electronic device 5. Furthermore, the memory 51 may include both an internal storage unit of the electronic device 5 and an external storage device. The memory 51 is used to store an operating system, application programs, a boot loader, data, and other programs, such as the program code of the computer program. The memory 51 may also be used to temporarily store data that has been output or is about to be output.

[0202] An embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in the above-mentioned various method embodiments can be implemented.

[0203] An embodiment of the present application provides a computer program product. When the computer program product is run on an electronic device, the electronic device can implement the steps of the above-mentioned method embodiments when executing the computer program product.

[0204] If the integrated unit is implemented as a software functional unit and used as a standalone product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the process steps in the above-mentioned method embodiments by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When executed by a processor, the computer program can implement the steps of each of the above-mentioned method embodiments. The computer program includes computer program code, which can be in source code form, object code form, executable file, or some intermediate form. The computer-readable medium can include at least: any entity or device capable of carrying computer program code to a device / electronic device, a recording medium, computer memory, read-only memory (ROM), random access memory (RAM), an electrical carrier signal, a telecommunications signal, and a software distribution medium. Examples include a USB flash drive, a removable hard drive, a magnetic disk, or an optical disk.

[0205] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant description of other embodiments.

[0206] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0207] In the embodiments provided in the present application, it should be understood that the disclosed devices / electronic devices and methods can be implemented in other ways. For example, the device / electronic device embodiments described above are merely schematic. For example, the division of the modules or units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0208] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0209] The above-described embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. These modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present application, and should all be included in the scope of protection of the present application.

Claims

1. A production line layout confirmation method, characterized in that: The production line includes a plurality of units to be laid out, the production line is used to produce a plurality of products, and the products include at least one production process. The production line layout confirmation method includes: Obtaining the original position information of the cells to be arranged and the factory area information of the production line, wherein the original position information includes the initial iteration coordinates of each cell to be arranged, the setback distance between every two cells to be arranged, the size of each cell to be arranged, and the setback distance of the loading and unloading port of each cell to be arranged; the factory area information includes the size of the factory area and the position coordinates of the fixed modules in the factory area; Determine the target constraint condition based on the setback distance between each two cells to be arranged, the size of the plant area, the size of each cell to be arranged, the position coordinates of the fixed module in the plant area, and the setback distance of the loading and unloading port of each cell to be arranged; Using the target cost function and the target constraint conditions, the initial iterative coordinates of each of the units to be arranged are iteratively optimized until the iteration stop condition is met, thereby obtaining the target optimized coordinates of each of the units to be arranged; wherein the target cost function represents the minimum value of the sum of the production path distances corresponding to all production processes of multiple products produced on the production line, and the production path distances are calculated based on the production paths corresponding to the production processes and the positions of each of the units to be arranged; the target optimized coordinates of the units to be arranged include the position coordinates of the units to be arranged and the position coordinates of the loading and unloading ports of the units to be arranged; According to the target optimization coordinates of each of the units to be arranged, layout results of multiple units to be arranged on the production line are generated.

2. The production line layout confirmation method according to claim 1, characterized in that: Determining target constraints based on the setback distance between each two cells to be laid out, the factory area size, the position coordinates of fixed modules in the factory area, the size of each cell to be laid out, and the setback distance of the loading and unloading ports of each cell to be laid out includes: Determining the inter-device distance constraint condition according to the setback distance between each two cells to be arranged, the coordinate position of the fixed module, and the size of each cell to be arranged; Determining plant area constraints based on the plant area size and the sizes of the individual units to be laid out; Determining a rotation constraint condition according to the setback distance of the loading and unloading ports of each of the units to be arranged; The target constraint condition is obtained by combining the inter-equipment distance constraint condition, the plant area constraint condition, and the rotation constraint condition.

3. The production line layout confirmation method according to claim 2, characterized in that: Determining the inter-device distance constraint condition according to the back-off distance between each two cells to be arranged, the coordinate position of the fixed module, and the size of each cell to be arranged includes: Determine, based on the setback distance between each two cells to be arranged and the size of each cell to be arranged, a first shortest distance and a second shortest distance in the horizontal direction, and a third shortest distance and a fourth shortest distance in the vertical direction, between each two cells to be arranged; Determining an overlapping relationship between each of the cells to be laid out and the fixed modules according to the coordinates of the cells to be laid out and the coordinate positions of the fixed modules; Determining the positional relationship between every two cells to be arranged according to the coordinates of the cells to be arranged; The inter-device distance constraint is determined according to the overlapping relationship between each unit to be arranged and the fixed module, the positional relationship between each two units to be arranged, the first shortest distance, the second shortest distance, the third shortest distance, and the fourth shortest distance.

4. The production line layout confirmation method according to claim 2, characterized in that: Determining the plant area constraint conditions based on the plant area size and the sizes of the individual units to be laid out includes: Determine the horizontal and vertical extents of the plant area based on the plant area dimensions; Determining the horizontal position and the vertical position of each of the cells to be arranged according to the coordinates of each of the cells to be arranged and the size of each of the cells to be arranged; The horizontal position of each of the cells to be arranged is within the horizontal range, and the vertical position of each of the cells to be arranged is within the vertical range, which are determined as the plant range constraint conditions.

5. The production line layout confirmation method according to claim 2, characterized in that: The determining of the rotation constraint condition according to the setback distance of the loading and unloading ports of each unit to be arranged includes: Determine the corresponding setback distance of each unit to be arranged in each direction according to the setback distance of the loading and unloading port of each unit to be arranged; According to the setbacks corresponding to the various directions of each cell to be laid out, a rotation constraint condition corresponding to each rotation angle is determined.

6. The production line layout confirmation method according to any one of claims 1 to 5, characterized in that: Generating layout results of a plurality of units to be arranged on the production line according to the target optimization coordinates of each unit to be arranged includes: A layout diagram of the plurality of cells to be arranged is drawn according to the target optimization coordinates of each cell to be arranged and the acquired size of each cell to be arranged, and an optimized path distance between every two cells to be arranged in the production line in the layout diagram is determined.

7. The production line layout confirmation method according to claim 6, characterized in that: Generating layout results of the plurality of units to be arranged on the production line according to the target optimized coordinates of each unit to be arranged further includes: The optimized paths corresponding to different production processes of different products are marked in the layout diagram.

8. The production line layout confirmation method according to claim 1, characterized in that: The step of iteratively optimizing the initial iterative coordinates of each of the cells to be arranged using the target cost function and the target constraint conditions until an iteration stop condition is satisfied, and obtaining the target optimized coordinates of each of the cells to be arranged, includes: Encoding the target cost function and the target constraint condition according to a preset encoding method; The initial iterative coordinates of the cells to be arranged are input into a solver, so that the solver solves the target optimized coordinates of each cell to be arranged according to the encoded target cost function and the encoded target constraint condition.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the production line layout confirmation method according to any one of claims 1 to 8 is implemented.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the production line layout confirmation method according to any one of claims 1 to 8 is implemented.

Images