• Title/Summary/Keyword: Stochastic optimization

Search Result 386, Processing Time 0.028 seconds

Preventing Premature Convergence in Genetic Algorithms with Adaptive Population Size (유전자 집단의 크기 조절을 통한 Genetic Algorithm의 조기 포화 방지)

  • 박래정;박철훈
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.12
    • /
    • pp.1680-1686
    • /
    • 1995
  • GAs, effective stochastic search algorithms based on the model of natural evolution and genetics, have been successfully applied to various optimization problems. When population size is not large, GAs often suffer from the phenomenon of premature convergence in which all chromosomes in the population lose the diversity of genes before they find the optimal solution. In this paper, we propose that a new heuristic that maintains the diversity of genes by adding some chromosomes with random mutation and selective mutation into population during evolution. And population size changes dynamically with supplement of new chromosomes. Experimental results for several test functions show that when population size is rather small and the length of chromosome is not long, this method is effective.

  • PDF

A Study on the Optimum Design of Multi-Object Dynamic System for the Rail Vehicle (철도차량 동적 진동특성을 고려한 다목적함수 최적설계)

  • Park, Chan-Kyoung;Lee, Kwang-Ki;Kim, Ki-Hwan;Hyun, Seung-Ho;Park, Choon-Soo
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2000.06a
    • /
    • pp.894-899
    • /
    • 2000
  • Optimization of 26 design variables selected from suspension characteristics for Korean High Speed Train (KHST) is performed according to the minimization of 58 responses which represent running safety and ride comfort for KHST and analyzed by using the each response surface model from stochastic design experiments. Sensitivity of design variables is also analyzed through the response surface model which ineffective design prameters to the performance index are screened by using stepwise regression method. The response surface models are used for optimizing design variables through simplex algorism. Values of performance index simulated by optimized design parameters are totally lower than those by initial design parameters. It shows that this method is effective for optimizing multi-design variables to multi-object function.

  • PDF

Application Markov State Model for the RCM of Combustion Turbine Generating Unit (Markov State Model을 이용한 복합화력 발전설비의 최적의 유지보수계획 수립)

  • Lee, Seung-Hyuk;Shin, Jun-Seok;Kim, Jin-O
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.2
    • /
    • pp.248-253
    • /
    • 2007
  • Traditional time based preventive maintenance is used to constant maintenance interval for equipment life. In order to consider economic aspect for time based preventive maintenance, preventive maintenance is scheduled by RCM(Reliability-Centered Maintenance) evaluation. So, Markov state model is utilized considering stochastic state in RCM. In this paper, a Markov state model which can be used for scheduling and optimization of maintenance is presented. The deterioration process of system condition is modeled by a Markov model. In case study, simulation results about RCM are used to the real historical data of combustion turbine generating units in Korean power systems.

A Stochastic Model for Maximizing the Lifetime of Wireless Sensor Networks (확률모형을 이용한 무선센서망 수명 최대화에 관한 분석)

  • Lee, Doo-Ho;Yang, Won-Seok
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.3
    • /
    • pp.69-78
    • /
    • 2012
  • Reduction of power consumption has been a major issue and an interesting challenge to maximize the lifetime of wireless sensor networks. We investigate the practical meaning of N-policy in queues as a power saving technique in a WSN. We consider the N-policy of a finite M/M/1 queue. We formulate the optimization problem of power consumption considering the packet loss probability. We analyze the trade-off between power consumption and the packet loss probability and demonstrate the operational characteristics of N-policy as a power saving technique in a WSN with various numerical examples.

Analysis of Micro Energy Building Operation (Micro Energy Building 운영사례 분석)

  • Choi, Hyeong-Jin;Park, Si-Sam;Na, Sang-Min
    • 한국신재생에너지학회:학술대회논문집
    • /
    • 2011.11a
    • /
    • pp.140.2-140.2
    • /
    • 2011
  • Renewable energy(RE) systems have difficulties in operating and management due to the intermittency of the energy generation. Stochastic supply profiles of RE creates problems for mechanical and electrical design in relation to the selection of technology types and capacities of RE to be installed. This paper presents an methodology of the feasibility assessment of RE-integrated energy systems on the basis of hourly demand/supply analysis tools. Also, this paper shows the feasibility and the usefulness of GS REMA(Renewable Energy Matching Analysis) and HOMER by comparing actual energy data.

  • PDF

