Amir Hossein Alavi
Michigan State University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Amir Hossein Alavi.
Engineering With Computers | 2013
Amir Hossein Gandomi; Xin-She Yang; Amir Hossein Alavi
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.
Neural Computing and Applications | 2013
Amir Hossein Gandomi; Xin-She Yang; Amir Hossein Alavi; Siamak Talatahari
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.
Information Sciences | 2011
Amir Hossein Gandomi; Amir Hossein Alavi
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.
Engineering Computations | 2011
Amir Hossein Alavi; Amir Hossein Gandomi
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...
Journal of Materials in Civil Engineering | 2011
Amir Hossein Gandomi; Amir Hossein Alavi; Mohammad Reza Mirzahosseini; Fereidoon Moghadas Nejad
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.
Neurocomputing | 2014
Gai-Ge Wang; Amir Hossein Gandomi; Amir Hossein Alavi
Recently, Gandomi and Alavi proposed a meta-heuristic optimization algorithm, called Krill Herd (KH), for global optimization [Gandomi AH, Alavi AH. Krill Herd: A New Bio-Inspired Optimization Algorithm. Communications in Nonlinear Science and Numerical Simulation, 17(12), 4831-4845, 2012.]. This paper represents an optimization method to global optimization using a novel variant of KH. This method is called the Stud Krill Herd (SKH). Similar to genetic reproduction mechanisms added to KH method, an updated genetic reproduction schemes, called stud selection and crossover (SSC) operator, is introduced into the KH during the krill updating process dealing with numerical optimization problems. The introduced SSC operator is originated from original Stud genetic algorithm. In SSC operator, the best krill, the Stud, provides its optimal information for all the other individuals in the population using general genetic operators instead of stochastic selection. This approach appears to be well capable of solving various functions. Several problems are used to test the SKH method. In addition, the influence of the different crossover types on convergence and performance is carefully studied. Experimental results indicate an instructive addition to the portfolio of swarm intelligence techniques.
Neural Computing and Applications | 2012
Amir Hossein Gandomi; Amir Hossein Alavi
This paper presents a new approach for behavioral modeling of structural engineering systems using a promising variant of genetic programming (GP), namely multi-gene genetic programming (MGGP). MGGP effectively combines the model structure selection ability of the standard GP with the parameter estimation power of classical regression to capture the nonlinear interactions. The capabilities of MGGP are illustrated by applying it to the formulation of various complex structural engineering problems. The problems analyzed herein include estimation of: (1) compressive strength of high-performance concrete (2) ultimate pure bending of steel circular tubes, (3) surface roughness in end-milling, and (4) failure modes of beams subjected to patch loads. The derived straightforward equations are linear combinations of nonlinear transformations of the predictor variables. The validity of MGGP is confirmed by applying the derived models to the parts of the experimental results that are not included in the analyses. The MGGP-based equations can reliably be employed for pre-design purposes. The results of MSGP are found to be more accurate than those of solutions presented in the literature. MGGP does not require simplifying assumptions in developing the models.
Neural Computing and Applications | 2014
Gai-Ge Wang; Amir Hossein Gandomi; Amir Hossein Alavi; Guo-sheng Hao
AbstractIn order to overcome the poor exploitation of the krill herd (KH) algorithm, a hybrid differential evolution KH (DEKH) method has been developed for function optimization. The improvement involves adding a new hybrid differential evolution (HDE) operator into the krill, updating process for the purpose of dealing with optimization problems more efficiently. The introduced HDE operator inspires the intensification and lets the krill perform local search within the defined region. DEKH is validated by 26 functions. From the results, the proposed methods are able to find more accurate solution than the KH and other methods. In addition, the robustness of the DEKH algorithm and the influence of the initial population size on convergence and performance are investigated by a series of experiments.
Neural Computing and Applications | 2012
Amir Hossein Gandomi; Amir Hossein Alavi
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 methods may lead to very large errors. This paper presents an endeavor to exploit a robust multi-gene genetic programming (MGGP) method for the analysis of geotechnical and earthquake engineering systems. MGGP is a modified genetic programming approach for model structure selection combined with a classical technique for parameter estimation. To justify the abilities of MGGP, it is systematically employed to formulate the complex geotechnical engineering problems. Different classes of the problems analyzed include the assessment of (i) undrained lateral load capacity of piles, (ii) undrained side resistance alpha factor for drilled shafts, (iii) settlement around tunnels, and (iv) soil liquefaction. The validity of the derived models is tested for a part of test results beyond the training data domain. Numerical examples show the superb accuracy, efficiency, and great potential of MGGP. Contrary to artificial neural networks and many other soft computing tools, MGGP provides constitutive prediction equations. The MGG-based solutions are particularly valuable for pre-design practices.
Neurocomputing | 2014
Lihong Guo; Gai-Ge Wang; Amir Hossein Gandomi; Amir Hossein Alavi; Hong Duan
This study presents an improved krill herd (IKH) approach to solve global optimization problems. The main improvement pertains to the exchange of information between top krill during motion calculation process to generate better candidate solutions. Furthermore, the proposed IKH method uses a new Levy flight distribution and elitism scheme to update the KH motion calculation. This novel meta-heuristic approach can accelerate the global convergence speed while preserving the robustness of the basic KH algorithm. Besides, the detailed implementation procedure for the IKH method is described. Several standard benchmark functions are used to verify the efficiency of IKH. Based on the results, the performance of IKH is superior to or highly competitive with the standard KH and other robust population-based optimization methods