Plenary Lecture
Artificial Bee Colony (ABC) Algorithm with Crossover and Mutation
Professor Milan Tuba
University Megatrend Belgrade
Faculty of Computer Science
Serbia
E-mail: tuba@ieee.org
Abstract: Combinatorial and continuous hard optimization problems were recently successfully approached by nature inspired metaheuristics. Swarm intelligence represents an important subclass of nature inspired algorithms and artificial bee colony (ABC) is one of its relatively new members. For all such heuristically guided search algorithms, balance between exploitation and exploration is most important. If that balance is not achieved the algorithm can be (by too much exploitation) prematurely trapped in local optima, or it can (by too much exploration) avoid convergence similarly to pure Monte Carlo search. It is generally considered that employed bees and onlooker bees in the ABC algorithm perform exploitation, while scout bees perform exploration. We have shown that the real situation is more complicated: some exploration is actually done by the employed bees and a way in which a new candidate solution is generated is of crucial importance. Previously we improved the ABC algorithm for a class of problems by limiting the new solution location from the hyper-cube to the diagonal and its projections between two existing solutions. Here we introduce new solution generation with a technique similar to the crossover from genetic algorithms and show additional improvement in the ABC algorithm. Also, in the scout phase random solution generation can successfully be replaced by a controlled mutation.
Brief Biography of the Speaker: Milan Tuba is Professor of Computer Science and Provost for mathematical, natural and technical sciences at Megatrend University of Belgrade. He received B. S. in Mathematics, M. S. in Mathematics, M. S. in Computer Science, M. Ph. in Computer Science, Ph. D. in Computer Science from University of Belgrade and New York University. From 1983 to 1994 he was in the U.S.A. first as a graduate student and teaching and research assistant at Vanderbilt University in Nashville and Courant Institute of Mathematical Sciences, New York University and later as Assistant Professor of Electrical Engineering at Cooper Union Graduate School of Engineering, New York. During that time he was the founder and director of Microprocessor Lab and VLSI Lab, leader of scientific projects and supervisor of many theses. From 1994 he was Assistant Professor of Computer Science and Director of Computer Center at University of Belgrade, from 2001 Associate Professor, Faculty of Mathematics, and from 2004 also a Professor of Computer Science and Dean of the College of Computer Science, Megatrend University Belgrade. He was teaching more than 20 graduate and undergraduate courses, from VLSI Design and Computer Architecture to Computer Networks, Operating Systems, Image Processing, Calculus and Queuing Theory. His research interest includes mathematical, queuing theory and heuristic optimizations applied to computer networks, image processing and combinatorial problems. He is the author or coauthor of more than 130 scientific papers and coeditor or member of the editorial board or scientific committee of number of scientific journals and conferences. Member of the ACM since 1983, IEEE 1984, New York Academy of Sciences 1987, AMS 1995, SIAM 2009.