• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.04a
• /
• pp.245-253
• /
• 1998

Recently, the importance of multi-objective optimization techniques and stochastic search methods is increasing. The stochastic search methods have the concepts of the survival of the fittest and natural selection such as genetic algorithms(GA), simulated annealing(SA) and evolution strategies (ES). As many accidents of oil tankers cause marine pollution, oil tankers of double hull or mid deck structure are being built to minimize the marine pollution. For the improvement of oil tanker design technique, an efficient optimization technique is proposed in this study. Multi-objective optimization problem of weight and cost of double hull and mid deck tanker is formulated. Discrete design variables are used considering real manufacturing, and the concept of relative production cost is also introduced. The ES method is used as an optimization technique, and the ES algorithm was developed to generate a more efficient Pareto optimal set.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.643-653
• /
• 2017

The paper presents controller optimization algorithm for a 12-pulse voltage source converter (VSC) based high voltage direct current (HVDC) system. To get an optimum algorithm, three methods namely conventional-Zeigler-Nichols, linear-golden section search (GSS) and stochastic-particle swarm optimization (PSO) are applied to control of 12 pulse VSC based HVDC system and simulation results are presented to show the best among the three. The performance results are obtained under various dynamic conditions such as load perturbation, non-linear load condition, and voltage sag, tapped load fault at points-of-common coupling (PCC) and single-line-to ground (SLG) fault at input AC mains. The conventional GSS and PSO algorithm are modified to enhance their performances under dynamic conditions. The results of this study show that modified particle swarm optimization provides the best results in terms of quick response to the dynamic conditions as compared to other optimization methods.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.3
• /
• pp.821-831
• /
• 2014

Stochastic rainfall generators or stochastic simulation have been widely employed to generate synthetic rainfall sequences which can be used in hydrologic models as inputs. The calibration of Poisson cluster stochastic rainfall generator (e.g. Modified Bartlett-Lewis Rectangular Pulse, MBLRP) is seriously affected by local minima that is usually estimated from the local optimization algorithm. In this regard, global optimization techniques such as particle swarm optimization and shuffled complex evolution algorithm have been proposed to better estimate the parameters. Although the global search algorithm is designed to avoid the local minima, reliable parameter estimation of MBLRP model is not always feasible especially in a limited parameter space. In addition, uncertainty associated with parameters in the MBLRP rainfall generator has not been properly addressed yet. In this sense, this study aims to develop and test a Bayesian model based parameter estimation method for the MBLRP rainfall generator that allow us to derive the posterior distribution of the model parameters. It was found that the HBM based MBLRP model showed better performance in terms of reproducing rainfall statistic and underlying distribution of hourly rainfall series.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.212-216
• /
• 1999

We propose a method for simulation optimization using stochastic genetic algorithm(GA) to get the best design and operating policies in a Direct-Input-Output Automated Manufacturing System (DIOMS).

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.8
• /
• pp.854-867
• /
• 2014

This paper deals with the performance comparison of a PSO algorithm inspired in the process of simulating the behavior pattern of the organisms. The PSO algorithm finds the optimal solution (fitness value) of the objective function based on a stochastic process. Generally, the stochastic process, a random function, is used with the expression related to the velocity included in the PSO algorithm. In this case, the random function of the normal distribution (Gaussian) or uniform distribution are mainly used as the random function in a PSO algorithm. However, in this paper, because the probability distribution which is various with 2 shape parameters can be expressed, the performance comparison of a PSO algorithm using the beta probability distribution function, that is a random function which has a high degree of freedom, is introduced. For performance comparison, 3 functions (Rastrigin, Rosenbrock, Schwefel) were selected among the benchmark Set. And the convergence property was compared and analyzed using PSO-FIW to find the optimal solution.

• Structural Monitoring and Maintenance
• /
• v.1 no.4
• /
• pp.427-449
• /
• 2014

A hybrid optimization method for the identification of state-space models is presented in this study. Hybridization is succeeded by combining the advantages of deterministic and stochastic algorithms in a superior scheme that promises faster convergence rate and reliability in the search for the global optimum. The proposed hybrid algorithm is developed by replacing the original stochastic mutation operator of Evolution Strategies (ES) by the Levenberg-Marquardt (LM) quasi-Newton algorithm. This substitution results in a scheme where the entire population cloud is involved in the search for the global optimum, while single individuals are involved in the local search, undertaken by the LM method. The novel hybrid identification framework is assessed through the Monte Carlo analysis of a simulated system and an experimental case study on a shear frame structure. Comparisons to subspace identification, as well as to conventional, self-adaptive ES provide significant indication of superior performance.

• Korean Management Science Review
• /
• v.9 no.1
• /
• pp.3-15
• /
• 1992

In this paper, we study a manufacturing system of serial stages with general service times, in which the production of each stage and the coordination of stages are controlled by Kanban discipline. This Kanban discipline is modeled as a Discrete Event Dynamic System and a system of recursive equations is applied to study the dynamics of the system. The recursive relationship enables us to compare this Kanban discipline with the other blocking disciplines such as transfer blocking, service blocking, block-and-hold b, and block-and-hold K, and the Kanban is shown to be superior to the other disciplines in terms of makespan and throughput. As a special case, two stages Kanban system is modeled as $C_2/C_2/1/N$ queueing system, and a recursive algorithm is developed to calculate the system performance. In optimizing the system performance, the stochastic optimization approach of Robbins-Monro is employed via perturbation analysis, the way to estimate the stochastic partial derivative based on only one sample trajectory of the system, and the required commuting condition is verified. Then the stochastic convexity result is established to provide second-order optimality condition for this parametric optimization problem.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.80-89
• /
• 2014

A stochastic optimal power flow (S-OPF) model considering uncertainties of load and wind power is developed based on chance constrained programming (CCP). The difficulties in solving the model are the nonlinearity and probabilistic constraints. In this paper, a limit relaxation approach and an iterative learning control (ILC) method are implemented to solve the S-OPF model indirectly. The limit relaxation approach narrows the solution space by introducing regulatory factors, according to the relationship between the constraint equations and the optimization variables. The regulatory factors are designed by ILC method to ensure the optimality of final solution under a predefined confidence level. The optimization algorithm for S-OPF is completed based on the combination of limit relaxation and ILC and tested on the IEEE 14-bus system.

• Structural Engineering and Mechanics
• /
• v.83 no.4
• /
• pp.537-549
• /
• 2022

In this paper, a novel multi-feature model predictive control (MPC) framework with real-time and adaptive performances is proposed for intelligent structural control in which some drawbacks of the algorithm including, complex control rule and non-optimality, are alleviated. Hence, Linear Programming (LP) is utilized to simplify the resulted control rule. Afterward, the Whale Optimization Algorithm (WOA) is applied to the optimal and adaptive tuning of the LP weights independently at each time step. The stochastic control rule is also achieved using Kalman Filter (KF) to handle noisy measurements. The Extreme Learning Machine (ELM) is then adopted to develop a data-driven and real-time control algorithm. The efficiency of the developed algorithm is then demonstrated by numerical simulation of a twenty-story high-rise benchmark building subjected to earthquake excitations. The competency of the proposed method is proven from the aspects of optimality, stochasticity, and adaptivity compared to the KF-based MPC (KMPC) and constrained MPC (CMPC) algorithms in vibration suppression of building structures. The average value for performance indices in the near-field and far-field (El earthquakes demonstrates a reduction up to 38.3% and 32.5% compared with KMPC and CMPC, respectively.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.12 no.6
• /
• pp.478-487
• /
• 2002

This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.