A Continuous Protein Design Model Using Artificial Power Law in Topology Optimization

2009 ◽  
Vol 131 (4) ◽  
Author(s):  
Sung K. Koh ◽  
Guangjun Liu ◽  
Wen-Hong Zhu

A continuous protein synthesis formulation based on the design principles applied to topology optimization problems is proposed in this paper. In contrast to conventional continuous protein design methods, the power law (PL) protein design formulation proposed in this paper can handle any number of residue types to accomplish the goal of protein synthesis, and hence provides a general continuous formulation for protein synthesis. Moreover, a discrete sequence with minimum energy can be determined by the PL design method as it inherits the feature of material penalization used in designing a structural topology. Since a continuous optimization method is implemented to solve the PL design formulation, the entire design process is more efficient and robust than conventional design methods employing stochastic or enumerative search methods. The performance of the proposed PL design formulation is explored by designing simple lattice protein models, for which an exhaustive search can be carried out to identify a sequence with minimum energy. We used residue probabilities as an initial guess for the design optimization to enhance the capability and efficiency of the PL design formulation. The comparison with the exchange replica method indicates that the PL design method is millions of times more efficient than the conventional stochastic protein design method.

Author(s):  
Sung Koh ◽  
Gunagjun Liu ◽  
Wen-Hong Zhu

A continuous protein synthesis formulation based on the design principles developed for structural topology optimization is proposed in this paper. Unlike conventional continuous protein design methods, the Power Law-based (PL) design formulation proposed in this paper enables using any number of residue types to accomplish the goal of protein synthesis and hence provides a continuous protein design formulation applicable to any general protein design problems. Moreover, a discrete sequence with minimum energy can be synthesized by the PL design method as it inherits the feature of material penalization used for the topology optimization. Since a continuous optimization method is implemented to solve the PL design formulation, the entire design process is more efficient and robust than the conventional design methods employing a stochastic or enumerative search process. The performance of the PL design formulation is demonstrated by designing simple lattice protein models for which an exhaustive search can be carried out to identify the sequence with minimum energy. The comparison with the exchange replica method indicates that the PL design method is millions of times more efficient than the conventional stochastic protein design method.


Author(s):  
Mads Baandrup ◽  
Ole Sigmund ◽  
Niels Aage

<p>This work applies a ultra large scale topology optimization method to study the optimal structure of bridge girders in cable supported bridges.</p><p>The current classic orthotropic box girder designs are limited in further development and optimiza­ tion, and suffer from substantial fatigue issues. A great disadvantage of the orthotropic girder is the loads being carried one direction at a time, thus creating stress hot spots and fatigue problems. Hence, a new design concept has the potential to solve many of the limitations in the current state­ of-the-art.</p><p>We present a design method based on ultra large scale topology optimization. The highly detailed structures and fine mesh-discretization permitted by ultra large scale topology optimization reveal new design features and previously unseen eff ects. The results demonstrate the potential of gener­ ating completely different design solutions for bridge girders in cable supported bridges, which dif­ fer significantly from the classic orthotropic box girders.</p><p>The overall goal of the presented work is to identify new and innovative, but at the same time con­ structible and economically reasonable, solutions tobe implemented into the design of future cable supported bridges.</p>


Author(s):  
Kuang-Wu Chou ◽  
Chang-Wei Huang

This study proposes a new element-based method to solve structural topology optimization problems with non-uniform meshes. The objective function is to minimize the compliance of a structure, subject to a volume constraint. For a structure of a fixed volume, the method is intended to find a topology that could almost conform to the compliance minimum. The method is refined from the evolutionary switching method, whose policy of exchanging elements is improved by replacing some empirical decisions with ones according to optimization theories. The method has the evolutionary stage and the element exchange stage to conduct topology optimization. The evolutionary stage uses the evolutionary structural optimization method to remove inefficient elements until the volume constraint is satisfied. The element exchange stage performs a procedure refined from the element exchange method. Notably, the procedures of both stages are refined to conduct non-uniform finite element meshes. The proposed method was implemented to use the Abaqus Python scripting interface to call the services of Abaqus such as running analysis and retrieving the output database of an analysis. Numerical examples demonstrate that the proposed optimization method could determine the optimal topology of a structure that is subject to a volume constraint and whose mesh is non-uniform.


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Yue Wu ◽  
Qingpeng Li ◽  
Qingjie Hu ◽  
Andrew Borgart

Firefly Algorithm (FA, for short) is inspired by the social behavior of fireflies and their phenomenon of bioluminescent communication. Based on the fundamentals of FA, two improved strategies are proposed to conduct size and topology optimization for trusses with discrete design variables. Firstly, development of structural topology optimization method and the basic principle of standard FA are introduced in detail. Then, in order to apply the algorithm to optimization problems with discrete variables, the initial positions of fireflies and the position updating formula are discretized. By embedding the random-weight and enhancing the attractiveness, the performance of this algorithm is improved, and thus an Improved Firefly Algorithm (IFA, for short) is proposed. Furthermore, using size variables which are capable of including topology variables and size and topology optimization for trusses with discrete variables is formulated based on the Ground Structure Approach. The essential techniques of variable elastic modulus technology and geometric construction analysis are applied in the structural analysis process. Subsequently, an optimization method for the size and topological design of trusses based on the IFA is introduced. Finally, two numerical examples are shown to verify the feasibility and efficiency of the proposed method by comparing with different deterministic methods.


Author(s):  
Shamim Akhtar ◽  
Kang Tai ◽  
Jitendra Prasad

