Amazing technological breakthrough possible @S-Logix pro@slogix.in

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • pro@slogix.in
  • +91- 81240 01111

Social List

Plant Intelligence based Metaheuristic Optimization Algorithms - 2017

plant-intelligence-based-metaheuristic-optimization-algorithms.jpg

Plant Intelligence based Metaheuristic Optimization Algorithms | S - Logix

Research Area:  Metaheuristic Computing

Abstract:

Classical optimization algorithms are insufficient in large scale combinatorial problems and in nonlinear problems. Hence, metaheuristic optimization algorithms have been proposed. General purpose metaheuristic methods are evaluated in nine different groups: biology-based, physics-based, social-based, music-based, chemical-based, sport-based, mathematics-based, swarm-based, and hybrid methods which are combinations of these. Studies on plants in recent years have showed that plants exhibit intelligent behaviors. Accordingly, it is thought that plants have nervous system. In this work, all of the algorithms and applications about plant intelligence have been firstly collected and searched. Information is given about plant intelligence algorithms such as Flower Pollination Algorithm, Invasive Weed Optimization, Paddy Field Algorithm, Root Mass Optimization Algorithm, Artificial Plant Optimization Algorithm, Sapling Growing up Algorithm, Photosynthetic Algorithm, Plant Growth Optimization, Root Growth Algorithm, Strawberry Algorithm as Plant Propagation Algorithm, Runner Root Algorithm, Path Planning Algorithm, and Rooted Tree Optimization.

Keywords:  
Classical optimization algorithm
combinatorial problems
biology-based
physics-based
social-based
music-based
chemical-based
sport-based
mathematics-based
swarm-based
hybrid methods

Author(s) Name:  Sinem Akyol, Bilal Alatas

Journal name:  Artificial Intelligence Review

Conferrence name:  

Publisher name:  Springer

DOI:  10.1007/s10462-016-9486-6

Volume Information:  47, pages 417–462