• 제목/요약/키워드: process optimization algorithm and system

검색결과 357건 처리시간 0.042초

다항식 뉴럴 네트워크의 최적화: 진화론적 방법 (Optimization of Polynomial Neural Networks: An Evolutionary Approach)

  • 김동원;박귀태
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제52권7호
    • /
    • pp.424-433
    • /
    • 2003
  • Evolutionary design related to the optimal design of Polynomial Neural Networks (PNNs) structure for model identification of complex and nonlinear system is studied in this paper. The PNN structure is consisted of layers and nodes like conventional neural networks but is not fixed and can be changable according to the system environments. three types of polynomials such as linear, quadratic, and modified quadratic is used in each node that is connected with various kinds of multi-variable inputs. Inputs and order of polynomials in each node are very important element for the performance of model. In most cases these factors are decided by the background information and trial and error of designer. For the high reliability and good performance of the PNN, the factors must be decided according to a logical and systematic way. In the paper evolutionary algorithm is applied to choose the optimal input variables and order. Evolutionary (genetic) algorithm is a random search optimization technique. The evolved PNN with optimally chosen input variables and order is not fixed in advance but becomes fully optimized automatically during the identification process. Gas furnace and pH neutralization processes are used in conventional PNN version are modeled. It shows that the designed PNN architecture with evolutionary structure optimization can produce the model with higher accuracy than previous PNN and other works.

다항식 뉴럴 네트워크의 최적화 : 진화론적 방법 (Optimization of Polynomial Neural Networks: An Evolutionary Approach)

  • 김동원;박귀태
    • 대한전기학회논문지:전기물성ㆍ응용부문C
    • /
    • 제52권7호
    • /
    • pp.424-424
    • /
    • 2003
  • Evolutionary design related to the optimal design of Polynomial Neural Networks (PNNs) structure for model identification of complex and nonlinear system is studied in this paper. The PNN structure is consisted of layers and nodes like conventional neural networks but is not fixed and can be changable according to the system environments. three types of polynomials such as linear, quadratic, and modified quadratic is used in each node that is connected with various kinds of multi-variable inputs. Inputs and order of polynomials in each node are very important element for the performance of model. In most cases these factors are decided by the background information and trial and error of designer. For the high reliability and good performance of the PNN, the factors must be decided according to a logical and systematic way. In the paper evolutionary algorithm is applied to choose the optimal input variables and order. Evolutionary (genetic) algorithm is a random search optimization technique. The evolved PNN with optimally chosen input variables and order is not fixed in advance but becomes fully optimized automatically during the identification process. Gas furnace and pH neutralization processes are used in conventional PNN version are modeled. It shows that the designed PNN architecture with evolutionary structure optimization can produce the model with higher accuracy than previous PNN and other works.

CSP와 SA를 이용한 Job Shop 일정계획에 관한 연구 (A Study on the Job Shop Scheduling Using CSP and SA)

  • 윤종준;손정수;이화기
    • 산업경영시스템학회지
    • /
    • 제23권61호
    • /
    • pp.105-114
    • /
    • 2000
  • Job Shop Problem which consists of the m different machines and n jobs is a NP-hard problem of the combinatorial optimization. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. Each machine can process at most one operation at a time. The purpose of this paper is to develop the heuristic method to solve large scale scheduling problem using Constraint Satisfaction Problem method and Simulated Annealing. The proposed heuristic method consists of the search algorithm and optimization algorithm. The search algorithm is to find the solution in the solution space using CSP concept such as backtracking and domain reduction. The optimization algorithm is to search the optimal solution using SA. This method is applied to MT06, MT10 and MT20 Job Shop Problem, and compared with other heuristic method.

  • PDF

가스절연 원통형 관로 내의 스페이서 전계 최적화 알고리즘에 관한 연구 (Investigation on Electric Field Optimization Algorithm of Spacer in Gas Insulated System)

  • 김웅식;민석원
    • 대한전기학회논문지:전기물성ㆍ응용부문C
    • /
    • 제51권3호
    • /
    • pp.115-120
    • /
    • 2002
  • This Paper describes an algorithm for the design of axi-symmetrical spacer under specified field conditions. The electric field alas been calculated by combination method of Integral Equation Method(IEM) and Charge Simulation Method(CSM). The contour of spacer is represented with NURB(Non-Uniform Rational B-spline) curve of which effectiveness has been proved. This algorithm introduces a design process in the aspect of electrical field, when a spacer in airtight cylinder is designed. Also various field conditions for obtaining optical shapes have been proposed. Due to the algorithm, the entire process shows a stable convergence. Both tangential and total electrical field are taken into consideration as specified field criteria.

효율적 유지보수를 위한 도시철도 전동차 브레이크의 시스템 신뢰도 최적화 (Reliability Optimization of Urban Transit Brake System For Efficient Maintenance)

  • 배철호;김현준;이정환;김세훈;이호용;서명원
    • 대한기계학회논문집A
    • /
    • 제31권1호
    • /
    • pp.26-35
    • /
    • 2007
  • The vehicle of urban transit is a complex system that consists of various electric, electronic, and mechanical equipments, and the maintenance cost of this complex and large-scale system generally occupies sixty percent of the LCC (Life Cycle Cost). For reasonable establishing of maintenance strategies, safety security and cost limitation must be considered at the same time. The concept of system reliability has been introduced and optimized as the key of reasonable maintenance strategies. For optimization, three preceding studies were accomplished; standardizing a maintenance classification, constructing RBD (Reliability Block Diagram) of VVVF (Variable Voltage Variable Frequency) urban transit, and developing a web based reliability evaluation system. Historical maintenance data in terms of reliability index can be derived from the web based reliability evaluation system. In this paper, we propose applying inverse problem analysis method and hybrid neuro-genetic algorithm to system reliability optimization for using historical maintenance data in database of web based system. Feed-forward multi-layer neural networks trained by back propagation are used to find out the relationship between several component reliability (input) and system reliability (output) of structural system. The inverse problem can be formulated by using neural network. One of the neural network training algorithms, the back propagation algorithm, can attain stable and quick convergence during training process. Genetic algorithm is used to find the minimum square error.

