Heuristic-Based Firefly Algorithm for Bound Constrained Nonlinear Binary Optimization
نویسندگان
چکیده
منابع مشابه
Heuristic-Based Firefly Algorithm for Bound Constrained Nonlinear Binary Optimization
Firefly algorithm (FA) is a metaheuristic for global optimization. In this paper, we address the practical testing of a heuristic-based FA (HBFA) for computing optima of discrete nonlinear optimization problems, where the discrete variables are of binary type. An important issue in FA is the formulation of attractiveness of each firefly which in turn affects its movement in the search space. Dy...
متن کاملFirefly Algorithm for Continuous Constrained Optimization Tasks
The paper provides an insight into the improved novel metaheuristics of the Firefly Algorithm for constrained continuous optimization tasks. The presented technique is inspired by social behavior of fireflies and the phenomenon of bioluminescent communication. The first part of the paper is devoted to the detailed description of the existing algorithm. Then some suggestions for extending the si...
متن کاملFirefly Algorithm with a Feasibility-Based Rules for Constrained Optimization
Firefly algorithm (FA) is recently developed nature-inspired metaheuristic based on the flashing patterns and behaviour of fireflies. Original FA was successfully applied to solve unconstrained optimization problems. This paper presents firefly algorithm to solve constrained optimization problems. For constraint handling, firefly algorithm uses certain feasibility-based rules in order to guide ...
متن کاملDesign of a Constrained Nonlinear Controller using Firefly Algorithm for Active Suspension System
Active vehicle suspension system is designed to increase the ride comfort and road holding of vehicles. Due to limitations in the external force produced by actuator, the design problem encounters the constraint on the control input. In this paper, a novel nonlinear controller with the input constraint is designed for the active suspension system. In the proposed method, at first, a constrained...
متن کاملExtensions of Firefly Algorithm for Nonsmooth Nonconvex Constrained Optimization Problems
Firefly Algorithm (FA) is a stochastic population-based algorithm based on the flashing patterns and behavior of fireflies. Original FA was created and successfully applied to solve bound constrained optimization problems. In this paper we present extensions of FA for solving nonsmooth nonconvex constrained global optimization problems. To handle the constraints of the problem, feasibility and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Operations Research
سال: 2014
ISSN: 1687-9147,1687-9155
DOI: 10.1155/2014/215182