• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.04a
• /
• pp.143-150
• /
• 2004

An optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen for design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size for each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.7
• /
• pp.940-947
• /
• 2004

In this paper, an optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen for design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size for each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2000

In this paper, optimum design problem of R.C. continuous beam is considered and GUI system is developed for using at the practical design. Objective function lot formulation of optimum design problem is made up of the costs of concrete, reinforcing steel and formwork. Design variables are width, effective depth of the beam and steel ratio and design constraints are considered on the strength, serviceability, durability and geometrical conditions. The optimum design problem is solved by using sequential linear programming(SLP), sequential convex programming(SCP) and compared their effectiveness. Also this paper shows the application at practical design work according to the development of GUI system using visual basic.

• Structural Engineering and Mechanics
• /
• v.52 no.2
• /
• pp.351-368
• /
• 2014

This study presents a hunting search based optimum design algorithm for engineering optimization problems. Hunting search algorithm is an optimum design method inspired by group hunting of animals such as wolves, lions, and dolphins. Each of these hunters employs hunting in a different way. However, they are common in that all of them search for a prey in a group. Hunters encircle the prey and the ring of siege is tightened gradually until it is caught. Hunting search algorithm is employed for the automation of optimum design process, during which the design variables are selected for the minimum objective function value controlled by the design restrictions. Three different examples, namely welded beam, cellular beam and moment resisting steel frame are selected as numerical design problems and solved for the optimum solution. Each example differs in the following ways: Unlike welded beam design problem having continuous design variables, steel frame and cellular beam design problems include discrete design variables. Moreover, while the cellular beam is designed under the provisions of BS 5960, LRFD-AISC (Load and Resistant Factor Design-American Institute of Steel Construction) is considered for the formulation of moment resisting steel frame. Levy Flights is adapted to the simple hunting search algorithm for better search. For comparison, same design examples are also solved by using some other well-known search methods in the literature. Results reveal that hunting search shows good performance in finding optimum solutions for each design problem.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1999.04a
• /
• pp.245-250
• /
• 1999

In this study, the development of graphic user interface(GUI) program for optimum design of RC continuous beam is dealt. Optimum design problem that satisfies strength, serviceability, durability and geometrical conditions is formulated as a non-linear programming problem(NLP) in which the objective function as well as the constraints are highly non-linear on design variables such as cross sectional dimensions and steel ratio. Optimum design problem is solved by NLP techniques namely, sequential linear programming(SLP), sequential convex programming(SCP). Numerical examples of R.C. continuous beam using GUI system are given to show usefulness of GUI system for practical design work and efficiency of algorithm for the NLP techniques.

• Structural Engineering and Mechanics
• /
• v.45 no.5
• /
• pp.643-654
• /
• 2013

Optimum cost design of columns subjected to axial force and uniaxial bending moment is presented in this paper. In the formulation of the optimum design problem, the height and width of the column, diameter and number of reinforcement bars are treated as design variables. The design constraints are implemented according to ACI 318-08 and studies in the literature. The objective function is taken as the cost of unit length of the column consisting the cost of concrete, steel, and shuttering. The solution of the design problem is obtained using the artificial bee colony algorithm which is one of the recent additions to metaheuristic techniques. The Artificial Bee Colony Algorithm is imitated the foraging behaviors of bee swarms. In application of this algorithm to the constraint problem, Deb's constraint handling method is used. Obtained results showed that the optimum value of numerical example is nearly same with the existing values in the literature.

• Computers and Concrete
• /
• v.10 no.3
• /
• pp.295-306
• /
• 2012

Optimum cost design of a simply supported reinforced concrete beam is presented in this paper. In the formulation of the optimum design problem, the height and width of the beam, and reinforcement steel area are treated as design variables. The design constraints are implemented according to ACI 318-08 and studies in the literature. The objective function is taken as the cost of unit length of the beam consisting the cost of concrete, steel and shuttering. The solution of the design problem is obtained using the artificial bee colony algorithm which is one of the recent additions to metaheuristic techniques. The artificial bee colony algorithm is imitated the foraging behaviors of bee swarms. In application of this algorithm to the constraint problem, Deb's constraint handling method is used. Obtained results showed that the optimum value of numerical example is nearly same with the existing values in the literature.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11a
• /
• pp.419-426
• /
• 2001

Industrial products determined by fixed size posses definite limits variety by manufacture tolerance in existence. The optimum value solved by deterministic approaches do not account of tolerance bands of design variables and material properties. If we examine optimum value considering tolerance bands of design variables and material properties, it might be useless, owing to exist infeasible region. We have two ways to prevent being useless value. The one is to minimize tolerance band, the other is to consider tolerance band in optimum design. The former needed more accuracy during manufacturing process require higher production cost, the letter is more appropriate to consider tolerance band. In this research, we consider the tolerance bands of all variables, which might have the tolerance bands used in the problem, based on optimum value of deterministic approaches. Orthogonal arrays are used to minimize the number of trial. Tolerance bands are supposed discretionary according to design variable. Appropriateness suggested by this research is examined through two examples. Mathematical problem is investigated only in terms of tolerance bands of design variables, and cantilever beam problem is explained through tolerance bands of design variable, material properties and loading conditions. It is proved that values from the presented method are satisfactory for tolerance bands of variables.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.1
• /
• pp.144-151
• /
• 2003

In this paper, an optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen fur design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size fur each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem. Favorable solution is obtained by the MLO, which is compared to both solutions made by RSM and sequential quadratic programming (SQP) in the OAO problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.315-318
• /
• 1995

The optimum design problem of a coat-hanger die is solved by the inverse formulation. The flow in the die is analyzed using three-dimensional model. The new model for the manifold geometry is developed for the inverse formulation. The inverse problem for the optimum die geometry is formed as the optimization problem whose objective function is the linear combination of the square sum of pressure gradient deviation at die exit and the penalty function relating to the measure of non-smoothness of solution. From the several iterative solutions of the optimization problem, the optimum solution can be obtained automatically while producing the uniform flow rate distribution at die exit.