• Transactions of the Korean Society of Automotive Engineers
• /
• v.7 no.8
• /
• pp.224-232
• /
• 1999

Topology optimization has evolved into a very efficient concept design tool and has been incorporated into design engineering processes in many industrial sectors. In recent years, topology optimization has become the focus of structural design community and has been researched and applied widely both in academia and industry. There are mainly tow approaches for topology optimization of continuum structures ; homogenization and density methods. The homogenization method is to compute is to compute an optimal distribution of microstructures in a given design domain. The sizes of the micro-calvities are treated as design variables for the topology optimization problem. the density method is to compute an optimal distribution of an isotropic material, where the material densities are treated as design variables. In this paper, the density method is used to formulate the topology optimization problem. This optimization problem is solved by using an optimality criteria method. Several example problems are solved to show the usefulness of the present approach.

• International Journal of CAD/CAM
• /
• v.7 no.1
• /
• pp.61-69
• /
• 2007

The objective of this work is to integrate reliability analysis into topology optimization problems. We introduce the reliability constraint in the topology optimization formulation, and the new model is called Reliability-Based Topology Optimization (RBTO). The application of the RBTO model gives a different topology relative to the classical topology optimization that should be deterministic. When comparing the structures resulting from the deterministic topology optimization and from the RBTO model, the RBTO model yields structures that are more reliable than the deterministic ones (for the same weight). Several applications show the importance of this integration.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.392-400
• /
• 2008

This paper proposes a novel optimization algorithm inspired by bacteria behavior patterns for foraging. Most bacteria can trace attractant chemical molecules for foraging. This tracing capability of bacteria called chemotaxis might be optimized for foraging because it has been evolved for few millenniums. From this observation, we developed a new optimization algorithm based on the chemotaxis of bacteria in this paper. We first define behavior and decision rules based on the behavior patterns of bacteria and then devise an optimization algorithm with these behavior and decision rules. Generally bacteria have a quorum sensing mechanism that makes it possible to effectively forage, but we leave its implementation as a further work for simplicity. Thereby, we call our algorithm a simple bacteria cooperative optimization (BCO) algorithm. Our simple BCO is tested with four function optimization problems on various' parameters of the algorithm. It was found from experiments that the simple BCO can be a good framework for optimization.

• East Asian mathematical journal
• /
• v.4
• /
• pp.193-201
• /
• 1988

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.219-227
• /
• 2008

As found in research on constraint satisfaction problems, the choice of variable ordering heuristics is crucial for effective solving of constraint optimization problems. For the special problems such as energy-efficient clustering in heterogeneous wireless sensor networks, in which cluster heads have an inclination to be near a base station, we propose a new approach based on the static preferences variable orderings and provide a pnode heuristic algorithm for a specific application. The pnode algorithm selects the next variable with the highest Preference. In our problem, the preference becomes higher when the cluster heads are closer to the optimal region, which can be obtained a Priori due to the characteristic of the problem. Since cluster heads are the most dominant sources of Power consumption in the cluster-based sensor networks, we seek to minimize energy consumption by minimizing the maximum energy dissipation at each cluster heads as well as sensor nodes. Simulation results indicate that the proposed approach is more efficient than other methods for solving constraint optimization problems with static preferences.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.59-72
• /
• 2005

The auxiliary principle is used to suggest and analyze some iterative methods for solving solving hemivariational inequalities under mild conditions. The results obtained in this paper can be considered as a novel application of the auxiliary principle technique. Since hemivariational in­equalities include variational inequalities and nonlinear optimization problems as special cases, our results continue to hold for these problems.

• Korean Journal of Mathematics
• /
• v.4 no.1
• /
• pp.7-16
• /
• 1996

The optimization problems with quadratic constraints often appear in various fields such as network flows and computer tomography. In this paper, we propose an algorithm for solving those problems and prove the convergence of the proposed algorithm.

• The Journal of the Korea Contents Association
• /
• v.15 no.7
• /
• pp.21-29
• /
• 2015

This paper proposes a novel two-tier optimization approach for decision making in many-objective problems. Because the Pareto-optimal solution ratio increases exponentially with an increasing number of objectives, simply finding the Pareto-optimal solutions is not sufficient for decision making in many-objective problems. In other words, it is necessary to discriminate the more preferable solutions from the other solutions. In the proposed approach, user preference-oriented as well as diverse Pareto-optimal solutions can be obtained as candidate solutions by introducing an additional tier of optimization. The second tier of optimization employs the corresponding secondary objectives, global evaluation and crowding distance, which were proposed in previous works, to represent the users preference to a solution and the crowdedness around a solution, respectively. To demonstrate the effectiveness of the proposed approach, decision making for some benchmark functions is conducted, and the outcomes with and without the proposed approach are compared. The experimental results demonstrate that the decisions are successfully made with consideration of the users preference through the proposed approach.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1090-1098
• /
• 2014

In this paper, an improved ACDE (Adaptive Cauchy Differential Evolution) algorithm with faster convergence speed, called ACDE2, is suggested. The baseline ACDE algorithm uses a "DE/rand/1" mutation strategy to provide good population diversity, and it is appropriate for solving multimodal optimization problems. However, the convergence speed of the mutation strategy is slow, and it is therefore not suitable for solving unimodal optimization problems. The ACDE2 algorithm uses a "DE/current-to-best/1" mutation strategy in order to provide a fast convergence speed, where a control parameter initialization operator is used to avoid converging to local optimization. The operator is executed after every predefined number of generations or when every individual fails to evolve, which assigns a value with a high level of exploration property to the control parameter of each individual, providing additional population diversity. Our experimental results show that the ACDE2 algorithm performs better than some state-of-the-art DE algorithms, particularly in unimodal optimization problems.

• Structural Engineering and Mechanics
• /
• v.71 no.1
• /
• pp.1-12
• /
• 2019

This study investigates optimum designs of steel space truss towers under seismic loading by using Jaya optimization algorithm. Turkish Earthquake Code (2007) specifications are applied on optimum designs of steel space truss towers under the seismic loading for different local site classes depending on different soil groups. The proposed novel algorithm does not have any algorithm-specific control parameters and depends only a simple revision equation. Therefore, it provides a practical solution for structural optimization problems. Optimum solutions of the different steel truss examples are carried out by selecting suitable W sections taken from American Institute of Steel Construction (AISC). In order to obtain optimum solutions, a computer program is coded in MATLAB in corporated with SAP2000-OAPI (Open Application Programming Interface). The stress and displacement constraints are applied on the design problems according to AISC-ASD (Allowable Stress Design) specifications. Firstly, a benchmark truss problem is examined to see the efficiency of Jaya optimization algorithm. Then, two different multi-element truss towers previously solved with other methods without seismic loading in literature are designed by the proposed algorithm. The first space tower is a 582-member space truss with the height of 80 m and the second space tower is a 942-member space truss of about 95 m height. The minimum optimum designs obtained with this novel algorithm for the case without seismic loading are lighter than the ones previously attained in the literature studies. The results obtained in the study show that Jaya algorithm is a practical and robust optimization method for structural optimization problems. Moreover, incorporation of the seismic loading causes significant increase in the minimum design weight.