KR101703450B1 - Structural topology optimization method using bigbang-bigcrunch algorithm - Google Patents

Structural topology optimization method using bigbang-bigcrunch algorithm Download PDF

Info

Publication number
KR101703450B1
KR101703450B1 KR1020150154799A KR20150154799A KR101703450B1 KR 101703450 B1 KR101703450 B1 KR 101703450B1 KR 1020150154799 A KR1020150154799 A KR 1020150154799A KR 20150154799 A KR20150154799 A KR 20150154799A KR 101703450 B1 KR101703450 B1 KR 101703450B1
Authority
KR
South Korea
Prior art keywords
fitness
region
elements
design
area
Prior art date
Application number
KR1020150154799A
Other languages
Korean (ko)
Inventor
한석영
안홍균
Original Assignee
한양대학교 산학협력단
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 한양대학교 산학협력단 filed Critical 한양대학교 산학협력단
Priority to KR1020150154799A priority Critical patent/KR101703450B1/en
Application granted granted Critical
Publication of KR101703450B1 publication Critical patent/KR101703450B1/en

Links

Images

Classifications

    • G06F17/5018
    • G06F17/5004

Abstract

A phase optimization design method of a structure includes dividing a design area of the structure into a plurality of elements, calculating a sensitivity value of each of the elements by finite element analysis, and calculating a fitness from the sensitivity value ; Creating a virtual design area extending in the design area and having an arbitrary area; And executing the large explosion-versus-shrink algorithm in each of the execution regions by arbitrarily setting the execution regions in the reference region unit over the entire region including the design region and the virtual design region.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of optimizing a topology of a structure using a large-

The present invention relates to a method of optimizing a topology of a structure, and more particularly, to a method of optimizing a topology of a structure using a large explosion-large contraction algorithm.

The Bigbang-Bigcrunch Algorithm is an algorithm inspired by the process of the birth and extinction of the universe, in which a myriad of planets are created at the birth of the universe, which, as the universe expands, It is a method to search the solution through the process of converging to the center of gravity by increasing the gravity of the part and disappearing. It has been confirmed that this large explosion - contraction algorithm is efficient in finding the global solution value faster than other algorithms in the optimization process.

On the other hand, the purpose of structural optimization is to obtain the shape of a structure that can draw the smallest static compliance value while satisfying the constraints such as the stress limit, the deformation limit, and the volume condition of the structure. According to the requirements of the designer, the structure optimization is divided into sizing, shape, and topology optimization. Conventional techniques include solid isotropic material with penalization (SIMP) and bi-directional evolutionary structural optimization (BESO ), Ant colony optimization (ACO), artificial bee colony algorithm (ABCA), and Harmony Search Algorithm (HS) all provide a similar optimal phase.

Among the phase optimization algorithms, SIMP has a gray area in phase, which makes it difficult to clearly define the optimized phase boundary and is slow. BESO requires a process to match target volume, so convergence is slow and ACO is also slow. The fastest ABCA of the prior art has the fastest convergence speed in the process of sending the employment bee to a better position for quick search, but it still needs to improve the convergence speed. Also, in the case of phase optimization using the HS (Harmonic Search) method, if the target volume is decreased below a certain amount, there is a limit that the optimum phase can not be found.

Although there is a case where the above-described large explosion-shrinkage algorithm is applied to the size optimization design of a structure, there is no case where the phase optimization is applied. This is because the large explosion-versus-contraction algorithm finds only one optimal solution for the center of gravity (contraction) of the candidate solutions, so that the general boundary-contraction algorithm can not find the boundary of the structure.

The present invention provides a method of performing a topology optimization design of a structure using a large explosion-versus-shrink algorithm.

According to an embodiment of the present invention, a method for optimizing a topology of a structure includes dividing a design area of the structure into a plurality of elements, calculating a sensitivity value of each of the elements by finite element analysis, Calculating a fitness from the sensitivity value; Creating a virtual design area extending in the design area and having an arbitrary area; And executing the large explosion-versus-shrink algorithm in each of the execution regions by arbitrarily setting the execution regions in the reference region unit over the entire region including the design region and the virtual design region.

