• Proceedings of the Korea Concrete Institute Conference
• /
• 2000.10a
• /
• pp.199-204
• /
• 2000

In this study, an optimum design algorithm using efficient reanalysis is proposed for seismic design of RC Piers. The proposed algorithm for optimization of RC Piers is based on efficient reanalysis technique. Considering structural behavior of RC Piers, several other approximation techniques, such as artificial constraint deletion is introduced to increase the efficiency of optimization. The efficiency and robustness of the proposed algorithm increase the proposed reanalysis technique is demonstrated by comparing it with a conventional optimization algorithm. A few of design examples are optimized to show the applicability of the proposed algorithm.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.471-477
• /
• 2005

This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.25 no.5
• /
• pp.361-368
• /
• 2015

This paper deals with a robust fine seek controller design problem with multiple constraints using a genetic algorithm. A robust $H\infty$ constraint is introduced to attenuate effectively velocity disturbance caused by the eccentric rotation of the disk. A weighting function is optimally selected based on the estimation of velocity disturbance and the estimated minimum velocity loop gain. A robust velocity loop constraint is considered to minimize the variances of the velocity loop gain and bandwidth against the uncertainties of fine actuator. Finally, a robust fine seek controller is obtained by solving a genetic algorithm with an LMI condition and an appropriate objective function. The proposed controller design method is applied to the fine seek control system of a DVD recording device and is evaluated through the experimental results.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.85-92
• /
• 2006

In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2003.09a
• /
• pp.217-221
• /
• 2003

Variation of decision variables for optimal remediation using the pump-and-treat method is examined to estimate the effect of the degree of concentration constraint. Simulation-optimization method using genetic algorithm is applied to minimize the total pumping volume. In total volume minimization strategy, the remediation time increases rapidly prior to significant increase in pumping rates. When the concentration constraint is set severer, the more wells are required and the well on the down-gradient direction from the plume hot-spot gives more efficient remediation performance than that on the hot-spot position. These results show that the more profitable strategy for remediation can be achieved by increasing the required remediation time than raising the pumping rate until the time reaches a certain limitation level. So, the remediation time has to be considered as one of the essential decision variables fer optimal remediation design.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.492-492
• /
• 2000

This paper proposes LQ optimal controller design method based on the modal decomposition. Here, the design problem of linear time-invariant systems is considered by using pencil model. The mathematical model based on matrix pencil is one of the most general representation of the system. By adding some conditions the model can be reduced to traditional system models. In pencil model, the state feedback is considered as an algebraic constraint between the state variable and the control input variable. The algebraic constraint on pencil model is called purely static mode, and is included in infinite mode. Therefore, the information of the constant gain controller is included in the purely static mode of the augmented system which consists of the plant and the control conditions. We pay attention to the coordinate transformation matrix, and LQ optimal controller is derived from the algebraic constraint of the internal variable. The proposed method is applied to the numerical examples, and the results are verified.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.4
• /
• pp.407-422
• /
• 2004

A new method for the design of predictive controllers for SISO systems is presented. The proposed technique allows uncertainties and constraints to be concluded in the design of the control law. The goal is to design, at each sample instant, a predictive feedback control law that minimizes a performance measure and guarantees of constraints are satisfied for a set of models that describes the system to be controlled. The predictive controller consists of a finite horizon parametric-optimization problem with an additional constraint over the manipulated variable behavior. This is an end-constraint based approach that ensures the exponential stability of the closed-loop system. The inclusion of this additional constraint, in the on-line optimization algorithm, enables robust stability properties to be demonstrated for the closed-loop system. This is the case even though constraints and disturbances are present. Finally, simulation results are presented using a nonlinear continuous stirred tank reactor model.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.77-83
• /
• 2008

In this paper, CPLD low power technology mapping for reuse module design under the time constraint is proposed. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed algorithm is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our using chaining and multi-cycling in the scheduling techniques. Low power circuit make using CPLD technology mapping algorithm for selection reuse module by scheduling.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.1
• /
• pp.133-146
• /
• 1994

Conditional constraints are frequently used to represent relations. To use these conditional constraints, it is necessary to develop an appropriate logic in which these conditional constraints can be represented and manipulated. Nevertheless, there has been little research that addresses interval-based conditional constraints. The proposed approach addresses the use of conditional constraints involving intervals in constraint networks. Two algorithms are presented: (1) a propagation algorithm for an interval-based conditional constraint, which is similar to one for an exact-value conditional constraint; (2) a propagation algorithm for interval-based conditional constraints which satisfy some conditions. The former can be applied to any conditional constraint. However, with the former algorithm, conditional constraints are usually categorized into the cases that they cannot be propagated. After investigating several methods in which most conditional constraints can be propagated, we propose the latter algorithm under certain condition that usually results in smaller resulting design space comparing to the former.

• Structural Engineering and Mechanics
• /
• v.5 no.5
• /
• pp.565-576
• /
• 1997

The material-based homogenization design method generates arbitrary topologies of initial structural design as well as reinforcement structural design by controlling the amount of material available. However, if a small volume constraint is specified in the design of Lightweight structures, thin and slender structures are usually obtained. For these structures stability becomes one of the most important requirements. Thus, to prevent overall buckling (that is, to increase stability), the objective of the design is to maximize the buckling load of a structure. In this paper, the buckling analysis is restricted to the linear buckling behavior of a structure. The global stability requirement is defined as a stiffness constraint, and determined by solving the eigenvalue problem. The optimality conditions to update the design variables are derived based on the sequential convex approximation method and the dual method. Illustrated examples are presented to validate the feasibility of this method in the design of structures.