zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A modified artificial bee colony algorithm. (English) Zbl 1251.90006
Summary: Artificial bee colony algorithm (ABC) is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. Inspired by differential evolution (DE), we propose an improved solution search equation, which is based on that the bee searches only around the best solution of the previous iteration to improve the exploitation. Then, in order to make full use of and balance the exploration of the solution search equation of ABC and the exploitation of the proposed solution search equation, we introduce a selective probability P and get the new search mechanism. In addition, to enhance the global convergence, when producing the initial population, both chaotic systems and opposition-based learning methods are employed. The new search mechanism together with the proposed initialization makes up the modified ABC (MABC for short), which excludes the probabilistic selection scheme and scout bee phase. Experiments are conducted on a set of 28 benchmark functions. The results demonstrate good performance of MABC in solving complex numerical optimization problems when compared with two ABC-based algorithms.
90-04Machine computation, programs (optimization)
90-08Computational methods (optimization)
90C59Approximation methods and heuristics
[1]Tang, K. S.; Man, K. F.; Kwong, S.; He, Q.: Genetic algorithms and their applications, IEEE signal processing magazine 13, 22-37 (1996)
[2]Kennedy, J.; Eberhart, R.: Particle swarm optimization, , 1942-1948 (1995)
[3]Dorigo, M.; Stutzle, T.: Ant colony optimization, (2004)
[4]Simon, D.: Biogeography-based optimization, IEEE transaction on evolutionary computation 12, 702-713 (2008)
[5]Wang, D. W.: Colony location algorithm for assignment problems, Journal of control theory and applications 2, 111-116 (2004)
[6]Karaboga D. An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Kayseri, Turkey: Erciyes University; 2005.
[7]Karaboga, D.; Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, Journal of global optimization 39, 171-459 (2007) · Zbl 1149.90186 · doi:10.1007/s10898-007-9149-x
[8]Karaboga, D.; Basturk, B.: On the performance of artificial bee colony (ABC) algorithm, Applied soft computing 8, 687-697 (2008)
[9]Karaboga, D.; Basturk, B.: A comparative study of artificial bee colony algorithm, Applied mathematics and computation 214, 108-132 (2009) · Zbl 1169.65053 · doi:10.1016/j.amc.2009.03.090
[10]Singh, A.: An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem, Applied soft computing 9, 625-631 (2009)
[11]Kang, F.: Structural inverse analysis by hybrid simplex artificial bee colony algorithms, Computers & structures 87, 861-870 (2009)
[12]Samrat, L.: Artificial bee colony algorithm for small signal model parameter extraction of MESFET, Engineering applications of artificial intelligence 11, 1573-2916 (2010)
[13]Storn, R.; Price, K.: Differential evolution–A simple and efficient heuristic for global optimization over continuous spaces, Journal of global optimization 23, 689-694 (2010)
[14]Zhu, G. P.; Kwong, S.: Gbest-guided artificial bee colony algorithm for numerical function optimization, Applied mathematics and computation (2010)
[15]Akay, B.; Karaboga, D.: A modified artificial bee colony algorithm for real-parameter optimization, Information sciences (2010)
[16]Alatas, B.: Chaotic bee colony algorithms for global numerical optimization, Expert systems with applications 37, 5682-5687 (2010)
[17]Rahnamayan, S.: Opposition-based differential evolution, IEEE transaction on evolutionary computation 12, 64-79 (2008)
[18]Shang, Y. W.; Qiu, Y. H.: A note on the extended rosenbrock function, Evolutionary computation 14, 119-126 (2006)