Stress-based binary differential evolution for topology optimization of structures

2010 ◽  
Vol 224 (2) ◽  
pp. 443-457 ◽  
Author(s):  
C-Y Wu ◽  
K-Y Tseng
Keyword(s):  
Topology Optimization ◽  
Differential Evolution ◽  
Optimization Problems ◽  
Search Space ◽  
Optimization Method ◽  
Optimal Topology ◽  
Combinatorial Optimization Problems ◽  
Point Representation ◽  
Mutation Mechanism ◽  
Binary Differential Evolution

Differential evolution (DE) is a heuristic optimization method used to solve many optimization problems in real-value search space. It has the advantage of incorporating a relatively simple and efficient form of mutation and crossover. However, the operator of DE is based on floating-point representation only, and is difficult to use in solving combinatorial optimization problems. In this article, a modified binary DE is developed using binary bit-string frameworks with a logical operation binary mutation mechanism. Further, a new stress-based binary mutation mechanism is also proposed to drive the binary DE search towards the optimal topology of the structure with higher performance and fewer objective function evaluations. The numerical results show that the performance of the proposed algorithm using stress-based binary mutation has high capability and efficiency in topology optimization of the structure.

A NEW ELEMENT-BASED METHOD FOR SOLVING STRUCTURAL TOPOLOGY OPTIMIZATION PROBLEMS WITH NON-UNIFORM MESHES

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Kuang-Wu Chou ◽  
Chang-Wei Huang
Keyword(s):  
Topology Optimization ◽  
Optimization Problems ◽  
Optimization Method ◽  
Optimal Topology ◽  
Evolutionary Stage ◽  
Structural Topology Optimization ◽  
Volume Constraint ◽  
Structural Topology ◽  
Exchange Method ◽  
Python Scripting

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.

scholarly journals Dichotomous Binary Differential Evolution for Knapsack Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Hu Peng ◽  
Zhijian Wu ◽  
Peng Shao ◽  
Changshou Deng
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
State Of The Art ◽  
Experimental Studies ◽  
Continuous Optimization ◽  
Knapsack Problems ◽  
Binary Particle Swarm Optimization ◽  
Combinatorial Optimization Problems ◽  
Multidimensional Knapsack ◽  
Binary Differential Evolution

Differential evolution (DE) is one of the most popular and powerful evolutionary algorithms for the real-parameter global continuous optimization problems. However, how to adapt into combinatorial optimization problems without sacrificing the original evolution mechanism of DE is harder work to the researchers to design an efficient binary differential evolution (BDE). To tackle this problem, this paper presents a novel BDE based on dichotomous mechanism for knapsack problems, called DBDE, in which two new proposed methods (i.e., dichotomous mutation and dichotomous crossover) are employed. DBDE almost has any difference with original DE and no additional module or computation has been introduced. The experimental studies have been conducted on a suite of 0-1 knapsack problems and multidimensional knapsack problems. Experimental results have verified the quality and effectiveness of DBDE. Comparison with three state-of-the-art BDE variants and other two state-of-the-art binary particle swarm optimization (PSO) algorithms has proved that DBDE is a new competitive algorithm.

scholarly journals Designation of Candidate Solutions in Differential Evolution Based on Bandit Algorithm and its Evaluation

2019 ◽  
Vol 23 (4) ◽  
pp. 758-766
Author(s):  
Masaya Sakakibara ◽  
◽  
Akira Notsu ◽  
Seiki Ubukata ◽  
Katsuhiro Honda
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Random Search ◽  
Optimal Solution ◽  
Search Space ◽  
Optimization Method ◽  
Local Solution ◽  
Search Speed ◽  
Mathematical Programming Problems

We propose UCT-Grid Area Search (UCT-GAS), which is an efficient optimization method that roughly estimates specific values in areas, and consider exploration and exploitation in optimization problems. This approach divides the search space and imagines it to be a multi-armed bandit, which enables us to use bandit algorithms to solve mathematical programming problems. Although the search speed is fast than other search algorithm like differential evolution, it might converge to a local solution. In this study, we improve this algorithm by replacing its random search part with differential evolution after several searches. Comparative experiments confirmed the search ability of the optimal solution, and our method benefits by showing that it avoids falling into a local solution and that its search speed is fast.

