Layout planning method and device, electronic equipment and storage medium

Abstract

This application provides a layout planning method, apparatus, electronic device, and storage medium. The layout planning method includes: acquiring region information, wherein the region information indicates the size of a region to be planned, and the size and position of at least one sub-region within the region to be planned; acquiring position constraint information, wherein the position constraint information indicates the constraints on the relative position of the placement area of ​​each of at least two objects to be planned with respect to the region to be planned and the at least one sub-region; acquiring attribute constraint information of the placement area; and determining the position of the placement areas of the at least two objects to be planned within the region to be planned based on the region information, the position constraint information, and the attribute constraint information. This solution introduces position constraint information and attribute constraint information during layout planning, resulting in highly reliable layout planning results, reducing manual labor intensity, and improving the efficiency of layout planning.

Description

Technical Field

[0001] This application relates to the field of data processing technology, and in particular to a layout planning method, apparatus, electronic device, and storage medium. Background Technology

[0002] Factory layout planning aims to plan and design the location, size, and shape of each production area within the factory, finding suitable physical locations for each production area. A reasonable factory layout plan can minimize the total amount of logistics between production areas, thereby improving production efficiency, reducing production costs, and minimizing waste and losses during the production process.

[0003] Currently, the optimal placement location for each area to be planned is determined manually, and then the layout is planned based on the optimal placement location.

[0004] However, in reality, various production areas in a factory may have multiple product lines or be shared by multiple departments. Furthermore, due to certain practical construction, safety, or legal constraints, some production areas may need to be concentrated in designated areas within the factory. Therefore, when manually determining the optimal placement of each planned area, it is impossible to consider the combination of the planned area with the actual conditions, resulting in low feasibility of the layout planning results. Moreover, manual layout planning and adjustments to the layout planning results involve high labor intensity, leading to low efficiency in layout planning. Summary of the Invention

[0005] In view of this, the layout planning method, apparatus, electronic device and storage medium provided in this application can improve the efficiency of layout planning by reducing the manual labor intensity of layout planning.

[0006] According to a first aspect of the embodiments of this application, a layout planning method is provided, comprising: acquiring region information, wherein the region information is used to indicate the size of a region to be planned, and the size and position of at least one sub-region within the region to be planned; acquiring position constraint information, wherein the position constraint information is used to indicate the constraints on the relative position of the placement area of ​​each of at least two objects to be planned with respect to the region to be planned and the at least one sub-region; acquiring attribute constraint information of the placement area; and determining the position of the placement area of ​​the at least two objects to be planned within the region to be planned based on the region information, the position constraint information, and the attribute constraint information.

[0007] According to a second aspect of the embodiments of this application, a layout planning apparatus is provided, comprising: a first acquisition unit, configured to acquire region information, wherein the region information is used to indicate the size of a region to be planned, and the size and position of at least one sub-region within the region to be planned; a second acquisition unit, configured to acquire position constraint information, wherein the position constraint information is used to indicate the constraint conditions of the relative position between the placement area of ​​each of at least two objects to be planned and the region to be planned and the at least one sub-region; a third acquisition unit, configured to acquire attribute constraint information of the placement area; and a determination unit, configured to determine the position of the placement area of ​​the at least two objects to be planned within the region to be planned based on the region information, the position constraint information, and the attribute constraint information.

[0008] According to a third aspect of the present application, an electronic device is provided, including: a processor, a communication interface, a memory, and a communication bus, wherein the processor, the memory, and the communication interface communicate with each other through the communication bus; the memory is used to store at least one executable instruction, wherein the executable instruction causes the processor to perform an operation corresponding to the layout planning method provided in the first aspect.

[0009] According to a fourth aspect of the embodiments of this application, a computer-readable storage medium is provided, wherein computer instructions are stored on the computer-readable storage medium, and when executed by a processor, the computer instructions cause the processor to perform the operation corresponding to the layout planning method provided in the first aspect.

[0010] According to a fifth aspect of the present application, a computer program product is provided, which is tangibly stored on a computer-readable medium and includes computer-executable instructions that, when executed, cause at least one processor to perform the layout planning method provided in the first aspect above.

[0011] The above technical solution first obtains regional information, thereby determining the size of the area to be planned and its sub-areas. It then obtains the positional constraint information of the placement area, thereby determining its positional constraints and attribute constraint information. Finally, based on the regional information, positional constraint information, and attribute constraint information, the position of the placement area within the area to be planned is determined. This achieves automatic layout planning, reducing manual labor. Furthermore, by using positional and attribute constraint information, it can meet the placement conditions of different objects to be planned. Since the placement area is constrained by positional and attribute constraint information, the output layout planning results are more reliable, reducing the labor intensity of manually modifying the output layout planning results and thus improving the efficiency of layout planning. Attached Figure Description

[0012] Figure 1 This is a flowchart of a layout planning method provided in an embodiment of this application;

[0013] Figure 2 This is a schematic diagram of a layout planning result provided in an embodiment of this application;

[0014] Figure 3 This is a flowchart of a chromosome encoding acquisition method provided in an embodiment of this application;

[0015] Figure 4 This is a schematic diagram of a first chromosome encoding provided in an embodiment of this application;

[0016] Figure 5 This is a schematic diagram of a layout planning device provided in an embodiment of this application;

