• Title/Summary/Keyword: Pareto 최적해

Search Result 119, Processing Time 0.04 seconds

Optimal Design of a Heat Exchanger with Vortex Generator (와류발생기가 부착된 열교환기 최적설계)

  • Park, Kyoung-Woo;Choi, Dong-Hoon
    • Proceedings of the KSME Conference
    • /
    • 2004.04a
    • /
    • pp.1219-1224
    • /
    • 2004
  • In this study the optimization of plate-fin type heat sink with vortex generator for thermal stability is conducted numerically. To acquire the optimal design variables, the CFD and mathematical optimization are integrated. The flow and thermal fields are predicted using the finite volume method. The optimization is carried out by means of the sequential quadratic programming (SQP) method. The results show that when the temperature rise is less than 40 K, the optimal design variables are as follows; $B_1=2.584mm$, $B_2=1.741mm$, and t = 7.914 mm. Comparing with the initial design, the temperature rise is reduced by 4.2 K, while the pressure drop is increased by 9.43 Pa. The Pareto optimal solutions are also presented between the pressure drop and the temperature rise.

  • PDF

A Pareto Ant Colony Optimization Algorithm for Application-Specific Routing in Wireless Sensor & Actor Networks (무선 센서 & 액터 네트워크에서 주문형 라우팅을 위한 파레토 개미 집단 최적화 알고리즘)

  • Kang, Seung-Ho;Choi, Myeong-Soo;Jung, Min-A;Lee, Seong-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4B
    • /
    • pp.346-353
    • /
    • 2011
  • Routing schemes that service applications with various delay times, maintaining the long network life time are required in wireless sensor & actor networks. However, it is known that network lifetime and hop count of trees used in routing methods have the tradeoff between them. In this paper, we propose a Pareto Ant Colony Optimization algorithm to find the Pareto tree set such that it optimizes these both tradeoff objectives. As it enables applications which have different delay times to select appropriate routing trees, not only satisfies the requirements of various multiple applications but also guarantees long network lifetime. We show that the Pareto tree set found by proposed algorithm consists of trees that are closer to the Pareto optimal points in terms of hop count and network lifetime than minimum spanning tree which is a representative routing tree.

Optimal LAN Design Using a Pareto Stratum-Niche Cubicle Genetic Algorithm (PS-NC GA를 이용한 최적 LAN 설계)

  • Choi, Kang-Hee;Jung, Kyoung-Hee
    • 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.

  • PDF

Optimum Structural Design of Panel Block Considering the Productivity (생산성을 고려한 평블록의 최적 구조 설계)

  • Lee, Joo-Sung;Kim, Jong-Mun
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.44 no.2 s.152
    • /
    • pp.139-147
    • /
    • 2007
  • The ultimate goal of structural design is to find the optimal design results which satisfies both safety and economy at the same time. Optimum design has been studied for the last several decades and is being studied. in this study, an optimum algorithm which is based on the genetic algorithm has been applied to the multi-object problem to obtain the optimum solutions which minimizes structural weight and construction cost of panel blocks in ship structures at the same time. Mathematical problems are dealt at first to justify the reliability of the present optimum algorithm. And then the present method has been applied to the panel block model which can be found in ship structures. From the present findings it has been seen that the present optimum algorithm can reasonably give the optimum design results.

Optimal Design of Water Distribution System considering the Uncertainties on the Demands and Roughness Coefficients (수요와 조도계수의 불확실성을 고려한 상수도관망의 최적설계)

  • Jung, Dong-Hwi;Chung, Gun-Hui;Kim, Joong-Hoon
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.10 no.1
    • /
    • pp.73-80
    • /
    • 2010
  • The optimal design of water distribution system have started with the least cost design of single objective function using fixed hydraulic variables, eg. fixed water demand and pipe roughness. However, more adequate design is accomplished with considering uncertainties laid on water distribution system such as uncertain future water demands, resulting in successful estimation of real network's behaviors. So, many researchers have suggested a variety of approaches to consider uncertainties in water distribution system using uncertainties quantification methods and the optimal design of multi-objective function is also studied. This paper suggests the new approach of a multi-objective optimization seeking the minimum cost and maximum robustness of the network based on two uncertain variables, nodal demands and pipe roughness uncertainties. Total design procedure consists of two folds: least cost design and final optimal design under uncertainties. The uncertainties of demands and roughness are considered with Latin Hypercube sampling technique with beta probability density functions and multi-objective genetic algorithms (MOGA) is used for the optimization process. The suggested approach is tested in a case study of real network named the New York Tunnels and the applicability of new approach is checked. As the computation time passes, we can check that initial populations, one solution of solutions of multi-objective genetic algorithm, spread to lower right section on the solution space and yield Pareto Optimum solutions building Pareto Front.

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

Study on Diversity of Population in Game model based Co-evolutionary Algorithm for Multiobjective optimization (다목적 함수 최적화를 위한 게임 모델에 기반한 공진화 알고리즘에서의 해집단의 다양성에 관한 연구)

  • Lee, Hea-Jae;Sim, Kwee-Bo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.11a
    • /
    • pp.104-107
    • /
    • 2007
  • 다목적 함수의 최적화 문제(Multiobjective optimization problems)의 경우에는 하나의 최적해가 존재하는 것이 아니라 '파레토 최적해 집합(Pareto optimal set)'이라고 알려진 해들의 집합이 존재한다. 이러한 이상적 파레토 최적해 집합과 가까운 최적해를 찾기 위한 다양한 해탐색 능력은 진화 알고리즘의 성능을 결정한다. 본 논문에서는 게임 모텔에 기반한 공진화 알고리즘(GCEA:Game model based Co-Evolutionary Algorithm)에서 해집단의 다양성을 유지하여, 다양한 비지배적 파레토 대안해(non-dominated alternatives)들을 찾기 위한 방법을 제안한다.

  • PDF

Design Optimization of Liquid Rocket Engine Using Genetic Algorithms (유전알고리즘을 이용한 액체로켓엔진 설계 최적화)

  • Lee, Sang-Bok;Lim, Tae-Kyu;Roh, Tae-Seong
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.16 no.2
    • /
    • pp.25-33
    • /
    • 2012
  • A genetic algorithm (GA) has been employed to optimize the major design variables of the liquid rocket engine. Pressure of the main combustion chamber, nozzle expansion ratio and O/F ratio have been selected as design variables. The target engine has the open gas generator cycle using the LO2/RP-1 propellant. The gas properties of the combustion chamber have been obtained from CEA2 and the mass has been estimated using reference data. The objective function has been set as multi-objective function with the specific impulse and thrust to weight ratio using the weight method. The result shows about 4% improvement of the specific impulse and 23% increase of the thrust to weight ratio. The Pareto frontier line has been also obtained for various thrust requirements.