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

• 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.

• Journal of Electrical Engineering and Technology
• /
• 제1권4호
• /
• pp.435-447
• /
• 2006

This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

• 한국콘텐츠학회논문지
• /
• 제15권7호
• /
• pp.21-29
• /
• 2015

본 논문은 목적이 네 개 이상인 고도 다목적 문제(many-objective problem)에서의 의사 결정을 위한 새로운 이중(two-tier) 최적화 접근법을 제안한다. 목적의 개수가 증가할수록, 특히 네 개 이상부터는, 전체해(solution) 중에서 파레도 최적해(Parero-optimal solution)가 차지하는 비율이 기하급수적으로 증가한다. 그래서 일반 다목적 문제와는 달리, 의사 결정을 하는데 단순히 파레토 최적 해만을 찾는 것으로는 충분하지 않고, 찾은 파레토 최적 해들 중에서도 상대적으로 좀 더 선호하는 해들을 가려내는 것이 필요하다. 제안하는 접근법에서는 추가적인 최적화 단계를 추가함으로써 사용자의 선호도를 균형있게 반영하는 방향으로 파레토 최적해들을 찾는다. 이러한 2차 최적화는 관련된 2차 목적들을 수반하게 되는데, 2차 목적으로는 광역평가값과 혼잡 거리를 사용하였다. 광역평가값과 혼잡 거리는 각각 사용자의 선호도와 다양성을 대변하는 척도이다. 제안한 접근법의 우수성을 보이기 위해서는 잘 알려진 검증 함수들을 활용하는데, 같은 함수에 대해 제안한 접근법을 적용한 경우와 적용하지 않은 경우의 결과를 비교한다. 제안한 접근법을 적용함으로써 기존보다 사용자의 선호도를 잘 반영하면서 동시에 우수하고 다양한 의사 선택이 가능하다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권11호
• /
• pp.3565-3583
• /
• 2022

The task scheduling problem has received a lot of attention in recent years as a crucial area for research in the cloud environment. However, due to the difference in objectives considered by service providers and users, it has become a major challenge to resolve the conflicting interests of service providers and users while both can still take into account their respective objectives. Therefore, the task scheduling problem as a bi-objective game problem is formulated first, and then a task scheduling model based on the bi-objective game (TSBOG) is constructed. In this model, energy consumption and resource utilization, which are of concern to the service provider, and cost and task completion rate, which are of concern to the user, are calculated simultaneously. Furthermore, a many-objective evolutionary algorithm based on a partitioned collaborative selection strategy (MaOEA-PCS) has been developed to solve the TSBOG. The MaOEA-PCS can find a balance between population convergence and diversity by partitioning the objective space and selecting the best converging individuals from each region into the next generation. To balance the players' multiple objectives, a crossover and mutation operator based on dynamic games is proposed and applied to MaPEA-PCS as a player's strategy update mechanism. Finally, through a series of experiments, not only the effectiveness of the model compared to a normal many-objective model is demonstrated, but also the performance of MaOEA-PCS and the validity of DGame.