[0017] Figure 6 This is a schematic diagram of an electronic device provided in an embodiment of this application.

[0018] List of reference numerals in the attached diagram:

[0019] 101: Obtain Regional Information

[0020] 102: Obtain position constraint information

[0021] 103: Obtain the attribute constraint information of the placement area

[0022] 104: Based on the regional information, location constraint information, and attribute constraint information, determine the placement of at least two objects to be planned.

[0023] Location of the area within the planned area

[0024] 301: Based on the location constraint information, group at least two placement areas to obtain at least one placement area group.

[0025] 302: Encode the positional constraint information of the placement areas in the placement area group to obtain the placement area sequence corresponding to that placement area group.

[0026] 303: Encode the attribute constraint information to obtain at least one constraint sequence.

[0027] 304: Concatenate at least one placement region sequence and at least one constraint sequence to obtain the first chromosome code.

[0028] 100: Layout planning method; 200: Area to be planned; 500: Layout planning device.

[0029] 201: Sub-region 202: Placement region 203: Placement region

[0030] 204: Placement Area 205: Placement Area 206: Logistics Flow Line

[0031] 207: Material flow line; 401: Placement area sequence; 402: Placement area sequence

[0032] 403: Placement Region Sequence 404: Constraint Sequence 405: Constraint Sequence

[0033] 501: First acquisition unit; 502: Second acquisition unit; 503: Third acquisition unit

[0034] 504: Determining Unit; 600: Electronic Equipment; 602: Processor

[0035] 604: Communication interface; 606: Memory; 608: Communication bus

[0036] 610: Program 300: Chromosome Encoding Acquisition Method Detailed Implementation

[0037] As mentioned earlier, currently, the optimal placement location for each area to be planned is determined manually, and then layout planning is carried out based on the optimal placement location. However, in reality, various production areas in a factory may have multiple product lines or be shared by multiple departments. Furthermore, due to certain practical construction, safety, or legal constraints, some production areas need to be concentrated in designated areas within the factory. Therefore, manually determining the optimal placement location for each area to be planned cannot take into account the combination of the planned area and the actual conditions, resulting in low feasibility of the layout planning results. In addition, the high labor intensity of manual layout planning and adjustments to the layout planning results leads to low efficiency.

[0038] In this embodiment, firstly, region information is obtained, thereby determining the size of the region to be planned and its sub-regions. Then, positional constraint information of the placement region is obtained, thereby determining its positional constraints and attribute constraint information. Finally, the position of the placement region within the region to be planned is determined based on the region information, positional constraint information, and attribute constraint information. This achieves automatic layout planning, reducing manual labor. Furthermore, by using positional and attribute constraint information, the placement conditions of different objects to be planned can be met. Since the placement region is constrained by positional and attribute constraint information, the output layout planning result is more reliable, reducing the labor intensity of manually modifying the output layout planning result and thus improving the efficiency of layout planning.

[0039] The layout planning method, apparatus, and electronic equipment provided in the embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0040] Figure 1 This is a flowchart of a layout planning method 100 provided in an embodiment of this application. For example... Figure 1 As shown, the layout planning method 100 includes the following steps:

[0041] Step 101: Obtain regional information.

[0042] The process involves obtaining area information, including the dimensions of the area to be planned. For example, if the area is a rectangular factory, the area information would include the factory's length and width, thus determining its size. The planned area includes at least one sub-area. For instance, the factory may have two departments, Department A and Department B, located within sub-area A and sub-area B, respectively. Each sub-area is within the planned area and can contain each other; for example, sub-area A may include sub-area C, and sub-area C may include sub-area D, and so on. Sub-areas can also intersect; for example, part of sub-area A may be located within sub-area B. The area information also includes the dimensions and location of at least one sub-area within the planned area.

[0043] In one example, the size of the area to be planned and the size and location of at least one sub-area within the area to be planned can be obtained manually through the parameter input window, or the size of the area to be planned and the size and location of at least one sub-area within the area to be planned can be imported from the data table through the import interface. The specific method for obtaining the area information is not limited in this embodiment of the application.

[0044] Step 102: Obtain position constraint information.

[0045] Location constraint information indicates the placement area for each of at least two objects to be planned, and the constraints on their relative positions to the planned area and at least one sub-area. The placement area for the planned object can be used to place the planned object, which can be materials in a factory, such as bent materials, steel coils, etc. The placement area for the planned object must be placed within the planned area.

[0046] Location constraint information can constrain the relative position of each placement area with the area to be planned and at least one sub-area. For example, the placement area corresponding to a bend can be placed in sub-area A or sub-area B, or the placement area corresponding to a bend cannot be placed in sub-area A but can be placed in sub-area B, and the placement area corresponding to a steel coil cannot be placed in either sub-area A or sub-area B, etc.

[0047] Step 103: Obtain the attribute constraint information of the placement area.

[0048] Obtain attribute constraint information for the placement areas corresponding to at least two objects to be planned. The attribute constraint information consists of the attribute constraints on the placement areas, such as constraints on whether the area can be modified and whether it can be adjacent to other placement areas.

[0049] Step 104: Based on the area information, location constraint information, and attribute constraint information, determine the location of at least two objects to be planned within the planned area.

