• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국제학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.772-776
• /
• 1988

In quantized control systems, the control values can take only given discrete (e.g. integer) values. In case of dealing with the control problem on the discrete-time, final-stage fixed, quantized control systems with multidimensional performance functions, the first thing, new definition on noninferior solutions in these systems is necessary because of their discreteness in state variables, and the efficient search for those solutions at final-stage is unavoidable for seeking their discrete-time optimal controls to these systems. In this paper, to the quantized control problem given by the formulation of Halkin-typed linear control systems with two performance functions, a new definition on noninferior solutions of this system control problem and a heuristic effective search on these noninferior solutions are stated. By use of these concepts, two definitions on noninferior solutions and the algorithm consisted of 8 steps and attained by geometric approaches are given. And a numerical example using the present algorithm is shown.

• Steel and Composite Structures
• /
• 제44권5호
• /
• pp.603-617
• /
• 2022

Structural design, in general, is developed through trial and error technique which is guided by standards criteria and based on the intuition and experience of the engineer, a context that leads to structural over-dimensioning, with uneconomic solutions. Aiming to find the optimal design, structural optimization methods have been developed to find a balance between cost, structural safety, and material performance. These methods have become a great opportunity in the steel structural engineering domain since they have as their main purpose is weight minimization, a factor directly correlated to the real cost of the structure. Assuming an objective function of minimum weight with stress and displacement constraints provided by Brazilian standards, the present research proposes the sizing optimization and combined approach of sizing and shape optimization, through a software developed to implement the Simulated Annealing metaheuristic algorithm. Therefore, two steel plane frame layouts, each admitting four typical truss geometries, were proposed in order to expose the difference between the optimal solutions. The assessment of the optimal solutions indicates a notable weight reduction, especially in sizing and shape optimization combination, in which the quantity of design variables is increased along with the search space, improving the efficiency of the optimal solutions achieved.

• KIEE International Transactions on Power Engineering
• /
• 제5A권4호
• /
• pp.412-415
• /
• 2005

The recent requirement for faster and more frequent solutions has encouraged the consideration of parallel implementations using decentralized processors. Distributed multi-processor environments can potentially greatly increase the available computational capacity and decrease the communication burden, allowing for faster Optimal Power Flow (OPF) solutions. This paper presents a mathematical approach to implementing distributed OPF using the alternating direction method (ADM) to parallelize the OPF. Several IEEE Reliability Test Systems were adopted to demonstrate the proposed algorithm.

• Journal of the Korean Statistical Society
• /
• 제14권1호
• /
• pp.18-28
• /
• 1985

Optimal screening procedures for improving outgoing product quality based on correlated normal variables are presented. The performance variable and the screening variables are assumed to be jointly normally distributed. These procedures do not require specialized tables, and closed-form solutions are obtained for the case of one-sided specification. Methods for finding optimal solutions for the case of two-sided specifications are also considered.

• 한국생산제조학회지
• /
• 제24권3호
• /
• pp.302-307
• /
• 2015

The automobile is an important means of transportation. For this reason, the automotive wheel is also an important component in the automotive industry because it acts as a load support and is closely related to safety. Thus, the wheel design is a very important safety aspect. In this paper, an optimal design for minimizing automotive wheel stress and increasing wheel safety is described. To study the optimal design, a central composite design (CCD) and D-optimal design theory are applied, and the approximate function using the response surface method (RSM) is generated. The optimal solutions using the non-dominant sorting genetic algorithm (NSGA-II) are then derived. Comparing CCD and D-optimal solution accuracy and verified the CCD can deduce more accuracy optimal solutions.

• 정보기술과데이타베이스저널
• /
• 제6권2호
• /
• pp.71-86
• /
• 1999

The performance of relational database is measured by the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to vertically partition relations into fragments and to allow attribute replication to reduce the number of disk accesses. To reduce the computational time, heuristic search method using genetic algorithm is used. Genetic algorithm used employs a rank-based-sharing fitness function and elitism. Desirable parameters of genetic algorithm are obtained through experiments and used to find the solutions. Solutions of attribute replication and attribute non-replication problems are compared. Optimal solutions obtained by branch and bound method and by heuristic solutions(genetic algorithm) are also discussed. The solution method proposed is able to solve large-sized problems within acceptable time limit and shows solutions near the optimal value.

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.77-91
• /
• 2007

In this paper, we present a symbiotic evolutionary algorithm for multi-objective optimization. The goal in multi-objective evolutionary algorithms (MOEAs) is to find a set of well-distributed solutions close to the true Pareto optimal solutions. Most of the existing MOEAs operate one population that consists of individuals representing the entire solution to the problem. The proposed algorithm has a two-leveled structure. The structure is intended to improve the capability of searching diverse and food solutions. At the lower level there exist several populations, each of which represents a partial solution to the entire problem, and at the upper level there is one population whose individuals represent the entire solutions to the problem. The parallel search with partial solutions at the lower level and the Integrated search with entire solutions at the upper level are carried out simultaneously. The performance of the proposed algorithm is compared with those of the existing algorithms in terms of convergence and diversity. The optimization problems with continuous variables and discrete variables are used as test-bed problems. The experimental results confirm the effectiveness of the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제13권2호
• /
• pp.704-710
• /
• 2018

For the optimal design of electromagnetic device involving uncertainties in design variables, this paper proposes a new reliability-based optimal design algorithm for multiple constraints problems. Through optimizing the nominal objective function and maximizing the minimum reliability, a set of global optimal reliable solutions representing different reliability levels are obtained by the multi-objective particle swarm optimization algorithm. Applying the sensitivity-assisted Monte Carlo simulation method, the numerical efficiency of optimization procedure is guaranteed. The proposed reliability-based algorithm supplying multi-reliable solutions is investigated through applications to analytic examples and the optimal design of two electromagnetic problems.

• 한국국방경영분석학회지
• /
• 제24권2호
• /
• pp.117-129
• /
• 1998

This study is concerned with developing a heuristic for a web-based vehicle routing problem using mixed genetic algorithm(VRPMGA) which determines each vehicle route in order to minimize the transportation costs, subject to meeting the demands of all delivery points. VRP is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a mixed genetic algorithm by partitioned strategy which can give a good solution in comparatively brief time. The good features of the VRPMGA are, fristly, the ability of early convergence and, secondly, the capability of producing multiple, alternative, and near-optimal solutions. The VRPMGA is a useful algorithm that can be appliable to VRP and TSP. Finally, the computational test were performed using the benchmark problems and the proposed heuristic is compared with the other existing algorithms (COSA). The result of computational tests shows that proposed heuristic gives good solutions, in much shorter time, which are same as the best known solutions in the pervious research.

• Management Science and Financial Engineering
• /
• 제18권2호
• /
• pp.5-11
• /
• 2012

In this paper, stochastic scheduling problems are considered when processing times and due dates follow arbitrary distributions and due dates are either common or exchangeable. For maximizing the expected number of early jobs, two policies, one, based on pairwise comparisons of the processing times, and the other, based on survivabilities, are introduced. In addition, it is shown that the former guarantees optimal solutions when the processing times and due dates are deterministic and that the latter guarantees optimal solutions when the due dates follow exponential distributions. Then a new approach, exploiting the two policies, is proposed and analyzed which turns out to give better job sequences in many situations. In fact, the new approach guarantees optimal solutions both when the processing times and due dates are deterministic and when the due dates follow exponential distributions.