𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An artificial beehive algorithm for continuous optimization

✍ Scribed by Mario A. Muñoz; Jesús A. López; Eduardo Caicedo

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
135 KB
Volume
24
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents an artificial beehive algorithm for optimization in continuous search spaces based on a model aimed at individual bee behavior. The algorithm defines a set of behavioral rules for each agent to determine what kind of actions must be carried out. Also, the algorithm proposed includes some adaptations not considered in the biological model to increase the performance in the search for better solutions. To compare the performance of the algorithm with other swarmbased Techniques, we conducted statistical analyses by using the so-called t test. This comparison is done with several common benchmark functions.

📜 SIMILAR VOLUMES

An algorithm for minimax parameter optim
An algorithm for minimax parameter optimization
✍ J.E. Heller; J.B. Cruz Jr. 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 905 KB

Sunnnary--The minimization, with respect to a set of parameters, of the maximum, with respect to another set of parameters, of a scalar performance index is considered. An algorithm for generating a sequence with a limit point which satisfies a necessary condition for a minimax solution is presented

An Optimal Parallel Matching Algorithm f
An Optimal Parallel Matching Algorithm for Cographs
✍ R. Lin; S. Olariu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 865 KB

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an \(n\)-v

A multi-start threshold accepting algori
A multi-start threshold accepting algorithm for multiple objective continuous optimization problems
✍ Souhail Dhouib; Aïda Kharrat; Habib Chabchoub 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 591 KB

## Abstract A multi‐start threshold accepting algorithm with an adaptive memory (MS‐TA) is proposed to solve multiple objective continuous optimization problems. The aim of this paper is to find efficiently multiple Pareto‐optimal solutions. Comparisons are carried out with multiple objective taboo