• Journal of Korea Water Resources Association
• /
• v.34 no.5
• /
• pp.567-575
• /
• 2001

A methodology is developed for designing the minimum-cost water distribution network. The method is based on network simulations and an optimization scheme using genetic algorithms. Being a stochastic optimization scheme, genetic algorithms have advantages over the conventional search algorithms in solving network problems known for their nonlinearities and herculean computational costs. While existing methods focus on the design of either entirely new or parallel augmentation of network systems, the proposed method can be applied to problems having both new branches of tree-type and paralle augmentation in loops. The applicability of the method was shown through a case study for Baekryeon water supply system. The optimized design resulted in the maximum 5.37% savings compared to the conventional design without optimization, while meeting the hydraulic constraints.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.226-249
• /
• 2016

The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1111-1130
• /
• 2016

Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.105-127
• /
• 1995

This paper solves different machine-part group formation (MPGF) problems using genetic algorithms to demonstrate that it can be a new robust alternative to the conventional heuristic approaches for optimization problems. We first give an overview of genetic algorithms: Its principle, various considerations required for its implementation, and the method for setting up parameter values are explained. Then, we describe the MPGF problem which are critical to the successful operation of cellular manufacturing or flexible manufacturing systems. We concentrate on three models of the MPGF problems whose forms of the objective function and/or constraints are quite different from each other. Finally, numerical examples of each of the models descibed above are solved by using genetic algorithms. The result shows that the solutions derived by genetic algorithms are comparable to those obtained through problem-specific heuristic methods.

• Advances in Computational Design
• /
• v.1 no.1
• /
• pp.79-86
• /
• 2016

In this study, the three different meta-heuristics namely the Grey Wolf Optimizer (GWO), Stochastic Fractal Search (SFS), and Adaptive Differential Evolution with Optional External Archive (JADE) algorithms are examined. This study considers optimization of the planer frame to minimize its weight subjected to the strength and displacement constraints as per the American Institute of Steel and Construction - Load and Resistance Factor Design (AISC-LRFD). The GWO algorithm is associated with grey wolves' activities in the social hierarchy. The SFS algorithm works on the natural phenomenon of growth. JADE on the other hand is a powerful self-adaptive version of a differential evolution algorithm. A one-bay ten-story planar steel frame problem is examined in the present work to investigate the design ability of the proposed algorithms. The frame design is produced by optimizing the W-shaped cross sections of beam and column members as per AISC-LRFD standard steel sections. The results of the algorithms are compared. In addition, these results are also mapped with other state-of-art algorithms.

• Steel and Composite Structures
• /
• v.7 no.3
• /
• pp.201-217
• /
• 2007

Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

• Structural Engineering and Mechanics
• /
• v.11 no.2
• /
• pp.151-170
• /
• 2001

With increasing competition, the engineering industry is in need of optimization of designs that would lead to minimum cost or weight. Recent developments in Genetic Algorithms (GAs) makes it possible to model and obtain optimal solutions in structural design that can be put to use in industry. The main objective of this paper is to illustrate typical applications of GAs to practical design of structural systems such as steel trusses, towers, bridges, reinforced concrete frames, bridge decks, shells and layout planning of buildings. Hence, instead of details of GA process, which can be found in the reported literature, attention is focussed on the description of the various applications and the practical aspects that are considered in Genetic Modeling. The paper highlights scope and future directions for wider applications of GA based methodologies for optimal design in practice.

• Industrial Engineering and Management Systems
• /
• v.14 no.1
• /
• pp.11-21
• /
• 2015

The purpose of this research is to develop algorithms using the Differential Evolution Algorithm (DE) to solve a multi-objective, sources and stages location-allocation problem. The development process starts from the design of a standard DE, then modifies the recombination process of the DE in order improve the efficiency of the standard DE. The modified algorithm is called modified DE. The proposed algorithms have been tested with one real case study (large size problem) and 2 randomly selected data sets (small and medium size problems). The computational results show that the modified DE gives better solutions and uses less computational time than the standard DE. The proposed heuristics can find solutions 0 to 3.56% different from the optimal solution in small test instances, while differences are 1.4-3.5% higher than that of the lower bound generated by optimization software in medium and large test instances, while using more than 99% less computational time than the optimization software.

• Structural Engineering and Mechanics
• /
• v.35 no.1
• /
• pp.83-98
• /
• 2010

In this paper, the mass optimization of four bar linkages is carried out using genetic algorithms (GA) with single and dual constraints. The single constraint of bending stress and the dual constraints of bending and buckling stresses are imposed. From the movement response of the bar linkage mechanism, the analysis of the mechanism is developed using the combination of kinematics, kinetics, and finite element analysis (FEA). A penalty-based transformation technique is used to convert the constrained problem into an unconstrained one. Lastly, a detailed comparison on the effect of single constraint and of dual constraints is presented.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.322-324
• /
• 2005

In this paper, we introduce the advanced Self-Organizing Fuzzy Polynomial Neural Network based on optimized FPN by evolutionary algorithm and discuss its comprehensive design methodology involving mechanisms of genetic optimization, especially genetic algorithms (GAs). The proposed model gives rise to a structurally and parametrically optimized network through an optimal parameters design available within Fuzzy Polynomial Neuron(FPN) by means of GA. Through the consecutive process of such structural and parametric optimization, an optimized and flexible the proposed model is generated in a dynamic fashion. The performance of the proposed model is quantified through experimentation that exploits standard data already used in fuzzy modeling. These results reveal superiority of the proposed networks over the existing fuzzy and neural models.