CN117272476A - Layout planning method, device, electronic equipment and storage medium - Google Patents

Layout planning method, device, electronic equipment and storage medium Download PDF

Info

Publication number
CN117272476A
CN117272476A CN202311245609.0A CN202311245609A CN117272476A CN 117272476 A CN117272476 A CN 117272476A CN 202311245609 A CN202311245609 A CN 202311245609A CN 117272476 A CN117272476 A CN 117272476A
Authority
CN
China
Prior art keywords
area
information
planned
placement
size
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311245609.0A
Other languages
Chinese (zh)
Inventor
竹益
浦岱辰
罗文�
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens Ltd China
Original Assignee
Siemens Ltd China
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens Ltd China filed Critical Siemens Ltd China
Priority to CN202311245609.0A priority Critical patent/CN117272476A/en
Publication of CN117272476A publication Critical patent/CN117272476A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • G06F30/27—Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/12—Computing arrangements based on biological models using genetic models
    • G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/043—Optimisation of two dimensional placement, e.g. cutting of clothes or wood
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/04—Constraint-based CAD

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Geometry (AREA)
  • Strategic Management (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Economics (AREA)
  • Biophysics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Marketing (AREA)
  • Artificial Intelligence (AREA)
  • Software Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • General Business, Economics & Management (AREA)
  • Evolutionary Biology (AREA)
  • Tourism & Hospitality (AREA)
  • Structural Engineering (AREA)
  • Computational Mathematics (AREA)
  • Civil Engineering (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Manufacturing & Machinery (AREA)
  • Architecture (AREA)
  • Mathematical Optimization (AREA)
  • Primary Health Care (AREA)
  • Medical Informatics (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Mathematical Analysis (AREA)
  • Pure & Applied Mathematics (AREA)

Abstract

The application provides a layout planning method, a device, electronic equipment and a storage medium, wherein the layout planning method comprises the following steps: acquiring area information, wherein the area information is used for indicating the size and the position of an area to be planned and the size and the position of an obstacle in the area to be planned; acquiring attribute constraint information of placement areas of at least two objects to be planned; acquiring parameter information of an algorithm model; determining the position information of the placement areas of the at least two objects to be planned in the areas to be planned through the algorithm model according to the area information, the attribute constraint information and the parameter information; and generating a layout planning drawing according to the position information and the area information. The method introduces attribute constraint information and the position and the size of the obstacle when carrying out layout planning, so that the output layout planning result has higher referential property, reduces the labor intensity of manually modifying the layout planning, and improves the efficiency of the layout planning.

Description

Layout planning method, device, electronic equipment and storage medium
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to a layout planning method, a device, an electronic device, and a storage medium.
Background
The factory is subjected to layout planning, and the purpose is to plan and design the position, the size, the shape and the like of each production area in the factory, so that a proper physical position is found for the production areas, and the logistics total amount between each production area can be reduced to the greatest extent by reasonable factory layout planning, thereby improving the production efficiency, reducing the production cost and reducing the waste and loss in the production process.
Currently, the optimal placement position of each area to be planned is manually determined, and then layout planning is performed according to the optimal placement position.
However, because the areas to be planned have some real construction, safety or legal constraints, different areas to be planned correspond to the same or different constraint conditions, when the optimal placement position of each area to be planned is manually determined, the combination of the areas to be planned and the real conditions cannot be considered, so that the feasibility of the layout planning result is lower, and when the layout planning is manually performed and the layout planning result is adjusted, the manual labor intensity is higher, and the efficiency of the layout planning is lower.
Disclosure of Invention
In view of this, the layout planning method, device, electronic equipment and storage medium provided by the application can improve the labor intensity of reducing the layout planning and improve the efficiency of the layout planning.
According to a first aspect of an embodiment of the present application, there is provided a layout planning method, including: acquiring area information, wherein the area information is used for indicating the size and the position of an area to be planned and the size and the position of an obstacle in the area to be planned; acquiring attribute constraint information of placement areas of at least two objects to be planned; acquiring parameter information of an algorithm model; determining the position information of the placement areas of the at least two objects to be planned in the areas to be planned through the algorithm model according to the area information, the attribute constraint information and the parameter information; and generating a layout planning drawing according to the position information and the area information.
According to a second aspect of embodiments of the present application, there is provided a layout planning apparatus, including: a first acquiring unit configured to acquire area information, where the area information is used to indicate a size and a position of an area to be planned, and a size and a position of an obstacle in the area to be planned; the second acquisition unit is used for acquiring attribute constraint information of the placement areas of at least two objects to be planned; the third acquisition unit is used for acquiring parameter information of the algorithm model; the determining unit is used for determining the position information of the placement areas of the at least two objects to be planned in the areas to be planned through the algorithm model according to the area information, the attribute constraint information and the parameter information; and the generating unit is used for generating a layout planning drawing according to the position information and the area information.
According to a third aspect of embodiments of the present application, there is provided an electronic device, including: the device comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus; the memory is configured to store at least one executable instruction, where the executable instruction causes the processor to execute an operation corresponding to the layout planning method provided in the first aspect.
According to a fourth aspect of embodiments of the present application, there is provided a computer readable storage medium having stored thereon computer instructions that, when executed by a processor, cause the processor to perform operations corresponding to the layout planning method provided in the first aspect above.
According to a fifth aspect of embodiments of the present application, there is provided a computer program product tangibly stored on a computer-readable medium and comprising computer-executable instructions which, when executed, cause at least one processor to perform a layout planning method as provided by the above-mentioned first aspect or any one of the possible implementations of the first aspect.
According to the technical scheme, the area information is firstly acquired, the size and the position of the area to be planned and the size and the position of the obstacle can be determined, then the attribute constraint information of the placement area is acquired, the attribute constraint condition of the placement area can be acquired, the parameter information is acquired, the algorithm model can be configured, the area information and the attribute constraint information can be calculated through the algorithm model, the position of the placement area in the area to be planned is determined, automatic layout planning is realized, the labor intensity of workers is reduced, the attribute constraint condition of the placement area and the position and the size of the obstacle in the area to be planned are introduced in layout planning, the placement conditions of different objects to be planned can be met, the obstacle avoidance requirement is met, the placement area is constrained through the attribute constraint information, the output layout planning result has referential property, the labor intensity of manually modifying the output layout planning result can be reduced, and the layout planning efficiency is improved.
Drawings
FIG. 1 is a flow chart of a layout planning method provided in an embodiment of the present application;
FIG. 2 is a schematic diagram of a layout plan drawing provided in an embodiment of the present application;
Fig. 3 is a flowchart of a method for determining location information according to an embodiment of the present application;
FIG. 4 is a schematic view of a first object placement area movement provided in an embodiment of the present application;
FIG. 5 is a schematic diagram of a layout planning apparatus according to an embodiment of the present disclosure;
fig. 6 is a schematic diagram of an electronic device according to a fourth embodiment of the present application.
List of reference numerals:
101: acquiring area information
102: acquiring attribute constraint information of placement areas of at least two objects to be planned
103: acquiring parameter information of algorithm model
104: determining the position information of the placement areas of at least two objects to be planned in the areas to be planned through an algorithm model according to the area information, the attribute constraint information and the parameter information
105: generating a layout planning drawing according to the position information and the area information
301: encoding the length and width of the placement region and attribute constraint information to determine a first chromosome encoding
302: inputting the size of the region to be planned and the first chromosome code contained in the region information, and inputting a genetic algorithm model configured according to the parameter information to solve the optimal solution to obtain at least one second chromosome code
303: determining an evaluation value of at least one second chromosome code based on at least a preset constraint condition, the size and position of the obstacle in the area to be planned, a penalty factor and the object flow of the object to be planned
304: sequencing the evaluation values from small to large, and determining the second chromosome codes corresponding to the first N evaluation values as N target chromosome codes
305: decoding each target chromosome code to obtain at least two placement areas of the object to be planned in the object to be planned
Location information in an area
100: layout planning method 201: the area to be planned 202: placement area
203: placement area 204: placement area 205: placement area
401: area to be planned 402: placement area 403: placement area
404: placement area 405: placement area 406: drag request
500: layout planning apparatus 501: the first acquisition unit 502: second acquisition unit
503: third acquisition unit 504: the confirmation unit 505: generating unit
600: electronic device 602: processor 604: communication interface
606: memory 608: communication bus 610: program
Detailed Description
As described above, currently, the optimal placement position of each area to be planned is manually determined, and then layout planning is performed according to the optimal placement position. Because the areas to be planned have some real construction, safety or legal constraints, different areas to be planned correspond to the same or different constraint conditions, when the optimal placement position of each area to be planned is manually determined, the combination of the areas to be planned and the real conditions cannot be considered, so that the feasibility of a layout planning result is low, and when the layout planning is manually performed and the layout planning result is adjusted, the manual labor intensity is high, and the efficiency of the layout planning is low.
In the embodiment of the application, the area information is firstly acquired, so that the size and the position of the area to be planned and the size and the position of the obstacle can be determined, then the attribute constraint information of the placement area is acquired, so that the attribute constraint condition of the placement area can be acquired, the parameter information is acquired, the algorithm model can be configured, the area information and the attribute constraint information can be calculated through the algorithm model, the position of the placement area in the area to be planned is determined, automatic layout planning is realized, the labor intensity of workers is reduced, the attribute constraint condition of the placement area and the position and the size of the obstacle in the area to be planned are introduced in layout planning, the placement conditions of different objects to be planned can be met, the obstacle avoidance requirement is met, and the placement area is constrained through the attribute constraint information, so that the output layout planning result has more referential, the labor intensity of manually modifying the output layout planning result can be reduced, and the layout planning efficiency is improved.
The following describes in detail a layout planning method, a layout planning device and electronic equipment provided in the embodiments of the present application with reference to the accompanying drawings.
Fig. 1 is a flowchart of a layout planning method 100 according to an embodiment of the present application. As shown in fig. 1, the layout planning method 100 includes the steps of:
step 101, obtaining area information.
The area information may be used to indicate the size and position of the area to be planned, and the size and position of the obstacle in the area to be planned.
Acquiring area information, wherein the area information comprises the size of an area to be planned, for example: the area to be planned is a rectangular factory, the area information comprises the length and the width of the factory, so that the size of the factory can be determined, the area information also comprises the position of the area to be planned, and the position can be used for indicating the position of the area to be planned in a layout planning drawing.
Also included in the area to be planned are obstacles such as: the support columns, the partitions and the like of the factory building, the size and the position of the obstacle are also included in the area information, and the position of the obstacle in the area to be planned can be determined according to the size and the position of the obstacle, so that the obstacle in the factory can be considered in layout planning.
In an example, the size and the position of the area to be planned and the size and the position of the obstacle in the area to be planned that are manually input may be obtained through a parameter input window, or the size and the position of the area to be planned and the size and the position of the obstacle in the area to be planned may be imported into the data table through the import interface, and the specific method for obtaining the area information is not limited in the embodiments of the present application.
Step 102, obtaining attribute constraint information of placement areas of at least two objects to be planned.
Acquiring attribute constraint information of a placement area corresponding to at least two objects to be planned, wherein the attribute constraint information is an attribute constraint condition of the placement area, for example: constraints on length and width, whether area can be modified, whether other placement areas can be adjacent, etc. can be included.
In an example, attribute constraint information of placement areas of at least two objects to be planned manually input may be obtained through a parameter input window, or attribute constraint information of placement areas of at least two objects to be planned in a data table may be imported through an import interface, and a specific method for obtaining attribute constraint information is not limited in this embodiment of the present application.
And 103, acquiring parameter information of the algorithm model.
Parameter information necessary for running an algorithm model is acquired, and the algorithm model can be a meta heuristic model. In one example, the manually entered parameter information may be obtained through a parameter input window such that an algorithm model may be calculated from the manually entered parameter information.
And 104, determining the position information of the placement areas of at least two objects to be planned in the areas to be planned through an algorithm model according to the area information, the attribute constraint information and the parameter information.
The area information and the attribute constraint information are input into an algorithm model configured according to the parameter information, position information of the placement areas of the at least two objects to be planned in the areas to be planned is determined, namely a layout planning result is determined, in an example, coordinates of each placement area can be determined through the algorithm model, the area of the areas to be planned is determined according to the area information, and therefore the positions of the placement areas of the at least two objects to be planned in the areas to be planned can be determined.
And 105, generating a layout planning drawing according to the position information and the area information.
And determining the positions of the placement areas of at least two objects to be planned in the area to be planned according to the position information, and determining the positions and the sizes of the area to be planned in the layout planning drawing according to the area information, thereby determining the positions and the sizes of the area to be planned and the placement area in the layout planning drawing, and generating the layout planning drawing.
Fig. 2 is a schematic diagram of a layout plan drawing provided in the embodiment of the present application, and as shown in fig. 2, the layout plan drawing includes an area to be planned 201, a placement area 202, a placement area 203, a placement area 204, and a placement area 205, where the placement areas 202 to 205 are planned in the area to be planned 201. It should be understood that fig. 2 is an example of a layout plan drawing, and should not be construed as limiting the embodiments of the present application.
Alternatively, the layout planning drawing may be converted into an engineering drawing, or the layout planning result may be exported to a data table, which is not described herein.
In the embodiment of the application, the area information is firstly acquired, so that the size and the position of the area to be planned and the size and the position of the obstacle can be determined, then the attribute constraint information of the placement area is acquired, so that the attribute constraint condition of the placement area can be acquired, the parameter information is acquired, the algorithm model can be configured, the area information and the attribute constraint information can be calculated through the algorithm model, the position of the placement area in the area to be planned is determined, automatic layout planning is realized, the labor intensity of workers is reduced, the attribute constraint condition of the placement area and the position and the size of the obstacle in the area to be planned are introduced in layout planning, the placement conditions of different objects to be planned can be met, the obstacle avoidance requirement is met, and the placement area is constrained through the attribute constraint information, so that the output layout planning result has more referential, the labor intensity of manually modifying the output layout planning result can be reduced, and the layout planning efficiency is improved.
In one possible implementation, the obstacle comprises: and (5) supporting the column. The area information includes: the length and width of the area to be planned, the region angular point coordinates, the length and width of the bottom surface of the support column, the support column angular point coordinates and the column spacing between the support columns.
The factory building needs the support columns to support so as to prevent the roof from collapsing, the obstacle comprises the support columns, the area information comprises the length and the width of the area to be planned, the size of the area to be planned can be determined, the area corner coordinates of the corner points of the area to be planned are also included, and it is understood that the factory building of the factory is generally a rectangular factory building, and therefore the position of the area to be planned can be determined according to the corner coordinates.
The area information further includes the length and width of the bottom surfaces of the support columns, whereby the floor area of the support columns can be determined, the area information further includes the coordinates of corner points of the support columns of the bottom surfaces of the support columns, whereby the position of the support columns in the area to be planned can be determined, and the area information further includes the column spacing between the support columns, whereby the position distribution of the plurality of support columns can be determined, and in one example, the column spacing of the support columns includes the spacing in the longitudinal direction and the spacing in the transverse direction, whereby the positions of the plurality of supports in the area to be planned can be determined.
In the embodiment of the application, the barrier comprises the support column, the region information comprises the length, the width and the region angular point coordinates of the region to be planned, the length, the width and the support column angular point coordinates of the bottom surface of the support column and the column spacing between the support columns, so that the size and the position of the region to be planned and the size and the position of the support column can be determined, the layout planning can be performed in the region to be planned, and the influence of the support column on the placement region is considered in the planning process, so that the output layout planning result has more referential property.
In one possible implementation, the attribute constraint information includes at least a movement constraint and an area modification constraint of the placement region.
The attribute constraint information of the placement area corresponding to the object to be planned at least comprises a movement constraint of the placement area, so that whether the placement area can move after layout planning can be determined, and the attribute constraint information further comprises an area modification constraint, namely whether the area of the area to be planned can be modified, for example: whether the placement area can be changed only in length or only in width.
It should be understood that the attribute constraint information may also include whether the placement area may exceed the boundary of the area to be planned, whether the placement area may participate in the calculation of the flow rate of the object, the calculation method of the flow rate, and the like, which are not limited herein.
In the embodiment of the application, the attribute constraint information at least comprises the movement constraint and the area modification constraint of the placement area of each object to be planned, so that the movement and the area modification of the placement area can be constrained, the layout planning result output according to the attribute constraint information is more referential, the labor intensity of the layout planning result output by manual modification can be reduced, and the layout planning efficiency is improved.
In one possible implementation, the algorithm model includes a genetic algorithm model, and the parameter information includes at least the number of iterations, the population size, the number of optimal solutions, and the penalty factor.
The algorithm model comprises a genetic algorithm model, the parameter information comprises iteration times, population size, optimal solution number and penalty coefficients, the genetic algorithm model can iterate a calculation result according to the iteration times included in the parameter information, the number of filial generation iterated each time can be determined according to the population size, the number of output planning results can be determined according to the optimal solution number, and the penalty value corresponding to each constraint condition can be determined according to the penalty coefficients, so that the optimal solution can be determined.
In the embodiment of the application, the algorithm model comprises a genetic algorithm model, the parameter information at least comprises iteration times, population size, optimal solution number and penalty coefficients, so that the genetic algorithm can be configured according to the parameter information, the position information of the placement areas of at least two objects to be planned in the areas to be planned can be determined through the prepared genetic algorithm model according to the area information and attribute constraint information, automatic layout planning is realized, and because the penalty coefficients are introduced, the optimal solution meeting a plurality of constraint conditions is determined according to the penalty coefficients, the output layout planning result has more referential property, the labor intensity of manually modifying the output layout planning result can be reduced, and the layout planning efficiency is improved.
Fig. 3 is a flowchart of a method for determining location information according to an embodiment of the present application, as shown in fig. 3, when determining location information of a placement area of at least two objects to be planned in a region to be planned according to region information, attribute constraint information and parameter information through an algorithm model, the location information may be determined by:
step 301, encoding the length and width of the placement region and attribute constraint information to determine a first chromosome encoding.
The attribute constraint information for the placement area includes constraint conditions such as: and (3) performing coding by using the movement constraint and the area modification constraint to obtain a first chromosome coding. Optionally, the first chromosome code may include a region coding sequence, where a placement order of each placement region is encoded in the region coding sequence, and at least one constraint sequence code, where constraint information corresponding to each placement region is encoded in the constraint sequence code.
And 302, inputting the size of the area to be planned and the first chromosome code contained in the area information, and solving an optimal solution according to a genetic algorithm model configured by the parameter information to obtain at least one second chromosome code.
Inputting the first chromosome code and the size of the area to be planned into a genetic algorithm, solving an optimal solution for the first chromosome code through the genetic algorithm, searching the position of each placement area in the area to be planned according to the area information and the first chromosome code by the genetic algorithm, and determining a plurality of schemes, namely at least one second chromosome code, of placing a plurality of placement areas in the area to be planned, wherein the second chromosome code is the code of the planning result of the placement area of the object to be planned.
Step 303, determining at least one evaluation value of the second chromosome coding at least according to preset constraint conditions, the size and the position of the obstacle in the area to be planned, penalty coefficients and the object flow of the object to be planned.
The preset constraint conditions are constraint conditions of each placement area, for example: the placement area corresponding to the object to be planned which needs ventilation needs to be placed on the window edge, the object to be planned which needs fire prevention needs to be placed on the non-high temperature area and the like, and according to the punishment coefficient included in the parameter information, the punishment value corresponding to each constraint condition can be determined, and punishment is performed when the constraint condition is not met.
Because the placement area can be placed on the side of the obstacle, or the obstacle can be positioned in the placement area, or the placement of the obstacle needs to be avoided, according to the size and the position of the obstacle in the area to be planned, whether the placement area can be placed at the planned position can be determined, and it is understood that penalty which does not meet the relative position with the obstacle can be correspondingly provided in the penalty coefficient, and when the placement area does not meet the relative position with the obstacle, the penalty value can be increased.
Alternatively, the evaluation value of the second chromosome coding may be obtained by weighted summing the amount of substance, the penalty value that does not satisfy the constraint condition or the relative position of the obstacle when the evaluation value is calculated.
Step 305, sorting the evaluation values in order from small to large, and determining the second chromosome codes corresponding to the first N evaluation values as N target chromosome codes.
The smaller the object flow is, the better the penalty value is, the more constraints are met by the scheme with lower evaluation values, the better the scheme is, the evaluation values are ordered in the order from small to large, the second chromosome codes corresponding to the first N evaluation values are determined to be N target chromosome codes, and the target chromosome codes are chromosome codes corresponding to the better layout planning scheme. N is the optimal solution number set in the parameter information, and N is a positive integer greater than or equal to 1.
And 306, decoding each target chromosome code to obtain the position information of the placement areas of at least two objects to be planned in the areas to be planned.
Each of the N target chromosomal codes is decoded to determine N positional information, i.e., N layout plan schemes. Optionally, the N layout planning schemes may be listed in a list, and the evaluation value, the object flow and the unsatisfied constraint condition corresponding to each layout planning scheme are listed in the list, so that a person may display different positions of the placement areas of at least two objects to be planned in the areas to be planned by selecting different layout planning schemes in the list, thereby a more suitable scheme may be manually selected.
In the embodiment of the application, the attribute constraint information of the placement area is encoded, the first chromosome code and the area information obtained after encoding are input into a genetic algorithm to solve an optimal solution, at least one second chromosome code is obtained, then the at least one second chromosome code is evaluated, N second chromosome codes with smaller evaluation values can be determined, N layout planning results can be obtained, automatic layout planning is realized, and because the attribute constraint information is introduced in the process of layout planning, and the second chromosome codes with smaller evaluation values are screened to decode, a better scheme meeting constraint conditions can be determined, so that the output layout planning result has better referential property, the labor intensity of manually modifying the output layout planning result can be reduced, and the efficiency of layout planning is improved.
In one possible implementation manner, when generating a layout planning drawing according to the position information and the area information, the position of the area to be planned in the drawing may be determined according to the position of the area to be planned included in the area information, the size of the area to be planned in the drawing may be determined according to a preset scale and the size of the area to be planned included in the area information, then the position of the obstacle in the drawing may be determined according to the position of the obstacle included in the area information, the size of the obstacle in the drawing may be determined according to the scale and the size of the obstacle included in the area information, the position of the placement area in the drawing may be determined according to the position information, the size of the placement area in the drawing may be determined according to the scale and the attribute constraint information, and the layout planning drawing may be generated according to the position and the size of the area to be planned in the drawing, the position and the size of the obstacle in the drawing, and the position and the size of the placement area in the drawing.
In the embodiment of the application, the position and the size of the area to be planned in the drawing and the position and the size of the obstacle in the drawing are determined according to the area information, and then the position and the size of each placement area in the drawing are determined according to the position information, so that a layout planning drawing can be generated, a layout planning result can be displayed in the drawing, the manual modification is facilitated, and the layout planning efficiency can be improved.
In a possible implementation manner, a drag request may be further obtained, then, according to attribute constraint information, a movement constraint of a first target placement area corresponding to the drag request is determined, if the first target placement area is movable, a movement operation is performed on the first target placement area in a layout planning drawing in response to the drag request, coordinates of a first target position where the moved first target placement area is located are calculated, and a first evaluation value of the first target placement area is determined at least according to a predetermined constraint condition, a position and a size of the placement area in the layout planning drawing, a position and a size of an obstacle in the layout planning drawing, the coordinates of the first target position and the size of the first target placement area, and if the first evaluation value is greater than a preset evaluation value threshold, first alarm information is sent, wherein the first alarm information is used for indicating that the first target placement area cannot be placed at the first target position.
Acquiring a drag request of a placement area in a layout planning drawing, for example: and clicking the first target placement area by a mouse manually and dragging the first target placement area. At this time, according to the constraint corresponding to the first target placement area in the attribute constraint information, whether the first target placement area can move is judged, if the first target placement area cannot move, the drag request is not responded, and the first target placement area is not moved.
When the first target placement area can be moved, the first target placement area is moved to a first target position corresponding to the drag request in response to the drag request, for example: and moving to a position where the mouse stops dragging. At this time, the coordinates of the first target position are calculated, alternatively, the coordinates of the corner point at which the first target placement area is at the first target position may be calculated, so that the coordinates of the first target position may be determined.
After determining the coordinates of the first target location, at least according to predetermined constraints, for example: the position and size of the placement area in the layout drawing, the position and size of the obstacle in the layout drawing, the coordinates of the first target position, and the size of the first target placement area, which need to be placed at the window side, cannot be placed at the high temperature area, and the like, for example: it is determined whether the first target placement area can overlap with other placement areas, whether an obstacle can be included, and the like, and a first placement evaluation value of the first target placement area is determined.
When the first placement evaluation value is greater than a preset evaluation value threshold, first alarm information is sent out so as to remind a user that the placement area cannot be moved to a first target position, and it is understood that a punishment value is increased due to the fact that constraint conditions are not met, and therefore the smaller the first placement evaluation value, the more the scheme is proved to meet the requirements.
It should be noted that the first alarm information may be any alarm information, for example: the user can be reminded that the user cannot move to the first target position in a popup window mode, or the frame of the first target placement area can be changed into red, so that the user is reminded that the user cannot move to the first target position, and the specific first alarm information mode is not limited.
Fig. 4 is a schematic diagram of movement of a first target placement area provided in the embodiment of the present application, as shown in fig. 4, in an area 401 to be planned, a placement area 402, a placement area 403, a placement area 404, and a placement area 405 are planned, where the placement area 404 is the first target placement area, that is, the placement area to be moved, as shown in fig. 4, and under the action of a drag request 406, the placement area 404 moves.
In the embodiment of the application, the drag request is acquired, and then, whether the first target placement area can move or not is determined according to the attribute constraint information, when the first target placement area can move, the first placement evaluation value of the first target placement area moving to the first target position is determined according to various conditions, so that whether the first target placement area can be moved to the first target position can be determined, the movement operation of the placement area is realized, a user can modify a layout planning result under the condition of meeting requirements, the degree of freedom of layout planning is increased, and because the first placement evaluation value after the first placement area moves can be determined, and when the first placement evaluation value is larger than a threshold value, the first alarm information is sent, the feasibility of moving the first placement area by the user can be reminded, the situation that the requirements cannot be met after the position of the first target placement area moves is avoided, and the efficiency of layout planning is improved.
In one possible implementation manner, a coordinate adjustment request of the second target placement area may be further obtained, where the coordinate adjustment request includes coordinates of the second target location, then movement constraint of the second target placement area is determined according to attribute constraint information, if the second target placement area is movable, the second target placement area is moved to the second target location in the layout planning drawing according to the coordinate adjustment request, and a second placement evaluation value of the second target placement area is determined according to at least a predetermined constraint condition, a position and a size of the placement area in the layout planning drawing, a position and a size of an obstacle in the layout planning drawing, coordinates of the second target location, and a size of the second target placement area, and if the second placement evaluation value is greater than a preset evaluation value threshold, second alarm information is sent, where the second alarm information is used to indicate that the second target placement area cannot be placed in the second target location.
Acquiring a coordinate adjustment request of the second target placement area, for example: and modifying the coordinate value in a parameter window of the second target placement area generated by clicking the second target placement area, judging whether the second target placement area can move according to the constraint corresponding to the second target placement area in the attribute constraint information, and if the second target placement area cannot move, not responding to the coordinate adjustment request, namely not moving the second target placement area. At this time, it may be displayed through a pop-up window that the second target placement area cannot be moved.
And when the second target placement area can be moved, moving the second target placement area to a second target position corresponding to the coordinate adjustment request. And then based at least on predetermined constraints, for example: the position and size of the placement area in the layout drawing, the position and size of the obstacle in the layout drawing, the coordinates of the second target position, and the size of the second target placement area, which need to be placed at the window side, cannot be placed at the high temperature area, and the like, for example: it is determined whether the second target placement area can overlap with other placement areas, whether an obstacle can be included, and the like, and a second placement evaluation value of the second target placement area is determined.
When the second placement evaluation value is greater than the preset evaluation value threshold, sending second alarm information so as to remind the user that the placement area cannot be adjusted to the second target position, wherein it is understood that the penalty value is increased because the constraint condition is not met, and therefore the smaller the second placement evaluation value, the more the scheme is proved to meet the requirement.
It should be noted that the second alarm information may be any alarm information, for example: the user can be reminded that the second target position cannot be adjusted through the popup window, or the user can be reminded that the second target position cannot be adjusted through changing the border of the second target placement area into red, and the specific second alarm information is not limited in the embodiment of the application.
In the embodiment of the application, the coordinate adjustment request of the second target placement area is acquired, then whether the second target placement area can move or not is determined according to the attribute constraint information, and when the second target placement area can move, the second placement evaluation value of the second target placement area adjusted to the second target position is determined according to various constraint conditions, so that whether the second target placement area can be adjusted to the second target position can be determined, the movement operation of the placement area is realized, a user can modify a layout planning result under the condition of meeting requirements, the degree of freedom of layout planning is increased, and because the second placement evaluation value of the second target placement area after adjustment can be determined, and when the second placement evaluation value is larger than a threshold value, the second alarm information is sent, therefore, the feasibility of adjusting the second placement area by the user can be reminded, the situation that the requirements cannot be met after the position of the second target placement area is adjusted is avoided, and the layout planning efficiency is improved.
Fig. 5 is a schematic diagram of a layout planning apparatus 500 according to an embodiment of the present application. As shown in fig. 5, the layout planning apparatus 500 includes:
a first obtaining unit 501, configured to obtain area information, where the area information is used to indicate a size and a position of an area to be planned and a size and a position of an obstacle in the area to be planned;
A second obtaining unit 502, configured to obtain attribute constraint information of a placement area of at least two objects to be planned;
a third obtaining unit 503, configured to obtain parameter information of the algorithm model;
a determining unit 504, configured to determine, according to the region information, the attribute constraint information, and the parameter information, position information of the placement regions of at least two objects to be planned in the region to be planned through an algorithm model;
a generating unit 505, configured to generate a layout drawing according to the location information and the area information.
In this embodiment of the present application, the first obtaining unit 501 may be used to perform step 101 in the above method embodiment, the second obtaining unit 502 may be used to perform step 102 in the above method embodiment, the third obtaining unit 503 may be used to perform step 103 in the above method embodiment, the determining unit 504 may be used to perform step 104 in the above method embodiment, and the generating unit 505 may be used to perform step 105 in the above method embodiment.
In one possible implementation, the obstacle comprises: a support column; the area information includes: the length and width of the area to be planned, the region angular point coordinates, the length and width of the bottom surface of the support columns, the support column angular point coordinates and the column spacing between the support columns.
In a possible implementation manner, the attribute constraint information acquired by the second acquisition unit 502 includes at least a movement constraint and an area modification constraint of the placement area.
In one possible implementation, the algorithm model includes a genetic algorithm model, and the parameter information includes at least the number of iterations, the population size, the number of optimal solutions, and the penalty factor.
In one possible implementation, the determining unit 504 may further encode the attribute constraint information to determine a first chromosome encoding; inputting the size of the area to be planned and the first chromosome code contained in the area information, and inputting a genetic algorithm model configured according to the parameter information to solve an optimal solution to obtain at least one second chromosome code; determining an evaluation value of at least one second chromosome code at least according to preset constraint conditions, the size and the position of the obstacle in the area to be planned, penalty factors and the object flow of the object to be planned; sequencing the evaluation values from small to large, and determining the second chromosome codes corresponding to the first N evaluation values as N target chromosome codes, wherein N is the optimal solution number and N is a positive integer greater than or equal to 1; and decoding each target chromosome code to obtain the position information of the placement areas of at least two objects to be planned in the areas to be planned.
In a possible implementation manner, the generating unit 505 may further determine a position of the area to be planned in the drawing according to a position of the area to be planned included in the area information, and determine a size of the area to be planned in the drawing according to a preset scale and a size of the area to be planned included in the area information; determining the position of the obstacle in the drawing according to the position of the obstacle included in the area information, and determining the size of the obstacle in the drawing according to the scale and the size of the obstacle included in the area information; determining the position of the placement area in the drawing according to the position information, and determining the size of the placement area in the drawing according to the scale and the attribute constraint information; and generating a layout planning drawing according to the position and the size of the area to be planned in the drawing, the position and the size of the obstacle in the drawing and the position and the size of the placement area in the drawing.
In one possible implementation, the generating unit 505 may further obtain a drag request; determining movement constraint of a first target placement area corresponding to the drag request according to the attribute constraint information, and if the first target placement area can move, responding to the drag request to move the first target placement area in the layout planning drawing; calculating the coordinates of the first target position of the moved first target placement area; determining a first placement evaluation value of the first target placement area at least according to a predetermined constraint condition, the position and the size of the placement area in the layout planning drawing, the position and the size of the obstacle in the layout planning drawing, the coordinate of the first target position and the size of the first target placement area, and if the first placement evaluation value is larger than a preset evaluation value threshold, sending out first alarm information, wherein the first alarm information is used for indicating that the first target placement area cannot be placed at the first target position.
In one possible implementation manner, the generating unit 505 may further obtain a coordinate adjustment request of the second target placement area, where the coordinate adjustment request includes coordinates of the second target position; determining movement constraint of the second target placement area according to the attribute constraint information, and if the second target placement area can move, moving the second target placement area to a second target position in the layout planning drawing according to the coordinate adjustment request; determining a second placement evaluation value of the second target placement area at least according to a predetermined constraint condition, the position and the size of the placement area in the layout planning drawing, the position and the size of the obstacle in the layout planning drawing, the coordinates of the second target position and the size of the second target placement area, and if the second placement evaluation value is larger than a preset evaluation value threshold, sending out second alarm information, wherein the second alarm information is used for indicating that the second target placement area cannot be placed in the second target position.
It should be noted that, because the content such as information interaction and execution process between the units in the layout planning apparatus is based on the same concept as the layout planning method embodiment, specific content can be referred to the description in the layout planning method embodiment, and will not be repeated here.
Fig. 6 is a schematic diagram of an electronic device according to an embodiment of the present application, which is not limited to a specific implementation of the electronic device. Referring to fig. 6, an electronic device 600 provided in an embodiment of the present application includes: a processor 602, a communication interface (Communications Interface), a memory 606, and a communication bus 608. Wherein:
processor 602, communication interface 604, and memory 606 perform communication with each other via communication bus 608.
Communication interface 604 for communicating with other electronic devices or servers.
The processor 602 is configured to execute the program 610, and may specifically perform relevant steps in any of the foregoing layout planning method embodiments.
In particular, program 610 may include program code including computer-operating instructions.
The processor 602 may be a central processing unit CPU, or a specific integrated circuit ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present application. The one or more processors comprised by the smart device may be the same type of processor, such as one or more CPUs; but may also be different types of processors such as one or more CPUs and one or more ASICs.
A memory 606 for storing a program 610. The memory 606 may comprise high-speed RAM memory or may further comprise non-volatile memory (non-volatile memory), such as at least one disk memory.
The program 610 may be specifically configured to cause the processor 602 to perform the layout planning method in any of the foregoing embodiments.
The specific implementation of each step in the program 610 may refer to corresponding steps and corresponding descriptions in the units in any of the foregoing embodiments of the layout planning method, which are not described herein. It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the apparatus and modules described above may refer to corresponding procedure descriptions in the foregoing method embodiments, which are not repeated herein.
According to the electronic equipment, the area information is firstly acquired, the size and the position of the area to be planned and the size and the position of the obstacle can be determined, then the attribute constraint information of the placement area is acquired, the attribute constraint condition of the placement area can be acquired, the parameter information is acquired, the algorithm model can be configured, the area information and the attribute constraint information can be calculated through the algorithm model, the position of the placement area in the area to be planned is determined, automatic layout planning is realized, the labor intensity of workers is reduced, the attribute constraint condition of the placement area and the position and the size of the obstacle in the area to be planned are introduced in layout planning, the placement conditions of different objects to be planned can be met, the obstacle avoidance requirement is met, the placement area is constrained through the attribute constraint information, the output layout planning result has more referential, the labor intensity of manually modifying the output layout planning result can be reduced, and the layout planning efficiency is improved.
Embodiments also provide a computer readable storage medium storing instructions for causing a machine to perform a layout planning method as described herein. Specifically, a system or apparatus provided with a storage medium on which a software program code realizing the functions of any of the above embodiments is stored, and a computer (or CPU or MPU) of the system or apparatus may be caused to read out and execute the program code stored in the storage medium.
In this case, the program code itself read from the storage medium may realize the functions of any of the above-described embodiments, and thus the program code and the storage medium storing the program code form part of the present application.
Examples of the storage medium for providing the program code include a floppy disk, a hard disk, a magneto-optical disk, an optical disk (e.g., CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD+RW), a magnetic tape, a nonvolatile memory card, and a ROM. Alternatively, the program code may be downloaded from a server computer by a communication network.
Further, it should be apparent that the functions of any of the above-described embodiments may be implemented not only by executing the program code read out by the computer, but also by causing an operating system or the like operating on the computer to perform part or all of the actual operations based on the instructions of the program code.
Further, it is understood that the program code read out by the storage medium is written into a memory provided in an expansion board inserted into a computer or into a memory provided in an expansion module connected to the computer, and then a CPU or the like mounted on the expansion board or the expansion module is caused to perform part and all of actual operations based on instructions of the program code, thereby realizing the functions of any of the above embodiments.
Embodiments of the present application also provide a computer program product tangibly stored on a computer-readable medium and comprising computer-executable instructions that, when executed, cause at least one processor to perform the layout planning method provided by the above embodiments. It should be understood that each solution in this embodiment has the corresponding technical effects in the foregoing method embodiments, which are not repeated herein.
It should be noted that not all the steps and modules in the above flowcharts and the system configuration diagrams are necessary, and some steps or modules may be omitted according to actual needs. The execution sequence of the steps is not fixed and can be adjusted as required. The system structure described in the above embodiments may 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 may be implemented jointly by some components in multiple independent devices.
Nouns and pronouns for humans in this patent application are not limited to a particular gender.
In the above embodiments, the hardware module may be mechanically or electrically implemented. For example, a hardware module may include permanently dedicated circuitry or logic (e.g., a dedicated processor, FPGA, or ASIC) to perform the corresponding operations. The hardware modules may also include programmable logic or circuitry (e.g., a general-purpose processor or other programmable processor) that may be temporarily configured by software to perform the corresponding operations. The particular implementation (mechanical, or dedicated permanent, or temporarily set) may be determined based on cost and time considerations.
While the present application has been illustrated and described in detail in the drawings and in the preferred embodiments, the present application is not limited to the disclosed embodiments, and it will be appreciated by those skilled in the art that the code audits of the various embodiments described above may be combined to obtain further embodiments of the present application, which are also within the scope of the present application.

Claims (12)

1. A layout planning method (100), comprising:
acquiring area information, wherein the area information is used for indicating the size and the position of an area to be planned and the size and the position of an obstacle in the area to be planned;
Acquiring attribute constraint information of placement areas of at least two objects to be planned;
acquiring parameter information of an algorithm model;
determining the position information of the placement areas of the at least two objects to be planned in the areas to be planned through the algorithm model according to the area information, the attribute constraint information and the parameter information;
and generating a layout planning drawing according to the position information and the area information.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the obstacle comprises: a support column;
the area information includes: the length, width and region angular point coordinates of the region to be planned, the length, width and support column angular point coordinates of the bottom surface of the support column and the column spacing between the support columns.
3. The method of claim 1, wherein the attribute constraint information includes at least a movement constraint and an area modification constraint of the placement region.
4. The method of claim 3, wherein the step of,
the algorithm model comprises a genetic algorithm model, and the parameter information at least comprises iteration times, population size, optimal solution number and penalty coefficients.
5. The method according to claim 4, wherein determining, by the algorithm model, the positional information of the placement areas of the at least two objects to be planned in the area to be planned according to the area information, the attribute constraint information, and the parameter information includes:
encoding the attribute constraint information to determine a first chromosome encoding;
inputting the size of the region to be planned and the first chromosome code contained in the region information, and inputting the genetic algorithm model configured according to the parameter information to solve an optimal solution to obtain at least one second chromosome code;
determining an evaluation value of the at least one second chromosome code at least according to preset constraint conditions, the size and the position of the obstacle in the area to be planned, the penalty coefficient and the logistics flow of the object to be planned;
sequencing the evaluation values from small to large, and determining second chromosome codes corresponding to the first N evaluation values as N target chromosome codes, wherein N is the optimal solution number and N is a positive integer greater than or equal to 1;
and decoding each target chromosome code to obtain the position information of the placement areas of the at least two objects to be planned in the areas to be planned.
6. A method according to claim 3, wherein said generating a layout plan drawing from said location information and said area information comprises:
determining the position of the area to be planned in a drawing according to the position of the area to be planned included in the area information, and determining the size of the area to be planned in the drawing according to a preset scale and the size of the area to be planned included in the area information;
determining the position of the obstacle in a drawing according to the position of the obstacle included in the area information, and determining the size of the obstacle in the drawing according to the scale and the size of the obstacle included in the area information;
determining the position of the placement area in the drawing according to the position information, and determining the size of the placement area in the drawing according to the scale and the attribute constraint information;
and generating the layout planning drawing according to the position and the size of the area to be planned in the drawing, the position and the size of the obstacle in the drawing and the position and the size of the placement area in the drawing.
7. The method of claim 6, wherein the method further comprises:
acquiring a drag request;
determining movement constraint of a first target placement area corresponding to the drag request according to the attribute constraint information, and if the first target placement area can move, responding to the drag request to perform movement operation on the first target placement area in the layout planning drawing;
calculating the coordinates of the first target position where the moved first target placement area is located;
determining a first placement evaluation value of the first target placement area at least according to a predetermined constraint condition, the position and the size of the placement area in the layout planning drawing, the position and the size of the obstacle in the layout planning drawing, the coordinate of the first target position and the size of the first target placement area, and if the first placement evaluation value is larger than a preset evaluation value threshold, sending out first alarm information, wherein the first alarm information is used for indicating that the first target placement area cannot be placed at the first target position.
8. The method of claim 6, wherein the method further comprises:
Acquiring a coordinate adjustment request of a second target placement area, wherein the coordinate adjustment request comprises coordinates of a second target position;
determining movement constraint of the second target placement area according to the attribute constraint information, and if the second target placement area can move, moving the second target placement area to the second target position in the layout planning drawing according to the coordinate adjustment request;
determining a second placement evaluation value of the second target placement area at least according to a predetermined constraint condition, the position and the size of the placement area in the layout planning drawing, the position and the size of the obstacle in the layout planning drawing, the coordinates of the second target position and the size of the second target placement area, and if the second placement evaluation value is larger than a preset evaluation value threshold, sending out second alarm information, wherein the second alarm information is used for indicating that the second target placement area cannot be placed in the second target position.
9. A layout planning apparatus (500), characterized by comprising:
a first acquisition unit (501) configured to acquire area information, wherein the area information is used to indicate a size and a position of an area to be planned, and a size and a position of an obstacle in the area to be planned;
A second obtaining unit (502) for obtaining attribute constraint information of the placement areas of at least two objects to be planned;
a third acquisition unit (503) for acquiring parameter information of the algorithm model;
a determining unit (504) configured to determine, according to the region information, the attribute constraint information, and the parameter information, position information of placement regions of the at least two objects to be planned in the region to be planned by using the algorithm model;
and the generating unit (505) is used for generating a layout planning drawing according to the position information and the area information.
10. An electronic device (600), comprising: -a processor (602), a communication interface (604), a memory (606) and a communication bus (608), said processor (602), said memory (606) and said communication interface (604) completing communication with each other via said communication bus (608);
the memory (606) is configured to store at least one executable instruction that causes the processor (602) to perform operations corresponding to the layout planning method (100) according to any one of claims 1-8.
11. A computer readable storage medium having stored thereon computer instructions which, when executed by a processor, cause the processor to perform the method of any of claims 1-8.
12. A computer program product, characterized in that the computer program product is tangibly stored on a computer-readable medium and comprises computer-executable instructions which, when executed, cause at least one processor to perform the method according to any one of claims 1-8.
CN202311245609.0A 2023-09-25 2023-09-25 Layout planning method, device, electronic equipment and storage medium Pending CN117272476A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311245609.0A CN117272476A (en) 2023-09-25 2023-09-25 Layout planning method, device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311245609.0A CN117272476A (en) 2023-09-25 2023-09-25 Layout planning method, device, electronic equipment and storage medium

Publications (1)

Publication Number Publication Date
CN117272476A true CN117272476A (en) 2023-12-22

Family

ID=89204088

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311245609.0A Pending CN117272476A (en) 2023-09-25 2023-09-25 Layout planning method, device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN117272476A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117828701A (en) * 2024-03-05 2024-04-05 中国石油大学(华东) Engineering drawing layout optimization method, system, equipment and medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117828701A (en) * 2024-03-05 2024-04-05 中国石油大学(华东) Engineering drawing layout optimization method, system, equipment and medium
CN117828701B (en) * 2024-03-05 2024-05-24 中国石油大学(华东) Engineering drawing layout optimization method, system, equipment and medium

Similar Documents

Publication Publication Date Title
KR102123450B1 (en) Simulation method for building construction using building information modeling, computer readable medium and system for performing the method
US20190026401A1 (en) Generative space planning in architectural design for efficient design space exploration
Ficko et al. Designing the layout of single-and multiple-rows flexible manufacturing system by genetic algorithms
US7007258B2 (en) Method, apparatus, and computer program product for generation of a via array within a fill area of a design layout
CN117272476A (en) Layout planning method, device, electronic equipment and storage medium
CN111728535B (en) Method and device for generating cleaning path, electronic equipment and storage medium
Koenig et al. Comparing two evolutionary algorithm based methods for layout generation: Dense packing versus subdivision
CN109308386B (en) Engineering drawing wall body identification method and device and electronic equipment
Jerin Leno et al. MIP model and elitist strategy hybrid GA–SA algorithm for layout design
Jerin Leno et al. An elitist strategy genetic algorithm for integrated layout design
CN102292749B (en) System and method for determining translation vector which separates two interference objects
US7454721B2 (en) Method, apparatus and computer program product for optimizing an integrated circuit layout
CN113297638A (en) Data processing method, cutting system, control system and equipment
CN113658195B (en) Image segmentation method and device and electronic equipment
US20100205570A1 (en) Method For Reading Polygon Data Into An Integrated Circuit Router
US20140088925A1 (en) Systems and methods for computing solutions of geometric constraint equations of computer-implemented virtual models
Mustafa et al. The (2n) 2-point scheme based on bivariate cubic polynomial
CN113239438B (en) Rapid point location arranging method in BIM (building information modeling)
CN112337093B (en) Virtual object clustering method and device, storage medium and electronic device
CN117007031A (en) Map processing method, map processing device, medium and electronic equipment
CN114444185A (en) In-situ labeling identification method and device and electronic equipment
CN110457030B (en) Mobile adaptive rearrangement method and device for component arrangement
Tabrizi et al. A detailed routing-aware detailed placement technique
CN117272475A (en) Layout planning method, device, electronic equipment and storage medium
CN114520978A (en) Method and system for automatically arranging base stations in network planning simulation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination