The artificial tree (AT) algorithm

Bionic intelligence algorithms have many advantages compared with traditional optimization algorithms. In this paper, inspired by the growth law of trees, a new bionic algorithm, named artificial tree (AT) algorithm is developed. In the proposed AT, the branch position is considered as the design variable. In addition, the branch is the solution, and the branch thickness is the indicator of the solution. The computing process of AT is achieved by simulating the transport of organic matters and the update of tree branches. The comparative analysis using thirty typical benchmark problems between AT algorithm and some well-known bionic intelligent methods is also performed. Based on numerical results, AT is found to be very effective in dealing with various problems. Display Omitted

[1]  Jun Zhang,et al.  Adaptive Particle Swarm Optimization , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[3]  Paul S. Andrews,et al.  An Investigation into Mutation Operators for Particle Swarm Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[4]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[5]  Stratis Ioannidis,et al.  Privacy Auctions for Recommender Systems , 2014, TEAC.

[6]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[7]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[8]  Sandra Paterlini,et al.  High performance clustering with differential evolution , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[9]  Chia-Ju Wu,et al.  Design of fuzzy logic controllers using genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[10]  J. Lampinen.  A constraint handling approach for the differential evolution algorithm , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[11]  Wei-Chiang Hong,et al.  Traffic flow forecasting by seasonal SVR with chaotic simulated annealing algorithm , 2011, Neurocomputing.

[12]  Roy J. Hartfield,et al.  Aerospace design optimization using a steady state real-coded genetic algorithm , 2008, Appl. Math. Comput..

[13]  A. Stacey,et al.  Particle swarm optimization with mutation , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[14]  M. N. Vrahatis,et al.  Objective function “stretching” to alleviate convergence to local minima , 2001 .

[15]  Duanfeng Han,et al.  Vessel traffic flow forecasting by RSVR with chaotic cloud simulated annealing genetic algorithm and KPCA , 2015, Neurocomputing.

[16]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[17]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[19]  Oscar Cordón,et al.  A fast and accurate approach for 3D image registration using the scatter search evolutionary algorithm , 2006, Pattern Recognit. Lett..

[20]  Troy Lee,et al.  How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony , 2002, Open Syst. Inf. Dyn..

[21]  T. K. Radhakrishnan,et al.  Real-coded genetic algorithm for system identification and controller tuning , 2009 .

[22]  Bir Bhanu,et al.  Fingerprint matching by genetic algorithms , 2006, Pattern Recognit..

[23]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[24]  Chun-Liang Lin,et al.  Microbrushless DC Motor Control Design Based on Real-Coded Structural Genetic Algorithm , 2011, IEEE/ASME Transactions on Mechatronics.

[25]  Nurhan Karaboga,et al.  Digital IIR Filter Design Using Differential Evolution Algorithm , 2005, EURASIP J. Adv. Signal Process..

[26]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[27]  Valery Tereshko,et al.  Reaction-Diffusion Model of a Honeybee Colony's Foraging Behaviour , 2000, PPSN.

[28]  Dervis Karaboga,et al.  A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..

[29]  Sam Kwong,et al.  Genetic algorithms and their applications , 1996, IEEE Signal Process. Mag..

[30]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[31]  Hossein Nezamabadi-pour,et al.  Edge detection using ant algorithms , 2006, Soft Comput..

[32]  Joni-Kristian Kämäräinen,et al.  Differential Evolution Training Algorithm for Feed-Forward Neural Networks , 2003, Neural Processing Letters.

[33]  Sahand Ghavidel,et al.  Modified teaching learning algorithm and double differential evolution algorithm for optimal reactive power dispatch problem: A comparative study , 2014, Inf. Sci..

[34]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.