• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1296-1299
• /
• 1996

This paper proposes a design automation method for the flight control system of an aircraft based on optimization. The control system design problem which has many specifications is formulated as multi-objective optimization problem. The solution of this optimization problem should be considered in terms of Pareto-optimality. In this paper, we use an evolutionary algorithm providing numerous Pareto-optimal solutions. These solutions are given to a control system designer and the most suitable solution is selected. This method decreases tasks required to determine the control parameters satisfying all specifications. The design automation of a flight control system is illustrated through an example.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1998년도 봄 학술발표회 논문집
• /
• pp.245-253
• /
• 1998

Recently, the importance of multi-objective optimization techniques and stochastic search methods is increasing. The stochastic search methods have the concepts of the survival of the fittest and natural selection such as genetic algorithms(GA), simulated annealing(SA) and evolution strategies (ES). As many accidents of oil tankers cause marine pollution, oil tankers of double hull or mid deck structure are being built to minimize the marine pollution. For the improvement of oil tanker design technique, an efficient optimization technique is proposed in this study. Multi-objective optimization problem of weight and cost of double hull and mid deck tanker is formulated. Discrete design variables are used considering real manufacturing, and the concept of relative production cost is also introduced. The ES method is used as an optimization technique, and the ES algorithm was developed to generate a more efficient Pareto optimal set.

• Journal of Electrical Engineering and Technology
• /
• 제4권4호
• /
• pp.467-475
• /
• 2009

Congestion management is one of the technical challenges in power system deregulation. This paper presents single objective and multi-objective optimization approaches for optimal choice, location and size of Static Var Compensators (SVC) and Thyristor Controlled Series Capacitors (TCSC) in deregulated power system to improve branch loading (minimize congestion), improve voltage stability and reduce line losses. Though FACTS controllers offer many advantages, their installation cost is very high. Hence Independent System Operator (ISO) has to locate them optimally to satisfy a desired objective. This paper presents optimal location of FACTS controllers considering branch loading (BL), voltage stability (VS) and loss minimization (LM) as objectives at once using GA. It is observed that the locations that are most favorable with respect to one objective are not suitable locations with respect to other two objectives. Later these competing objectives are optimized simultaneously considering two and three objectives at a time using multi-objective Strength Pareto Evolutionary Algorithms (SPEA). The developed algorithms are tested on IEEE 30 bus system. Various cases like i) uniform line loading ii) line outage iii) bilateral and multilateral transactions between source and sink nodes have been considered to create congestion in the system. The developed algorithms show effective locations for all the cases considered for both single and multiobjective optimization studies.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1994년도 추계학술발표회 및 정기총회
• /
• pp.1-2
• /
• 1994

With the prevalence of computers in modern organizations, simulation is receiving more atention as an effectvie decision -making tool. Simualtion is a computer-based numerical technique which uses mathmatical and logical models to approximate the behaviror of a real-world system. However, iptimization of synamic stochastic systems often defy analytical and algorithmic soluions. Although a simulation approach is often free fo the liminting assumption s of mathematical modeling, cost and time consiceration s make simulation the henayst's last resort. Therefore, whenever possible, analytical and algorithmica solutions are favored over simulation. This paper discussed the issues and procedrues for using simulation as a tool for optimization of stochastic complex systems that are dmodeled by computer simulation . Its emphasis is mostly on issues that are speicific to simulation optimization instead of consentrating on the general optimizationand mathematical programming techniques . A simulation optimization problem is an optimization problem where the objective function. constraints, or both are response that can only be evauated by computer simulation. As such, these functions are only implicit functions of decision parameters of the system, and often stochastic in nature as well. Most of optimization techniqes can be classified as single or multiple-resoneses techniques . The optimization of single response functins has been researched extensively and consists of many techniques. In the single response category, these strategies are gradient based search techniques, stochastic approximate techniques, response surface techniques, and heuristic search techniques. In the multiple response categroy, there are basically five distinct strategies for treating the responses and finding the optimum solution. These strategies are graphica techniqes, direct search techniques, constrained optimization techniques, unconstrained optimization techniques, and goal programming techniques. The choice of theprocedreu to employ in simulation optimization depends on the analyst and the problem to be solved. For many practival and industrial optimization problems where some or all of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computersimulation is one of the most effective means of studying such complex systems. In this paper, after discussion of simulation optmization techniques, the applications of above techniques will be presented in the modeling process of many flexible manufacturing systems.

• Management Science and Financial Engineering
• /
• 제3권1호
• /
• pp.75-88
• /
• 1997

Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness.

• 산업경영시스템학회지
• /
• 제45권4호
• /
• pp.109-117
• /
• 2022

