Discrete Monkey Algorithm And Chaotic Monkey Algorithm And Its Application

In recent years, a large number of good intelligence algorithms has appeared,which largely enhanced the ability to solve complex optimization problems, andis widely used in the engineering practice of scientific computing. As a newintelligence algorithm, Monkey Algorithm (MA) has a great advantage in dealingwith large-scale, multi-peak optimization problems, which have great applicationprospects in engineering practices.Discrete Monkey Algorithm (DMA) is designed for a class of combinationoptimization problems. DMA improves climbing process, which solvs the failureof MA in climbing process of combinatorial optimization problems containingdiscrete variables. Information sharing mechanism and disturbance process areintroduced, which improve the solution efciency and robustness of algorithm.In the end, one numerical example is given.Chaotic Monkey Algorithm (CMA) is designed for a class of dynamic op-timization problems. Dynamic optimization problem is discretized, and chaoticsearch process is improved, which improves the efciency of solving problems. Inthe end, two numerical examples are given.