Root system growth biomimicry for global optimization models and emergent behaviors
- 147 Downloads
Terrestrial plants have evolved remarkable adaptability that enables them to sense environmental stimuli and use this information as a basis for governing their growth orientation and root system development. In this paper, we explain the foraging behaviors of plant root and develop simulation models based on the principles of adaptation processes that view root growing as optimization. This provides us with new methods for global optimization. Accordingly a novel bioinspired optimizer, namely the root system growth algorithm (RSGA), is proposed, which adopts the root foraging, memory and communication and auxin-regulated mechanism of the root system. Then RSGA is benchmarked against several state-of-the-art reference algorithms on a suit of CEC2014 functions. Experimental results show that RSGA can obtain satisfactory performances on several benchmarks in terms of accuracy, robustness and convergence speed. Moreover, a comprehensive simulation is conducted to investigate the explicit adaptability of root system in RSGA. That is, in order to be able to climb noisy gradients in nutrients in soil, the foraging behaviors of root system are social and cooperative that is analogous to animal foraging behaviors.
KeywordsPlant root system Optimization Growth simulation TSP
This research is partially supported by National Natural Science Foundation of China under Grant 61503373; Natural Science Foundation of Liaoning Province under Grant 2015020002; and Natural Science Foundation of Guangdong Province under Grant 2015A030310274.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- Administrator (2015) A performance comparison of GA and ACO applied to TSP. Int J Comput Appl 117(20):28–35Google Scholar
- Bradbury JW, Vehrencamp SL (1998) Principles of animal communication. Sinauer, SunderlandGoogle Scholar
- Gilroy S, Masson PH (eds) (2008) Plant tropisms. Blackwell Publishing, OxfordGoogle Scholar
- Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: Proceedings on IEEE congress on evolutionary computation, pp 1671–1676Google Scholar
- Liang J, Qu B, Suganthan P (2013) Problem Definitions and Evaluation Criteria for the CEC 2014 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization, Technical ReportGoogle Scholar
- Noon CE (1988) The generalized traveling salesman problem, Ph.D. thesis. University of Michigan,Google Scholar
- Savio MRD, Sankar A, Vijayarajan NR (2014) A novel enumeration strategy of maximal bicliques from 3-dimensional symmetric adjacency matrix. Int J Artif Intell 12(2):42–56Google Scholar
- Shi YH, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of IEEE world congress on computational intelligence, pp 69–73Google Scholar
- Sumathi S, Hamsapriya T, Surekha P (2008) Evolutionary intelligence: an introduction to theory and applications with matlab. Springer, BerlinGoogle Scholar