[0050] Based on the area information, location constraint information, and attribute constraint information, the layout planning result is determined. In one example, the coordinates of each placement area can be determined through layout planning, and the area of ​​the area to be planned can be determined based on the area information. Thus, the placement areas of at least two objects to be planned can be determined in the area to be planned. Optionally, the corresponding layout planning drawing can be generated based on the layout planning result, which will not be elaborated here.

[0051] In this embodiment, firstly, region information is obtained, thereby determining the size of the region to be planned and its sub-regions. Then, positional constraint information of the placement region is obtained, thereby determining its positional constraints and attribute constraint information. Finally, the position of the placement region within the region to be planned is determined based on the region information, positional constraint information, and attribute constraint information. This achieves automatic layout planning, reducing manual labor. Furthermore, by using positional and attribute constraint information, the placement conditions of different objects to be planned can be met. Since the placement region is constrained by positional and attribute constraint information, the output layout planning result is more reliable, reducing the labor intensity of manually modifying the output layout planning result and thus improving the efficiency of layout planning.

[0052] In one possible implementation, the area information includes: the length and width of the area to be planned, and the length, width, and coordinates of at least one corner point of each sub-area within at least one sub-area.

[0053] The area information includes the length and width of the area to be planned, which can determine the size of the area to be planned. It also includes the length and width of each sub-area, which can determine the size of each sub-area included in the area to be planned. Furthermore, it includes the coordinates of at least one corner point of each sub-area, which can determine the position of each sub-area in the area to be planned.

[0054] It should be understood that the area to be planned is a rectangular area, and each sub-area included in the area to be planned is also a rectangular area. Therefore, the area of ​​the area to be planned and each sub-area can be calculated based on the length and width. Since the sub-area is a rectangular area, the position of the sub-area in the area to be planned can be determined by the coordinates of at least one corner point and the area of ​​the sub-area.

[0055] In this embodiment, the area information includes the length and width of the area to be planned, and the length, width, and coordinates of at least one corner point of each sub-area in at least one sub-area. This allows the size of the area to be planned and the size and position of each sub-area to be determined. Thus, the placement area can be laid out in the area to be planned or at least one sub-area based on the area information, thereby achieving automatic layout planning.

[0056] In one possible implementation, when determining the positions of at least two objects to be planned within the planned area based on region information, location constraint information, and attribute constraint information, the attribute constraint information can be encoded based on the location constraint information to obtain a first chromosome code. Then, the first chromosome code and region information are input into a genetic algorithm to solve for the optimal solution, obtaining at least one second chromosome code. Based on a pre-defined evaluation standard, an evaluation value for at least one second chromosome code is determined, and the evaluation values ​​are sorted in ascending order. The second chromosome codes corresponding to the first N evaluation values ​​are determined as N target chromosome codes, where N is a positive integer greater than or equal to 1. Each target chromosome code is then decoded to obtain the positions of at least two objects to be planned within the planned area.

[0057] Based on the location constraint information, the attribute constraint information of the placement area corresponding to each object to be planned is encoded to obtain the first chromosome code. The optimal solution is obtained by the genetic algorithm on the first chromosome code. The genetic algorithm will search for the placement position of each placement area based on the area information and the first chromosome code, and determine multiple schemes for placing multiple placement areas in the area to be planned or in each sub-area, that is, at least one second chromosome code. The second chromosome code is the code of the planning result of the placement area of ​​the object to be planned.

[0058] Based on predetermined evaluation criteria, such as a pre-set penalty coefficient, the evaluation value of each second chromosome code is determined, for example, the suitability of each second chromosome code can be determined. The evaluation values ​​are sorted in ascending order, and the second chromosome codes corresponding to the top N evaluation values ​​are identified as N target chromosome codes. Then, the target chromosome codes are decoded, thereby determining N layout planning schemes, that is, the positions of N placement areas (at least two objects to be planned) within the planned area.

[0059] Optionally, N layout planning schemes can be listed in a list format, with each scheme's corresponding evaluation value, material flow, and violated constraints listed in the list. By selecting different layout planning schemes from the list, at least two placement areas of the objects to be planned can be displayed in different locations within the planned area. This allows for manual selection of a more suitable scheme. It should be understood that since the scheme with the lower evaluation value is not necessarily the optimal scheme, multiple schemes need to be listed for manual selection, which can reduce the labor intensity of manually modifying the layout planning schemes.

[0060] It should be understood that, in addition to inputting the first chromosome code and region information into the genetic algorithm to find the optimal solution, the first chromosome code and region information can also be input into any metaheuristic algorithm to calculate the position of the placement regions of at least two objects to be planned in the region to be planned. This will not be elaborated further here.

[0061] In this embodiment, the attribute constraint information of the placement area is encoded based on the position constraint information. The encoded first chromosome code and the area information are then input into a genetic algorithm to solve for the optimal solution, obtaining at least one second chromosome code. The at least one second chromosome code is then evaluated, and N second chromosome codes with smaller evaluation values ​​can be determined. This yields N layout planning results, realizing automatic layout planning. Since position constraint information and attribute constraint information are introduced during the layout planning process, and the second chromosome codes with smaller evaluation values ​​are filtered for decoding, layout schemes that meet the evaluation criteria and satisfy the position and attribute constraints of each placement area can be selected. This makes the output layout planning results more reliable and reduces the labor intensity of manually modifying the output layout planning results, thus improving the efficiency of layout planning.