벌칙함수를 도입한 하모니서치 휴리스틱 알고리즘 기반 구조물의 이산최적설계법 (Discrete Optimization of Structural System by Using the Harmony Search Heuristic Algorithm with Penalty Function)

  • 정주성;최윤철;이강석
    • 대한건축학회논문집:구조계
    • /
    • 제33권12호
    • /
    • pp.53-62
    • /
    • 2017
  • Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.

다기준 시뮬레이션 최적화를 위한 알고리즘

  • 이영해;신현문
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
    • /
    • pp.697-708
    • /
    • 1995
  • For many practical optimization problems where the system components are stochastic, the objective functions can not be represented analytically. Furthermore, many of these problems are characterized by the presence of multiple and conflicting objectives. In this research, we introduce a new algorithm through an interactive cutting plane method for solving this multi-criteria simulation optimization problem. Then a turning process is evaluated through the proposed algorithm.

  • PDF

Optimum static balancing of a robot manipulator using TLBO algorithm

  • Rao, R. Venkata;Waghmare, Gajanan
    • Advances in robotics research
    • /
    • 제2권1호
    • /
    • pp.13-31
    • /
    • 2018
  • This paper presents the performance of Teaching-Learning-Based Optimization (TLBO) algorithm for optimum static balancing of a robot manipulator. Static balancing of robot manipulator is an important aspect of the overall robot performance and the most demanding process in any robot system to match the need for the production requirements. The average force on the gripper in the working area is considered as an objective function. Length of the links, angle between them and stiffness of springs are considered as the design variables. Three robot manipulator configurations are optimized. The results show the better or competitive performance of the TLBO algorithm over the other optimization algorithms considered by the previous researchers.

An Efficient Channel Selection and Power Allocation Scheme for TVWS based on Interference Analysis in Smart Metering Infrastructure

  • Huynh, Chuyen Khoa;Lee, Won Cheol
    • Journal of Communications and Networks
    • /
    • 제18권1호
    • /
    • pp.50-64
    • /
    • 2016
  • Nowadays, smart meter (SM) technology is widely effectively used. In addition, power allocation (PA) and channel selection (CS) are considered problems with many proposed approaches. In this paper, we will suggest a specific scenario for an SM configuration system and show how to solve the optimization problem for transmission between SMs and the data concentrator unit (DCU), the center that collects the data from several SMs, via simulation. An efficient CS with PA scheme is proposed in the TV white space system, which uses the TV band spectrum. On the basic of the optimal configuration requirements, SMs can have a transmission schedule and channel selection to obtain the optimal efficiency of using spectrum resources when transmitting data to the DCU. The optimal goals discussed in this paper are the maximum capacity or maximum channel efficiency and the maximum allowable power of the SMs used to satisfy the quality of service without harm to another wireless system. In addition, minimization of the interference to the digital television system and other SMs is also important and needs to be considered when the solving coexistence scenario. Further, we propose a process that performs an interference analysis scheme by using the spectrum engineering advanced Monte Carlo analysis tool (SEAMCAT), which is an integrated software tool based on a Monte-Carlo simulation method. Briefly, the process is as follows: The optimization process implemented by genetic evolution optimization engines, i.e., a genetic algorithm, will calculate the best configuration for the SM system on the basis of the interference limitation for each SM by SEAMCAT in a specific configuration, which reaches the solution with the best defined optimal goal satisfaction.

유전알고리즘과 조합화학을 이용한 형광체 개발 (A Search for Red Phosphors Using Genetic Algorithm and Combinatorial Chemistry)

  • 이재문;유정곤;박덕현;손기선
    • 한국세라믹학회지
    • /
    • 제40권12호
    • /
    • pp.1170-1176
    • /
    • 2003
  • 진화최적방법을 이용하여 alkali earth borosilicate 계열(Eu, Mg, Ca, Sr, Ba)$_{x}$ $B_{y}$S $i_{z}$ $O_{d}$에 E $u^{3+}$ 를 도핑 하여 고효율 적색 형광체를 합성하였다. 본 연구는 삼원색 백색 LED로의 적용을 목적으로 한다. 진화최적방법은 유전알고리즘과 조합화학을 연계하여, LED형광체 개발을 위해 개발하였다. 유전알고리즘을 조합화학에 접목함으로써 시간과 자원의 낭비 없이 매우 효율적인 형광체 탐색을 꾀할 수 있었다. 실질적인 실험에 앞서 다양한 목적함수를 이용하여 시뮬레이션을 실시하여 본 연구의 타당성을 증명하고 실제 합성한 결과 삼원색 백색 LED용 적색형광체(E $u_{0.14}$M $g_{0.18}$C $a_{0.07}$B $a_{0.12}$ $B_{0.17}$S $i_{0.32}$ $O_{{\delta}}$)를 얻었다.얻었다.다.얻었다.얻었다.다.