• Journal of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.985-999
• /
• 2011

A new filled function method is presented in this paper to solve box-constrained nonlinear integer programming problems. It is shown that for a given non-global local minimizer, a better local minimizer can be obtained by local search starting from an improved initial point which is obtained by locally solving a box-constrained integer programming problem. Several illustrative numerical examples are reported to show the efficiency of the present method.

• Smart Structures and Systems
• /
• v.20 no.5
• /
• pp.607-618
• /
• 2017

In this research, a newly developed nature-inspired optimization method, the Lion Pride Optimization algorithm (LPOA), is utilized for optimal design of composite steel box girder bridges. A composite box girder bridge is one of the common types of bridges used for medium spans due to their economic, aesthetic, and structural benefits. The aim of the present optimization procedure is to provide a feasible set of design variables in order to minimize the weight of the steel trapezoidal box girders. The solution space is delimited by different types of design constraints specified by the American Association of State Highway and Transportation Officials. Additionally, the optimal solution obtained by LPOA is compared to the results of other well-established meta-heuristic algorithms, namely Gray Wolf Optimization (GWO), Ant Lion Optimizer (ALO) and the results of former researches. By this comparison the capability of the LPOA in optimal design of composite steel box girder bridges is demonstrated.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.35-43
• /
• 2001

In this paper, we propose a design method for GBSB (generalized brain-state-in-a-box) based associative memories. Based on the theoretical investigation about the properties of GBSB, we parameterize the solution space utilizing the limited number of parameters sufficient to represent the solution space and appropriate to be searched. Next we formulate the problem of finding a GBSB that can store the given pattern as stable states in the form of constrained optimization problems. Finally, we transform the constrained optimization problem into a SDP(semidefinite program), which can be solved by recently developed interior point methods. The applicability of the proposed method is illustrated via design examples.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1998.10b
• /
• pp.718-723
• /
• 1998

The program which could determine cross-sectional dimension of the prestressed concrete box girder bridges at the stage of preliminary design was developed using the optimal technique in this study. It could minimize the cost required in the design of box girder bridges and the construction with the full staging method. Objective cost function consisted of six independent variables such as height of cross-section, jacking force and thickness of web and bottom flange. The SUMT(Sequntial Unconstrained minimization Technique) was used to solve the constrained nonlinear minimization optimal problem. Using the program developed in this study, optimum design was performed for existing bridges with one cell cross section of constant depth. The result verify the compatibility of the program.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.28-33
• /
• 1994

An optimal controller, e.g. LQG controller, may not be realistic in the sense that the required control power may not be achieved by existing actuators, and the measured output is not satisfactory. To be realistic, the controller should meet such constraints as sensor or actuator limitation, performance limit, etc. In this paper, the lnput/Output Variance Constrained (IOVC) control problem will be considered from the viewpoint of mathematical programming. A dual version shall be developed to solve the IOVC control problem, whose objective is to find a stabilizing control law attaining a minimum value of a quadratic cost function subject to the inequality constraint on each input and output variance for a stabilizable and detectable plant. One approach to the constrained optimization problem is to use the Kuhn-Tucker necessary conditions for the optimality and to seek an optimal point by an iterative algorithm. However, since the algorithm uses only the necessary conditions, the convergent point may not be optimal solution. Our algorithm will guarantee a sufficiency.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.5
• /
• pp.56-64
• /
• 2006

Station collocation of closely placed multiple GEO spacecraft is required to avoid the problem of collision risk, attitude sensor interference and/or occultation. This paper presents the method of obtaining the orbit correction scheme for collocating two GEO spacecraft within a small station-keeping box. The relative motion of each spacecraft with respect to the virtual geostationary satellite is precisely expressed in terms of power and trigonometry functions. This closed-form orbit propagator is used to define the constraint conditions which meet the requirements for the station collocation. Finally, the technique of constrained optimization is used to find the orbit maneuver sequence. Nonlinear simulations are performed and their results are compared with those of the classical method.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.04a
• /
• pp.262-271
• /
• 1998

