Tree Physiology Optimization in Benchmark Function and Traveling Salesman Problem Academic Article uri icon

abstract

  • Abstract Nature has the ability of sustainability and improvisation for better survival. This unique characteristic reflects a pattern of optimization that inspires the computational intelligence toward different scopes of optimization: a nondeterministic optimization approach or a nature-inspired metaheuristic algorithm. To date, there are many metaheuristic algorithms introduced with good promising results and also becoming a powerful method for solving numerous optimization problems. In this paper, a new metaheuristic algorithm inspired from a plant growth system is proposed, which is defined as tree physiology optimization (TPO). A plant growth consists of two main counterparts: plant shoots and roots. Shoots extend to find better sunlight for the photosynthesis process that converts light and water supplied from the roots into energy for plant growth; at the same time, roots elongate in the opposite way in search for water and nutrients for shoot survival. The collaboration from both systems ensures plant sustainability. This idea is transformed into an optimization algorithm: shoots with defined branches find the potential solution with the help of roots variable. The shoots-branches extension enhances the search diversity and the root system amplifying the search via evaluated fitness. To demonstrate its effectiveness, two different classes of problem are evaluated: (1) a continuous benchmark test function compared to particle swarm optimization (PSO) and genetic algorithm (GA) and (2) an NP-hard problem with the traveling salesman problem (TSP) compared to GA and nearest-neighbor (NN) algorithm. The simulation results show that TPO outperforms PSO and GA in all problem characteristics (flat surface and steep-drop with a combination of many local minima and plateau). In the TSP, TPO has a comparable result to GA.

publication date

  • 2019

number of pages

  • 22

start page

  • 849

end page

  • 871

volume

  • 28

issue

  • 5