Amir Hossein Gandomi

Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems

In this study, a new metaheuristic optimization algorithm, called cuckoo search (CS), is introduced for solving structural optimization tasks. The new CS algorithm in combination with Lévy flights is first verified using a benchmark nonlinear constrained optimization problem. For the validation against structural engineering optimization problems, CS is subsequently applied to 13 design problems reported in the specialized literature. The performance of the CS algorithm is further compared with various algorithms representative of the state of the art in the area. The optimal solutions obtained by CS are mostly far better than the best solutions obtained by the existing methods. The unique search features used in CS and the implications for future research are finally discussed in detail.

Bat algorithm: a novel approach for global engineering optimization

– 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., – The proposed BA is based on the echolocation behavior of bats. After a detailed formulation and explanation of its implementation, BA is verified using eight nonlinear engineering optimization problems reported in the specialized literature., – BA has been carefully implemented and carried out optimization for eight well‐known optimization tasks; then a comparison has been made between the proposed algorithm and other existing algorithms., – The optimal solutions obtained by the proposed algorithm are better than the best 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.

Firefly Algorithm for solving non-convex economic dispatch problems with valve loading effect

The growing costs of fuel and operation of power generating units warrant improvement of optimization methodologies for economic dispatch (ED) problems. The practical ED problems have non-convex objective functions with equality and inequality constraints that make it much harder to find the global optimum using any mathematical algorithms. Modern optimization algorithms are often meta-heuristic, and they are very promising in solving nonlinear programming problems. This paper presents a novel approach to determining the feasible optimal solution of the ED problems using the recently developed Firefly Algorithm (FA). Many nonlinear characteristics of power generators, and their operational constraints, such as generation limitations, prohibited operating zones, ramp rate limits, transmission loss, and nonlinear cost functions, were all contemplated for practical operation. To demonstrate the efficiency and applicability of the proposed method, we study four ED test systems having non-convex solution spaces and compared with some of the most recently published ED solution methods. The results of this study show that the proposed FA is able to find more economical loads than those determined by other methods. This algorithm is considered to be a promising alternative algorithm for solving the ED problems in practical power systems.

BAT ALGORITHM FOR CONSTRAINED OPTIMIZATION TASKS

In this study, we use a new metaheuristic optimization algorithm, called bat algorithm (BA), to solve constraint optimization tasks. BA is verified using several classical benchmark constraint problems. For further validation, BA is applied to three benchmark constraint engineering problems reported in the specialized literature. The performance of the bat algorithm is compared with various existing algorithms. The optimal solutions obtained by BA are found to be better than the best solutions provided by the existing methods. Finally, the unique search features used in BA are analyzed, and their implications for future research are discussed in detail.

Chaotic Krill Herd algorithm

Recently, Gandomi and Alavi proposed a meta-heuristic optimization algorithm, called Krill Herd (KH). This paper introduces the chaos theory into the KH optimization process with the aim of accelerating its global convergence speed. Various chaotic maps are considered in the proposed chaotic KH (CKH) method to adjust the three main movements of the krill in the optimization process. Several test problems are utilized to evaluate the performance of CKH. The results show that the performance of CKH, with an appropriate chaotic map, is better than or comparable with the KH and other robust optimization approaches

Chaotic bat algorithm

Abstract Bat algorithm (BA) is a recent metaheuristic optimization algorithm proposed by Yang. In the present study, we have introduced chaos into BA so as to increase its global search mobility for robust global optimization. Detailed studies have been carried out on benchmark problems with different chaotic maps. Here, four different variants of chaotic BA are introduced and thirteen different chaotic maps are utilized for validating each of these four variants. The results show that some variants of chaotic BAs can clearly outperform the standard BA for these benchmarks.

Multi-stage genetic programming: A new strategy to nonlinear system modeling

This paper presents a new multi-stage genetic programming (MSGP) strategy for modeling nonlinear systems. The proposed strategy is based on incorporating the individual effect of predictor variables and the interactions among them to provide more accurate simulations. According to the MSGP strategy, an efficient formulation for a problem comprises different terms. In the first stage of the MSGP-based analysis, the output variable is formulated in terms of an influencing variable. Thereafter, the error between the actual and the predicted value is formulated in terms of a new variable. Finally, the interaction term is derived by formulating the difference between the actual values and the values predicted by the individually developed terms. The capabilities of MSGP are illustrated by applying it to the formulation of different complex engineering problems. The problems analyzed herein include the following: (i) simulation of pH neutralization process, (ii) prediction of surface roughness in end milling, and (iii) classification of soil liquefaction conditions. The validity of the proposed strategy is confirmed by applying the derived models to the parts of the experimental results that were not included in the analyses. Further, the external validation of the models is verified using several statistical criteria recommended by other researchers. The MSGP-based solutions are capable of effectively simulating the nonlinear behavior of the investigated systems. The results of MSGP are found to be more accurate than those of standard GP and artificial neural network-based models.

A robust data mining approach for formulation of geotechnical engineering systems

Purpose – The complexity of analysis of geotechnical behavior is due to multivariable dependencies of soil and rock responses. In order to cope with this complex behavior, traditional forms of engineering design solutions are reasonably simplified. Incorporating simplifying assumptions into the development of the traditional models may lead to very large errors. The purpose of this paper is to illustrate capabilities of promising variants of genetic programming (GP), namely linear genetic programming (LGP), gene expression programming (GEP), and multi‐expression programming (MEP) by applying them to the formulation of several complex geotechnical engineering problems.Design/methodology/approach – LGP, GEP, and MEP are new variants of GP that make a clear distinction between the genotype and the phenotype of an individual. Compared with the traditional GP, the LGP, GEP, and MEP techniques are more compatible with computer architectures. This results in a significant speedup in their execution. These method...

Nonlinear Genetic-Based Models for Prediction of Flow Number of Asphalt Mixtures

Rutting has been considered the most serious distress in flexible pavements for many years. Flow number is an explanatory index for the evaluation of the rutting potential of asphalt mixtures. In this study, a promising variant of genetic programming, namely, gene expression programming (GEP), is utilized to predict the flow number of dense asphalt-aggregate mixtures. The proposed constitutive models relate the flow number of Marshall specimens to the coarse and fine aggregate contents, percentage of air voids, percentage of voids in mineral aggregate, Marshall stability, and Marshall flow. Different correlations were developed using different combinations of the influencing parameters. The comprehensive experimental database used for the development of the correlations was established on the basis of a series of uniaxial dynamic-creep tests conducted in this study. Relative importance values of various predictor variables were calculated to determine their contributions to the flow number prediction. A multiple-least-squares-regression (MLSR) analysis was performed to benchmark the GEP models. For more verification, a subsequent parametric study was carried out, and the trends of the results were confirmed with the results of previous studies. The results indicate that the proposed correlations are effectively capable of evaluating the flow number of asphalt mixtures. The GEP-based formulas are simple, straightforward, and particularly valuable for providing an analysis tool accessible to practicing engineers.

Interior search algorithm (ISA): a novel approach for global optimization.

This paper presents the interior search algorithm (ISA) as a novel method for solving optimization tasks. The proposed ISA is inspired by interior design and decoration. The algorithm is different from other metaheuristic algorithms and provides new insight for global optimization. The proposed method is verified using some benchmark mathematical and engineering problems commonly used in the area of optimization. ISA results are further compared with well-known optimization algorithms. The results show that the ISA is efficiently capable of solving optimization problems. The proposed algorithm can outperform the other well-known algorithms. Further, the proposed algorithm is very simple and it only has one parameter to tune.