Optimal Structural Elements Sizing Using Neural Network and Adaptive Differential Algorithm

Optimal Structural Elements Sizing Using Neural Network and Adaptive Differential Algorithm

Wonsiri Punurai (Mahidol University, Thailand) and Nantiwat Pholdee (Khon Kaen University, Thailand)
DOI: 10.4018/978-1-5225-2990-3.ch005
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Engineering design is one of many disciplines involving optimization problems. This chapter will introduce differential evolution (DE), as well as educate readers on an efficient adaptive differential evolution algorithm (ADEA). The ADEA is considered an effective method for complex structural optimization problems such as truss structures. First, the chapter will provide an overview on the DE and ADEA concepts. Using illustrative examples, the chapter will provide the reader with a methodology used to perform 2D and 3D truss sizing optimization. The remainder of the chapter will discuss the computational aspect of neural network assisted adaptive differential algorithm for truss optimization design. Future work can show the benefits of this adaptation to accelerate the convergence speed while using fewer structural analyses than those required by other methods.
Chapter Preview
Top

Introduction

Optimization is one of three specific core concepts in the engineering design process. By applying appropriate design constraints and criteria, results found in the optimization process help the designer deliver valuable preliminary conclusions. These conclusions lead to positive solutions while avoiding repetitive evaluation of a trial and error design.

Over the past several decades, many optimization techniques have been developed (Dieu Ngoc & Peter, 2013); Erol & Eksin, 2006; Geem, Kim, & Loganathan, 2001; Hindriyanto Dwi & Hui-Ming, 2014; Hossein & Fatemeh, 2016; Imran, Pandian, Balbir Singh Mahinder & Abdullah-Al-Wadud, 2016; Jia, Wang, Cai, & Jin, 2013; Karaboga & Basturk, 2007; Kaveh & Talatahari, 2010; Khatib & Fleming, 1998; Rao, Savsani, & Vakharia, 2011; Rashedi, Nezamabadi-pour, & Saryazdi, 2009; Socha & Dorigo, 2008; Storn & Price, 1997; Sotirios, Katherine& John, 2016; Tan & Zhu, 2010; Teh & Rangaiah, 2003; Venter & Sobieszczanski-Sobieski, 2003; Yang & Deb, 2010; Yang & Gandomi, 2012). Mathematical programming (MP) and optimality criteria (OC) are two of the earliest methods. Some of these classical methods rely on gradient information (i.e., derivative of the objective function, with respect to design variables). These have potential drawbacks, including trapping in local optimum and requiring high computational effort. Metaheuristic and evolutionary algorithms are more recent and efficient. These latter approaches are experience-based optimization (sometimes called population-based). The methods have no requirement for a differentiable or continuous objective function. Additionally, they make little or no assumptions about the problem being optimized and have global search capability of feasible candidate solutions. The best-known names of these methods include: genetic algorithm (GA) (Holland, 1975); DE (Storn & Price, 1997); particle swarm optimization (PSO) (Venter & Sobieszczanski-Sobieski, 2003); ant colony optimization (ACO) (Socha & Dorigo, 2008); tabu search (TS) (Teh & Rangaiah, 2003); and simulated annealing (SA) (Hwang, 1988).

The GA was introduced by Holland in the 1970s (Holland, 1975) and further applied by Goldberg in the 1980s (Goldberg, 1983; Goldberg & Holland, 1988; Goldberg, Korb, & Deb, 1989). The GA principle is based on Darwin’s theory of evolution. In the GA scheme, an initial set of possible solutions is randomly created in the form of binary strings. Each string represents one feasible solution to the problem being solved. The solution strings are converted into decimal equivalents and evaluated on their fitness through the inverse of the cost function. Next, the natural random processes of crossover, mutation, and selection take place to form the next generation of solution strings. These operations repeat; the algorithm is geared toward maximizing the fitness function parameter. The algorithm is stopped when the average fitness of the population exceeds some fraction of the best fit in the population.

Key Terms in this Chapter

Strategy Adaptation: A strategy or equation in an optimization process which is iteratively changed.

Parameter Adaptation: A parameter in an optimization process which is iteratively changed.

Truss: A two force member structure.

Global Numerical Optimization: A multi modal design problem post to find a set of design variable lead to minimize or maximize objective function subjected to constraints.

Differential Evolution: A non-gradient based optimization method.

Complete Chapter List

Search this Book:
Reset