[0062] In one possible implementation, when determining the evaluation value of at least one second chromosome code according to a pre-set evaluation criterion, the coordinates of each placement area in each second chromosome code can be determined. Then, based on the coordinates of the placement areas, the distance between the placement areas is determined, and the material flow rate of each object to be planned is determined based on the distance between the placement areas. Based on the material flow rate and the pre-set evaluation constraints, at least one second chromosome code is evaluated to determine the evaluation value of at least one second chromosome code.

[0063] Determine the coordinates of each placement area in each second chromosome code. It should be understood that each placement area in the second chromosome code is located within the area to be planned, or at least one sub-area within the area to be planned. After determining the coordinates of each placement area, determine the distance between the placement areas, and then determine the material flow rate for each object to be planned based on the determined distances. It should be noted that since the object to be planned is not immobile after being placed in the placement area—for example, it may need to be moved to the production area during production, or moved from the receiving entrance / exit to the corresponding placement area during receiving—it is necessary to calculate the material flow rate for the object to be planned. Optionally, the material flow rate for the object to be planned can be calculated using its weight and the expected movement distance. The expected movement distance can be determined based on the distance between the placement areas.

[0064] The evaluation value of each second chromosome code is determined based on the material flow rate and pre-set evaluation conditions. These pre-set conditions can be constraints on each placement area, such as: objects requiring ventilation need to be placed near windows; objects requiring fire protection need to be placed in non-high-temperature areas; and space occupancy must exceed a threshold. A penalty coefficient can be pre-set for each constraint; failure to meet the constraint results in a penalty. Optionally, the material flow rate and penalty value can be weighted and summed when calculating the evaluation value to obtain the evaluation value of the second chromosome code.

[0065] It should be understood that in layout planning, the smaller the material flow, the better, and the more evaluation conditions are met, the better. Since failing to meet the evaluation conditions will increase the penalty value, the second chromosome encoding scheme with the smaller the weighted evaluation value is more in line with the requirements.

[0066] In one example, Figure 2 This is a schematic diagram of a layout planning result provided in an embodiment of this application, such as... Figure 2 As shown, the planned area 200 includes sub-area 201. Placement areas 202 and 205 are located within sub-area 201, while placement areas 203 and 204 are located within the planned area 200. The layout planning result may include a material flow line 206 between placement areas 202 and 203, and a material flow line 207 between placement areas 203 and 204. Since placement area 205 does not participate in production, it has no material flow line. Material flow line 206 is thicker than material flow line 207; therefore, the material flow rate of the planned objects in placement area 202 is greater than that in placement area 203. It should be understood that the above is merely an example and should not be construed as limiting the scope of this application.

[0067] In this embodiment, the distance between placement areas and the location of the placement areas are determined based on the coordinates of the placement areas. Then, the material flow of the corresponding object to be planned can be determined based on the distance between the placement areas. Thus, the evaluation value of the second chromosome code can be determined by the constraints and the material flow, realizing the evaluation of the second chromosome code. Therefore, when selecting the second chromosome code with the lowest evaluation value, the material flow and constraints can be comprehensively considered. Thus, the selected second chromosome code can meet the layout requirements, making the layout planning result more referential and reducing the labor intensity of manually modifying the output layout planning result, thereby improving the efficiency of layout planning.

[0068] In one possible implementation, the attribute constraint information includes at least the rotation constraints and aspect ratio change constraints of the placement area of ​​each object to be planned.

[0069] The attribute constraint information of the placement area corresponding to the object to be planned includes at least the rotation constraint of the placement area, which can determine whether the placement area can be rotated, that is, whether the length and width values ​​can be exchanged. It also includes aspect ratio change constraint, that is, whether the placement area can change only the length or only the width.

[0070] It should be understood that attribute constraint information may also include whether the placement area can exceed the planning area or the boundary of the sub-area, and whether it participates in the material flow calculation, etc., which are not limited here.

[0071] In the embodiments of this application, the attribute constraint information includes at least the rotation constraint and aspect ratio change constraint of the placement area of ​​each object to be planned. This allows for constraints on the rotation and aspect ratio changes of the placement area, making the layout planning results output based on the attribute constraint information more reliable. It can reduce the labor intensity of manually modifying the output layout planning results, thereby improving the efficiency of layout planning.

[0072] Figure 3 This is a flowchart of a chromosome encoding acquisition method 300 provided in an embodiment of this application, as shown below. Figure 3 As shown, when encoding the attribute constraint information based on the position constraint information to obtain the first chromosome code, the first chromosome code can be obtained through the following steps:

[0073] Step 301: Based on the location constraint information, group at least two placement areas to obtain at least one placement area group.

[0074] Each placement area group includes at least one placement area. Placement areas in the same placement area group are located within the same candidate area, and placement areas in different placement area groups are located within different candidate areas. Candidate areas include sub-areas and areas in the area to be planned other than the sub-areas.

[0075] Based on the location constraints, the placement location of each placement area is determined. For example, a placement area can be placed in sub-area A, a placement area can be placed in sub-area B, a placement area cannot be placed in either sub-area A or sub-area B, and so on. Based on the placement location of each placement area, the placement areas are grouped to obtain multiple placement area groups. Different placement area groups include placement areas placed within different sub-areas.