Recent, more and more steel deck bridges are adopted for the design of long span bridges and the upgrading of existing concrete deck bridges, mainly because of reduced self weight, higher stiffness and efficient erection compared to concrete decks. The main objective of this study is to propose on formulation of the design optimizations to develop an optimal desist program required for optimum desist for orthotropic steel-deck bridges. The objective function of the optimization is formulated as a minimum initial cost design problem. The behavior and design constraints are formulated based on the ASD and LRFD criteria of the Korean Bridge Design Code(1996). The optimum design program developed in this study consists of two steps. In the first step the system optimization of the steel box girder bridges is carried out. And in the second step the program provided the optimum design of the orthotropic steel-deck with close ribs. In the optimal design program the analysis module for the deck optimization is based on the Pelican Esslinger method. The optimizer module of the program utilizes the ADS(Automated Desist Synthesis) routines using the optimization techniques fuor constrained optimization. From the results of real application examples, The cost effectiveness of optimum orthotropic steel-deck bridges designs based on both ASD and LRFD methods is investigated by comparing the results with those of conventional designs, and it may be concluded that the design developed in this study seems efficient and robust for the optimization of orthotropic steel-deck bridges

• Structural Engineering and Mechanics
• /
• v.20 no.2
• /
• pp.161-172
• /
• 2005

This paper presents the section model for analysis of RC circular tower structures based on nonlinear material laws. The governing equations for normal strains due to the bending moment and the normal force are derived in the case when openings are located symmetrically in respect to the bending direction. In this approach the additional reinforcement at openings is also taken into account. The mathematical model is expressed in the form of a set of nonlinear equations which are solved by means of the minimization of the sums of the second powers of the residuals. For minimization the BFGS quasi-Newton and/or Hooke-Jeeves local minimizers suitably modified are applied to take into account the box constraints on variables. The model is verified on the set of data encountered in engineering practice. The numerical examples illustrate the effects of the loading eccentricity and size of the opening on the strains and stresses in concrete and steel in the cross-sections under consideration. Calculated results indicate that the additional reinforcement at the openings increases the resistance capacity of the section by several percent.

• Advances in aircraft and spacecraft science
• /
• v.7 no.4
• /
• pp.353-369
• /
• 2020

This paper presents the flutter analysis and optimum design of axially functionally graded box beam cantilever wing section by considering various geometric and material parameters. The coupled dynamic equations of the continuous model of wing system in terms of material and cross-sectional properties are formulated based on extended Hamilton's principle. By expressing the lift and pitching moment in terms of plunge and pitch displacements, the resultant two continuous equations are simplified using Galerkin's reduced order model. The flutter velocity is predicted from the solution of resultant damped eigenvalue problem. Parametric studies are conducted to know the effects of geometric factors such as taper ratio, thickness, sweep angle as well as material volume fractions and functional grading index on the flutter velocity. A generalized surrogate model is constructed by training the radial basis function network with the parametric data. The optimized material and geometric parameters of the section are predicted by solving the constrained optimal problem using firefly metaheuristics algorithm that employs the developed surrogate model for the function evaluations. The trapezoidal hollow box beam section design with axial functional grading concept is illustrated with combination of aluminium alloy and aluminium with silicon carbide particulates. A good improvement in flutter velocity is noticed by the optimization.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.680-688
• /
• 2001

In this paper, we propose a reliable method for searching the optimally performing generalized brain-state-in-a-box (GBSB) neural associative memory using an evolution program (EP) given a set of prototype patterns to be stored as stable equilibrium points. First, we exploit some qualitative guidelines necessary to synthesize the GBSB model. Next, we parameterize the solution space utilizing the limited number of parameters to represent the solution space. Then, we recast the synthesis of GBSB neural associative memories as two constrained optimization problems, which are equivalent to finding a solution to the original synthesis problem. Finally, we employ an evolution program (EP), which enables us to find an optimal set of parameters related to the size of domains of attraction (DOA) for prototype patterns. The validity of this approach is illustrated by a design example and computer simulations.