• Journal of the Korea Institute of Building Construction
• /
• v.8 no.6
• /
• pp.91-98
• /
• 2008

It is time-consuming and difficulty to solve the time-cost trade-off problems, as there are trade-offs between time and cost to complete the activities in construction projects and this problems do not have unique solutions. Typically, heuristic methods, mathematical models and GA models has been used to solve this problems. As heuristic methods and mathematical models are have weakness in solving the time-cost trade-off problems, GA based model has been studied widely in recent. This paper suggests the time-cost trade-off optimization algorithm using particle swarm optimization. The traditional particle swarm optimization model is modified to generate optimal tradeoffs among construction time and cost efficiently. An application example is analyzed to illustrate the use of the suggested algorithm and demonstrate its capabilities in generating optimal tradeoffs among construction time and cost. Future applications of the model are suggested in the conclusion.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.2
• /
• pp.182-191
• /
• 2011

Genetic algorithms (GA) and particle swarm optimization (PSO) are the most famous optimization techniques among various modern heuristic optimization techniques. These two approaches identify the solution to a given objective function, but they employ different strategies and computational effort; therefore, a comparison of their performance is needed. This paper presents the application and performance comparison of the PSO and GA optimization techniques for a static synchronous series compensator-based controller design. The design objective is to enhance power system stability. The design problem of the FACTS-based controller is formulated as an optimization problem, and both PSO and GA optimization techniques are employed to search for the optimal controller parameters.

• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

• Proceeding of KASS Symposium
• /
• 2005.05a
• /
• pp.3-51
• /
• 2005

Optimization methods are presented for design of shells and spatial structures. The effectiveness of using optimization techniques are demonstrated by the following examples: 1. Shape design of ribbed shells. 2. Shape design of membrane structures. 3. Optimization of single-layer spatial truss against buckling. 4. Application of heuristic methods to optimization of space frames. The readers may first see the numerical results to find that is possible by optimization. In the appendix, overview of structural optimization in architectural design is presented, and effectiveness of optimization is demonstrated by small examples. Each chapter is a part of a published paper, or translation from a Japanese article. So there might be some difficulties for understanding the details: inconsistency of the story, etc., which the author hope not to lead to major difficulties for understanding the concepts and results.

• International Journal of CAD/CAM
• /
• v.7 no.1
• /
• pp.61-69
• /
• 2007

The objective of this work is to integrate reliability analysis into topology optimization problems. We introduce the reliability constraint in the topology optimization formulation, and the new model is called Reliability-Based Topology Optimization (RBTO). The application of the RBTO model gives a different topology relative to the classical topology optimization that should be deterministic. When comparing the structures resulting from the deterministic topology optimization and from the RBTO model, the RBTO model yields structures that are more reliable than the deterministic ones (for the same weight). Several applications show the importance of this integration.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.198-200
• /
• 2006

This paper presents a development of an educational simulator of particle swarm optimization (PSO) and application for solving the test functions and economic dispatch (ED) problems with nonsmooth cost functions. A particle swarm optimization is one of the most powerful methods for solving global optimization problems. It is a population-based search algorithm and searches in parallel using a group of particles similar to other AI-based heuristic optimization techniques. In developed simulator, lecturers and students can select the functions for simulation and set the parameters that have an influence on PSO performance. To improve searching capability for ED problems, a crossover operation is proposed to the position update of each individual (CR-PSO). To verify the feasibility of CR-PSO method, numerical studies have been performed for two different sample systems. The proposed CR-PSO method outperforms other algorithms in solving ED problems.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.571-582
• /
• 2008

This paper analyzes global convergence of the univariate dynamic encoding algorithm for searches (uDEAS) and provides an application result to function optimization. uDEAS is a more advanced optimization method than its predecessor in terms of the number of neighborhood points. This improvement should be validated through mathematical analysis for further research and application. Since uDEAS can be categorized into the generating set search method also established recently, the global convergence property of uDEAS is proved in the context of the direct search method. To show the strong performance of uDEAS, the global minima of four 30 dimensional benchmark functions are attempted to be located by uDEAS and the other direct search methods. The proof of global convergence and the successful optimization result guarantee that uDEAS is a reliable and effective global optimization method.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.4
• /
• pp.317-324
• /
• 2008

Optimum design for general or complex structures are required to the need of many numbers of structural analyses. However, current computational environment with single processor is not capable of generating a high-level efficiency in structural analysis and design process for complex structures. In this paper, a virtual parallel computing system communicated by an internet of personal computers and workstation is constructed. In addition, a routine executing Pro/E, ANSYS and optimization algorithm automatically are adopted in the distributed process technique of sequential approximate optimization for the purpose of enhancing the flexibility of application to general structures. By employing the distributed processing technique during structural analysis using commercial application, total calculation time could be reduced, which will enhance the applicability of the proposed technique to the general complex structures.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.13 no.1
• /
• pp.115-125
• /
• 2021

Simulation-based hull form optimization is a typical HEB (high-dimensional, expensive computationally, black-box) problem. Conventional optimization algorithms easily fall into the "curse of dimensionality" when dealing with HEB problems. A recently proposed Cross-Entropy (CE) optimization algorithm is an advanced stochastic optimization algorithm based on a probability model, which has the potential to deal with high-dimensional optimization problems. Currently, the CE algorithm is still in the theoretical research stage and rarely applied to actual engineering optimization. One reason is that the Monte Carlo (MC) method is used to estimate the high-dimensional integrals in parameter update, leading to a large sample size. This paper proposes an improved CE algorithm based on quasi-Monte Carlo (QMC) estimation using high-dimensional truncated Sobol subsequence, referred to as the QMC-CE algorithm. The optimization performance of the proposed algorithm is better than that of the original CE algorithm. With a set of identical control parameters, the tests on six standard test functions and a hull form optimization problem show that the proposed algorithm not only has faster convergence but can also apply to complex simulation optimization problems.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.531-536
• /
• 2001

The structural shape optimization is a useful tool for engineers to determine the shape of a structure. During the optimization process, relocations of nodes happen successively. However, excessive movement of nodes often results in the mesh distortion and eventually deteriorates the accuracy of the optimum solution. To overcome this problem, an efficient method for the shape optimization has been developed. The method starts from the design domain which is large enough to hold the possible shape of the structure. The design domain has pre-defined uniform fine meshes. At every cycle, the method judges whether all the elements are inside of the structure or not. Elements inside of the structure are assigned with real material properties, however elements outside of the structure are assigned with nearly zero values. The performance of the method is evaluated through various examples.