Most of real-world decision-making processes are used to optimize problems with many objectives of conflicting. Since the betterment of some objectives requires the sacrifice of other objectives, different objectives may not be optimized simultaneously. Consequently, Pareto solution can be considered as candidates of a solution with respect to a multi-objective optimization (MOP). Such problem involves two main procedures: finding Pareto solutions and choosing one solution among them. So-called multi-objective genetic algorithms have been proved to be effective for finding many Pareto solutions. In this study, we suggest a fitness evaluation method based on the achievement level up to the target value to improve the solution search performance by the multi-objective genetic algorithm. Using numerical examples and benchmark problems, we compare the proposed method, which considers the achievement level, with conventional Pareto ranking methods. Based on the comparison, it is verified that the proposed method can generate a highly convergent and diverse solution set. Most of the existing multi-objective genetic algorithms mainly focus on finding solutions, however the ultimate aim of MOP is not to find the entire set of Pareto solutions, but to choose one solution among many obtained solutions. We further propose an interactive decision-making process based on a visualized trade-off analysis that incorporates the satisfaction of the decision maker. The findings of the study will serve as a reference to build a multi-objective decision-making support system.

• 청정기술
• /
• 제7권2호
• /
• pp.99-107
• /
• 2001

Optimization methodologies have been proposed of find the best environment-friendly recycling pathways of plastic materials based on life-cycle assessment (LCA) methodology. The main difficulty in conducting this optimization study is that multiple environmental burdens have to be considered simultaneously as the cost functions. Instead of generating conservative Pareto or noninferior solutions following multi-objective optimization approaches, we have proposed some practical criteria on how to combine the different environmental burdens into a single measure. The obtained single objective optimization problem can then be solved by conventional nonlinear programming techniques or, more effectively, by a tree search method based on decision flows. The latter method reduces multi-dimensional optimization problems to a set of one-dimensional problems in series. It is expected the suggested tree search approach can be applied to many LCA studies as a new promising optimization tool.

• Geomechanics and Engineering
• /
• 제10권6호
• /
• pp.709-726
• /
• 2016

Corrugated-core sandwich panels are prevalent for many applications in industries. The researches performed with the aim of optimization of such structures in the literature have considered a deterministic approach. However, it is believed that deterministic optimum points may lead to high-risk designs instead of optimum ones. In this paper, an effort has been made to provide a reliable and robust design of corrugated-core sandwich structures through stochastic and probabilistic multi-objective optimization approach. The optimization is performed using a coupling between genetic algorithm (GA), Monte Carlo simulation (MCS) and finite element method (FEM). To this aim, Prob. Design module in ANSYS is employed and using a coupling between optimization codes in MATLAB and ANSYS, a connection has been made between numerical results and optimization process. Results in both cases of deterministic and probabilistic multi-objective optimizations are illustrated and compared together to gain a better understanding of the best sandwich panel design by taking into account reliability and robustness. Comparison of results with a similar deterministic optimization study demonstrated better reliability and robustness of optimum point of this study.

• 한국시뮬레이션학회논문지
• /
• 제6권1호
• /
• pp.71-84
• /
• 1997

For many optimization problems where some of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computer simulation is one of the most effective means of studying such complex systems. Many, if not most, simulation optimization problems have multiple aspects. Historically, multiple aspects have been combined ad hoc to form a scalar objective function, usually through a linear combination (weighted sum) of the multiple attributes, or by turning objectives into constraints. The genetic algorithm (GA), however, is readily modified to deal with multiple aspects. In this paper we propose a MAGA (Multiple Aspects-based Genetic Algorithm) as an algorithm for finding the Pareto optimal set. We demonstrate its ability to find and maintain a diverse "Pareto optimal population" on two problems.

• 대한수학회보
• /
• 제30권1호
• /
• pp.1-7
• /
• 1993

Vector optimization problems consist of two or more objective functions and constraints. Optimization entails obtaining efficient solutions. Geoffrion [3] introduced the definition of the properly efficient solution in order to eliminate efficient solutions causing unbounded trade-offs between objective functions. In 1974, Isermann [7] obtained a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with linear constraints and showed that every efficient solution is a properly efficient solution. Since then, many authors [1, 2, 4, 5, 6] have extended the Isermann's results. In particular, Gulati and Islam [4] derived a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with nonlinear constraints, under certain assumptions. In this paper, we consider the following nonlinear vector optimization problem (NVOP): (Fig.) where for each i, f$_{i}$ is a differentiable function from R$^{n}$ into R and g is a differentiable function from R$^{n}$ into R$^{m}$ .