• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.539-550
• /
• 2005

The spanning tree, which is being used the most widely in indoor wiring network, is chosen for the network topology of the optimal LAN design. To apply a spanning tree to GA, the concept of $Pr\ddot{u}fer$ numbers is used. $Pr\ddot{u}fer$ numbers can express he spanning tree in an efficient and brief way, and also can properly represent the characteristics of spanning trees. This paper uses Pareto Stratum-Niche Cubicle(PS-NC) GA by complementing the defect of the same priority allowance in non-dominated solutions of pareto genetic algorithm(PGA). By applying the PS-NC GA to the LAN design areas, the optimal LAN topology design in terms of minimizing both message delay time and connection-cost could be accomplished in a relatively short time. Numerical analysis has been done for a hypothetical data set. The results show that the proposed algorithm could provide better or good solutions for the multi-objective LAN design problem in a fairly short time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• 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.

• Structural Engineering and Mechanics
• /
• v.68 no.5
• /
• pp.633-638
• /
• 2018

One of the important problems in the vehicle design is vehicle handling and stability. Effective parameters which should be considered in the vehicle handling and stability are roll angle, camber angle and scrub radius. In this paper, a planar vehicle model is considered that two right and left suspensions are double wishbone suspension system. For a better analysis of the suspension geometry, a kinestatic model of vehicle is considered which instantaneous kinematic and statics relations are analyzed simultaneously. In this model, suspension geometry is considered completely. In order to optimum design of double wishbones suspension system, a multi-objective genetic algorithm is applied. Three important parameters of suspension including roll angle, camber angle and scrub radius are taken into account as objective functions. Coordinates of suspension hard points are design variables of optimization which optimum values of them, corresponding to each optimum point, are obtained in the optimization process. Pareto solutions for three objective functions are derived. There are important optimum points in these Pareto solutions which each point represents an optimum status in the model. In other words, corresponding to any optimal point, a specific geometric position is determined for the suspension hard points. Each of the obtained points in the Pareto optimization can be selected for a special design purpose by designer to create an optimum condition in the vehicle handling and stability.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2246-2251
• /
• 2003

This paper proposes shape design of frame structures for vibration suppression and weight reduction. The $H_{\infty}$ norm of the transfer function from disturbance sources to the output points where vibration should be suppressed, is adopted as the performance index to represent the magnitude of vibration transfer. The design parameters are the node positions of the frame structure, on which constraints are imposed so that the structure achieves given tasks. For computation of Pareto optimal solutions to the two-objective design problem, a number of linear combinations of the $H_{\infty}$ norm and the total weight of the structure are considered and minimized. For minimization of the scalared objective function, a Lagrange function is defined by the objective function and the imposed constraints on the design parameters. The solution for which the Lagrange function satisfies the Karush-Kuhn-Tucker condition, is searched by the sequential quadratic programming (SQP) method. Numerical examples are presented to demonstrate the effectiveness of the proposed design method.

• The KSFM Journal of Fluid Machinery
• /
• v.14 no.5
• /
• pp.31-38
• /
• 2011

Optimization using a hybrid multi-objective evolutionary algorithm coupled with response surface approximation has been performed to improve the performance of a transonic axial compressor with circumferential casing grooves. In order to optimize the operating stability and peak adiabatic efficiency of the compressor with circumferential casing grooves, tip clearance, angle distribution at blade tip and the depth of the circumferential casing grooves are selected as design variables. Three-dimensional Reynolds-averaged Navier-Stokes equations with the shear stress transport turbulence model are discretized by finite volume approximations. The trade-off between two objectives with the interaction of blade and casing treatment is determined and discussed with respect to the representative clusters in the Pareto-optimal solutions compared to the axial compressor without the casing treatment.

• IE interfaces
• /
• v.24 no.3
• /
• pp.220-230
• /
• 2011

The multi-reservoir operation problem for efficient utilization of water resources involves conflicting objectives, and the problem can be solved by varying weight coefficient on objective functions. Accordingly, decision makers need to choose appropriate weight coefficients balancing the trade-offs among multiple objectives. Although the appropriateness of the weight coefficients may depend on the total amount of water inflow, reservoir operating policy may not be changed to a certain degree for different hydrological conditions on inflow. Therefore, we propose to use fuzzy Data Envelopment Analysis (DEA) to rank the weight coefficients in consideration of the inflow variation. In this approach, we generate a set of Paretooptimal solutions by applying different weight coefficients on Coordinated Multi-reservoir Operating Model. Then, we rank the Pareto-optimal solutions or the corresponding weight coefficients by using Fuzzy DEA model. With the proposed approach, we can suggest the best weight coefficients that can produce the appropriate Pareto-optimal solution considering the uncertainty of inflow, whereas the general DEA model cannot pinpoint the best weight coefficients.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.2
• /
• pp.247-255
• /
• 2004

The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjective Optimization Problems (MOPs). Though this approach was further developed leading to numerous applications, these applications are based on Pareto ranking and employ the use of the fitness sharing function to maintain diversity. Another scheme for solving MOPs has been presented by J. Nash to solve MOPs originated from Game Theory and Economics. Sefrioui introduced the Nash Genetic Algorithm in 1998. This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm. First, we will investigate the validity of our co-evolutionary approach to solve MOPs. That is, we will demonstrate how the evolutionary game can be embodied using co-evolutionary algorithms and also confirm whether it can reach the optimal equilibrium point of a MOP. Second, we will evaluate the effectiveness of our approach, comparing it with other methods through rigorous experiments on several MOPs.

• Management Science and Financial Engineering
• /
• v.3 no.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.

• IE interfaces
• /
• v.20 no.4
• /
• pp.504-514
• /
• 2007

The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.1
• /
• pp.70-78
• /
• 2010

Elitist nondominated sorting genetic algorithm (NSGA-II) is adopted and improved for multiobjective optimal reactive power flow (ORPF) problem. Multiobjective ORPF, formulated as a multiobjective mixed integer nonlinear optimization problem, minimizes real power loss and improves voltage profile of power grid by determining reactive power control variables. NSGA-II-based ORPF is tested on standard IEEE 30-bus test system and compared with four other state-of-the-art multiobjective evolutionary algorithms (MOEAs). Pareto front and outer solutions achieved by the five MOEAs are analyzed and compared. NSGA-II obtains the best control strategy for ORPF, but it suffers from the lower convergence speed at the early stage of the optimization. Several problem-specific local search strategies (LSSs) are incorporated into NSGA-II to promote algorithm's exploiting capability and then to speed up its convergence. This enhanced version of NSGA-II (ENSGA) is examined on IEEE 30 system. Experimental results show that the use of LSSs clearly improved the performance of NSGA-II. ENSGA shows the best search efficiency and is proved to be one of the efficient potential candidates in solving reactive power optimization in the real-time operation systems.