Also, the reference area may be an area in which the elements are arranged in a matrix of m x n (m and n are natural numbers), and the virtual design area may be extended in the design area at a certain rate of the m x n matrix.

Also, the virtual design area may be extended to the upper and lower sides of the design area by a row of the elements corresponding to 1/2 of m, and may be extended to both sides of the design area Respectively.

The step of performing the large explosion-contraction algorithm in the execution regions may further include: randomly selecting a candidate solution among the elements; Dividing the execution region into a solid region including the candidate solution and a void region not including the candidate solution; Performing the large explosion-versus-shrink algorithm in the solid region, and selecting an element having the highest fitness in the solid region; Performing the large explosion-versus-shrink algorithm in the void region, and selecting an element having the lowest fitness in the void region; Comparing the element having the highest fitness and the element having the lowest fitness; And when the fitness of the element with the highest fitness is greater than the fitness of the element with the lowest fitness, the position of the element with the highest fitness and the one with the lowest fitness are not exchanged, Of the element having the highest degree of fidelity is larger than the degree of fidelity of the element having the highest degree of fidelity.

Also, the number of times the position of the element having the highest fitness and the element having the lowest fitness is not counted is counted until the number of consecutive times is repeated at a preset number of times, May be repeated.

The topology optimization design method of a structure according to another embodiment of the present invention designs an optimum phase of the structure by executing a large explosion-large shrinkage algorithm.

Calculating a sensitivity value of the elements by a finite element analysis on a design area of the structure and calculating a fitness from the sensitivity value; Executing the large explosion-versus-shrink algorithm in the entire area including the design area and a virtual design area extending therefrom to an arbitrary area; And classifying the elements having a high value of the fitness and the elements having a low value of the fitness by executing the large explosion-large contraction algorithm.

Also, the large explosion-to-shrink algorithm may be performed in units of execution regions where the elements are included in a predetermined area, and the virtual design region may be extended from the design region at a certain rate of the execution region.

The step of performing the large explosion-contraction algorithm in the entire region may include: selecting a candidate solution among the elements; Dividing the execution region into a solid region including the candidate solution and a void region not including the candidate solution; Performing the large explosion-versus-shrink algorithm in the solid region, and selecting an element having the highest fitness in the solid region; And performing the large explosion-versus-shrink algorithm in the void region, and selecting an element having the lowest fidelity in the void region, wherein the element having a high value of the fidelity and the element having a low value of the fidelity Wherein the classifying step compares the element having the highest fitness with the element having the lowest fitness and if the fitness of the element having the highest fitness is greater than the fitness of the element having the lowest fitness, If the position of the element with the lowest degree of fit is not replaced and if the degree of fit of the element with the lowest degree of fit is larger than that of the element with the highest degree of fit, Exchangeable.

Also, the number of times the positions of the elements having the highest fitness and the elements having the lowest fitness are not counted are counted, and a large-explosion-shrinkage algorithm is performed in all the regions until the number of consecutive times is repeated a preset number of times. May be repeated.

According to another embodiment of the present invention, a method for optimizing a topology of a structure includes defining a design area of the structure, creating a virtual design area extending from the design area to an arbitrary area, And performs a large explosion-versus-shrink algorithm on the entire region including the region.

According to the present invention, the design method using the large explosion-shrinkage algorithm improves the convergence speed than the conventional design method.

1 is a flow chart illustrating a method for optimizing a topology of a structure according to an embodiment of the present invention.
2 is a view showing an example of a structure to which a topology optimization design method according to an embodiment of the present invention is applied.
FIGS. 3 and 4 are views illustrating a process of creating a virtual design area according to an embodiment of the present invention.
5 to 9 are views showing an example of executing a large explosion-large contraction algorithm according to an embodiment of the present invention.
FIGS. 10 and 11 are views showing an example of a phase optimization design of a structure to which a large explosion-shrinkage algorithm according to an embodiment of the present invention is applied.
12 is a diagram showing an experimental example according to a conventional phase optimization design method.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. However, the technical spirit of the present invention is not limited to the embodiments described herein but may be embodied in other forms. Rather, the embodiments disclosed herein are provided so that the disclosure can be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.

In this specification, when an element is referred to as being on another element, it may be directly formed on another element, or a third element may be interposed therebetween. Further, in the drawings, the thicknesses of the films and regions are exaggerated for an effective explanation of the technical content.