[0076] Step 302: Encode the position constraint information of the placement area in the placement area group to obtain the placement area sequence corresponding to the placement area group.

[0077] The positional constraint information of the placement areas in the placement area group is encoded to obtain the placement area sequence corresponding to the placement area group. The placement area sequence includes multiple placement area sub-sequences, each of which corresponds to a placement area within the placement area group. The placement area sequence can indicate the placement order of each placement area. Optionally, each placement area sub-sequence can be sorted according to a predetermined placement order of the objects to be planned to obtain the placement area sequence.

[0078] Step 303: Encode the attribute constraint information to obtain at least one constraint sequence.

[0079] Different constraint sequences correspond to different types of constraint information in attribute constraint information. The constraint sequence includes the result of encoding the target constraint information of each placement area. The type of the target constraint information is the same as the type of the constraint information corresponding to the constraint sequence.

[0080] Attribute constraint information is encoded. For example, a constraint sequence is obtained by encoding rotation constraints and aspect ratio change constraints within the attribute constraint information. A constraint sequence includes constraint information for each placement area, and each constraint sequence corresponds to a type of constraint information. For instance, a rotation constraint sequence is obtained by encoding the rotation constraints for each placement area, and the rotation constraint sequence only includes rotation constraints for each placement area. Different constraint sequences correspond to different constraint types; for example, there may be only one rotation constraint sequence and only one aspect ratio change constraint sequence.

[0081] Step 304: Splice at least one placement region sequence and at least one constraint sequence to obtain the first chromosome code.

[0082] At least one placement region sequence is sorted in a predetermined order, and the sorted placement region sequences are concatenated with at least one constraint sequence to obtain the first chromosome code. It should be understood that the placement region sequences corresponding to each sub-region group can be sorted according to a predetermined sub-region order.

[0083] Figure 4 This is a schematic diagram of a first chromosome encoding provided in an embodiment of this application, as shown below. Figure 4 As shown, the first chromosome encoding includes a placement region sequence 401 corresponding to a placement region group placed in sub-region A, a placement region sequence 402 corresponding to a placement region group placed in sub-region B, and a placement region sequence 403 corresponding to a placement region group not placed in either sub-region A or sub-region B, a constraint sequence 404 corresponding to rotation constraints, and a constraint sequence 405 corresponding to aspect ratio change constraints. Each rectangle in the placement region sequence corresponds to a placement region, and the rectangles in the constraint sequence correspond one-to-one with the rectangles in the placement region sequence, representing the constraint information for the same placement region.

[0084] In this embodiment, the placement areas are grouped according to position constraint information, and the position constraint information of each placement area in the group is encoded according to the grouping result to obtain a placement area sequence. Attribute constraint information is also encoded to determine at least one constraint sequence. The constraint sequence and the placement area sequence are concatenated to obtain a first chromosome code. Since the first chromosome code encodes attribute constraint information, the second chromosome code determined by the genetic algorithm also contains attribute constraint information. Therefore, the layout planning result determined according to the target chromosome code satisfies the constraint conditions in the attribute constraint information. Furthermore, because the position constraint conditions are met, the output layout planning result is more reliable, reducing the labor intensity of manually modifying the output layout planning result and thus improving the efficiency of layout planning.

[0085] In one possible implementation, when grouping at least two placement areas according to location constraint information to obtain at least one placement area group, the placement area located in the sub-region can be determined as the first placement area according to the location constraint information, and the placement area located in the area to be planned but outside the sub-region can be determined as the second placement area. Then, the first placement area located in the sub-region can be determined as the placement area group corresponding to the sub-region, and the set of each second placement area can be determined as a placement area group.

[0086] When grouping placement areas, the placement areas within each sub-region are determined based on location constraint information. Then, the placement areas within a sub-region are defined as a placement area group corresponding to that sub-region. For example, placement areas in sub-region A are defined as the first placement area group, and placement areas in sub-region B are defined as the second placement area group. It should be understood that if a placement area can be placed in multiple sub-regions, then that placement area can be located in multiple placement area groups. Placement areas that are to be planned within a specific area but cannot be placed in any sub-region are defined as a single placement area group.

[0087] In this embodiment of the application, the placement area placed in the sub-region is defined as the placement area group of the sub-region, and the placement area placed outside the sub-region is defined as a placement area group. This can realize the division of placement area groups, so that each placement area can be encoded according to the placement area group.

[0088] In one possible implementation, when grouping at least two placement areas according to location constraint information to obtain at least one placement area group, each placement area that can only be located in the same sub-region can be determined as the placement area group corresponding to that sub-region according to the location constraint information. Then, according to the location constraint information, the set of placement areas that can be located in multiple sub-regions and the set of placement areas located in the area to be planned but outside the sub-regions can be determined as a placement area group.

[0089] In this embodiment of the application, a placement area that can only be placed in one sub-region is defined as a placement area group of that sub-region, and a placement area that can be placed in multiple sub-regions or cannot be placed in any sub-region is defined as a placement area group. This realizes the determination of the placement area group, so that the placement area that can only be placed in the corresponding sub-region can be prioritized, making the layout result more referential.

[0090] Figure 5 This is a schematic diagram of a layout planning device 300 provided in an embodiment of this application. Figure 3 As shown, the layout planning device 500 includes:

