• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.10a
• /
• pp.17-24
• /
• 1995

This work proposes an optimality criteria applicable to the optimum design of plane frames. Stress constraints as well as displacement constraints are treated as behavioural constraints and thus the first order approximation of stress constraints is adopted. The design space of practical reinforced concrete frames with discrete design variables has been found to have many local minima, and thus it is desirable to find in advance the mathematical minimum, hopefully global, prior to starting to search a practical optimum design. By using the mathematical minimum as a trial design of any search algorithm, we may not full into a local minimum but apparently costly design. Therefore this work aims at establishing a mathematically rigorous method ⑴ by adopting first-order approximation of constraints, ⑵ by reducing the design space whenever minimum size restrictions become "active" and ⑶ by the of Newton-Raphson Method.

• English Language & Literature Teaching
• /
• v.16 no.3
• /
• pp.35-57
• /
• 2010

This study focuses on how prosodically and morphologically based OT constraints are implemented in voicing and place assimilations in English. It is revealed that prosodically based ID-ONS(V) applies to both assimilations except for assimilations occurring with irregular inflection morphemes. Morphologically based meta-constraint ranking, however, plays a role only in progressive voicing assimilation with regular inflection morphemes and regressive place assimilation with complex words. Thus, prosodically and morphologically based constraints are differently implemented in assimilation processes in English. The study shows that general faithfulness constraints should be decomposed into more specified constraints. It is also revealed that the general direction of assimilation is regressive in English and it might be reversed if morphological facts are involved in the process (Lombardi, 2001).

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.230-233
• /
• 1987

This paper addresses the identification of various constraints in time-varying obstacle avoidance for mechanical manipulators. The manipulator constraints include the smoothness constraint and torque constraint, while the environmental constraints include a motion priority, a traveling time constraint, a path constraint, and a collision constraint. The inherent difficulties in combining these constraints are discussed with a suggestion for the purpose of time-varying obstacle avoidance.

• Journal of Mechanical Science and Technology
• /
• v.20 no.6
• /
• pp.770-781
• /
• 2006

This paper defined design constraints for the compound CVTs (continuously variable trans-missions) by combining power-circulation-mode CVTs and power-split-mode CVTs, which were proposed for connecting 2K-H I-type differential gear to V-belt-type CVU (Continuously Variable Unit). The design constraints are the necessary and sufficient conditions to avoid geometrical interferences among elements in the compound CVTs, and to guarantee smooth assembly between the power-circulation-mode CVT and power-split-mode CVT Two com-pound CVTs were designed and manufactured in accordance with the design constraints. With these compound CVTs, theoretical analysis and performance experiments were conducted. The results showed that the design constraints were valid and effective design method, and that the designed compound CVTs had the improved performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.60.1-60
• /
• 2001

In recent years, distributed control systems(DCS) using fieldbus such as CAN have been being applied to process systems but it is very difficult to design the DCS in order to guarantee the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of ...

• Steel and Composite Structures
• /
• v.19 no.2
• /
• pp.503-519
• /
• 2015

This paper presents an optimization process using Genetic Algorithm (GA) for minimum weight by selecting suitable standard sections from a specified list taken from American Institute of Steel Construction (AISC). The stress constraints obeying AISC-LRFD (American Institute of Steel Construction-Load and Resistance Factor Design), lateral displacement constraints being the top and inter-storey drift, mid-span deflection constraints for the beams and geometric constraints are considered for optimum design by using GA that mimics biological processes. Optimum designs for three different space frames taken from the literature are carried out first without considering concrete slab effects in finite element analyses for the constraints above and the results are compared with the ones available in literature. The same optimization procedures are then repeated for the case of space frames with composite (steel and concrete) beams. A program is coded in MATLAB for the optimization processes. Results obtained in the study showed that consideration of the contribution of the concrete on the behavior of the floor beams results with less steel weight and ends up with more economical designs.

• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.35 no.10
• /
• pp.135-142
• /
• 2019

Ant colony optimization(ACO) technique is utilized in truss size optimization with frequency constraints. Total weight of truss to be minimized is considered as the objective function and multiple natural frequencies are adopted as constraints. The modified traveling salesman problem(TSP) is adopted and total length of the TSP tour is interpreted as the weight of the structure. The present ACO-based design optimization procedure uses discrete design variables and the penalty function is introduced to enforce design constraints during optimization process. Three numerical examples are carried out to verify the capability of ACO in truss optimization with frequency constraints. From numerical results, the present ACO is a very effective way of finding optimum design of truss structures in free vibration. Finally, we provide the present numerical results as future reference solutions.

• Journal of Mechanical Science and Technology
• /
• v.18 no.10
• /
• pp.1722-1729
• /
• 2004

This paper presents a design methodology for determining configurations of slider air bearings considering the randomness of the air-bearing surface (ABS) geometry by using the iSIGHT. A reliability-based design optimization (RBDO) problem is formulated to minimize the variations in the mean values of the flying heights from a target value while satisfying the desired probabilistic constraints keeping the pitch and roll angles within a suitable range. The reliability analysis is employed to estimate how the fabrication tolerances of individual slider parameters affect the final flying attitude tolerances. The proposed approach first solves the deterministic optimization problem. Then, beginning with this solution, the RBDO is continued with the reliability constraints affected by the random variables. Reliability constraints overriding the constraints of the deterministic optimization attempt to drive the design to a reliability solution with minimum increase in the objective. The simulation results of the RBDO are listed in comparison with the values of the initial design and the results of the deterministic optimization, respectively. To show the effectiveness of the proposed approach, the reliability analyses are simply carried out by using the mean value first-order second-moment (MVFO) method. The Monte Carlo simulation of the RBDO's results is also performed to estimate the efficiency of the proposed approach. Those results are demonstrated to satisfy all the desired probabilistic constraints, where the target reliability level for constraints is defined as 0.8.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.105-116
• /
• 2018

In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.175-185
• /
• 2005

The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.