Also, while the terms first, second, third, etc. in the various embodiments of the present disclosure are used to describe various components, these components should not be limited by these terms. These terms have only been used to distinguish one component from another. Thus, what is referred to as a first component in any one embodiment may be referred to as a second component in another embodiment. Each embodiment described and exemplified herein also includes its complementary embodiment. Also, in this specification, 'and / or' are used to include at least one of the front and rear components.

The singular forms "a", "an", and "the" include plural referents unless the context clearly dictates otherwise. It is also to be understood that the terms such as " comprises "or" having "are intended to specify the presence of stated features, integers, Should not be understood to exclude the presence or addition of one or more other elements, elements, or combinations thereof. Also, in this specification, the term "connection " is used to include both indirectly connecting and directly connecting a plurality of components.

In the following description of the present invention, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear.

1 is a flow chart illustrating a method for optimizing a topology of a structure according to an embodiment of the present invention.

Referring to FIG. 1, a method of optimizing a topology of a structure includes steps of defining a design domain and a design parameter (S10), inputting a boundary and a load condition of the structure (S20), finite element analysis Calculating a sensitivity value of each element (S30), calculating a fitness from the obtained sensitivity values of each element (S40), generating a virtual design area of an arbitrary area with respect to the design area In step S50, the execution regions are defined as a reference region unit over the entire region including the design region and the virtual design region, the large-explosion-contraction algorithm is repeatedly executed in each of the execution regions, (S60) of replacing elements having small fitness values, and evaluating the obtained structure (S70).

Step S10 of defining the design area and the design parameters will be described with reference to Fig. FIG. 2 is a diagram illustrating a Cantilever beam. In step S10 of defining a design region and a design variable, a target volume of a designed structure is defined as a design region, and variables that can occur in the design of the structure are defined.

Step S20 of inputting the boundary and load condition of the structure inputs information about the structure required for the phase optimization. The input information may include boundary condition, load acting position, load magnitude, load acting direction, and the like.

In the step S30 of calculating the sensitivity number of each element by performing the finite element analysis, the defined design region is divided into a plurality of elements, and the sensitivity value of each element is calculated through a finite element analysis .

The step of calculating the fitness from the sensitivity values of the obtained elements (S40) calculates the fitness from the sensitivity values. Fit is the reciprocal of the sensitivity, and the elements with low fit are interpreted as the area where the structure is located and the elements with high fitness are the areas where the structure is not located.

The step (S50) of creating a virtual design area of an arbitrary area with respect to the design area creates a virtual design area and expands the design area. In the case of the existing large-explosion-contraction algorithm, there is no restriction on the boundary because it finds the candidate solution with its center of gravity by randomly causing a large explosion in the infinite region to find the solution. However, Therefore, we can not find the boundary of the structure by using the characteristics of the algorithm that finds the optimal solution with the center of gravity intact. Therefore, in order to solve the problem, an arbitrary virtual design area is added to a desired design area. And we propose a method to find boundary of design area by expanding explosion area to virtual design area.

FIGS. 3 and 4 are views illustrating a process of creating a virtual design area according to an embodiment of the present invention.

Referring to FIG. 3, the original design domain 10 is divided into a plurality of elements 11 by performing the above-described finite element analysis. For ease of understanding, the design area 10 illustrates an example in which the elements 11 are divided into 6x6 matrices. The number of elements 11 to be divided in the design area 10 can be variously changed.

Referring to FIG. 4, an expanded design domain 20 is extended to an arbitrary area in the design region 10. [0031] FIG. According to the embodiment, the virtual design areas 20 are extended in the design area 10 at a certain ratio of the reference area 30 (red dotted line). The reference area 30 is a unit area in which a large explosion-versus-shrink algorithm is performed, and can be set by the user. The reference area 30 is an area containing a plurality of elements 11, and the elements 11 are arranged in a matrix of m x n (where m and n are natural numbers). According to the embodiment, the reference area 30 is set to an area in which the elements 11 are arranged in 4 X 2. Alternatively, the reference area 30 may be set to various matrix arrangements of elements 11.