[0091] The first acquisition unit 501 is used to acquire area information, wherein the area information is used to indicate the size of the area to be planned, and the size and location of at least one sub-area within the area to be planned;

[0092] The second acquisition unit 502 is used to acquire position constraint information, wherein the position constraint information is used to indicate the placement area of ​​each of the at least two objects to be planned, and the constraints on the relative position between the planning area and at least one sub-area.

[0093] The third acquisition unit 503 is used to acquire the attribute constraint information of the placement area;

[0094] The determination unit 504 is used to determine the location of the placement areas of at least two objects to be planned within the area to be planned, based on the area information, location constraint information, and attribute constraint information.

[0095] In this embodiment of the application, the first acquisition unit 501 can be used to execute step 101 in the above method embodiment, the second acquisition unit 502 can be used to execute step 102 in the above method embodiment, the third acquisition unit 503 can be used to execute step 103 in the above method embodiment, and the determination unit 504 can be used to execute step 104 in the above method embodiment.

[0096] In one possible implementation, the area information acquired by the first acquisition unit 501 includes: the length and width of the area to be planned, and the length, width, and coordinates of at least one corner point of each sub-area in at least one sub-area.

[0097] In one possible implementation, the determining unit 504 can also be used to encode the attribute constraint information according to the position constraint information to obtain a first chromosome code; input the first chromosome code and the region information into a genetic algorithm to solve for the optimal solution to obtain at least one second chromosome code; determine the evaluation value of at least one second chromosome code according to a pre-set evaluation standard; sort the evaluation values ​​in ascending order, and determine the second chromosome codes corresponding to the first N evaluation values ​​as N target chromosome codes, where N is a positive integer greater than or equal to 1; decode each target chromosome code to obtain the position of the placement area of ​​at least one object to be planned in the area to be planned.

[0098] In one possible implementation, the determining unit 504 can also be used to determine the coordinates of each placement area in each second chromosome code; determine the distance between placement areas based on the coordinates of the placement areas, and determine the material flow rate of each object to be planned based on the distance between the placement areas; evaluate at least one second chromosome code based on the material flow rate and pre-set evaluation constraints, and determine the evaluation value of at least one second chromosome code.

[0099] In one possible implementation, the attribute constraint information acquired by the third acquisition unit 503 includes at least the rotation constraints and aspect ratio change constraints of the placement area of ​​each object to be planned.

[0100] In one possible implementation, the determining unit 504 can also be used to group at least two placement areas according to position constraint information to obtain at least one placement area group, wherein the placement area group includes at least one placement area, the placement areas in the same placement area group are located in the same candidate area, and the placement areas in different placement area groups are located in different candidate areas, the candidate areas include sub-regions and areas in the area to be planned excluding each sub-region; encode the position constraint information of the placement areas in the placement area group to obtain the placement area sequence corresponding to the placement area group; encode the attribute constraint information to obtain at least one constraint sequence, wherein different constraint sequences correspond to different types of constraint information in the attribute constraint information, the constraint sequence includes the result of encoding the target constraint information of each placement area, the type of the target constraint information is the same as the type of the constraint information corresponding to the constraint sequence; and concatenate at least one placement area sequence and at least one constraint sequence to obtain a first chromosome code.

[0101] In one possible implementation, the determining unit 504 can also be used to determine, based on the position constraint information, the placement area located in the sub-region as the first placement area, and the placement area located in the area to be planned but outside the sub-region as the second placement area; determine the first placement area located in the sub-region as the placement area group corresponding to the sub-region; and determine the set of each second placement area as a placement area group.

[0102] In one possible implementation, the determining unit 504 can also be used to determine, based on the position constraint information, each placement area that can only be located in the same sub-region as the placement area group corresponding to that sub-region; and based on the position constraint information, to determine, based on the set of placement areas that can be located in multiple sub-regions and the set of placement areas located in the area to be planned but outside the sub-regions, as a placement area group.

[0103] It should be noted that the information interaction and execution process between the units in the above-mentioned layout planning device are based on the same concept as the aforementioned layout planning method embodiment. For details, please refer to the description in the aforementioned layout planning method embodiment, and will not be repeated here.

[0104] Figure 6 This is a schematic diagram of an electronic device provided in an embodiment of this application. The specific embodiments of this application do not limit the specific implementation of the electronic device. See also... Figure 6 The electronic device 600 provided in this application embodiment includes: a processor 602, a communications interface 604, a memory 606, and a communication bus 608. Wherein:

[0105] The processor 602, communication interface 604, and memory 606 communicate with each other via communication bus 608.

[0106] Communication interface 604 is used for communication with other electronic devices or servers.

[0107] The processor 602 is used to execute program 610, which can specifically execute the relevant steps in any of the aforementioned layout planning method embodiments.

[0108] Specifically, program 610 may include program code that includes computer operation instructions.

[0109] The processor 602 may be a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of this application. The smart device includes one or more processors, which may be processors of the same type, such as one or more CPUs; or they may be processors of different types, such as one or more CPUs and one or more ASICs.

[0110] Memory 606 is used to store program 610. Memory 606 may include high-speed RAM memory, and may also include non-volatile memory, such as at least one disk storage device.

