• Title/Summary/Keyword: Pareto Optimal Solution

Search Result 95, Processing Time 0.028 seconds

Multi-Objective Micro-Genetic Algorithm for Multicast Routing (멀티캐스트 라우팅을 위한 다목적 마이크로-유전자 알고리즘)

  • Jun, Sung-Hwa;Han, Chi-Geun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.916-918
    • /
    • 2005
  • 다목적 최적화 문제의 목표는 다양한 파레토 최적해(Pareto Optimal Solution)을 찾는데 있으며, 마이크로-유전자 알고리즘(Micro-Genetic Algorithm)은 단순 유전자 알고리즘(Simple Genetic Algorithm)에 비해 소수의 유전자들만을 선별하여 진화시키는 방식으로 효율성을 극대화시킨다. 본 논문에서는 다양한 목적을 동시에 최적화하는 다목적 멀티캐스트 라우팅 문제를 해결하기 위해서 다목적 유전자 알고리즘과 마이크로-유전자 알고리즘을 결합한 다목적 마이크로-유전자 알고리즘을 적용하였다.

  • PDF

Multiple Objective Genetic Algorithms for Multicast Routing with Multi-objective QoS (다수의 QoS 갖는 멀티캐스트 라우팅을 위한 다목적 유전자 알고리즘)

  • 이윤구;한치근
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.511-513
    • /
    • 2003
  • 멀티미디어 서비스의 증가로 다양한 QoS(Quality of Service) 파라미터를 보장하는 멀티캐스트 라우팅 알고리즘이 필요하게 되었다. 이러한 멀티캐스트 라우팅에서 고려해야 하는 각각의 QoS 파리미터와 비용과의 관계는 Trade-off 관계에 있으며, 이들을 동시에 최적화하는 멀티캐스트 라우팅 문제는 다목적 최적화 문제(Multi-Objective Optimization Problem: MOOP)에 속하는 어려운 문제이다. 다목적 최적화 문제의 목표는 다양한 파레토 최적해(Pareto Optimal Solution)를 찾는데 있으며, 이를 해결하기 위해서 본 논문에서는 다목적 유전자 알고리즘(Multiple Objective Genetic Algorithms: MOGA)을 적용하였다.

  • PDF

Topology Optimization of a Vehicle's Hood Considering Static Stiffness (자동차 후드의 정강성을 고려한 위상 최적화)

  • Han, Seog-Young;Choi, Sang-Hyuk;Park, Jae-Yong;Hwang, Joon-Seong;Kim, Min-Sue
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.16 no.1
    • /
    • pp.69-74
    • /
    • 2007
  • Topology optimization of the inner reinforcement for a vehicle's hood has been performed by evolutionary structural optimization(ESO) using a smoothing scheme. The purpose of this study is to obtain optimal topology of the inner reinforcement for a vehicle's hood considering the static stiffness of bending and torsion simultaneously. To do this, the multiobjective optimization technique was implemented. Optimal topologies were obtained by the ESO method. From several combinations of weighting factors, a Pareto-optimal solution was obtained. Also, a smoothing scheme was implemented to suppress the checkerboard pattern in the procedure of topology optimization. It is concluded that ESO method with a smoothing scheme is effectively applied to topology optimization of the inner reinforcement of a vehicle's hood considering the static stiffness of bending and torsion.

Design of an Optimal Controller with Neural Networks for Nonminimum Phase Systems (신경 회로망을 이용한 비최소 위상 시스템의 최적 제어기 설계)

  • 박상봉;박철훈
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.6
    • /
    • pp.56-66
    • /
    • 1998
  • This paper investigates a neuro-controller combined in parallel with a conventional linear controller of PID type in order to control nonminimum phase systems more efficiently. The objective is to minimize overall position errors as well as to maintain small undershooting. A costfunction is proposed with two conflict objectives. The neuro-controller is trained off-line with evolutionary programming(EP) in such a way that it becomes optimal by minimizing the given cost function through global evaluation based on desired control performance during the whole training time interval. However, it is not easy to find an optimal solution which satisfies individual objective simultaneously. With the concept of Pareto optimality and EP, we train the proposed controller more effectively and obtain a valuable set of optimal solutions. Simulation results show the efficacy of the proposed controller in a viewpoint of improvement of performance of a step response like fast settling time and small undershoot or overshoot compared with that of a conventional linear controller.

  • PDF

