Search published articles


Showing 9 results for Firefly Algorithm

S. Kazemzadeh Azad, S. Kazemzadeh Azad ,
Volume 1, Issue 2 (6-2011)
Abstract

Nature-inspired search algorithms have proved to be successful in solving real-world optimization problems. Firefly algorithm is a novel meta-heuristic algorithm which simulates the natural behavior of fireflies. In the present study, optimum design of truss structures with both sizing and geometry design variables is carried out using the firefly algorithm. Additionally, to improve the efficiency of the algorithm, modifications in the movement stage of artificial fireflies are proposed. In order to evaluate the performance of the proposed algorithm, optimum designs found are compared to the previously reported designs in the literature. Numerical results indicate the efficiency and robustness of the proposed approach.
A. Baghlani,
Volume 2, Issue 3 (7-2012)
Abstract

Optimum control of upstream pumping station in open channels with given constraint in downstream end is presented in this paper. The upstream control is capable of minimizing water level fluctuations in the channel in which the downstream pumping station causes an undesirable wave. The proposed method combines an unsteady non-uniform flow solver with shock-capturing capability, Fourier series and metaheuristic firefly algorithm. Fourier series is used to estimate the optimum inflow control and firefly algorithm is utilized to determine the unknown coefficients in the series. With a suitable objective function, the procedure generates the optimum inflow hydrograph that can effectively cancel destructive downstream waves. The results have been compared with the results obtained by a variational approach and show satisfactory improvement both in simplicity and the value of objective function.
S. Gholizadeh, H. Barati,
Volume 2, Issue 3 (7-2012)
Abstract

In the present study, the computational performance of the particle swarm optimization (PSO) harmony search (HS) and firefly algorithm (FA), as popular metaheuristics, is investigated for size and shape optimization of truss structures. The PSO was inspired by the social behavior of organisms such as bird flocking. The HS imitates the musical performance process which takes place when a musician searches for a better state of harmony, while the FA was based on the idealized behavior of the flashing characteristics of natural fireflies. These algorithms were inspired from different natural sources and their convergence behavior is focused in this paper. Several benchmark size and shape optimization problems of truss structures are solved using PSO, HS and FA and the results are compared. The numerical results demonstrate the superiority of FA to HS and PSO.
R. Kamyab , E. Salajegheh,
Volume 4, Issue 2 (6-2014)
Abstract

This paper presents an efficient meta-heuristic algorithm for optimization of double-layer scallop domes subjected to earthquake loading. The optimization is performed by a combination of harmony search (HS) and firefly algorithm (FA). This new algorithm is called harmony search firefly algorithm (HSFA). The optimization task is achieved by taking into account geometrical and material nonlinearities. Operation of HSFA includes three phases. In the first phase, a preliminary optimization is accomplished using HS. In the second phase, an optimal initial population is produced using the first phase results. In the last phase, FA is employed to find optimum design using the produced optimal initial population. The optimum design obtained by HSFA is compared with those of HS and FA. It is demonstrated that the HSFA converges to better solution compared to the other algorithms.
S. Gholizadeh , H. Asadi , A. Baghchevan,
Volume 4, Issue 3 (9-2014)
Abstract

The main aim of the present paper is to propose efficient multi-objective optimization algorithms (MOOAs) to tackle truss structure optimization problems. The proposed meta-heuristic algorithms are based on the firefly algorithm (FA) and bat algorithm (BA), which have been recently developed for single-objective optimization. In order to produce a well distributed Pareto front, some improvements are implemented on the basic algorithms. The proposed MOOAs are examined for three truss optimization problems, and the results are compared to those of some other well-known methods. The numerical results demonstrate that the proposed MOOAs possess better computational performance compared to the other algorithms.
R. Kamyab Moghadas, S. Gholizadeh,
Volume 7, Issue 1 (1-2017)
Abstract

In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presented to illustrate the efficiency of the proposed algorithm. Numerical results reveal that the proposed algorithm is a powerful optimization technique with improved convergence rate in comparison with other existing algorithms.


S. Delir, A. Foroughi-Asl, S. Talatahari,
Volume 9, Issue 2 (4-2019)
Abstract

Water distribution networks are one of the important and costly infrastructures of cities and many meta-heuristic algorithms in standard or hybrid forms were used for optimizing water distribution networks. These algorithms require a large amount of computational cost. Therefore, the converging speed of algorithms toward the optimization goal is as important as the goal itself. In this paper, a new method is developed by linking the charged system search algorithm and firefly algorithm for optimizing water distribution networks. For evaluating the proposed method, some popular benchmark examples are considered. Simulation results demonstrate the efficiency of the proposed algorithm compared to others.
A. H. Karimi, A. Bazrafshan Moghaddam,
Volume 14, Issue 1 (1-2024)
Abstract

Most industrial-practical projects deal with nonlinearity phenomena. Therefore, it is vital to implement a nonlinear method to analyze their behavior. The Finite Element Method (FEM) is one of the most powerful and popular numerical methods for either linear or nonlinear analysis. Although this method is absolutely robust, it suffers from some drawbacks. One of them is convergency issues, especially in large deformation problems. Prevalent iterative methods such as the Newton-Raphson algorithm and its various modified versions cannot converge in certain problems including some cases such as snap-back or through-back. There are some appropriate methods to overcome this issue such as the arc-length method. However, these methods are difficult to implement. In this paper, a computational framework is presented based on meta-heuristic algorithms to improve nonlinear finite element analysis, especially in large deformation problems. The proposed method is verified via different benchmark problems solved by commercial software. Finally, the robustness of the proposed algorithm is discussed compared to the classic methods.
 
A.h. Karimi, A. Bazrafshan Moghaddam,
Volume 14, Issue 2 (2-2024)
Abstract

Most industrial-practical projects deal with nonlinearity phenomena. Therefore, it is vital to implement a nonlinear method to analyze their behavior. The Finite Element Method (FEM) is one of the most powerful and popular numerical methods for either linear or nonlinear analysis. Although this method is absolutely robust, it suffers from some drawbacks. One of them is convergency issues, especially in large deformation problems. Prevalent iterative methods such as the Newton-Raphson algorithm and its various modified versions cannot converge in certain problems including some cases such as snap-back or through-back. There are some appropriate methods to overcome this issue such as the arc-length method. However, these methods are difficult to implement. In this paper, a computational framework is presented based on meta-heuristic algorithms to improve nonlinear finite element analysis, especially in large deformation problems. The proposed method is verified via different benchmark problems solved by commercial software. Finally, the robustness of the proposed algorithm is discussed compared to the classic methods.

Page 1 from 1     

© 2024 CC BY-NC 4.0 | Iran University of Science & Technology

Designed & Developed by : Yektaweb