The pseudo design area 20 expands the row at a certain rate of the row elements of the reference area 30 and expands the column at a certain rate of the column elements of the reference area 30. [ The virtual design area 20 can be extended at a half rate of the row elements of the reference area 30 and the column can be extended at a half rate of the column elements. According to the embodiment, the virtual design area 20 is expanded on the basis of two rows, which is one-half of the four rows of the reference area 30, . The virtual design region 20 is extended by two rows in the upper and lower sides of the design region 10, and extended by one row on both sides. Thereby, the entire area including the design area 10 and the virtual design area 20 is arranged in a 10 x 8 matrix. The enlargement ratio value 1/2 of the virtual design area 20 described above is an optimized value required for finding the boundary of the structure. Experimental results show that it is difficult to find the interface of the structure when the extension ratio is smaller than this value, and the convergence speed is slower when the expansion ratio is larger.

Referring again to FIG. 1, step S60 of executing the large explosion-large contraction algorithm may be performed by setting execution regions on a per-reference-area basis over the entire region including the design region and the virtual design region, - Executes a major contraction algorithm.

The step S60 of executing the large explosion-large contraction algorithm includes generating (S110) execution regions on the basis of the reference region in the entire region, arbitrarily setting a candidate solution among elements included in the design region, (S120) dividing an execution region including the candidate solution into solid regions and dividing an execution region not including the candidate solution into void regions (S120), executing a large explosion-to-contraction algorithm in the solid region, (S140), selecting the element having the highest fitness in the void region (S140), executing the large explosion-contraction algorithm in the void region (S140), selecting the element having the highest fitness And comparing the value of the fitness value of the lowest fitness factor with the fitness value of the lowest fitness factor (S150). If the fitness value of the element having the highest fitness is smaller than the fitness value of the element having the lowest fitness, the positions of the elements are exchanged (S160). If the fitness value of the element having the highest fitness is greater than the fitness value of the element having the lowest fitness, the positions of the corresponding elements are not exchanged (S170).

FIGS. 5 to 7 sequentially illustrate the steps of executing the large explosion-to-contraction algorithm according to the embodiment of the present invention.

Referring to FIG. 5, the candidate solution 41 among the elements included in the design region 10 is arbitrarily set. An execution region included in the candidate solution 41 is divided into a solid region 30a and an arbitrary execution region not including the candidate solution 41 is divided into a void region 30b. A large explosion-versus-shrink algorithm is executed in each of the solid area 30a and the void area 30b to select the element 42 having the highest fitness and the element 43 having the lowest fitness as shown in FIG. As a result of the comparison of the fitness values of the two elements 42 and 43, if the fitness value of the element 42 having the highest fitness is smaller than the fitness value of the element 43 having the lowest fitness, 43 are exchanged with each other. Alternatively, if the fitness value of the element 42 having the highest fitness is greater than the fitness value of the element 43 having the lowest fitness, the positions of the elements 42 and 43 are not exchanged.

The process of executing the above-described large explosion-large contraction algorithm is repeated by resetting the execution regions 30c and 30d as shown in FIG. Here, the execution regions 30c and 30d are set at random.

In the execution step (S60) of the large explosion-large contraction algorithm, the final large contraction point is designated as the optimal candidate solution, and a large explosion occurs in the vicinity of the large contraction point, thereby selecting a plurality of large explosion points near the candidate solution. And exchanging the data. This is based on the fact that several candidate solutions are gathered near the structure. As shown in FIG. 8, the optimal candidate solutions 41a and 41b according to the last major contraction are specified, and the last major explosion is generated in the vicinity thereof, and the candidate solution is selected from a plurality of large explosion points in the vicinity. And exchanges element positions of candidate solutions. The numerical values set forth in the elements in the drawings are fitness values, and are given in arbitrary numerals for the sake of explanation. The elements of the solid region 30e and the void region 30f are arbitrarily extracted, and the fitness values of the extracted elements are individually compared. As a result, the element having a lower fitness value is compared with the solid region 30e, Area 30f. As shown in Fig. 9, only the elements having a smaller fit than the void region 30f are located in the solid region 30e. The solid region 30e in which the elements having a small fitness are gathered is determined as an area in which the structure is located.

While the above-described large explosion-to-shrink algorithm execution step is repeated, the number of elements to be exchanged gradually decreases, and the number of non-exchanged elements gradually increases.

Referring again to FIG. 1, the repetition of step S60 of executing the large explosion-major contraction algorithm is repeated until the non-exchanged successively reaches a preset value. If it is determined that the fitness of the elements in the solid region is higher than the fitness of the elements in the void region, the number of times of non-replacement is increased by one (S170). Alternatively, if the fit of the elements in the solid region is less than the fit of the elements in the void region, then the exchange of elements takes place and the pre-counted number of unchanged times is initialized (S160). When the number of unexchanged cycles is counted in the course of execution of the large explosion-to-contraction algorithm, the execution of the large explosion-contraction algorithm ends when the counted number of unexchanged cycles reaches a predetermined value.

When the execution of the large explosion-major shrink algorithm is terminated, a step S70 of evaluating the obtained structure is performed. The evaluation step S70 calculates the objective function for the obtained structure, and calculates the sensitivity number according to the calculated objective function (S210). Then, it is determined whether the objective function of the structure according to the interation is converged (220). When the convergence condition is satisfied, the calculation is terminated. Otherwise, if the convergence condition is not satisfied, the above-described processes are repeated from the step of calculating the sensitivity number of each element by performing the finite element analysis.

FIGS. 10 and 11 are views showing an example of a phase optimization design of a structure to which a large explosion-shrinkage algorithm according to an embodiment of the present invention is applied. FIG. 10 is a view illustrating a phase optimization designing process for a cantilever beam structure, and FIG. 11 is a diagram illustrating a phase optimization designing process for an MBB beam structure. The phase optimization design process for the cantilever beam structure shows 26 convergence speeds, and the phase optimization design process for the MBB beam structure shows 27 convergence speeds.

12 is a diagram illustrating an experimental example according to a conventional phase optimization design method. In the phase optimization design of the cantilever beam, a Harmony Search Algorithm (HS), an artificial bee colony algorithm (ABCA), a bi-directional evolutionary structural optimization Respectively.

Referring to FIG. 10 and FIG. 12, the result obtained through the design method according to the present invention and the conventional design methods are represented by a topology structure having the same shape. On the other hand, the design method according to the present invention shows 27 convergence speeds, whereas the HS design method shows 33 times, the ABCA design method shows 41 times, and the BESO design method shows 63 times and 71 times convergence speed respectively. Accordingly, the phase optimization design method according to the present invention can be expected to have a speed efficiency as compared with the conventional design method.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the scope of the present invention is not limited to the disclosed exemplary embodiments. It will also be appreciated that many modifications and variations will be apparent to those skilled in the art without departing from the scope of the invention.

10: Design area
11: Element
20: Virtual design area
30: reference area, execution area
30a: solid area
30b: void area
41: Candidate
42: The element with the highest fitness
43: The lowest fit

Claims (11)

A method for topology optimization of a structure,
Computing a sensitivity value of each of the elements by finite element analysis and calculating a fit from the sensitivity value;
Creating a virtual design area extending in the design area and having an arbitrary area; And
Determining execution regions on a per-reference-area basis over the entire region including the design region and the virtual design region, and executing a large-size contraction algorithm in each of the execution regions,
Wherein performing the large explosion-to-contraction algorithm in the execution regions comprises:
Arbitrarily selecting a candidate solution among the elements;
Dividing the execution region into a solid region including the candidate solution and a void region not including the candidate solution;
Performing the large explosion-versus-shrink algorithm in the solid region, and selecting an element having the highest fitness in the solid region;
Performing the large explosion-versus-shrink algorithm in the void region, and selecting an element having the lowest fitness in the void region;
Comparing the element having the highest fitness and the element having the lowest fitness; And
Wherein when the fitness of the element with the highest fitness is greater than the fitness of the element with the lowest fitness, the position of the element with the highest fitness and the one with the lowest fitness are not exchanged, and the fitness of the element with the lowest fitness And replacing the location of the element with the highest fitness and the location of the element with the lowest fitness when the fitness is greater than the fitness of the element with the highest fitness.
The method according to claim 1,
Wherein the reference region is an area in which the elements are arranged in a matrix of mxn (m and n are natural numbers)
Wherein the virtual design area extends in the design area at a constant rate of the mxn matrix.
3. The method of claim 2,
Wherein the virtual design area is extended to upper and lower sides of the design area by a row of the elements corresponding to 1/2 of m and each of the elements is expanded to both sides of the design area by a row of the elements corresponding to 1/2 of n Topology Optimization Design Method of Structures.
delete The method according to claim 1,
A large explosion-to-contraction algorithm is executed in the execution regions until the number of times the element having the highest fitness and the element having the lowest fitness are not replaced is repeated a predetermined number of times consecutively A phase optimization design method for a structure in which the steps are repeated.
A method for topology optimization of a structure,
Calculating a sensitivity value of the elements by a finite element analysis on a design area of the structure and calculating a fitness from the sensitivity value;
Executing a large explosion-versus-shrink algorithm in the entire area including the design area and a virtual design area extending therefrom to an arbitrary area;
Classifying the elements having a high value of the fitness and the elements having a low value of the fitness by execution of the large explosion-contraction algorithm,
Wherein the large explosion-versus-shrink algorithm is performed on an execution region unit in which the elements are included in a predetermined area, the virtual design region is extended from the design region at a predetermined ratio of the execution region,
Wherein performing the large explosion-versus-shrink algorithm in the entire region comprises:
Arbitrarily selecting a candidate solution among the elements;
Dividing the execution region into a solid region including the candidate solution and a void region not including the candidate solution;
Performing the large explosion-versus-shrink algorithm in the solid region, and selecting an element having the highest fitness in the solid region; And
Performing the large explosion-versus-shrink algorithm in the void region, and selecting an element having the lowest fidelity in the void region,
Wherein the step of classifying elements having a high value of the goodness of fit and elements having a low value of the goodness value includes:
When the element having the highest fitness is compared with the element having the lowest fitness and the fitness of the element having the highest fitness is greater than that of the element having the lowest fitness, The position of the element is not exchanged,
Wherein the position of the element with the highest fitness and the element with the lowest fitness are exchanged when the fitness of the element with the lowest fitness is greater than the fitness of the element with the highest fitness.
delete delete delete The method according to claim 6,
A large explosion-versus-shrink algorithm is executed in all the regions until the number of times the element having the highest fitness and the element having the lowest fitness are not replaced is repeated a predetermined number of times consecutively A phase optimization design method for a structure in which the steps are repeated.
delete
KR1020150154799A 2015-11-04 2015-11-04 Structural topology optimization method using bigbang-bigcrunch algorithm KR101703450B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020150154799A KR101703450B1 (en) 2015-11-04 2015-11-04 Structural topology optimization method using bigbang-bigcrunch algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020150154799A KR101703450B1 (en) 2015-11-04 2015-11-04 Structural topology optimization method using bigbang-bigcrunch algorithm

Publications (1)

Publication Number Publication Date
KR101703450B1 true KR101703450B1 (en) 2017-02-09

Family

ID=58154545

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020150154799A KR101703450B1 (en) 2015-11-04 2015-11-04 Structural topology optimization method using bigbang-bigcrunch algorithm

Country Status (1)

Country Link
KR (1) KR101703450B1 (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109408893A (en) * 2018-09-26 2019-03-01 武汉理工大学 A kind of more thickness area dividing methods of inner plate of car door considering different operating conditions
CN109558621A (en) * 2018-09-12 2019-04-02 中山大学 A kind of Structural Damage Identification and system
CN110069800A (en) * 2018-11-17 2019-07-30 华中科技大学 Three-dimensional structure method of topological optimization design and equipment with smooth boundary expression
CN110261154A (en) * 2019-06-21 2019-09-20 广州大学 A kind of Structural Damage Identification and device
CN110569958A (en) * 2019-09-04 2019-12-13 长江水利委员会长江科学院 High-dimensional complex water distribution model solving method based on hybrid artificial bee colony algorithm
CN111090942A (en) * 2019-12-18 2020-05-01 浙江大学 High-sensitivity piezoresistive uniaxial force sensor design method based on topology optimization

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"Reformulations of Big Bang-Big Crunch Algorithm for Discrete Structural Design Optimization",International Journal of Civil Environmental Structural Construction Engineering Vol.7(pp.139-147),2013 *
"Size and Shape Optimization of Two-Dimensional Trusses Using Hybrid Big Bang-Big Crunch Algorithm",International Journal of Mechatronics Electrical and Computer Technology Vol.5(pp.1987-1998),2015.01* *
"연성 및 취성재료의 파괴이론을 고려한 위상최적설계 기법 개발", 대한기계학회 2011년도 추계학술대회 강연 및 논문 초록집(pp. 531-535), 2011년 11월* *
"위상최적설계와 형상최적설계를 이용한 크레인의 경량설계", 대한기계학회논문집 A권 제35권 제7호(pp. 821-826), 2011 *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109558621A (en) * 2018-09-12 2019-04-02 中山大学 A kind of Structural Damage Identification and system
CN109558621B (en) * 2018-09-12 2020-08-18 中山大学 Structural damage identification method and system
CN109408893A (en) * 2018-09-26 2019-03-01 武汉理工大学 A kind of more thickness area dividing methods of inner plate of car door considering different operating conditions
CN110069800A (en) * 2018-11-17 2019-07-30 华中科技大学 Three-dimensional structure method of topological optimization design and equipment with smooth boundary expression
CN110069800B (en) * 2018-11-17 2021-03-26 华中科技大学 Three-dimensional structure topology optimization design method and equipment with smooth boundary expression
CN110261154A (en) * 2019-06-21 2019-09-20 广州大学 A kind of Structural Damage Identification and device
CN110569958A (en) * 2019-09-04 2019-12-13 长江水利委员会长江科学院 High-dimensional complex water distribution model solving method based on hybrid artificial bee colony algorithm
CN110569958B (en) * 2019-09-04 2022-02-08 长江水利委员会长江科学院 High-dimensional complex water distribution model solving method based on hybrid artificial bee colony algorithm
CN111090942A (en) * 2019-12-18 2020-05-01 浙江大学 High-sensitivity piezoresistive uniaxial force sensor design method based on topology optimization
CN111090942B (en) * 2019-12-18 2022-02-11 浙江大学 High-sensitivity piezoresistive uniaxial force sensor design method based on topology optimization

Similar Documents

Publication Publication Date Title
KR101703450B1 (en) Structural topology optimization method using bigbang-bigcrunch algorithm
JP6726246B2 (en) Method and apparatus for performing operations in a convolutional neural network and non-transitory storage medium
US10324453B2 (en) Space for materials selection
AU2007208111B2 (en) Sector meshing and neighbor searching for object interaction simulation
CN106408604A (en) Filtering method and device for point cloud data
CN108491226B (en) Spark configuration parameter automatic tuning method based on cluster scaling
JP2015230702A (en) Processing flow generation apparatus, processing flow generation method, processing flow generation program, manufacturing method of information processor and manufacturing method of information processing program
JP2007164393A (en) Design support method and design support system
CN110322417B (en) Image processing implementation method and system
JP6365102B2 (en) Data processing apparatus and program
Laslier et al. How quickly can we sample a uniform domino tiling of the 2 L * 2L 2 L× 2 L square via Glauber dynamics?
CN109952742B (en) Graph structure processing method, system, network device and storage medium
Wang et al. A fast successive over-relaxation algorithm for force-directed network graph drawing
JP2016091488A (en) Data sorting method and program
Liu et al. Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique
CN112347589A (en) Space geometry unfolding method and device and electronic equipment
JP7161154B2 (en) Hierarchical bounding volume generation method, computer program and computer device
JP7138401B1 (en) Design support device
JP3692460B2 (en) Numerical analysis system using mixed grid type solution adaptive grid method
CN110659286A (en) Dynamic space index method based on weak balance space tree and storage medium and device thereof
Díaz et al. Node-Based Data Structure for Balancing Process Optimization of Quadtree Meshes
JP2020135590A (en) Design support device of outer wall panel
JP5741705B2 (en) Optimal region extraction method and apparatus
KR100750379B1 (en) Method for optimizing material property
WO2024053100A1 (en) Data generation device, learning device, data generation method, and program

Legal Events

Date Code Title Description
GRNT Written decision to grant