A New Differential Evolution Based Metaheuristic for Discrete Optimization

2010 ◽  
Vol 1 (2) ◽  
pp. 15-32 ◽  
Author(s):  
Ricardo Sérgio Prado ◽  
Rodrigo César Pedrosa Silva ◽  
Frederico Gadelha Guimarães ◽  
Oriane Magela Neto
Keyword(s):  
Combinatorial Optimization ◽  
Differential Evolution ◽  
Discrete Optimization ◽  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
Search Space ◽  
Combinatorial Problems ◽  
Combinatorial Optimization Problems ◽  
De Algorithm ◽  
The Difference

The Differential Evolution (DE) algorithm is an important and powerful evolutionary optimizer in the context of continuous numerical optimization. Recently, some authors have proposed adaptations of its differential mutation mechanism to deal with combinatorial optimization, in particular permutation-based integer combinatorial problems. In this paper, the authors propose a novel and general DE-based metaheuristic that preserves its interesting search mechanism for discrete domains by defining the difference between two candidate solutions as a list of movements in the search space. In this way, the authors produce a more meaningful and general differential mutation for the context of combinatorial optimization problems. The movements in the list can then be applied to other candidate solutions in the population as required by the differential mutation operator. This paper presents results on instances of the Travelling Salesman Problem (TSP) and the N-Queen Problem (NQP) that suggest the adequacy of the proposed approach for adapting the differential mutation to discrete optimization.

scholarly journals Differential Evolution with Population and Strategy Parameter Adaptation

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
V. Gonuguntla ◽  
R. Mallipeddi ◽  
Kalyana C. Veluvolu
Keyword(s):  
Differential Evolution ◽  
Population Size ◽  
Optimization Problems ◽  
Search Space ◽  
Benchmark Problems ◽  
Parameter Adaptation ◽  
De Algorithm ◽  
Probabilistic Technique ◽  
Number Of Individuals ◽  
Strategy Parameters

Differential evolution (DE) is simple and effective in solving numerous real-world global optimization problems. However, its effectiveness critically depends on the appropriate setting of population size and strategy parameters. Therefore, to obtain optimal performance the time-consuming preliminary tuning of parameters is needed. Recently, different strategy parameter adaptation techniques, which can automatically update the parameters to appropriate values to suit the characteristics of optimization problems, have been proposed. However, most of the works do not control the adaptation of the population size. In addition, they try to adapt each strategy parameters individually but do not take into account the interaction between the parameters that are being adapted. In this paper, we introduce a DE algorithm where both strategy parameters are self-adapted taking into account the parameter dependencies by means of a multivariate probabilistic technique based on Gaussian Adaptation working on the parameter space. In addition, the proposed DE algorithm starts by sampling a huge number of sample solutions in the search space and in each generation a constant number of individuals from huge sample set are adaptively selected to form the population that evolves. The proposed algorithm is evaluated on 14 benchmark problems of CEC 2005 with different dimensionality.

scholarly journals Ls-II: An Improved Locust Search Algorithm for Solving Optimization Problems

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Octavio Camarena ◽  
Erik Cuevas ◽  
Marco Pérez-Cisneros ◽  
Fernando Fausto ◽  
Adrián González ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Search Algorithm ◽  
Search Space ◽  
Optimization Method ◽  
Superior Performance ◽  
Solution Quality ◽  
Original Algorithm ◽  
Motion Models ◽  
Search Mechanism ◽  
Solitary Phase