[0111] Specifically, program 610 can be used to cause processor 602 to execute the layout planning method in any of the foregoing embodiments.

[0112] The specific implementation of each step in program 610 can be found in the corresponding steps and units described in any of the aforementioned layout planning method embodiments, and will not be repeated here. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working process of the devices and modules described above can be referred to the corresponding process descriptions in the aforementioned method embodiments, and will not be repeated here.

[0113] The electronic device in this application first obtains region information, thereby determining the size of the region to be planned and its sub-regions. It then obtains positional constraint information for the placement region, thereby obtaining its positional constraints and attribute constraint information. Finally, based on the region information, positional constraint information, and attribute constraint information, it determines the position of the placement region within the region to be planned. This achieves automatic layout planning, reducing manual labor intensity. Furthermore, by using positional and attribute constraint information, it can meet the placement conditions of different objects to be planned. Since the placement region is constrained by positional and attribute constraint information, the output layout planning result is more reliable, reducing the labor intensity of manually modifying the output layout planning result and thus improving the efficiency of layout planning.

[0114] This application also provides a computer-readable storage medium storing instructions for causing a machine to perform the layout planning method as described herein. Specifically, a system or apparatus equipped with a storage medium storing software program code that implements the functions of any of the embodiments described above, and enabling the computer (or CPU or MPU) of the system or apparatus to read and execute the program code stored in the storage medium.

[0115] In this case, the program code read from the storage medium can itself implement the function of any of the above embodiments, and therefore the program code and the storage medium storing the program code constitute part of this application.

[0116] Examples of storage media used to provide program code include floppy disks, hard disks, magneto-optical disks, optical disks (such as CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD+RW), magnetic tapes, non-volatile memory cards, and ROMs. Alternatively, program code can be downloaded from a server computer via a communication network.

[0117] Furthermore, it should be clear that not only can the program code read by the computer be executed, but also the operating system or other components operating on the computer can be instructed based on the program code to perform some or all of the actual operations, thereby realizing the function of any of the embodiments described above.

[0118] Furthermore, it is understood that the program code read from the storage medium is written to the memory set in the expansion board inserted into the computer or to the memory set in the expansion module connected to the computer. Then, based on the instructions of the program code, the CPU or other components installed on the expansion board or expansion module execute some and all of the actual operations, thereby realizing the function of any of the above embodiments.

[0119] This application also provides a computer program product, which is tangibly stored on a computer-readable medium and includes computer-executable instructions. When executed, these computer-executable instructions cause at least one processor to perform the layout planning methods provided in the above embodiments. It should be understood that the solutions in this embodiment have the corresponding technical effects in the above method embodiments, and will not be repeated here.

[0120] It should be noted that not all steps and modules in the above processes and system structure diagrams are mandatory; some steps or modules can be omitted as needed. The execution order of each step is not fixed and can be adjusted as required. The system structure described in the above embodiments can be a physical structure or a logical structure. That is, some modules may be implemented by the same physical entity, or some modules may be implemented by multiple physical entities, or they may be jointly implemented by certain components in multiple independent devices.

[0121] In this patent application, nouns and pronouns relating to people are not limited to specific genders.

[0122] In the above embodiments, the hardware modules can be implemented mechanically or electrically. For example, a hardware module may include permanent dedicated circuitry or logic (such as a dedicated processor, FPGA, or ASIC) to perform the corresponding operations. The hardware module may also include programmable logic or circuitry (such as a general-purpose processor or other programmable processor), which can be temporarily configured by software to perform the corresponding operations. The specific implementation method (mechanical, dedicated permanent circuitry, or temporarily configured circuitry) can be determined based on cost and time considerations.

[0123] The present application has been shown and described in detail above with reference to the accompanying drawings and preferred embodiments. However, the present application is not limited to these disclosed embodiments. Based on the above multiple embodiments, those skilled in the art will know that more embodiments of the present application can be obtained by combining the code review methods in the different embodiments above. These embodiments are also within the protection scope of the present application.

Claims

1. A layout planning method (100), characterized in that, include: Obtain area information, wherein the area information is used to indicate the size of the area to be planned, and the size and location of at least one sub-area within the area to be planned; Obtain location constraint information, wherein the location constraint information is used to indicate the placement area of ​​each of at least two objects to be planned, and the constraints on the relative position between the planning area and the at least one sub-area. Obtain the attribute constraint information of the placement area; Based on the region information, the location constraint information, and the attribute constraint information, determine the location of the placement area of ​​the at least two objects to be planned in the region to be planned; Determining the location of the placement areas of the at least two objects to be planned within the planned area based on the area information, the location constraint information, and the attribute constraint information includes: The attribute constraint information is encoded based on the position constraint information to obtain the first chromosome code; The first chromosome code and the region information are input into a genetic algorithm to solve for the optimal solution, thereby obtaining at least one second chromosome code; The evaluation value of the at least one second chromosome encoding is determined according to a pre-set evaluation standard; The evaluation values ​​are sorted in ascending order, and the second chromosome codes corresponding to the first N evaluation values ​​are determined as N target chromosome codes, where N is a positive integer greater than or equal to 1; Decode each target chromosome to obtain the location of the placement areas of the at least two objects to be planned in the planned area; The step of encoding the attribute constraint information based on the position constraint information to obtain the first chromosome code includes: Based on the location constraint information, at least two placement areas are grouped to obtain at least one placement area group. The placement area group includes at least one placement area. Placement areas in the same placement area group are located in the same candidate area, and placement areas in different placement area groups are located in different candidate areas. The candidate area includes the sub-area and the area in the area to be planned, excluding each of the sub-areas. Encode the position constraint information of the placement area in the placement area group to obtain the placement area sequence corresponding to the placement area group; The attribute constraint information is encoded to obtain at least one constraint sequence, wherein different constraint sequences correspond to different types of constraint information in the attribute constraint information, and the constraint sequence includes the result of encoding the target constraint information of each placement area, wherein the type of the target constraint information is the same as the type of the constraint information corresponding to the constraint sequence; The first chromosome code is obtained by splicing together at least one of the placement region sequences and at least one of the constraint sequences.