Multiobjective Design Optimization of Brushless DC Motor (브러시리스 직류전동기의 다목적 최적설계)

  • 전연도;약미진치;이주;오재응
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.53 no.5
    • /
    • pp.325-331
    • /
    • 2004
  • The multiobjective optimization (MO) problem usually includes the conflicting objectives and the use of conventional optimization algorithms for MO problem does not so good approach to obtain an effective optimal solution. In this paper, genetic algorithm (GA) as an effective method is used to solve such MO problem of brushless DC motor (BLDCM). 3D equivalent magnetic circuit network (EMCN) method which enables us to reduce the computational burden is also used to consider the 3D structure of BLDCM. In order to effectively obtain a set of Pareto optimal solutions in MO problem, ranking method proposed by Fonseca is applied. The objective functions are decrease of cogging torque and increase of torque respectively. The airgap length, teeth width and magnetization angle of PM are selected for the design variables. The experimental results are also shown to confirm the validity of the optimization results.

Optimizing Concurrent Spare Parts Inventory Levels for Warships Under Dynamic Conditions

  • Moon, Seongmin;Lee, Jinho
    • Industrial Engineering and Management Systems
    • /
    • v.16 no.1
    • /
    • pp.52-63
    • /
    • 2017
  • The inventory level of concurrent spare parts (CSP) has a significant impact on the availability of a weapon system. A failure rate function might be of particular importance in deciding the CSP inventory level. We developed a CSP optimization model which provides a compromise between purchase costs and shortage costs on the basis of the Weibull and the exponential failure rate functions, assuming that a failure occurs according to the (non-) homogeneous Poisson process. Computational experiments using the data obtained from the Korean Navy identified that, throughout the initial provisioning period, the optimization model using the exponential failure rate tended to overestimate the optimal CSP level, leading to higher purchase costs than the one using the Weibull failure rate. A Pareto optimality was conducted to find an optimal combination of these two failure rate functions as input parameters to the model, and this provides a practical solution for logistics managers.

A Game Theoretic Cross-Layer Design for Resource Allocation in Heterogeneous OFDMA Networks

  • Zarakovitis, Charilaos C.;Nikolaros, Ilias G.;Ni, Qiang
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.1
    • /
    • pp.50-64
    • /
    • 2012
  • Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

  • PDF

Multi-objective optimization using a two-leveled symbiotic evolutionary algorithm (2 계층 공생 진화알고리듬을 이용한 다목적 최적화)

  • Sin, Gyeong-Seok;Kim, Yeo-Geun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.573-576
    • /
    • 2006
  • This paper deals with multi-objective optimization problem of finding a set of well-distributed solutions close to the true Pareto optimal solutions. In this paper, we present a two-leveled symbiotic evolutionary algorithm to efficiently solve the problem. Most of the existing multi-objective evolutionary algorithms (MOEAs) operate one population that consists of individuals representing the complete solution to the problem. The proposed algorithm maintains several populations, each of which represents a partial solution to the entire problem, and has a structure with two levels. The parallel search and the structure are intended to improve the capability of searching diverse and good solutions. The performance of the proposed algorithm is compared with those of the existing algorithms in terms of convergence and diversity. The experimental results confirm the effectiveness of the proposed algorithm.

  • PDF

Multicriteria Optimization of Spindle Units

  • Lim Sang-Heon;Lee Choon-Man;Zverev Igor Aexeevich
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.7 no.4
    • /
    • pp.57-62
    • /
    • 2006
  • The quality of precision spindle units (S/Us) running on rolling bearings depends strongly on their structural parameters, such as the configuration and geometry of the S/U elements and bearing preloads. When S/Us are designed, their parameters should be optimized to improve the performance characteristics. However, it is practically impossible to state perfectly a general criterion function for S/U quality. Therefore, we propose to use a multicriteria optimization based on the parameter space investigation (PSI) method We demonstrate the efficiency of the proposed method using the optimization results of high-speed S/Us.

A Genetic Algorithm for A Cell Formation with Multiple Objectives (다목적 셀 형성을 위한 유전알고리즘)

  • 이준수;정병호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.4
    • /
    • pp.31-41
    • /
    • 2003
  • This paper deals with a cell formation problem for a set of m-machines and n-processing parts. Generally, a cell formation problem is known as NP-completeness. Hence the cell formation problem with multiple objectives is more difficult than single objective problem. The paper considers multiple objectives; minimize number of intercell movements, minimize intracell workload variation and minimize intercell workload variation. We propose a multiple objective genetic algorithms(MOGA) resolving the mentioned three objectives. The MOGA procedure adopted Pareto optimal solution for selection method for next generation and the concept of Euclidean distance from the ideal and negative ideal solution for fitness test of a individual. As we consider several weights, decision maker will be reflected his consideration by adjusting high weights for important objective. A numerical example is given for a comparative analysis with the results of other research.