Drought Monitoring with Indexed Sequential Modeling

  • Kim, Hung-Soo;Yoon, Yong-Nam
    • Korean Journal of Hydrosciences
    • /
    • v.8
    • /
    • pp.125-136
    • /
    • 1997
  • The simulation techniques of hydrologic data series have develped for the purposes of the design of water resources system, the optimization of reservoir operation, and the design of flood control of reservoir, etc. While the stochastic models are usually used in most analysis of water resources fields for the generation of data sequences, the indexed sequential modeling (ISM) method based on generation of a series of overlapping short-term flow sequences directly from the historical record has been used for the data generation in the western USA since the early of 1980s. It was reported that the reliable results by ISM were obtained in practical applications. In this study, we generate annual inflow series at a location of Hong Cheon Dam site by using ISM method and autoregressive, order-1 model (AR(1)), and estimate the drought characteristics for the comparison aim between ISM and AR(1).

  • PDF

Optimum Design of BLDC Motor for Cogging Torque Minimization Using Genetic Algorithm and Response Surface Method

  • Jeon, Mun-Ho;Kim, Dong-Hun;Kim, Chang-Eob
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.4
    • /
    • pp.466-471
    • /
    • 2006
  • This raper presents a new optimization method combining the genetic algorithm with the response surface method for the optimum design of a Brushless Direct Current motor. The method utilizes a regression function approximating an objective function and the window moving and zoom-in method so as to complement disadvantages of both the genetic algorithm and response surface method. The results verify that the proposed method is powerful and effective in reducing cogging torque by optimizing only a few decisive design factors compared with the conventional stochastic methods.

Application of GA for Optimum Design of Composite Laminated Structures (복합 적층구조의 최적설계를 위한 유전알고리즘의 적용)

  • 이상근;한상훈;구봉근
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1997.10a
    • /
    • pp.163-170
    • /
    • 1997
  • The present paper describes an investigation into the application of the genetic algorithm(GA) in the optimization of structural design. Stochastic processes generate an initial population of designs and then apply principles of natural selection/survival of the fittest to improve the designs. The five test functions are used to verify the robustness and reliability of GA, and as a numerical example, minimum weight of a cantilever composite laminated beam with a mix of continuous, integer and discrete design variables is obtained by using GA with exterior penalty function method. The design problem has constraints on strength, displacements, and natural frequencies, and is formulated to a multidimensional nonlinear form. From the results, it is found that the GA search technique is very effective at finding the good optimum solution as well as has higher robustness.

  • PDF

Determining the Optimal Buffer Sizes in Poisson Driven 3-node Tandem Queues using (Max, +)-algebra ((Max, +)-대수를 이용한 3-노드 유한 버퍼 일렬대기행렬 망에서 최적 버퍼 크기 결정)

  • Seo, Dong-Won;Hwang, Seung-June
    • Korean Management Science Review
    • /
    • v.24 no.1
    • /
    • pp.25-34
    • /
    • 2007
  • In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

Note on Fuzzy Random Renewal Process and Renewal Rewards Process

  • Hong, Dug-Hun
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.9 no.3
    • /
    • pp.219-223
    • /
    • 2009
  • Recently, Zhao et al. [Fuzzy Optimization and Decision Making (2007) 6, 279-295] characterized the interarrival times as fuzzy random variables and presented a fuzzy random elementary renewal theorem on the limit value of the expected renewal rate of the process in the fuzzy random renewal process. They also depicted both the interarrival times and rewards are depicted as fuzzy random variables and provided fuzzy random renewal reward theorem on the limit value of the long run expected reward per unit time in the fuzzy random renewal reward process. In this note, we simplify the proofs of two main results of the paper.