2. The method according to claim 1, characterized in that, The area information includes: the length and width of the area to be planned, and the length, width, and coordinates of at least one corner point of each sub-area in the at least one sub-area.

3. The method according to claim 1, characterized in that, The step of determining the evaluation value of the at least one second chromosome encoding according to a pre-set evaluation standard includes: Determine the coordinates of each of the placement regions in each of the second chromosome codes; Based on the coordinates of the placement areas, the distance between the placement areas is determined, and the material flow rate of each object to be planned is determined based on the distance between the placement areas; Based on the material flow rate and pre-set evaluation constraints, the at least one second chromosome code is evaluated to determine the evaluation value of the at least one second chromosome code.

4. The method according to claim 1, characterized in that, The attribute constraint information includes at least the rotation constraint of the placement area and the aspect ratio change constraint for each of the objects to be planned.

5. The method according to claim 1, characterized in that, The step of grouping the at least two placement areas according to the location constraint information to obtain at least one placement area group includes: Based on the location constraint information, the placement area located in the sub-region is determined as the first placement area, and the placement area located in the area to be planned but outside the sub-region is determined as the second placement area; The first placement area located within the sub-region is determined as the placement area group corresponding to the sub-region; The set of each of the second placement areas is defined as a placement area group.

6. The method according to claim 1, characterized in that, The step of grouping the at least two placement areas according to the location constraint information to obtain at least one placement area group includes: Based on the location constraint information, each placement area that can only be located in the same sub-region is determined as the placement area group corresponding to that sub-region; Based on the location constraint information, a set of placement areas that can be located in multiple sub-regions and placement areas located within the planned area but outside the sub-regions are determined as a placement area group.

7. A layout planning device (500), characterized in that, include: The first acquisition unit (501) is used to acquire area information, wherein the area information is used to indicate the size of the area to be planned, and the size and location of at least one sub-area within the area to be planned; The second acquisition unit (502) is used to acquire position constraint information, wherein the position constraint information is used to indicate the placement area of ​​each of the at least two objects to be planned, and the constraint conditions of the relative position between the planning area and the at least one sub-area. The third acquisition unit (503) is used to acquire the attribute constraint information of the placement area; The determining unit (504) is used to determine the location of the placement area of ​​the at least two objects to be planned in the area to be planned based on the area information, the location constraint information and the attribute constraint information; Specifically, the determining unit (504) is used for: The attribute constraint information is encoded based on the position constraint information to obtain the first chromosome code; The first chromosome code and the region information are input into a genetic algorithm to solve for the optimal solution, thereby obtaining at least one second chromosome code; The evaluation value of the at least one second chromosome encoding is determined according to a pre-set evaluation standard; The evaluation values ​​are sorted in ascending order, and the second chromosome codes corresponding to the first N evaluation values ​​are determined as N target chromosome codes, where N is a positive integer greater than or equal to 1; Decode each target chromosome to obtain the location of the placement areas of the at least two objects to be planned in the planned area; The step of encoding the attribute constraint information based on the position constraint information to obtain the first chromosome code includes: Based on the location constraint information, at least two placement areas are grouped to obtain at least one placement area group. The placement area group includes at least one placement area. Placement areas in the same placement area group are located in the same candidate area, and placement areas in different placement area groups are located in different candidate areas. The candidate area includes the sub-area and the area in the area to be planned, excluding each of the sub-areas. Encode the position constraint information of the placement area in the placement area group to obtain the placement area sequence corresponding to the placement area group; The attribute constraint information is encoded to obtain at least one constraint sequence, wherein different constraint sequences correspond to different types of constraint information in the attribute constraint information, and the constraint sequence includes the result of encoding the target constraint information of each placement area, wherein the type of the target constraint information is the same as the type of the constraint information corresponding to the constraint sequence; The first chromosome code is obtained by splicing together at least one of the placement region sequences and at least one of the constraint sequences.

8. An electronic device (600), characterized in that, include: The processor (602), the communication interface (604), the memory (606), and the communication bus (608) communicate with each other through the communication bus (608). The memory (606) is used to store at least one executable instruction that causes the processor (602) to perform the operation corresponding to the layout planning method (100) as described in any one of claims 1-6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed by a processor, cause the processor to perform the method of any one of claims 1-6.

10. A computer program product, characterized in that, The computer program product is tangibly stored on a computer-readable medium and includes computer-executable instructions that, when executed, cause at least one processor to perform the method according to any one of claims 1-6.

Images