Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10347190 | Computers & Operations Research | 2012 | 12 Pages |
Abstract
To solve such problems, the present work proposes three new variations of BBO. Each new version uses different update strategies, and each is tested on several benchmark functions. A successful implementation of an additional selection procedure is also proposed in this work which is based on the feasibility-based rule to preserve fitter individuals for subsequent generations. Our extensive experimentations successfully demonstrate the usefulness of all these modifications proposed for the BBO algorithm that can be suitably applied for solving different types of constrained optimization problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ilhem Boussaïd, Amitava Chatterjee, Patrick Siarry, Mohamed Ahmed-Nacer,