7/25/2019 !!!bat algo

1/30

Engineering ComputationsBat algorithm: a novel approach for global engineering optimization

Xin-She Yang Amir Hossein GandomiArticle in format ion:

To cite this document:Xin-She Yang Amir Hossein Gandomi, (2012),"Bat algorithm: a novel approach for global engineeringoptimization", Engineering Computations, Vol. 29 Iss 5 pp. 464 - 483Permanent link to this document:http://dx.doi.org/10.1108/02644401211235834

Downloaded on: 03 February 2016, At: 04:40 (PT)

References: this document contains references to 50 other documents.

To copy this document: permissions@emeraldinsight.com

The fulltext of this document has been downloaded 1455 times since 2012*

Users who downloaded this article also downloaded:

Gai-Ge Wang, Amir Hossein Gandomi, Xin-She Yang, Amir Hossein Alavi, (2014),"A novel improvedaccelerated particle swarm optimization algorithm for global numerical optimization", EngineeringComputations, Vol. 31 Iss 7 pp. 1198-1220 http://dx.doi.org/10.1108/EC-10-2012-0232

Sergio Rodolfo Idelsohn, Norberto Marcelo Nigro, Juan Marcelo Gimenez, Riccardo Rossi, Julio MarceloMarti, (2013),"A fast and accurate method to solve the incompressible Navier-Stokes equations",Engineering Computations, Vol. 30 Iss 2 pp. 197-222 http://dx.doi.org/10.1108/02644401311304854

Amir Hossein Alavi, Amir Hossein Gandomi, (2011),"A robust data mining approach for formulationof geotechnical engineering systems", Engineering Computations, Vol. 28 Iss 3 pp. 242-274 http://dx.doi.org/10.1108/02644401111118132