This paper describes an intuitive way of defining geometry design variables for solving structural topology optimization problems using an evolutionary algorithm (EA). The geometry representation scheme works by defining a skeleton which represents the underlying topology/connectivity of the continuum structure. As the effectiveness of any EA is highly dependent on the chromosome encoding of the design variables, the encoding used here is a graph which reflects this underlying topology so that the genetic crossover and mutation operators of the EA can recombine and preserve any desirable geometric characteristics through succeeding generations of the evolutionary process. The overall optimization procedure is applied to design a straight-line compliant mechanism : a large displacement flexural structure that generates a vertical straight line path at some point when given a horizontal straight line input displacement at another point.


2020 ◽  
Author(s):  
Hailu Shimels Gebremedhen ◽  
Dereje Engida Woldemichael ◽  
Fakhruldin Mohd Hashim

Abstract In this paper a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability of generating connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. Lower and upper limit of design variables (0 and 1) were used to find initial material distribution to initialize firefly algorithm based section of the hybrid algorithm. Input parameters, number of fireflies and number function evaluations were determined before implementation of firefly algorithm to solve formulated problems. Since direct application of firefly algorithm cannot generate connected topologies, outputs from firefly algorithm were used as an initial input material distribution for OC method. The proposed method was validated using two-dimensional benchmark problems and the results were compared with results using OC method. Weight percentage reduction, maximum stress induced, optimal material distribution and compliance were used to compare results. Results from the proposed method showed that the proposed method can generate connected topologies and generated topologies are free from interference of end users, which only dependence on boundary conditions or the design variables. From the results, the objective function (weight of the design domain) can be further reduced in the range of 5% to 15% compared to OC method.


2020 ◽  
Author(s):  
Hailu Shimels Gebremedhen ◽  
Dereje Engida Woldemichael ◽  
Fakhruldin Mohd Hashim

Abstract In this paper, a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability to generate connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. The lower and upper limit of design variables (0 and 1) were used to find initial material distribution to initialize the firefly algorithm based section of the hybrid algorithm. Input parameters, the number of fireflies, and number function evaluations were determined before the implementation of the firefly algorithm to solve formulated problems. Since the direct application of the firefly algorithm cannot generate connected topologies, outputs from the firefly algorithm were used as an initial input material distribution for the OC method. The proposed method was validated using two-dimensional benchmark problems and the results were compared with results using the OC method. Weight percentage reduction, maximum stress-induced, optimal material distribution, and compliance were used to compare results. Results from the proposed method showed that the proposed method can generate connected topologies and generated topologies are free from the interference of end-users, which only dependence on boundary conditions or the design variables. From the results, the objective function (weight of the design domain) can be further reduced in the range of 5% to 15% compared to the OC method.


2020 ◽  
Author(s):  
Hailu Shimels Gebremedhen ◽  
Dereje Engida Woldemichael ◽  
Fakhruldin Mohd Hashim

Abstract In this paper, a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability to generate connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. The lower and upper limit of design variables (0 and 1) were used to find initial material distribution to initialize the firefly algorithm based section of the hybrid algorithm. Input parameters, the number of fireflies, and the number of function evaluations were determined before the implementation of the firefly algorithm to solve formulated problems. Since the direct application of the firefly algorithm cannot generate connected topologies, outputs from the firefly algorithm were used as an initial input material distribution for the OC method. The proposed method was validated using two-dimensional benchmark problems and the results were compared with results using the OC method. Weight percentage reduction, maximum stress-induced, optimal material distribution, and compliance were used to compare results. Results from the proposed method showed that the proposed method can generate connected topologies which are free from the interference of end-users, and only depend on boundary conditions or design variables. From the results, the objective function (weight of the design domain) can be further reduced in the range of 5% to 15% compared to the OC method.


2020 ◽  
Vol 10 (4) ◽  
pp. 1481 ◽  
Author(s):  
Abdulkhaliq A. Jaafer ◽  
Mustafa Al-Bazoon ◽  
Abbas O. Dawood

In this study, the binary bat algorithm (BBA) for structural topology optimization is implemented. The problem is to find the stiffest structure using a certain amount of material and some constraints using the bit-array representation method. A new filtering algorithm is proposed to make BBA find designs with no separated objects, no checkerboard patterns, less unusable material, and higher structural performance. A volition penalty function for topology optimization is also proposed to accelerate the convergence toward the optimal design. The main effect of using the BBA lies in the fact that the BBA is able to handle a large number of design variables in comparison with other well-known metaheuristic algorithms. Based on the numerical results of four benchmark problems in structural topology optimization for minimum compliance, the following conclusions are made: (1) The BBA with the proposed filtering algorithm and penalty function are effective in solving large-scale numerical topology optimization problems (fine finite elements mesh). (2) The proposed algorithm produces solid-void designs without gray areas, which makes them practical solutions that are applicable in manufacturing.


Author(s):  
K-Y Tseng ◽  
C-B Zhang ◽  
C-Y Wu

Particle swarm optimization (PSO), a heuristic optimization method, has been successfully applied in solving many optimization problems in real-value search space. The original binary particle swarm optimization (BPSO) uses the concept of bit flipping of the binary string to convert the velocity from a real code into a binary code. However, the conversion process cannot be reversed, and it is difficult to extend this framework to solve certain discrete optimization problems. An enhanced binary particle swarm algorithm is proposed in this study based on pure binary bit-string frameworks to deal with structural topology optimization problems. Further, two enhancement strategies, stress-based strategy and pair-switched strategy, were developed to improve the performance of the proposed algorithm for topology optimization of structure. The results of experimental cases demonstrated in this study show that the proposed enhanced binary particle swarm optimization (EBPSO) with two developed strategies is an efficient population-based approach for finding the optimal design for structural topology optimization problems of minimum compliance design and minimum weight design.


Sign in / Sign up

Export Citation Format

Share Document