• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.565-569
• /
• 1993

In this paper, a specified number of actuators are selected from a given set of admissible actuators. The selected set of actuators is likely to use minimum control energy while required output variance constraints are guaranteed to be satisfied. The actuator selection procedure is an iterative algorithm composed of two parts; an output variance constrained control and an input variance constrained control algorithm. The idea behind this algorithm is that the solution to the first control problem provides the necessary weighting matrix in the objective function of the second optimization problem, and the sensitivity information from the second problem is utilized to delete one actuator. For variance constrained control problems, by considering a dual version of each control problem an efficient algorithm is provided, whose convergence properties turn out to be better than an existing algorithm. Numerical examples with a simple beam are given for both the input/output variance constrained control problem and the actuator selection problem.

• Structural Engineering and Mechanics
• /
• v.75 no.4
• /
• pp.445-454
• /
• 2020

Structural damage identification (SDI) is a crucial step in structural health monitoring. However, some of the existing SDI methods cannot provide enough identification accuracy and efficiency in practice. A novel whale optimization algorithm (WOA) based method is proposed for SDI by weighting modal data and flexibility assurance criterion in this study. At first, the SDI problem is mathematically converted into a constrained optimization problem. Unlike traditional objective function defined using frequencies and mode shapes, a new objective function on the SDI problem is formulated by weighting both modal data and flexibility assurance criterion. Then, the WOA method, due to its good performance of fast convergence and global searching ability, is adopted to provide an accurate solution to the SDI problem, different predator mechanisms are formulated and their probability thresholds are selected. Finally, the performance of the proposed method is assessed by numerical simulations on a simply-supported beam and a 31-bar truss structures. For the given multiple structural damage conditions under environmental noises, the WOA-based SDI method can effectively locate structural damages and accurately estimate severities of damages. Compared with other optimization methods, such as particle swarm optimization and dragonfly algorithm, the proposed WOA-based method outperforms in accuracy and efficiency, which can provide a more effective and potential tool for the SDI problem.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.2
• /
• pp.161-167
• /
• 2000

In this paper, we propose a design method for BAMs(bidirectiona1 associative memories) which can perform the function of bidirectional association efficiently. Based on the theoretical investigation about the properties of BAMs, we first formulate the problem of finding a BAM that can store the given pattern pairs as stable states with high error correction ratio in the form of a constrained optimization problem. Next, we transform the constrained optimization problem into a GEVP(genera1ized eigenvalue problem), which can be solved by recently developed interior point methods. The applicability of the proposed method is illustrated via design examples.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.4
• /
• pp.408-414
• /
• 2011

The objective of this paper is to define local optimization algorithms (LOA) to solve Resource-Constrained Project Scheduling Problem (RCPSP) and analyze the performance of these algorithms. By representing solutions with activity list, three primitive LOAs, i.e. forward and backward improvement-based, exchange-based, and relocation-based LOAs are defined. Also, combined LOAs integrating two primitive LOAs are developed. From the experiments with standard test set J120 generated using ProGen, the FBI-based LOA demonstrates to be an efficient algorithm. Moreover, algorithms combined with FBI-based LOA and other LOA generate good solutions in general. Among the considered algorithms, the combined algorithm of FBI-based and exchangebased shows best performance in terms of solution quality and computation time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.1
• /
• pp.67-71
• /
• 2009

This paper presents a rank-constrained linear matrix inequality (LMI) approach to the design of a multi-objective controller such as $H_2/H_{\infty}$ control. Multi-objective control is formulated as an LMI optimization problem with a nonconvex rank condition, which is imposed on the controller gain matirx not Lyapunov matrices. With this rank-constrained formulation, we can expect to reduce conservatism because we can use separate Lyapunov matrices for different control objectives. An iterative penalty method is applied to solve this rank-constrained LMI optimization problem. Numerical experiments are performed to illustrate the proposed method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.179-189
• /
• 1994

A two-phase neural network finds exact feasible solutions for a constrained optimization programming problem. The time-varying programming neural network is a modified steepest-gradient algorithm which solves time-varying optimization problems. In this paper, we propose a time-varying two-phase optimization neural network which incorporates the merits of the two-phase neural network and the time-varying neural network. The proposed algorithm is applied to system identification and function approximation using a multi-layer perceptron. Particularly training of a multi-layer perceptrion is regarded as a time-varying optimization problem. Our algorithm can also be applied to the case where the weights are constrained. Simulation results prove the proposed algorithm is efficient for solving various optimization problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2889-2909
• /
• 2017

Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.355-356
• /
• 2005

The problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities is considered by Yager[Fuzzy Sets and Systems, 81(1996) 89-101]. He obtained how this problem can be modelled as a mixed integer linear programming problem. Recently, Carlsson et al. [Fuzzy Sets and Systems, 139(2003) 543-546] obtained a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem with a single constraint on the sum of all decision variables. In this note, we introduce anew approach to the same problem as Carlsson et al. considered. Indeed, it is a direct consequence of a known result of the linear programming problem.

• Journal of Distribution Science
• /
• v.15 no.2
• /
• pp.15-20
• /
• 2017

Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.739-748
• /
• 2007

The objective of this research study is to develop the permutation-based genetic algorithm for solving the resource-constrained project scheduling problem in construction engineering by incorporating elitism into genetic algorithm. A key aspect of the algorithm was the development of the elitist roulette selection operator to preserve the best individual solution for the next generation so the improved solution can be obtained. Another notable characteristic is the application of the parallel schedule generation scheme to generate a feasible solution to the problem. Case studies with a standard test problem were presented to demonstrate the performance and accuracy of the algorithm. The computational results indicate that the proposed algorithm produces reasonably good solutions for the resource-constrained project scheduling problem.