Access to this document was granted through an Emerald subscription provided by emerald-srm:393177 [

For Authors

If you would like to write for this, or any other Emerald publication, then please use our Emerald forAuthors service information about how to choose which publication to write for and submission guideline

are available for all. Please visit www.emeraldinsight.com/authors for more information.About Emerald www.emeraldinsight .com

Emerald is a global publisher linking research and practice to the benefit of society. The companymanages a portfolio of more than 290 journals and over 2,350 books and book series volumes, as well asproviding an extensive range of online products and additional customer resources and services.

Emerald is both COUNTER 4 and TRANSFER compliant. The organization is a partner of the Committeeon Publication Ethics (COPE) and also works with Portico and the LOCKSS initiative for digital archivepreservation.

http://dx.doi.org/10.1108/02644401211235834http://dx.doi.org/10.1108/02644401211235834

7/25/2019 !!!bat algo

2/30

*Related content and download information correct at time of download.

7/25/2019 !!!bat algo

3/30

Bat algorithm: a novel approachfor global engineering

optimizationXin-She Yang

Mathematics and Scientific Computing, National Physical Laboratory,Teddington, UK, and

Amir Hossein GandomiDepartment of Civil Engineering, Tafresh University, Tafresh, Iran

Abstract

Purpose Nature-inspired algorithms are among the most powerful algorithms for optimization.

The purpose of this paper is to introduce a new nature-inspired metaheuristic optimization algorithm,called bat algorithm (BA), for solving engineering optimization tasks.

Design/methodology/approach The proposed BA is based on the echolocation behavior of bats.After a detailed formulation and explanation of its implementation, BA is verified using eightnonlinear engineering optimization problems reported in the specialized literature.

Findings BA has been carefully implemented and carried out optimization for eight well-knownoptimization tasks; then a comparison has been made between the proposed algorithm and otherexisting algorithms.

Originality/value The optimal solutions obtained by the proposed algorithm are better than thebest solutions obtained by the existing methods. The unique search features used in BA are analyzed,and their implications for future research are also discussed in detail.

KeywordsIterative methods, Programming and algorithm theory, Optimization techniques,Bat algorithm, Engineering optimization, Metaheuristic algorithm

Paper typeResearch paper

1. IntroductionDesign optimization forms an important part of any design problem in engineering andindustry. Structural design optimization focuses on finding the optimal and practicalsolutions to complex structural design problems under dynamic complex loadingpattern with complex nonlinear constraints. These constraints often involve thousandsof and even millions of members with stringent limitations on stress, geometry as wellas loading and service requirements. The aim is not only to minimize the cost andmaterials usage, but also to maximize their performance and lifetime service. All thesedesigns are of scientific and practical importance (Deb, 1995; Yang, 2010). However,

most structural design optimization problems are highly nonlinear and multimodal withnoise, and thus they are often NP-hard. Finding the right and practically efficientalgorithms are usually difficult, if not impossible. In realistic, the choice of an algorithmrequires extensive experience and knowledge of the problem of interest. Even so, there isno guarantee that an optimal or even suboptimal solution can be found.

The current issue and full text archive of this journal is available at

www.emeraldinsight.com/0264-4401.htm

Amir Hossein Gandomi is now based in the Department of Civil Engineering, The University ofAkron, Akron, Ohio, USA.

EC29,5

464

Received 28 April 2011Revised 5 August 2011Accepted 11 August 2011

Engineering Computations:

International Journal for

Computer-Aided Engineering and

Software

Vol. 29 No. 5, 2012

pp. 464-483

q Emerald Group Publishing Limited

0264-4401

DOI 10.1108/02644401211235834

7/25/2019 !!!bat algo

4/30

Metaheuristic algorithms including evolutionary and swarm intelligence algorithmsare now becoming powerful methods for solving many tough problems (Gandomi andAlavi, 2011) and especially real-world engineering problems (Gandomi et al., 2011;Alavi and Gandomi, 2011). The vast majority of heuristic and metaheuristic algorithms

have been derived from the behavior of biological systems and/or physical systems innature. For example, particle swarm optimization was developed based on the swarmbehavior of birds and fish (Kennedy and Eberhart, 1995) or charged system searchinspired from physical processes (Kaveh and Talatahari, 2010). New algorithms are alsoemerging recently, including harmony search (HS) and the firefly algorithm. The formerwas inspired by the improvising process of composing a piece of music (Geem et al.,2001), while the latter was formulated based on the flashing behavior of fireflies(Yang, 2008). Each of these algorithms has certain advantages and disadvantages. Forexample, simulating annealing (Kirkpatrick et al., 1983) can almost guarantee to find theoptimal solution if the cooling process is slow enough and the simulation is running longenough; however, the fine adjustment in parameters does affect the convergence rate ofthe optimization process. A natural question is whether it is possible to combine majoradvantages of these algorithms and try to develop a potentially better algorithm?

This paper is such an attempt to address this issue. In this paper, we intend to proposea new metaheuristic method, namely, the bat algorithm (BA), based on the echolocationbehavior of bats, and preliminary studies show that this algorithm is very promising(Yang, 2010). The capability of echolocation of microbats is fascinating as these bats canfind their prey and discriminate different types of insects even in complete darkness. Wewill first formulate the BA by idealizing the echolocation behavior of bats. We thendescribe how it works and make comparison with other existing algorithms. Finally, wewill discuss some implications for further studies.

2. Echolocation of microbats

Bats are fascinating animals. They are the only mammals with wings and they also haveadvanced capability of echolocation. It is estimated that there are about 1,000 differentspecies which account for up to about one-fifth of all mammal species (Altringham,1996). Their size ranges from the tiny bumblebee bat (of about 1.5-2 g) to the giant batswith wingspan of about 2 m and weight up to about 1 kg. Microbats typically haveforearm length of about 2.2-11 cm. Most bats uses echolocation to a certain degree;among all the species, microbats are a famous example as microbats use echolocationextensively while megabats do not (Richardson, 2008).

Most microbats are insectivores. Microbats use a type of sonar, called, echolocation,to detect prey, avoid obstacles, and locate their roosting crevices in the dark. These batsemit a very loud sound pulse and listen for the echo that bounces back from thesurrounding objects. Their pulses vary in properties and can be correlated with their

hunting strategies, depending on the species. Most bats use short, frequency-modulatedsignals to sweep through about an octave, while others more often useconstant-frequency signals for echolocation. Their signal bandwidth varies dependson the species, and often increased by using more harmonics.

Though each pulse only lasts a few thousandths of a second (up to about 8-10 ms);however, it has a constant frequency which is usually in the region of 25-150 kHz. Thetypical range of frequencies for most bat species are in the region between 25 and100 kHz, though some species can emit higher frequencies up to 150 kHz. Each ultrasonic

Bat algorithm

465

7/25/2019 !!!bat algo

5/30

burst may last typically 5-20 ms, and microbats emit about 10-20 such sound burstsevery second. When hunting for prey, the rate of pulse emission can be sped up to about200 pulses per second when they fly near their prey. Such short sound bursts implythe fantastic ability of the signal processing power of bats. In fact, studies show the

integration time of the bat ear is typically about 300-400 ms.As the speed of sound in air is typically v 340 m/s, the wavelength l of the

ultrasonic sound bursts with a constant frequency f is given by lv/f, which is in therange of 2-14 mm for the typical frequency range from 25 to 150 kHz. Suchwavelengths are in the same order of their prey sizes.

Amazingly, the emitted pulse could be as loud as 110 dB, and, fortunately, they arein the ultrasonic region. The loudness also varies from the loudest when searching forprey and to a quieter base when homing towards the prey. The travelling range of suchshort pulses is typically a few meters, depending on the actual frequencies (Richardson,2008). Microbats can manage to avoid obstacles as small as thin human hairs.

Studies show that microbats use the time delay from the emission and detection ofthe echo, the time difference between their two ears, and the loudness variations of the

echoes to build up three dimensional scenario of the surrounding. They can detect thedistance and orientation of the target, the type of prey, and even the moving speed ofthe prey such as small insects. Indeed, studies suggested that bats seem to be able todiscriminate targets by the variations of the Doppler effect induced by the wing-flutterrates of the target insects (Altringham, 1996).

Obviously, some bats have good eyesight, and most bats also have very sensitivesmell sense. In reality, they will use all the senses as a combination to maximize theefficient detection of prey and smooth navigation. However, here we are only interestedin the echolocation and the associated behavior.

Such echolocation behavior of microbats can be formulated in such a way that it canbe associated with the objective function to be optimized, and this makes it possible toformulate new optimization algorithms. In the rest of this paper, we will first outline thebasic formulation of the BA and then discuss the implementation and comparison indetail.

3. Bat algorithmIf we idealize some of the echolocation characteristics of microbats, we can developvarious bat-inspired algorithms or BAs. For simplicity, we now use the followingapproximate or idealized rules:

. All bats use echolocation to sense distance, and they also know the differencebetween food/prey and background barriers in some magical way.

. Bats fly randomly with velocity vi at position xiwith a fixed frequency fmin,varying wavelength l and loudness A0 to search for prey. They can

automatically adjust the wavelength (or frequency) of their emitted pulses andadjust the rate of pulse emission r in the range of [0, 1], depending on theproximity of their target.

. Although the loudness can vary in many ways, we assume that the loudnessvaries from a large (positive) A0to a minimum constant value Amin.

Another obvious simplification is that no ray tracing is used in estimating the timedelay and three dimensional topography. Though this might be a good feature for the

EC29,5

466

7/25/2019 !!!bat algo

6/30

application in computational geometry, however, we will not use this feature, as it ismore computationally extensive in multidimensional cases.

In addition to these simplified assumptions, we also use the followingapproximations, for simplicity. In general the frequency f in a range [fmin, fmax]

corresponds to a range of wavelengths [lmin,lmax]. For example, a frequency range of[20, 500 kHz] corresponds to a range of wavelengths from 0.7 to 17 mm.

For a given problem, we can also use any wavelength for the ease of implementation.In the actual implementation, we can adjust the range by adjusting the wavelengths(or frequencies), and the detectable range (or the largest wavelength) should be chosensuch that it is comparable to the size of the domain of interest, and then toning down tosmaller ranges. Furthermore, we do not necessarily have to use the wavelengthsthemselves; instead, we can also vary the frequency while fixing the wavelengthl. Thisis becausel andfare related due to the factlfis constant. We will use this later approachin our implementation.

For simplicity, we can assume f is within [0,fmax]. We know that higher frequencieshave short wavelengths and travel a shorter distance. For bats, the typical ranges are a

few meters. The rate of pulse can simply be in the range of [0, 1] where 0 means nopulses at all, and 1 means the maximum rate of pulse emission.

Based on these approximations and idealization, the basic steps of the BA can besummarized as the pseudo code shown in Figure 1.

3.1 Velocity and position vectors of virtual batsIn simulations, we use virtual bats naturally. We have to define the rules how theirpositions xiand velocities vi in a d-dimensional search space are updated. The newsolutions xt

i and velocities vt

iat time step tare given by:

fi fmin fmax 2fminb 1

vt

i5 vt21i 1 x

t

i2 x*fi 2

Figure 1.Pseudo code of the BA

Bat Algorithm

Objective function f (x), x = (x1, ...,xd)T

Initialize the bat population xi(i = 1,2,...,n)and viDefine pulse frequency fi at xiInitialize pulse rates riand the loudness Aiwhile (t < Max number of iterations)

Generate new solutions by adjusting frequency,

and updating velocities and locations/ solutions [equations (1)to (3)]

if (rand

7/25/2019 !!!bat algo

7/30

xt

i5 x

t21i 1 v

t

i 3

whereb[ [0, 1] is a random vector drawn from a uniform distribution. Here x*is thecurrent globalbest location (solution) which is located after comparing all the solutions

among all the n bats. As the product lifiis the velocity increment, we can use eitherfi(or li) to adjust the velocity change while fixing the other factor li(or fi), dependingon the type of the problem of interest. In our implementation, we will use fmin0 andfmax100, depending the domain size of the problem of interest. Initially, each bat israndomly assigned a frequency that is drawn uniformly from [fmin, fmax].

For the local search part, once a solution is selected among the current bestsolutions, a new solution for each bat is generated locally using a local random walk:

xnew5 xold1 1At 4

where 1 [ [21, 1] is a random number, while At , Ati . is the average loudness ofall the bats at this time step.

The update of the velocities and positions of bats have some similarity to theprocedure in the standard particle swarm optimization (Geem etal., 2001) asfiessentiallycontrols the pace and range of the movement of the swarming particles. To a degree,BA can be considered as a balanced combination of the standard particle swarmoptimization and the intensive local search controlled by the loudness and pulse rate.

3.2 Variations of loudness and pulse emissionFurthermore, the loudness Ai and the rate ri of pulse emission have to be updatedaccordingly as the iterations proceed. As the loudness usually decreases once a bat hasfound its prey, while the rate of pulse emission increases, the loudness can be chosen asany value of convenience. For example, we can use A0100 and Amin1. Forsimplicity, we can also useA01 andAmin0, assumingAmin0 means that a bathas just found the prey and temporarily stop emitting any sound. Now we have:

At1i aAti; rt1i r0i1 2 exp2gt 5

where a and g are constants. In fact, a is similar to the cooling factor of a coolingschedule in the simulated annealing (Kirkpatrick et al., 1983; Yang, 2008). For any0 , a , 1, 0 , g, we have:

Ati ! 0; rti ! r

0i; as t!1 6

In the simplicity case, we can use ag, and we have in fact used ag0.9 in oursimulations. The choice of parameters requires some experimenting. Initially, each batshould have different valuesof loudness and pulse emission rate, and this can be achieved

by randomization. For example, the initial loudness A0ican typically be [1, 2], while theinitial emission rate r0

i can be around zero, or any value r0

i [ [0, 1] if using (equation (5)).

Their loudness and emission rates will be updated only if the new solutions are improved,which means that these bats are moving towards the optimal solution.

4. Non-linear engineering design tasksMost real-world engineering optimization problems are nonlinear with complexconstraints, sometimes the optimal solutions of interest do not even exist. In order to see

EC29,5

468

7/25/2019 !!!bat algo

8/30

how BA performs, we will now test it against some well-known, tough but yet diverse,benchmark design problems. We have chosen eight case studies as:

(1) mathematical problem;

(2) Himmelblaus problem;(3) three-bar truss design;

(4) speed reducer design;

(5) parameter identification of structures;

(6) cantilever stepped beam;

(7) heater exchanger design; and

(8) car side problem.

The reason for such choice is to provide a validation and test of the proposed BAagainst a diverse range of real-world engineering optimization problems. As we willsee below, for most problems, the optimal solutions obtained by BA are far better than

the best solutions reported in the literature. In all case studies, the statistical measureshave been obtained, based on 50 independent runs.

4.1 Case 1: mathematical problemNow let us start with a nonlinear mathematical benchmark problem. This problem hasbeen used as a benchmark constrained optimization problem with some activeinequality constraints (Chen and Vassiliadis, 2003). In this problem, Nis the number ofvariables and it is a multiple of four (N4n, n1, 2, 3, . . .). This problem has N/2inequality constraints and2Nsimple bounds or limits. The problem can be stated asfollows:

Minimize : fX XNi1

ffiffiipxi2 12 XN

i1x2i 2 25

" #2 7Subject to:

gjx4j2112x4j2123x4j2134x4j214 2 20 8

0 # gj # 30 and j1; 2; . . .;N

4 9

with simple bounds:

0:5 # xi# 10i1; 2; . . .N:For this problem, the global optimum and best known optimum for N12 andN60obtained by BA is given in Table I. It can clearly be seen from Table I that the BA

ID Variables no. Constraints no. Global optimum Best BA result

1 12 6 256.75 256.752 60 30 30,945.28 30,945.28

Table I.BA results and global

optimums for themathematical problem

Bat algorithm

469

7/25/2019 !!!bat algo

9/30

successfully find the global minimum. The statistical results of the mathematicalproblem are also presented in Table II.

4.2 Case 2: Himmelblaus problem

Now we solve a well-known benchmark problem, namely Himmelblaus problem. Thisproblem was originally proposed by Himmelblaus (1972) and it has been widely used asa benchmark nonlinear constrained optimization problem. In this problem, there are fivedesign variables [x1, x2, x3, x4, x5], six nonlinear inequality constraints, and ten simplebounds or limits. The problem can be stated as follows:

Minimize : fX 5:3578547x230:8356891x1x537:293239x1 2 40792:141 10Subject to 0 # g1 # 92, 90 # g2 # 110, and 20 # g3# 25 where:

g185:3344070:0056858x1x50:0006262x1x4 2 0:0022053x3x5 11g2

80:51249

0:0071317x2x5

0:0029955x1x2 2 0:0021813x

23

12

g39:3009610:0047026x3x50:0012547x1x3 2 0:0019085x3x4 13

with simple bounds:

78 # x1 # 102; 33 # x2 # 45; and 27 # x3;x4;x5 # 45:

The best known optimum for the Himmelblaus problem obtained by BA is given inTable III.

The problem was initially solved by Himmelblau (1972) using a generalized gradientmethod. Since then, this problem has also been solved using several other methods suchas GA (Gen and Cheng, 1997; Homaifaret al., 1994), HS algorithm (Lee and Geem, 2004;Fesanghary et al., 2008), and PSO (He et al., 2004; Shi and Eberhart, 1998). Table II

summarizes the results obtained by BA,as well as thosepublishedin the literature. It canclearly be seen from Table IV that the result obtained by BA is better than the bestfeasible solution previously reported.

4.3 Case 3: a three-bar truss designThis case study considers a three-bar planar truss structure shown in Figure 2. Thisproblem was first presented by Nowcki (1974). The volume of a statically loaded three-bartruss is to be minimized subject to stress (s) constraints on each of the truss members. Theobjective is to evaluate the optimal cross sectional areas. The mathematical formulation is

ID Best Mean Worst SD No. bats No. evals. Ave. time (s)

1 256.752 256.753 256.758 0.0016 10 10,000 1.5392 30,945.278 35,622.163 46,707.949 4,770.34 25 50,000 32.50

Table II.Statistical results of themathematical problem

X [x1, x2, x3, x4, x5] Fmin No. bats No. evals. Ave. time (s)

[78, 33, 29.995523554, 45, 36.77520645342] 230,665.4922 15 15,000 2.76224

Table III.BA results for theHimmelblaus problem

EC29,5

470

7/25/2019 !!!bat algo

10/30

given as below:

Minimize : fX 2ffiffiffiffiffiffiffi

2x1p

x2 l 14Subject to:

g1ffiffiffi

2p

x1x2

ffiffiffi2

p x212x1x2

P2 s# 0 15

g2x

2ffiffiffi2

p x212x1x2

P2 s# 0 16

g31

x1ffiffiffi

2p

x2P2 s# 0 17

where:

0 # x1 # 1 and 0 # x2 # 1; l100 cm;P 2KN=cm2; and s2KN=cm2

Author(s) SDa Best 0 # g1 # 92 90 # g2 # 110 20 # g3 # 25

Himmelblau (1972) N/A 230,373.9490 N/A N/A N/AGen and Cheng (1997) N/A 230,183.5760 N/A N/A N/A

Homaifar et al. (1994) N/A 230,005.7000 9 1.65619 99.53690 20.02553Lee and Geem (2004) N/A 230,665.5000 92.00004 98.84051 19.99994Fesanghary et al. (2008) N/A 231,024.3160 93.27834 100.39612 20.00000He et al. (2004) 70.0400 230,643.9900 93.28536 100.40478 20.00000Shi and Eberhart (1998) N/A 231,025.5610 93.28533 b 100.40473 19.99997Coello (2000) 73.6335 231,020.8590 93.28381 100.40786 20.00191Omran and Salman (2009) N/A 231,025.5560 93.28536 100.40478 20.00000Present study 444.293 230,665.4922 91.99990 98.84039 20.00001

Notes: aSD is standard deviation; bitalized sets are violated sets

Table IV.Statistical results for the

Himmelblaus problem

Figure 2.Three-bar truss

H

P

H H

A1

A2

A1=A3

Bat algorithm

471

7/25/2019 !!!bat algo

11/30

This design problem is a nonlinear fractional programming problem. The statisticalvalues of the best solution obtained by BA are given in Table V. The best solutionby BA is (x1, x2) (0.78863, 0.40838) with the objective value equal to 263.896248.Table VI presents the best solutions obtained by BA and those reported by Ray and Saini

(2001) and Tsai (2005). It can be seen clearly that the best objective value reported byTsai (2005) is not feasible because the first constraint (g1) is violated. Hence, itcan be concluded that the results obtained by BA are better than those of the previousstudies.

4.4 Case 4: speed reducer designThe design of a speed reducer is a more complex case study (Golinski, 1973) and it isone of the benchmark structural engineering problems (Gandomi and Yang, 2011).This problem involves seven design variables, as shown in Figure 3, with the facewidthb(x1), module of teethm(x2), number of teeth on pinion z(x3), length of first shaftbetween bearings l1 (x4), length of second shaft between bearings l2 (x5), diameter of

first shaftd1(x6), and diameter of second shaftd2(x7). The objective is to minimize thetotal weight of the speed reducer. There are nine constraints, including the limits on the

Best Mean Worst SD No. bats No. evals. Ave. time (s)

263.896248 263.90614 263.9024677 0.003527 10 15,000 0.72

Table V.Statistical resultsof the best three-bartruss model

Park et al. (2007) Ray and Saini (2001) Tsai (2005) Present study

x1(A1) 0.78879 0.79500 0.78800 0.78863x2(A2) 0.40794 0.39500 0.40800 0.40838g1 0.00000 20.00169 0.00082

a0.00000

g2 20.26778 20.26124 20.26740 20.26802g3 20.73223 20.74045 20.73178 20.73198

fmin 263.8965 264.3000 263.6800 263.8962

Note: aItalized set is violated sets

Table VI.Best solutionsfor the three-bar trussdesign example

Figure 3.Speed reducer

l1

z l2

d1

d2

EC29,5

472

7/25/2019 !!!bat algo

12/30

bending stress of the gear teeth, surface stress, transverse deflections of shafts 1 and 2due to transmitted force, and stresses in shafts 1 and 2.

The mathematical formulation can be summarized as follows:

Minimize :fX 0:7854x1x22

3:3333x32

14:9334x32 43:09342 1:508x1 x26x

27

7:477 x36x37

0:7854 x4x26x5x27

Subject to:

g127

x1x22x3

P2 1 # 0 18

g2397:5

x1x22x

23

2 1 # 0 19

g31:93

x2x3x34x46

21#

0 20

g41:93

x2x3x34x

47

2 1 # 0 21

g5

ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi745x4=x2x32 1:69 106

q 110x36

2 1 # 0 22

g6ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi745x4x2x32 157:5 106

p 85x37

2 1 # 0 23

g7 x2x340 2 1 # 0 24

g85x2

B2 12 1 # 0 25

g9x1

12x22 1 # 0 26

In addition, the design variables are also subject to simple bounds list in Table VII.This problem has been solved by using BA, and the corresponding statistical values ofthe best solutions are also presented in Table VII.

Table VIII summarizes a comparison of the results obtained by BA with thoseobtained by other methods. Although some of the best objective values are better thanthose of BA, these reported values are not feasible because some of the constraints areviolated. Thus, BA obtained the best feasible solution for this problem.

4.5 Case 5: parameter identification of structuresEstimation of structural parameter is the art of reconciling an a priori finite-element model(FEM) of the structure with nondestructive test data. It has a great potential for usein FEM updating. Sanayei and Saletnik (1996) developed a parameter estimationbenchmark using measured strains for simultaneous estimation of the structural

Bat algorithm

473

7/25/2019 !!!bat algo

13/30

parameters. The parameter estimation objective function is defined as follows:

Minimize :XNMSi1

1am;i2 1aa;i1m;i

27

where [1a]m is the measured strains, [1a]m number of measurements (NMS) number of loading states (NLS), and [1a]ais the analytical strains.

Bound Value

x1(b) [2.6-3.6] 3.50000x2(m) [0.7-0.8] 0.70000

x3(z) [17-28] 17.0000x4(l1) [7.3-8.3] 7.30001x5(l2) [7.3-8.3] 7.71532x6(d1) [2.9-3.9] 3.35021x7(d2) [5.0-5.5] 5.28665Objective function value 2,994.4671No. bats 15No. iterations 15,000Time of each run (s) 2.53317

Table VII.Statistical resultsof the speed reducerdesign example

Kuanget al.(1998) Akhtar et al.(2002) Golinski(1973) Ray andSaini (2001) Hsu andLiu (2007)

Li and

Papalambros(1985) Presentstudy

Best 2,876.1176 3,008.08 2,985.2 2,732.9006 3,007.8 2,985.22 2,994.4671

x1 3.6 3.506122 3.5 3.514185 3.5197 3.500243 3.50000x2 0.7 0.700006 0.7 0.700005 0.7039 0.70 0.70000x3 17 17 17 17 17.3831 17 17.0000x4 7.3 7.549126 7.3 7.497343 7.3 7.3 7.30001x5 7.8 7.85933 7.3 7.8346 7.7152 7.8 7.71532x6 3.4 3.365576 3.35 2.9018 3.3498 3.4 3.35021x7 5 5.289773 5.29 5.0022 5.2866 5.0 5.2875g1 20.100 20.076 20.074 20.078 20.246 20.074 20.074g2 20.220 20.199 20.198 20.201 20.513 20.198 20.198g3 20.528 20.456 20.499 20.036 20.907 20.528 20.499g4 20.877 20.899 20.919 20.875 0.000 20.877 20.905g5 20.043 20.013 0.000 0.540 0.000 20.043 0.000g6 0.182 20.002 20.002 0.181 20.694 0.182 0.000g7 20.703 20.703 20.703 20.703 0.000 20.703 20.703g8 20.028 20.002 0.000 20.004 20.583 0.000 0.000g9 20.571 20.583 20.583 20.582 20.051 20.583 20.583g10 20.041 20.080 20.051 20.166 0.000 20.041 20.051g11 20.051 20.018 0.057 20.055 20.246 20.051 0.000Mean NA 3,012.120 NA 2,758.888 NA NA 2,994.4671

Max. NA 3,028.280 NA 2,780.307 NA NA 4,973.8644

SD NA NA NA NA NA NA 721.51803

Notes:Italized sets are violated sets

Table VIII.Statistical resultsof the speed reducerdesign example

EC29,5

474

7/25/2019 !!!bat algo

14/30

The static FEM equation for a structural system is [F][K][U]. Thus, theanalytical strains can be calculated as follows:

1

B

K

21

F

28

It is not required to measure all the strains, therefore, equation (32) is partitioned basedon measured strain aand unmeasured strain b:

1a

1b

Ba

Bb

K 21 F 29

Since there is no need for unmeasured strains [1b] is eliminated as:

1a BaK21F 30

In this work, the case study is a frame structure presented by Sanayei and Saletnik(1996) (Figure 4). The identified parameter in this example is moment of inertia I(X) foreach member.

A 445 N load is applied to degrees of freedom of 2, 5, 8 and 11, and each load set iscomposed of only one force. Strains are measured on 3, 6 and 7 for each load set. Thecross section areas are, respectively, 484 and 968 cm2 for the horizontal and inclinedmembers. The elastic modulus is 206.8 GPa for all elements. The optimal solution isobtained atX[869, 869, 869, 869, 869, 1,320, 1,320] (cm4) with corresponding functionvalue equal tof*(X)0.00000. The statistical results for this case study provided byBA are presented in Table IX.

The analytical algorithm proposed by Sanayei and Saletnik (1996) is not applicableto this problem due to a singularity. Arjmandi (2010) solved this problem using GA.A comparison of the results obtained by GA and BA with the measured values isshown in Figure 5. The results show that BA has found the global optimum andidentified all the parameters without any error.

Figure 4.Frame structure

used for parameteridentification example

19

7

4

1

1

2

3 4 5 6

7

8

366 cm 427 cm427 cm 610 cm610 cm

6 7

1 3 4 52

610 cm

Best Mean Worst SD No. bats No. evals. Ave. time (s)

5.39 10214 5.1052 10210 5.1146 1024 2.491 1025 25 25,000 14.9

Table IX.Best solutions for the

parameter identificationexample using BA

Bat algorithm

475

7/25/2019 !!!bat algo

15/30

4.6 Case 6: cantilever stepped beamThe capability of BA for continuous and discrete variable design problems are verifiedusing a design problem with ten variables. The case is originally presented by Thanedarand Vanderplaats (1995). Figure 6 shows a five-stepped cantilever beam withrectangular shape. In this case study, the width (x1 2 x5) and height (x6 2 x10) of thebeam in all five steps of the cantilever beam are design variables. The volume of thebeam is to be minimized. The objective function is formulated as follows:

Minimize :VX5i1

xixi5li 31

where li100 cm (i

1, 2, . . . , 5).

Subject to the following constraints:

g1600P

x5x210

2 14000 # 0 32

g26Plsl4

x4x29

2 14000 # 0 33

g36Plsl4l3

x3x28

2 14000 # 0 34

Figure 5.Parameter identificationresults using GA and BA

Figure 6.A stepped cantilever beam

P

543

L

bi

hi21

l1 l2 l3 l4 l5

EC29,5

476

http://www.emeraldinsight.com/action/showImage?doi=10.1108/02644401211235834&iName=master.img-002.jpg&w=273&h=168

7/25/2019 !!!bat algo

16/30

g46Plsl4l3l2

x2x27

2 14000 # 0 35

g56P

ls

l4

l3

l2

l1

x1x262

14000#

0 36

g6Pl3

3E

1

Is 7

I4 19

I3 37

I2 61

I1

2 2:7 # 0 37

g7x10

x52 20 # 0 38

g8x9

x42 20 # 0 39

g9x8

x32 20 # 0 40

g10x7

x22 20 # 0 41

g11x6

x12 20 # 0 42

where P50,000 N, E2 107 N/cm2 and the initial design space are: 1 # xi# 5(i1, 2, . . . , 5), and 30 # xj # 65 (j6, 7, . . . , 10).

BA has achieved a solution that satisfies all the constraints and it reaches the bestsolution, possibly the unique global optimum. BA outperforms the previous othermethods in terms of the minimum objective function value. Table X presents theresults obtained by BA. We can see that the proposed method requires 25 bats and

1,000 iterations to reach the optimum.This nonlinear constrained problem has been solved by other researchers shown in

Table XI. As it is seen, BA significantly outperforms other studies.

4.7 Case 7: heat exchanger designAs another case study, we now try to solve the heat exchanger design task, which is adifficult benchmark minimization problem since all the constraints are binding.It involves eight design variables and six inequality constraints (three linear and threenon-linear). The problem is expressed as follows:

Minimize : fX x1x2x3 43Subject to:

g10:0025x4x62 1 # 0 44

Best Mean Worst SD No. bats No. evals. Ave. time (s)

61,914.86841 61,914.86842 61,914.86845 0.00001 25 25,000 7.025

Table X.Best solution results for

the stepped cantileverbeam examples

Bat algorithm

477

7/25/2019 !!!bat algo

17/30

g20:0025x5x7 2x42 1 # 0 45

g30:01x8 2x52 1 # 0 46

g4833:33252x4100x1 2x1x6 2 83333:333 # 0 47

g51250x5x2x4 2x2x7 2 125x4 # 0 48

g6x3x5 2 2500x5 2x3x8125 104 # 0 49Table XII shows the best solution for the heat exchanger design obtained by BA aswell as the best solutions obtained previously by other methods. The solution shownfor BA is the best generated using 25 bats. The solution generated by BA(with X*

[579.30675, 1,359.97076, 5,109.97052, 182.01770, 295.60118, 217.98230,

286.41653, 395.60118]) is better than the best solutions reported in the literature.As shown in Table XII, the SD and the number of evaluations using BA are also muchless than those obtained by the other methods. This solution is feasible and

Thanedar andVanderplaats (1995)

Lamberti andPappalettere (2003)

Huang andArora (1997)

Presentstudy

x1 3.06 NA NA 2.99204

x2 2.81 NA NA 2.77756x3 2.52 NA NA 2.52359x4 2.2 NA NA 2.20455x5 1.75 NA NA 1.74977x6 61.16 NA NA 59.84087x7 56.24 NA NA 55.55126x8 50.47 NA NA 50.4718x9 44.09 NA NA 44.09106x10 35.03 NA NA 34.99537Best objective 63,110 65,352.2 63,108.7 61,914.9

Table XI.Statistical resultsof the stepped cantileverbeam example usingdifferent methods

Author(s) Best Mean Worst SD No. evalus.

Lee and Geem (2004) 7,057.2744 NA NA NA NAJoines and Houck (1994) 7,068.688 7,244.2786 NA 107.7516 NAJaberipour and Khorram (2010) (1) 7,109.1901 NA NA NA 200,000Jaberipour and Khorram (2010) (2) 7,051.3012 NA NA NA 200,000Deb (2000) 7,060.221 NA NA NA 320,080Michalewicz (1995) 7,377.976 NA NA NA NA

Shopova and Vaklieva-Bancheva (2006) 7,095.485 NA NA NA NAChootinan and Chen (2006) 7,049.2607 7,049.5659 7,051.6857 0.57 NAKoziel and Michaelwicz (1999) 7,147.9 8,163.6 9,659.3 NA NARunarsson and Yao (2000) 7,054.316 7,559.192 8,835.655 530 NAFarmani and Wright (2003) 7,061.34 7,627.89 8,288.79 373 NAAmirjanov (2006) 7,054.316 7,372.613 8,835.655 1,000 128,000Wright and Farmani (2001) 7,152.83 NA NA NA NABen Hamida and Schoenauer (2000) 7,095.15 NA NA NA NAPresent study 7,049.248 7,049.2484 7,049.3307 0.00523 25,000

Table XII.Statistical resultsof the heat exchangerdesign example bydifferent model

EC29,5

478

7/25/2019 !!!bat algo

18/30

the constraint values are G* [0.0000000, 0.0000000, 0.0000000, 20.0071449,20.0061782, 20.0020000].

4.8 Case 8: car side impact design

Design of car side impact is used as a benchmark problem of the proposed BA. On thefoundation of European Enhanced Vehicle-Safety Committee procedures, a car is exposedto a side impact (Youn et al., 2004). Here we want to minimize the weight using nineinfluence parameters including, thicknesses of B-pillar inner, B-pillar reinforcement, floorside inner, cross members, door beam, door beltline reinforcement and roof rail (x1 2 x7),materials of B-pillar inner and floor side inner (x8and x9) and barrier height and hittingposition (x10andx11). The car side problem is formulated as follow:

Minimize fx Weight; 50Subject to:

g1x

Fa

load in abdomen

# 1kN;

51

g2x V Cudummy upper chest # 0:32 m=s; 52

g3x V Cmdummy middle chest # 0:32 m=s; 53g4x V Cldummy lower chest # 0:32 m=s; 54

g5x Durupper rib deflection # 32 mm; 55g6x Dmrmiddle rib deflection # 32mm; 56

g7x Dlrlower rib deflection # 32 mm; 57g8x FpPubic force # 4kN; 58

g9x VMBPVelocity of V2Pillar at middle po int # 9 : 9 mm=ms; 59g10x VFDVelocity of front door at V2Pillar # 15 : 7 mm=ms; 60

with simple bounds:

0:5 # x1;x3;x4 # 1:5; 0:45 # x2 # 1:35; 0:875 # x5 # 2:625; 0:4 # x6;x7# 1:2;x8;x9 [ {0:192; 0:345}; 0:5 # x10;x11 # 1:5;

For solving this problem, we ran BA with 20 bats and 1,000 iterations. Because this casestudy has not been solved previously in the literature, we also solved this problem usingPSO, DE and GA methods so as to benchmark and compare with the BA method.Table XIII shows the statistical results for the car side impact design problem using the

proposed BA method and other well-known methods after 20,000 searches. As it can beseen from Table XIII, in comparison with other heuristic algorithms, the proposedalgorithm is better than GA and it seems that the BA method performances similar to thePSO and DE.

5. Discussions and conclusionsWe have presented a new BA for solving engineering optimization problems. BA hasbeen validated using several benchmark engineering design problems, and it is found

Bat algorithm

479

7/25/2019 !!!bat algo

19/30

from our simulations that BA is very efficient. The extensive comparison study, carriedout over seven different nonlinear constrained design tasks, reveals that BA performssuperior to many different existing algorithms used to solve these seven benchmarkproblems. It is potentially more powerful than other methods such as GA and PSO aswell as HS. The primary reason is that BA uses a good combination of major advantagesof these algorithms in some way. Moreover, PSO and HS are the special cases of BAunder appropriate simplifications. More specifically, if we fix the loudness asAi0 andpulse emission rate asri1, BA reduces to the standard particle swarm optimization.On the other hand, if set Ai ri0.7-0.9, BA essentially becomes a HS as frequencychange is equivalent to the pitch adjustment in HS.

Sensitivity studies can be an important issue for the further research topics, as thefine adjustment of the parametersa and gcan affect the convergence rate of the BA.Thisis true for almost all metaheuristic algorithms. In fact, parameteraplays a similar role asthe cooling schedule in the simulated annealing. Though the implementation is morecomplicated than many other metaheuristic algorithms; however, the detailed study ofseven engineering design tasks indicates that BA actually uses a balanced combinationof the advantages of existing successful algorithms with innovative feature based on theecholocation behavior of microbats. New solutions are generated by adjustingfrequencies, loudness and pulse emission rates, while the proposed solution is acceptedor not depends on the quality of the solutions controlled or characterized by loudnessand pulse rate which are in turn related to the closeness or the fitness of thelocations/solution to the global optimal solution.

Theoretically speaking, if we simplify the system with enough approximations, it ispossible to analyze the behaviour of the BA using analysis in the framework ofdynamical systems. In addition, more extensive comparison studies with a more widerange of existing algorithms using much tough test functions in higher dimensions willpose more challenges to the algorithms, and thus such comparisons will potentiallyreveal the virtues and weakness of all the algorithms of interest. Furthermore, a naturalextension is to formulate a discrete version of BA so that it can directly solvecombinatorial optimization problems such as the travelling salesman problem.

Method PSO DE GA BA

Best objective 22.84474 22.84298 22.85653 22.84474x1 0.50000 0.50000 0.50005 0.50000

x2 1.11670 1.11670 1.28017 1.11670x3 0.50000 0.5000 0.50001 0.50000x4 1.30208 1.30208 1.03302 1.30208x5 0.50000 0.50000 0.50001 0.50000x6 1.50000 1.50000 0.50000 1.50000x7 0.50000 0.50000 0.50000 0.50000x8 0.34500 0.34500 0.34994 0.34500x9 0.19200 0.19200 0.19200 0.19200x10 219.54935 219.54935 10.3119 219.54935x11 20.00431 20.00431 0.00167 20.00431Mean objective 22.89429 23.22828 23.51585 22.89273Worst objective 23.21354 24.12606 26.240578 23.21354SD 0.15017 0.34451 0.66555 0.17383

Table XIII.Statistical results of thecar side design exampleby different methods

EC29,5

480

7/25/2019 !!!bat algo

20/30

On the other hand, for dynamical optimization problems and computational geometry, afurther natural extension to the current BA would be to use the directional echolocationand Doppler effect, which may lead to even more interesting variants and newalgorithms. These further extensions will help us to design more efficient, often hybrid,

algorithms to solve a wider class of even tougher optimization problems.

References

Akhtar, S., Tai, K. and Ray, T. (2002), A socio-behavioral simulation model for engineeringdesign optimization, Eng. Optmiz., Vol. 34 No. 4, pp. 341-54.

Alavi, A.H. and Gandomi, A.H. (2011), A robust data mining approach for formulation ofgeotechnical engineering systems, International Journal of Computer Aided Methods in

Engineering-Engineering Computations, Vol. 28 No. 3, pp. 242-74.

Altringham, J.D. (1996),Bats: Biology and Behaviour, Oxford Univesity Press, Oxford.

Amirjanov, A. (2006), The development of a changing range genetic algorithm,Comput. Methods Appl. Mech. Eng., Vol. 195, pp. 2495-508.

Arjmandi, P. (2010), Damage detection of continues steel beams using static data, MSc thesis,Tafresh University, Tafresh.

Ben Hamida, S. and Schoenauer, M. (2000), An adaptive algorithm for constrained optimizationproblems, Proceedings of Parallel Problem Solving from Nature, Vol. VI, pp. 529-38.

Chen, T.W.C. and Vassiliadis, V.S. (2003), Solution of general nonlinear optimization problemsusing the penalty/modified barrier method with the use of exact Hessians,Comput. Chem.

Eng., Vol. 27, pp. 501-25.

Chootinan, P. and Chen, A. (2006), Constraint handling in genetic algorithms usinga gradient-based repair method,Comput. Oper. Res., Vol. 33, pp. 2263-81.

Coello, C.A.C. (2000), Use of a self-adaptive penalty approach for engineering optimizationproblems, Comput. Ind., Vol. 41 No. 2, pp. 113-27.

Deb, K. (1995), Optimization for Engineering Design: Algorithms and Examples, Prentice-Hall,New Delhi.

Deb, K. (2000), An efficient constraint handling method for genetic algorithms,Comput. Methods Appl. Mech. Eng., Vol. 186, pp. 311-38.

Farmani, R. and Wright, J.A. (2003), Self-adaptive fitness formulation for constrainedoptimization, IEEE T. Evolut. Comput., Vol. 7 No. 5, pp. 445-55.

Fesanghary, M., Mahdavi, M., Minary-Jolandan, M. and Alizadeh, Y. (2008), Hybridizingharmony search algorithm with sequential quadratic programming for engineeringoptimization problems,Comput. Methods Appl. Mech. Eng., Vol. 197, pp. 3080-91.

Gandomi, A.H. and Alavi, A.H. (2011), Multi-stage genetic programming: a new strategy tononlinear system modeling, Information Sciences, Vol. 181 No. 23.

Gandomi, A.H. and Yang, X.S. (2011), Benchmark problems in structural optimization,in Koziel, S. and Yang, X.S. (Eds), Computational Optimization, Methods and Algorithms,Chapter 12, Springer, Berlin, pp. 267-91.

Gandomi, A.H., Yang, X.S. and Alavi, A.H. (2011), Cuckoo search algorithm: a metaheuristicapproach to solve structural optimization problems, Engineering with Computers, Vol. 27.

Geem, Z.W., Kim, J.H. and Loganathan, G.V. (2001), A new heuristic optimization algorithm:harmony search, Simulation, Vol. 76, pp. 60-8.

Gen, M. and Cheng, R. (1997), Genetic Algorithms & Engineering Design, Wiley, New York, NY.

Bat algorithm

481

http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150212723&isi=000176848000002http://www.emeraldinsight.com/action/showLinks?system=10.1108%2F02644401111118132&isi=000292713100002http://www.emeraldinsight.com/action/showLinks?system=10.1108%2F02644401111118132&isi=000292713100002http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cma.2005.05.014&isi=000236488700015http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0098-1354%2802%2900234-X&isi=000181703600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0098-1354%2802%2900234-X&isi=000181703600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cor.2005.02.002&isi=000235584900012http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0166-3615%2899%2900046-9&isi=000085142400002http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0045-7825%2899%2900389-8&isi=000087538300010http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FTEVC.2003.817236&isi=000185906600003http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cma.2008.02.006&isi=000257666400026http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2F978-3-642-20859-1_12http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2Fs00366-011-0241-yhttp://www.emeraldinsight.com/action/showLinks?crossref=10.1177%2F003754970107600201http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2Fs00366-011-0241-yhttp://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FTEVC.2003.817236&isi=000185906600003http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cor.2005.02.002&isi=000235584900012http://www.emeraldinsight.com/action/showLinks?crossref=10.1177%2F003754970107600201http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150212723&isi=000176848000002http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2F978-3-642-20859-1_12http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cma.2005.05.014&isi=000236488700015http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cma.2008.02.006&isi=000257666400026http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0166-3615%2899%2900046-9&isi=000085142400002http://www.emeraldinsight.com/action/showLinks?system=10.1108%2F02644401111118132&isi=000292713100002http://www.emeraldinsight.com/action/showLinks?system=10.1108%2F02644401111118132&isi=000292713100002http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0045-7825%2899%2900389-8&isi=000087538300010http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0098-1354%2802%2900234-X&isi=000181703600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0098-1354%2802%2900234-X&isi=000181703600004

7/25/2019 !!!bat algo

21/30

Golinski, J. (1973), An adaptive optimization system applied to machine synthesis,Mech. Mach.

Synthesis, Vol. 8 No. 4, pp. 419-36.

He, S., Prempain, E. and Wu, Q.H. (2004), An improved particle swarm optimizer for mechanical

design optimization problems, Eng. Optimiz., Vol. 36 No. 5, pp. 585-605.

Himmelblau, D.M. (1972), Applied Nonlinear Programming, McGraw-Hill, New York, NY.

Homaifar, A., Lai, S.H.V. and Qi, X. (1994), Constrained optimization via genetic algorithms,

Simulation, Vol. 62 No. 4, pp. 242-54.

Hsu, Y.L. and Liu, T.C. (2007), Developing a fuzzy proportional-derivative controller

optimization engine for engineering design optimization problems,Eng. Optimiz., Vol. 39

No. 6, pp. 679-700.

Huang, M.-W. and Arora, J.S. (1997), Optimal design with discrete variables: some numerical

experiments, Int. J. Numer. Meth. Eng., Vol. 40, pp. 165-88.

Jaberipour, M. and Khorram, E. (2010), Two improved harmony search algorithms for solving

engineering optimization problems, Commun. Nonlinear Sci. Numer. Simulat., Vol. 15

No. 11, pp. 3316-31.

Joines, J . and Houck, C. (1994), On the use of non-stationary penalty functions to solve nonlinear

constrained optimization problems with gas, in Fogel, D. (Ed.), Proceedings First IEEE

Conf. on Evolutionary Computation, Orlando, FL, IEEE Press, Piscataway, NJ, pp. 579-84.

Kaveh, A. and Talatahari, S. (2010), A novel heuristic optimization method: charged system

search, Acta Mech., Vol. 213 Nos 3/4, pp. 267-89.

Kennedy, J. and Eberhart, R. (1995), Particle swarm optimization,Proceedings IEEE Int. Conf.

Neural Networks, Perth, Australia, pp. 1942-5.

Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983), Optimization by simulated annealing,

Science, Vol. 220 No. 4598, pp. 671-80.

Koziel, S. and Michaelwicz, Z. (1999), Evolutionary algorithms, homomorphous mappings,

and constrained parameter optimization,Evol. Comput., Vol. 7 No. 1, pp. 19-44.Kuang, J.K., Rao, S.S. and Chen, L. (1998), Taguchi-aided search method for design optimization

of engineering systems, Eng. Optimiz., Vol. 30, pp. 1-23.

Lamberti, L. and Pappalettere, C. (2003), Move limits definition in structural optimization with

sequential linear programming. Part II: numerical examples, Computers & Structures,

Vol. 81, pp. 215-38.

Lee, K.S. and Geem, Z.W. (2004), A new meta-heuristic algorithm for continues engineering

optimization: harmony search theory and practice, Comput. Methods Appl. Mech. Eng.,

Vol. 194, pp. 3902-33.

Li, H.L. and Papalambros, P. (1985), A production system for use of global optimization

knowledge,ASME. J. Mech Transm. Autom. Des., Vol. 107, pp. 277-84.

Michalewicz, Z. (1995), Genetic algorithms, numerical optimization, and constraints,in Eshelman, L. (Ed.), Proceedings Sixth Int. Conf. on Genetic Algorithms,

Morgan Kaufmann, Waltham, MA, pp. 151-8.

Nowcki, H. (1974), Optimization in pre-contract ship design, in Fujita, Y., Lind, K. and

Williams, T.J. (Eds),Computer Applications in the Automation of Shipyard Operation and

Ship Design, Vol. 2, Elsevier, New York, NY, pp. 327-38.

Omran, M.G.H. and Salman, A. (2009), Constrained optimization using CODEQ, Chaos Soliton.

Fract., Vol. 42, pp. 662-8.

EC29,5

482

http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2F0094-114X%2873%2990018-9&isi=A1973S391100001http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2F0094-114X%2873%2990018-9&isi=A1973S391100001http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2F0094-114X%2873%2990018-9&isi=A1973S391100001http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150410001704854&isi=000222240700006http://www.emeraldinsight.com/action/showLinks?crossref=10.1177%2F003754979406200405http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150701252664&isi=000248853000003http://www.emeraldinsight.com/action/showLinks?crossref=10.1002%2F%28SICI%291097-0207%2819970115%2940%3A1%3C165%3A%3AAID-NME60%3E3.0.CO%3B2-I&isi=A1997VY95700010http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cnsns.2010.01.009&isi=000278723500014http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FICEC.1994.349995http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FICEC.1994.349995http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2Fs00707-009-0270-4&isi=000281038600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FICNN.1995.488968http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FICNN.1995.488968http://www.emeraldinsight.com/action/showLinks?crossref=10.1126%2Fscience.220.4598.671&isi=A1983QN77100006http://www.emeraldinsight.com/action/showLinks?crossref=10.1162%2Fevco.1999.7.1.19&isi=000208244600003http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052159808941235&isi=000072537400001http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0045-7949%2802%2900443-1&isi=000181435500004http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cma.2004.09.007&isi=000230191000007http://www.emeraldinsight.com/action/showLinks?crossref=10.1115%2F1.3258721http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.chaos.2009.01.039&isi=000268550600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.chaos.2009.01.039&isi=000268550600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052159808941235&isi=000072537400001http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FICEC.1994.349995http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FICEC.1994.349995http://www.emeraldinsight.com/action/showLinks?crossref=10.1002%2F%28SICI%291097-0207%2819970115%2940%3A1%3C165%3A%3AAID-NME60%3E3.0.CO%3B2-I&isi=A1997VY95700010http://www.emeraldinsight.com/action/showLinks?crossref=10.1115%2F1.3258721http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2F0094-114X%2873%2990018-9&isi=A1973S391100001http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2F0094-114X%2873%2990018-9&isi=A1973S391100001http://www.emeraldinsight.com/action/showLinks?crossref=10.1126%2Fscience.220.4598.671&isi=A1983QN77100006http://www.emeraldinsight.com/action/showLinks?crossref=10.1177%2F003754979406200405http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2FS0045-7949%2802%2900443-1&isi=000181435500004http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2Fs00707-009-0270-4&isi=000281038600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.chaos.2009.01.039&isi=000268550600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.chaos.2009.01.039&isi=000268550600004http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150410001704854&isi=000222240700006http://www.emeraldinsight.com/action/showLinks?crossref=10.1162%2Fevco.1999.7.1.19&isi=000208244600003http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cnsns.2010.01.009&isi=000278723500014http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150701252664&isi=000248853000003http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.cma.2004.09.007&isi=000230191000007http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FICNN.1995.488968http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2FICNN.1995.488968

7/25/2019 !!!bat algo

22/30

Park, Y.C., Chang, M.H. and Lee, T.Y. (2007), A new deterministic global optimization methodfor general twice differentiable constrained nonlinear programming problems,

Eng. Optimiz., Vol. 39 No. 4, pp. 397-411.

Ray, T. and Saini, P. (2001), Engineering design optimization using a swarm with an intelligent

information sharing among individuals, Eng. Optimiz., Vol. 33 No. 3, pp. 735-48.Richardson, P. (2008),Bats, Natural History Museum, London.

Runarsson, T.P. and Yao, X. (2000), Stochastic ranking for constrained evolutionaryoptimization, IEEE T. Evolut. Comput., Vol. 4 No. 3, pp. 284-94.

Sanayei, M. and Saletnik, M.J. (1996), Parameter estimation of structures from static strainmeasurements I: formulation,J. Struct. Eng-ASCE, Vol. 122 No. 5, pp. 555-62.

Shi, Y and Eberhart, R.C. (1998), A modified particle swarm optimizer, Proceedings Int. Cong.Evolutionary Computation, IEEE Service Center, Piscataway, NJ.

Shopova, E.G. and Vaklieva-Bancheva, N.G. (2006), BASIC a genetic algorithm for engineeringproblems solution, Comput. Chem. Eng., Vol. 30, pp. 1293-309.

Thanedar, P.B. and Vanderplaats, G.N. (1995), Survey of discrete variable optimization for

structural design journal of structural engineering, J. Struct. Eng.-ASCE, Vol. 121 No. 2,pp. 301-6.

Tsai, J. (2005), Global optimization of nonlinear fractional programming problems inengineering design, Eng. Optimiz., Vol. 37 No. 4, pp. 399-409.

Wright, J.A. and Farmani, R. (2001), Genetic algorithm: a fitness formulation for constrainedminimization,Proceedings of Genetic and Evolutionary Computation Conf., San Francisco,CA, July 7-11, pp. 725-32.

Yang, X.-S. (2008), Nature-inspired Metaheuristic Algorithms, Luniver Press, Beckington.

Yang, X.-S. (2010), A new metaheuristic bat-inspired algorithm, in Cruz, C., Gonzalez, J.,Krasnogor, N. and Terraza, G. (Eds), Nature Inspired Cooperative Strategies forOptimization (NICSO2010), Vol. SCI 284, Springer, Berlin, pp. 65-74.

Youn, B.D., Choi, K.K., Yang, R.-J. and Gu, L. (2004), Reliability-based design optimization for

crashworthiness of vehicle side impact, Struct. Multidisc. Optim., Vol. 26, pp. 272-83.

Corresponding authorAmir Hossein Gandomi can be contacted at: a.h.gandomi@gmail.com

Bat algorithm

483

To purchase reprints of this article please e-mail: reprints@emeraldinsight.comOr visit our web site for further details: www.emeraldinsight.com/reprints

http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150701218475&isi=000247731900002http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150108940941&isi=000172215700004http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2F4235.873238&isi=000089800300007http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2F4235.873238&isi=000089800300007http://www.emeraldinsight.com/action/showLinks?crossref=10.1061%2F%28ASCE%290733-9445%281996%29122%3A5%28555%29&isi=A1996UG89400012http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.compchemeng.2006.03.003&isi=000238726600009http://www.emeraldinsight.com/action/showLinks?crossref=10.1061%2F%28ASCE%290733-9445%281995%29121%3A2%28301%29&isi=A1995QC84900013http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150500066737&isi=000229620400004http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2F978-3-642-12538-6_6http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2F978-3-642-12538-6_6http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2F978-3-642-12538-6_6http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2F978-3-642-12538-6_6http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2Fs00158-003-0345-0&isi=000188929500013http://www.emeraldinsight.com/action/showLinks?crossref=10.1109%2F4235.873238&isi=000089800300007http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150500066737&isi=000229620400004http://www.emeraldinsight.com/action/showLinks?crossref=10.1016%2Fj.compchemeng.2006.03.003&isi=000238726600009http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150108940941&isi=000172215700004http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2F978-3-642-12538-6_6http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2F978-3-642-12538-6_6http://www.emeraldinsight.com/action/showLinks?crossref=10.1061%2F%28ASCE%290733-9445%281996%29122%3A5%28555%29&isi=A1996UG89400012http://www.emeraldinsight.com/action/showLinks?crossref=10.1007%2Fs00158-003-0345-0&isi=000188929500013http://www.emeraldinsight.com/action/showLinks?crossref=10.1061%2F%28ASCE%290733-9445%281995%29121%3A2%28301%29&isi=A1995QC84900013http://www.emeraldinsight.com/action/showLinks?crossref=10.1080%2F03052150701218475&isi=000247731900002

7/25/2019 !!!bat algo

23/30

7/25/2019 !!!bat algo

24/30

16. Adil Baykasolu, Fehmi Burcin Ozsoydan. 2015. Adaptive firefly algorithm with chaos for mechanicaldesign optimization problems.Applied Soft Computing36, 152-164. [CrossRef]

17. Manjeet Kumar, Tarun Kumar Rawat. 2015. Optimal fractional delay-IIR filter design using cuckoo searchalgorithm. ISA Transactions59, 39-54. [CrossRef]

18. Gai-Ge Wang, Suash Deb, Amir H. Gandomi, Amir H. Alavi. 2015. Opposition-based krill herd

algorithm with Cauchy mutation and position clamping. Neurocomputing. [CrossRef]19. Mohammad Hassan Khooban, Taher Niknam. 2015. A new intelligent online fuzzy tuning approach

for multi-area load frequency control: Self Adaptive Modified Bat Algorithm. International Journal ofElectrical Power & Energy Systems71, 254-261. [CrossRef]

20. Xian-Bing Meng, X.Z. Gao, Yu Liu, Hengzhen Zhang. 2015. A novel bat algorithm with habitat selectionand Doppler effect in echoes for optimization. Expert Systems with Applications42, 6350-6364. [CrossRef]

21. Rajnish Mallick, Ranjan Ganguli, M. Seetharama Bhat. 2015.Robust design of multiple trailing edge flapsfor helicopter vibration reduction: A multi-objective bat algorithm approach. Engineering Optimization47, 1243-1263. [CrossRef]

22. Hamid Reza Ansari, AminGholami. 2015. An improved support vector regression model for estimation

of saturation pressure of crude oils. Fluid Phase Equilibria402, 124-132. [CrossRef]23. Richa Sharma, Prerna Gaur, A.P. Mittal. 2015. Performance analysis of two-degree of freedom fractional

order PID controllers for robotic manipulator with payload. ISA Transactions58, 279-291. [CrossRef]

24. Amir H. Gandomi, Amir H. Alavi. 2015. An introduction of Krill Herd algorithm for engineeringoptimization.Journal of Civil Engineering and Management1-10. [CrossRef]

25. Yongquan Zhou, Liangliang Li, Mingzhi Ma. 2015. A Complex-valued Encoding Bat Algorithm forSolving 01 Knapsack Problem. Neural Processing Letters. [CrossRef]

26. Murat Canayaz, Ali Karci. 2015. Cricket behaviour-based evolutionary computation technique in solvingengineering optimization problems.Applied Intelligence. [CrossRef]

27. Rajko Sveko, Dragan Kusi. 2015. Feedforward neural network position control of a piezoelectric actuatorbased on a BAT search algorithm. Expert Systems with Applications42, 5416-5423. [CrossRef]

28. Dongsheng Zhao, Yuzhu He. 2015. Chaotic binary bat algorithm for analog test point selection.AnalogIntegrated Circuits and Signal Processing84, 201-214. [CrossRef]

29. Goran R. Miodragovi, Radovan R. Bulatovi. 2015. Loop bat family algorithm (Loop BFA) forconstrained optimization.Journal of Mechanical Science and Technology29, 3329-3341. [CrossRef]

30. Bijaya Bijeta Nayak, Siba Sankar Mahapatra. 2015. Optimization of WEDM process parameters using deepcryo-treated Inconel 718 as work material. Engineering Science and Technology, an International Journal. [CrossRef]

31. Yaohui Zeng, Zijun Zhang, Andrew Kusiak, Fan Tang, Xiupeng Wei. 2015. Optimizing wastewater

pumping system with data-driven models and a greedy electromagnetism-like algorithm. StochasticEnvironmental Research and Risk Assessment. [CrossRef]

32. Yassine Saji, Mohammed Essaid Riffi. 2015. A novel discrete bat algorithm for solving the travellingsalesman problem. Neural Computing and Applications. [CrossRef]

33. Puja Dash, Lalit Chandra Saikia, Nidul Sinha. 2015. Automaticgeneration control of multi area thermalsystem using Bat algorithm optimized PDPID cascade controller. International Journal of Electrical Power& Energy Systems68, 364-372. [CrossRef]

http://dx.doi.org/10.1016/j.ijepes.2014.12.063http://dx.doi.org/10.1007/s00521-015-1978-9http://dx.doi.org/10.1007/s00477-015-1115-4http://dx.doi.org/10.1016/j.jestch.2015.06.009http://dx.doi.org/10.1007/s10470-015-0548-5http://dx.doi.org/10.1007/s10470-015-0548-5http://dx.doi.org/10.1007/s11063-015-9465-yhttp://dx.doi.org/10.1016/j.fluid.2015.05.037http://dx.doi.org/10.1080/0305215X.2014.958734http://dx.doi.org/10.1016/j.ijepes.2015.03.017http://dx.doi.org/10.1016/j.ijepes.2014.12.063http://dx.doi.org/10.1007/s00521-015-1978-9http://dx.doi.org/10.1007/s00477-015-1115-4http://dx.doi.org/10.1016/j.jestch.2015.06.009http://dx.doi.org/10.1007/s12206-015-0730-9http://dx.doi.org/10.1007/s10470-015-0548-5http://dx.doi.org/10.1016/j.eswa.2015.02.061http://dx.doi.org/10.1007/s10489-015-0706-6http://dx.doi.org/10.1007/s11063-015-9465-yhttp://dx.doi.org/10.3846/13923730.2014.897986http://dx.doi.org/10.1016/j.isatra.2015.03.013http://dx.doi.org/10.1016/j.fluid.2015.05.037http://dx.doi.org/10.1080/0305215X.2014.958734http://dx.doi.org/10.1016/j.eswa.2015.04.026http://dx.doi.org/10.1016/j.ijepes.2015.03.017http://dx.doi.org/10.1016/j.neucom.2015.11.018http://dx.doi.org/10.1016/j.isatra.2015.08.007http://dx.doi.org/10.1016/j.asoc.2015.06.056

7/25/2019 !!!bat algo

25/30

34. Sashikala Mishra, Debahuti Mishra. 2015. Adaptive multi-classifier fusion approach for gene expressiondataset based on probabilistic theory.Journal of the Korean Statistical Society44, 247-260. [CrossRef]

35. A.S. Oshaba, E.S. Ali, S.M. Abd Elazim. 2015. MPPT control design of PV system supplied SRM usingBAT search algorithm. Sustainable Energy, Grids and Networks2, 51-60. [CrossRef]

36. Gai-Ge Wang, Suash Deb, Amir H. Gandomi, Zhaojun Zhang, Amir H. Alavi. 2015. Chaotic cuckoo

search. Soft Computing. [CrossRef]37. Xin-She Yang, Suash Deb, Thomas Hanne, Xingshi He. 2015. Attraction and diffusion in nature-inspired

optimization algorithms. Neural Computing and Applications. [CrossRef]

38. Maryam PourkamaliAnaraki, Mehdi Sadeghi. 2015. Honey bee-inspired algorithms for SNP haplotypereconstruction problem.Journal of Experimental & Theoretical Artificial Intelligence1-14. [CrossRef]

39. Manjeet Kumar, Tarun Kumar Rawat. 2015. Optimal design of FIR fractional order differentiator usingcuckoo search algorithm. Expert Systems with Applications42, 3433-3449. [CrossRef]

40. Murat Canayaz, Ali Karc. 2015. Investigation of cricket behaviours as evolutionary computation for systemdesign optimization problems. Measurement68, 225-235. [CrossRef]

41. Nour El Yakine Kouba, Mohamed Menaa, Mourad Hasni, Mohamed BoudourA novel robust automaticgeneration control in interconnected multi-area power system based on bat inspired algorithm 1-6.[CrossRef]

42. Tzung-Pei Hong, Chun-Hao Chen, Feng-Shih Lin. 2015. Using group genetic algorithm to improveperformance of attribute clustering.Applied Soft Computing29, 371-378. [CrossRef]

43. Beatriz Gonzlez, Fevrier Valdez, Patricia Melin, German Prado-Arechiga. 2015. Fuzzy logic in thegravitational search algorithm for the optimization of modular neural networks in pattern recognition.Expert Systems with Applications. [CrossRef]

44. Xiaolei Liang, Wenfeng Li, PanPan Liu, Yu Zhang, Aaron Agbenyegah AgboSocial Network-basedSwarm Optimization algorithm 360-365. [CrossRef]

45. Selim Ylmaz, Ecir U. Kksille. 2015. A new modification approach on bat algorithm for solvingoptimization problems.Applied Soft Computing28, 259-275. [CrossRef]

46. Yu-Jun Zheng. 2015. Water wave optimization: A new nature-inspired metaheuristic. Computers &Operations Research55, 1-11. [CrossRef]

47. Xiangtao Li, Minghao Yin. 2015. A particle swarm inspired cuckoo search algorithm for real parameteroptimization. Soft Computing. [CrossRef]

48. Kelton A.P. Costa, Luis A.M. Pereira, Rodrigo Y.M. Nakamura, Clayton R. Pereira, Joo P. Papa,Alexandre Xavier Falco. 2015. A nature-inspired approach to speed up optimum-path forest clusteringand its application to intrusion detection in computer networks. Information Sciences294, 95-108.[CrossRef]

49. U. Sabura Banu, S.K. LakshmanaprabuAdaptive multi-loop fractional order PID controller tuning usingBat colony optimization for Quadruple Tank process 1-8. [CrossRef]

50. Saeed Gholizadeh, Amir Masoud Shahrezaei. 2015. Optimal placement of steel plate shear walls for steelframes by bat algorithm. The Structural Design of Tall and Special Buildings24:10.1002/tal.v24.1, 1-18.[CrossRef]

51. A. Rezaee Jordehi. 2015. Chaotic bat swarm optimisation (CBSO).Applied Soft Computing26, 523-530.[CrossRef]

http://dx.doi.org/10.1016/j.asoc.2014.10.010http://dx.doi.org/10.1002/tal.1151http://dx.doi.org/10.1109/RACE.2015.7097280http://dx.doi.org/10.1109/RACE.2015.7097280http://dx.doi.org/10.1016/j.ins.2014.09.025http://dx.doi.org/10.1016/j.eswa.2015.03.034http://dx.doi.org/10.1016/j.eswa.2015.03.034http://dx.doi.org/10.1007/s00521-015-1925-9http://dx.doi.org/10.1016/j.asoc.2014.10.010http://dx.doi.org/10.1002/tal.1151http://dx.doi.org/10.1109/RACE.2015.7097280http://dx.doi.org/10.1016/j.ins.2014.09.025http://dx.doi.org/10.1007/s00500-015-1594-8http://dx.doi.org/10.1016/j.cor.2014.10.008http://dx.doi.org/10.1016/j.asoc.2014.11.029http://dx.doi.org/10.1109/ICNSC.2015.7116063http://dx.doi.org/10.1016/j.eswa.2015.03.034http://dx.doi.org/10.1016/j.asoc.2015.01.001http://dx.doi.org/10.1109/CEIT.2015.7233025http://dx.doi.org/10.1016/j.measurement.2015.02.052http://dx.doi.org/10.1016/j.eswa.2014.12.020http://dx.doi.org/10.1080/0952813X.2015.1020525http://dx.doi.org/10.1007/s00521-015-1925-9http://dx.doi.org/10.1007/s00500-015-1726-1http://dx.doi.org/10.1016/j.segan.2015.04.002http://dx.doi.org/10.1016/j.jkss.2014.09.001

7/25/2019 !!!bat algo

26/30

52. Xin-She Yang, Su Fong Chien, Tiew On TingBio-Inspired Computation and Optimization 1-21.[CrossRef]

53. M.R. Sathya, M. Mohamed Thameem Ansari. 2015. Load frequency control using Bat inspired algorithmbased dual mode gain scheduling of PI controllers for interconnected power system. International Journalof Electrical Power & Energy Systems64, 365-374. [CrossRef]

54. Gai-Ge Wang, Amir H. Gandomi, Amir H. Alavi, Suash Deb. 2015. A hybrid method based on krill herdand quantum-behaved particle swarm optimization. Neural Computing and Applications. [CrossRef]

55. Mridul Chawla, Manoj Duhan. 2015. Bat Algorithm: A Survey of the State-of-the-Art.Applied ArtificialIntelligence29:6, 617. [CrossRef]

56. M. Hajiaghaei-Keshteli, M. Aminnayeri. 2014. Solving the integrated scheduling of production and railtransportation problem by Keshtel algorithm.Applied Soft Computing25, 184-203. [CrossRef]

57. K.R. Subhashini, A.T.Praveen KumarPseudo-bessel pattern generation employing linear and non linearsynthesis of a hexagonal antenna array 1-6. [CrossRef]

58. Liangliang Li, Yongquan Zhou. 2014. A novel complex-valued bat algorithm. Neural Computing andApplications25, 1369-1381. [CrossRef]

59. Halima Djelloul, Sara Sabba, Salim ChikhiBinary bat algorithm for graph coloring problem 481-486.[CrossRef]

60. Yassine Saji, Mohammed Essaid Riffi, Belaid AhiodDiscrete bat-inspired algorithm for travelling salesmanproblem 28-31. [CrossRef]

61. Bibliography 393-412. [CrossRef]

62. Fevrier Valdez, Patricia Melin, Oscar Castillo. 2014. A survey on nature-inspired optimization algorithmswith fuzzy logic for dynamic parameter adaptation. Expert Systems with Applications41, 6459-6466.[CrossRef]

63. E.S. Ali. 2014. Optimization of Power System Stabilizers using BAT search algorithm. International

Journal of Electrical Power & Energy Systems61, 683-690. [CrossRef]64. Gai-Ge Wang, Amir Hossein Gandomi, Xin-She Yang, Amir Hossein Alavi. 2014. A novel improved

accelerated particle swarm optimization algorithm for global numerical optimization. EngineeringComputations31:7, 1198-1220. [Abstract] [Full Text] [PDF]

65. Xin-She Yang, Mehmet Karamanoglu, Xingshi He. 2014. Flower pollination algorithm: A novel approachfor multiobjective optimization. Engineering Optimization46, 1222-1237. [CrossRef]

66. Nantiwat Pholdee, Sujin Bureerat. 2014. Comparative performance of meta-heuristic algorithms for massminimisation of trusses with dynamic constraints.Advances in Engineering Software75, 1-13. [CrossRef]

67. Gebrail Bekdas. 2014. Optimum design of axially symmetric cylindrical reinforced concrete walls.Structural Engineering and Mechanics51, 361-375. [CrossRef]

68. Gai-Ge Wang, Lihong Guo, Amir H. Gandomi, Guo-Sheng Hao, Heqi Wang. 2014. Chaotic Krill Herdalgorithm. Information Sciences274, 17-34. [CrossRef]

69. Xin-She Yang, Mehmet Karamanoglu, T. O. Ting, Yu-Xin Zhao. 2014. Applications and analysis ofbio-inspired eagle strategy for engineering optimization. Neural Computing and Applications25, 411-420.[CrossRef]

70. Lihong Guo, Gai-Ge Wang, Amir H. Gandomi, Amir H. Alavi, Hong Duan. 2014. A new improved krillherd algorithm for global numerical optimization. Neurocomputing138, 392-402. [CrossRef]

http://dx.doi.org/10.1016/j.neucom.2014.01.023http://dx.doi.org/10.1016/j.neucom.2014.01.023http://dx.doi.org/10.1007/s00521-013-1508-6http://dx.doi.org/10.1007/s00521-013-1508-6http://dx.doi.org/10.1016/j.neucom.2014.01.023http://dx.doi.org/10.1007/s00521-013-1508-6http://dx.doi.org/10.1016/j.ins.2014.02.123http://dx.doi.org/10.12989/sem.2014.51.3.361http://dx.doi.org/10.1016/j.advengsoft.2014.04.005http://dx.doi.org/10.1080/0305215X.2013.832237http://www.emeraldinsight.com/doi/pdfplus/10.1108/EC-10-2012-0232http://www.emeraldinsight.com/doi/full/10.1108/EC-10-2012-0232http://dx.doi.org/10.1108/EC-10-2012-0232http://dx.doi.org/10.1016/j.ijepes.2014.04.007http://dx.doi.org/10.1016/j.eswa.2014.04.015http://dx.doi.org/10.1002/9781118648766.bibliohttp://dx.doi.org/10.1109/ICoCS.2014.7060983http://dx.doi.org/10.1109/ICoCS.2014.7060988http://dx.doi.org/10.1007/s00521-014-1624-yhttp://dx.doi.org/10.1109/INDICON.2014.7030666http://dx.doi.org/10.1016/j.asoc.2014.09.034http://dx.doi.org/10.1080/08839514.2015.1038434http://dx.doi.org/10.1007/s00521-015-1914-zhttp://dx.doi.org/10.1016/j.ijepes.2014.07.042http://dx.doi.org/10.1016/B978-0-12-801538-4.00001-X

7/25/2019 !!!bat algo

27/30

71. Gai-Ge Wang, Amir H. Gandomi, Amir H. Alavi, Guo-Sheng Hao. 2014. Hybrid krill herd algorithmwith differential evolution for global numerical optimization. Neural Computing and Applications25,297-308. [CrossRef]

72. Omid Bozorg-Haddad, Iman Karimirad, Samaneh Seifollahi-Aghmiuni, Hugo A. Loiciga. 2014.Development and Application of the Bat Algorithm for Optimizing the Operation of Reservoir Systems.

Journal of Water Resources Planning and Management04014097. [CrossRef]73. Manoj Kumar Dhadwal, Sung Nam Jung, Chang Joo Kim. 2014. Advanced particle swarm assisted

genetic algorithm for constrained optimization problems. Computational Optimization and Applications58, 781-806. [CrossRef]

74. Richa Sharma, K.P.S. Rana,Vineet Kumar. 2014. Performance analysis of fractional order fuzzy PIDcontrollers applied to a robotic manipulator. Expert Systems with Applications41, 4274-4289. [CrossRef]

75. Satyasai Jagannath Nanda, Ganapati Panda. 2014. A survey on nature inspired metaheuristic algorithmsfor partitional clustering. Swarm and Evolutionary Computation16, 1-18. [CrossRef]

76. Aziz Ouaarab, Belad Ahiod, Xin-She Yang. 2014. Discrete cuckoo search algorithm for the travellingsalesman problem. Neural Computing and Applications24, 1659-1669. [CrossRef]

77. Georgios Kalantzis, Yu LeiA self-tuned bat algorithm for optimization in radiation therapy treatmentplanning 1-6. [CrossRef]

78. Gai-Ge Wang,Amir H. Gandomi, Amir H. Alavi. 2014. An effective krill herd algorithm with migrationoperator in biogeography-based optimization.Applied Mathematical Modelling38, 2454-2462. [CrossRef]

79. Junpeng Li, Yinggan Tang, Changchun Hua, Xinping Guan. 2014. An improved krill herd algorithm:Krill herd with linear decreasing step.Applied Mathematics and Computation234, 356-367. [CrossRef]

80. Siamak Talatahari, Amir Hossein Gandomi, Gun Jin Yun. 2014. Optimum design of tower structuresusing Firefly Algorithm. The Structural Design ofTall and Special Buildings23:10.1002/tal.v23.5, 350-361.[CrossRef]

81. Bibliography 114-134. [CrossRef]

82. Gai-Ge Wang, Amir H. Gandomi, Amir H. Alavi. 2014. Stud krill herd algorithm. Neurocomputing128,363-370. [CrossRef]

83. Mohamad Amin Bakhshali, Mousa Shamsi. 2014. Segmentation of color lip images by optimalthresholding using bacterial foraging optimization (BFO).Journal of Computational Science5, 251-257.[CrossRef]

84. Bahman Bahmani-Firouzi, Rasoul Azizipanah-Abarghooee. 2014. Optimal sizing of battery energystorage for micro-grid operation management using a new improved bat algorithm. International Journalof Electrical Power & Energy Systems56, 42-54. [CrossRef]

85. Xin-She Yang, Mehmet Karamanoglu, Tao Luan, Slawomir Koziel. 2014. Mathematical modelling and

parameter optimization of pulsating heat pipes.Journal of Computational Science5, 119-125. [CrossRef]86. Gaige Wang, Lihong Guo, Heqi Wang, Hong Duan, Luo Liu, Jiang Li. 2014. Incorporating mutationscheme into krill herd algorithm for global numerical optimization. Neural Computing and Applications24, 853-871. [CrossRef]

87. Amir H. Gandomi, Xin-SheYang. 2014. Chaotic bat algorithm. Journal of Computational Science5,224-232. [CrossRef]

http://dx.doi.org/10.1016/j.jocs.2013.10.002http://dx.doi.org/10.1007/s00521-012-1304-8http://dx.doi.org/10.1016/j.ijepes.2013.10.019http://dx.doi.org/10.1016/j.ijepes.2013.10.019http://dx.doi.org/10.1016/j.jocs.2013.07.001http://dx.doi.org/10.1016/j.neucom.2013.08.031http://dx.doi.org/10.1002/9781118908860.bibliohttp://dx.doi.org/10.1109/SNPD.2014.6888747http://dx.doi.org/10.1016/j.swevo.2013.11.003http://dx.doi.org/10.1016/j.swevo.2013.11.003http://dx.doi.org/10.1007/s10589-014-9637-0http://dx.doi.org/10.1016/j.jocs.2013.10.002http://dx.doi.org/10.1007/s00521-012-1304-8http://dx.doi.org/10.1016/j.jocs.2013.12.003http://dx.doi.org/10.1016/j.ijepes.2013.10.019http://dx.doi.org/10.1016/j.jocs.2013.07.001http://dx.doi.org/10.1016/j.neucom.2013.08.031http://dx.doi.org/10.1002/9781118908860.bibliohttp://dx.doi.org/10.1002/tal.1043http://dx.doi.org/10.1016/j.amc.2014.01.146http://dx.doi.org/10.1016/j.apm.2013.10.052http://dx.doi.org/10.1109/SNPD.2014.6888747http://dx.doi.org/10.1007/s00521-013-1402-2http://dx.doi.org/10.1016/j.swevo.2013.11.003http://dx.doi.org/10.1016/j.eswa.2013.12.030http://dx.doi.org/10.1007/s10589-014-9637-0http://dx.doi.org/10.1061/(ASCE)WR.1943-5452.0000498http://dx.doi.org/10.1007/s00521-013-1485-9

7/25/2019 !!!bat algo

28/30

88. Saeed Gholizadeh, Fayegh Fattahi. 2014. Design optimization of tall steel buildings by a modified particleswarm algorithm. The Structural Design of Tall and Special Buildings23:10.1002/tal.v23.4, 285-301.[CrossRef]

89. Xin-She YangBat Algorithms 141-154. [CrossRef]

90. O. Hasanebi, S. Carbas. 2014. Bat inspired algorithm for discrete size optimization of steel frames.

Advances in Engineering Software67, 173-185. [CrossRef]91. Qifang Luo, Yongquan Zhou, Jian Xie, Mingzhi Ma, Liangliang Li. 2014. Discrete Bat Algorithm

for Optimal Problem of Permutation Flow Shop Scheduling. The Scientific World Journal2014, 1-15.[CrossRef]

92. Jiao-hong Yi, Wei-hong Xu, Yuan-tao Chen. 2014. Novel Back Propagation Optimization by CuckooSearch Algorithm. The Scientific World Journal2014, 1-8. [CrossRef]

93. Xin-She YangAnalysis of Algorithms 23-44. [CrossRef]

94. Xin-She YangA Framework for Self-Tuning Algorithms 175-182. [CrossRef]

95. Xin-She Yang, Slawomir Koziel, Leifur Leifsson. 2014. Computational Optimization, Modelling andSimulation: Past, Present and Future. Procedia Computer Science29, 754-758. [CrossRef]

96. Adis Alihodzic, Milan Tuba. 2014. Improved Bat Algorithm Applied to Multilevel Image Thresholding.The Scientific World Journal2014, 1-16. [CrossRef]

97. Amir Hossein Gandomi, Siamak Talatahari, Xin-She Yang, Suash Deb. 2013. Design optimization of trussstructures using cuckoo search algorithm. The Structural Design of Tall and Special Buildings22:10.1002/tal.v22.17, 1330-1349. [CrossRef]

98. Wipada Parika, Wipada Seesuaysom, Srisatja Vitayasak, Pupong PongcharoenBat algorithm for designingcell formation with a consideration of routing flexibility 1353-1357. [CrossRef]

99. Alireza Fathi, Ahmad Mozaffari. 2013. Identification of a dynamic model for shape memory alloy actuatorusing Hammerstein-Wiener gray box and mutable smart bee algorithm. International Journal of Intelligent

Computing and Cybernetics6:4, 328-357. [Abstract] [Full Text] [PDF]100. Xing-shi He, Wen-Jing Ding, Xin-She Yang. 2013. Bat algorithm based on simulated annealing and

Gaussian perturbations. Neural Computing and Applications. [CrossRef]

101. O. Hasanebi, T. Teke, O. Pekcan. 2013. A bat-inspired algorithm for structural optimization. Computers& Structures128, 77-90. [CrossRef]

102. Xing Wei, Xiaojin YangSpeech dynamic time warping based on ant colony optimization algorithm602-604. [CrossRef]

103. Rishemjit Kaur, Ritesh Kumar, Amol P. Bhondekar, Pawan Kapur. 2013. Human opinion dynamics: Aninspiration to solve complex optimization problems. Scientific Reports3. . [CrossRef]

104. Robert C. Green, Lingfeng Wang, Mansoor Alam, Chanan Singh. 2013. Intelligentstate space pruning for

Monte Carlo simulation with applications in composite power system reliability. Engineering Applicationsof Artificial Intelligence26, 1707-1724. [CrossRef]

105. Xin-She Yang, Suash Deb, Xingshi HeEagle strategy with flower algorithm 1213-1217. [CrossRef]

106. S. Talatahari, N. Mohajer Rahbari, A. Kaveh. 2013. A new hybrid optimization algorithm for recognitionof hysteretic non-linear systems. KSCE Journal of Civil Engineering17, 1099-1108. [CrossRef]

107. Wang Gai-Ge, Hossein Gandomi Amir, Hossein Alavi Amir. 2013. A chaotic particle-swarm krill herdalgorithm for global numerical optimization. Kybernetes42:6, 962-978. [Abstract] [Full Text] [PDF]

http://dx.doi.org/10.1038/srep03008http://dx.doi.org/10.1109/CECNet.2013.6703403http://dx.doi.org/10.1016/j.compstruc.2013.07.006http://dx.doi.org/10.1155/2014/176718http://dx.doi.org/10.1016/j.procs.2014.05.067http://dx.doi.org/10.1016/B978-0-12-416743-8.00012-9http://www.emeraldinsight.com/doi/pdfplus/10.1108/K-11-2012-0108http://www.emeraldinsight.com/doi/full/10.1108/K-11-2012-0108http://dx.doi.org/10.1108/K-11-2012-0108http://dx.doi.org/10.1007/s12205-013-0341-xhttp://dx.doi.org/10.1109/ICACCI.2013.6637350http://dx.doi.org/10.1016/j.engappai.2013.03.006http://dx.doi.org/10.1038/srep03008http://dx.doi.org/10.1109/CECNet.2013.6703403http://dx.doi.org/10.1016/j.compstruc.2013.07.006http://dx.doi.org/10.1007/s00521-013-1518-4http://www.emeraldinsight.com/doi/pdfplus/10.1108/IJICC-02-2013-0003http://www.emeraldinsight.com/doi/full/10.1108/IJICC-02-2013-0003http://dx.doi.org/10.1108/IJICC-02-2013-0003http://dx.doi.org/10.1109/IEEM.2013.6962631http://dx.doi.org/10.1002/tal.1033http://dx.doi.org/10.1155/2014/176718http://dx.doi.org/10.1016/j.procs.2014.05.067http://dx.doi.org/10.1016/B978-0-12-416743-8.00012-9http://dx.doi.org/10.1016/B978-0-12-416743-8.00002-6http://dx.doi.org/10.1155/2014/878262http://dx.doi.org/10.1155/2014/630280http://dx.doi.org/10.1016/j.advengsoft.2013.10.003http://dx.doi.org/10.1016/B978-0-12-416743-8.00010-5http://dx.doi.org/10.1002/tal.1042

7/25/2019 !!!bat algo

29/30

7/25/2019 !!!bat algo

30/30

128. Gholizadeh SaeedStructural Optimization for Frequency Constraints 389-417. [CrossRef]

129. Alireza Azarbakht, Mehdi MousaviApplication of Genetic Algorithms in Ground Motion Selection forSeismic Analysis 319-344. [CrossRef]

130. Emad E. ElbeltagiSwarm Intelligence for Large-Scale Optimization in Construction Management479-495. [CrossRef]

131. Chara Ch. Mitropoulou, Yiannis Fourkiotis, Nikos D. Lagaros, Matthew G. KarlaftisEvolution Strategies-Based Metaheuristics in Structural Design Optimization 79-102. [CrossRef]

132. Xin-She Yang, Mehmet KaramanogluSwarm Intelligence and Bio-Inspired Computation 3-23. [CrossRef]

133. Gaige Wang, Lihong Guo, Amir Hossein Gandomi, Lihua Cao, Amir Hossein Alavi, Hong Duan,Jiang Li. 2013. Lvy-Flight Krill Herd Algorithm. Mathematical Problems in Engineering2013, 1-14.[CrossRef]

134. Jian Xie, Yongquan Zhou, Hongqing Zheng. 2013. A Hybrid Metaheuristic for Multiple Runways AircraftLanding Problem Based on Bat Algorithm.Journal of Applied Mathematics2013, 1-8. [CrossRef]

135. Amir Hossein Gandomi, Amir Hossein Alavi. 2012. Krill herd: A new bio-inspired optimizationalgorithm. Communications in Nonlinear Science and Numerical Simulation17, 4831-4845. [CrossRef]

136. Xin-She Yang, Suash Deb, Mehmet Karamanoglu, Xingshi HeCuckoo search for business optimizationapplications 1-5. [CrossRef]

137. Conclusions and Emerging Topics 238-265. [CrossRef]

138. Xin-She Yang, Suash DebCuckoo Search for Optimization and Computational Intelligence 133-142.[CrossRef]

139. Gai-Ge Wang, Amir H. Gandomi, Amir H. Alavi, Yong-Quan DongA Hybrid Meta-Heuristic MethodBased on Firefly Algorithm and Krill Herd 505-524. [CrossRef]

http://dx.doi.org/10.4018/978-1-4666-9479-8.ch019http://dx.doi.org/10.4018/978-1-4666-5888-2.ch014http://dx.doi.org/10.4018/978-1-4666-4908-8.ch014http://dx.doi.org/10.1109/NCCCS.2012.6412973http://dx.doi.org/10.1016/j.cnsns.2012.05.010http://dx.doi.org/10.1155/2013/742653http://dx.doi.org/10.1155/2013/682073http://dx.doi.org/10.1016/B978-0-12-405163-8.00001-6http://dx.doi.org/10.1016/B978-0-12-398364-0.00004-8http://dx.doi.org/10.1016/B978-0-12-398364-0.00020-6http://dx.doi.org/10.1016/B978-0-12-398364-0.00013-9http://dx.doi.org/10.1016/B978-0-12-398364-0.00016-4