The Locust Search (LS) algorithm is a swarm-based optimization method inspired in the natural behavior of the desert locust. LS considers the inclusion of two distinctive nature-inspired search mechanism, namely, their solitary phase and social phase operators. These interesting search schemes allow LS to overcome some of the difficulties that commonly affect other similar methods, such as premature convergence and the lack of diversity on solutions. Recently, computer vision experiments in insect tracking methods have conducted to the development of more accurate locust motion models than those produced by simple behavior observations. The most distinctive characteristic of such new models is the use of probabilities to emulate the locust decision process. In this paper, a modification to the original LS algorithm, referred to as LS-II, is proposed to better handle global optimization problems. In LS-II, the locust motion model of the original algorithm is modified incorporating the main characteristics of the new biological formulations. As a result, LS-II improves its original capacities of exploration and exploitation of the search space. In order to test its performance, the proposed LS-II method is compared against several the state-of-the-art evolutionary methods considering a set of benchmark functions and engineering problems. Experimental results demonstrate the superior performance of the proposed approach in terms of solution quality and robustness.

Space Contraction and Partition Algorithm for Combinatorial Optimization

2011 ◽  
Vol 421 ◽  
pp. 559-563
Author(s):  
Yong Chao Gao ◽  
Li Mei Liu ◽  
Heng Qian ◽  
Ding Wang
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Solution Space ◽  
Search Space ◽  
Small Scale ◽  
Optimal Solutions ◽  
Solution Quality ◽  
Intelligent Algorithms ◽  
Combinatorial Optimization Problems

The scale and complexity of search space are important factors deciding the solving difficulty of an optimization problem. The information of solution space may lead searching to optimal solutions. Based on this, an algorithm for combinatorial optimization is proposed. This algorithm makes use of the good solutions found by intelligent algorithms, contracts the search space and partitions it into one or several optimal regions by backbones of combinatorial optimization solutions. And optimization of small-scale problems is carried out in optimal regions. Statistical analysis is not necessary before or through the solving process in this algorithm, and solution information is used to estimate the landscape of search space, which enhances the speed of solving and solution quality. The algorithm breaks a new path for solving combinatorial optimization problems, and the results of experiments also testify its efficiency.

Optimization of Antenna Design Problems Using Binary Differential Evolution

2018 ◽  
pp. 614-636
Author(s):  
Sotirios K. Goudos
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Phase Shifters ◽  
Antenna Design ◽  
Design Problems ◽  
Array Design ◽  
Search Spaces ◽  
De Algorithm ◽  
Discrete Phase ◽  
Binary Differential Evolution

Differential Evolution (DE) is a popular evolutionary algorithm that has been applied to several antenna design problems. However, DE is best suited for continuous search spaces. Therefore, in order to apply it to combinatorial optimization problems for antenna design a binary version of the DE algorithm has to be used. In this chapter, the author presents a design technique based on Novel Binary DE (NBDE). The main benefit of NBDE is reserving the DE updating strategy to binary space. This chapter presents results from design cases that include array thinning, phased array design with discrete phase shifters, and conformal array design with discrete excitations based on NBDE.

Centroid Opposition-Based Differential Evolution

2014 ◽  
Vol 5 (4) ◽  
pp. 1-25 ◽  
Author(s):  
Shahryar Rahnamayan ◽  
Jude Jesuthasan ◽  
Farid Bourennani ◽  
Greg F. Naterer ◽  
Hojjat Salehinejad
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Extreme Points ◽  
Search Space ◽  
Population Based ◽  
Effective Population ◽  
Centroid Point ◽  
Opposite Point ◽  
Novel Concept ◽  
Multiple Variants

The capabilities of evolutionary algorithms (EAs) in solving nonlinear and non-convex optimization problems are significant. Differential evolution (DE) is an effective population-based EA, which has emerged as very competitive. Since its inception in 1995, multiple variants of DE have been proposed with higher performance. Among these DE variants, opposition-based differential evolution (ODE) established a novel concept in which individuals must compete with theirs opposites in order to make an entry in the next generation. The generation of opposite points is based on the current extreme points (i.e., maximum and minimum) in the search space. This paper develops a new scheme that utilizes the centroid point of a population to calculate opposite individuals. The classical scheme of an opposite point is modified. Incorporating this new scheme into DE leads to an enhanced ODE that is identified as centroid opposition-based differential evolution (CODE). The accuracy of the CODE algorithm is comprehensively evaluated on well-known complex benchmark functions and compared with the performance of conventional DE, ODE, and other state-of-the-art algorithms. The results for CODE are found to be promising.

Sign in / Sign up

Export Citation Format

Share Document