中文摘要：

在混沌猴群算法（Chaotic monkey algorithm,CMA）的思想上,通过选用一个遍历性更好的混沌函数代替了原算法中的Logistic函数,并设计了一种适用于求解动态规划问题的智能算法。先对CMA进行了介绍,接着给出了一类动态优化问题的模型,并将该模型离散化为一类多维函数优化问题,给出了求解各过程的详细步骤和数值例子,说明上述方法的可行性和有效性。

英文摘要：

Based on CMA,a chaotic function was used to solve a class of dynamic optimization problems,which has better than the Logistic function. After given the brief introduction of CMA, a class of dynamic optimization model was proposed. The class of model was discretized into a multidimensional optimization problem and then processes for solving the problem were given. To testify the feasibility and the effectiveness, one numerical example was presented.