Self-organizing hierarchical monkey algorithm with time-varying parameter

Gaoji Sun, Yanfei Lan, Ruiqing Zhao

Research output: Contribution to journalArticlepeer-review

5 Citations (SciVal)


This paper proposes a self-organizing hierarchical monkey algorithm (SHMA) with a time-varying parameter to improve the performance of the original monkey algorithm (MA). In the proposed SHMA, we adopt a hierarchical structure to organize the climb, watch, and somersault operations and apply a self-organizing mechanism to coordinate these operations. Moreover, a time-varying parameter is employed to adjust the exploration ability and exploitation ability during the optimization process. The SHMA also applies the fitness information of solutions to guide the optimization process and introduces a selection operator, a fitness-based replacement operator, and a repulsion operator into the climb, watch and somersault operations, respectively. To investigate the performance of the SHMA, we compare it with eight different metaheuristic algorithms on 30 benchmark problems and four real-world optimization problems. The simulation results show that the SHMA exhibits better overall performance than the eight compared algorithms
Original languageEnglish
Pages (from-to)3245–3263
Number of pages18
JournalNeural Computing and Applications
Publication statusPublished - 10 Nov 2017
Externally publishedYes


  • self-organizing hierarchical monkey algorithm
  • monkey algorithm
  • metaheuristic algorithm
  • global optimization
  • time-varying parameter


Dive into the research topics of 'Self-organizing hierarchical monkey algorithm with time-varying parameter'. Together they form a unique fingerprint.

Cite this