离散猴群算法及其在输电网扩展规划中的应用

Discrete Monkey Algorithm and Its Application in Transmission Network Expansion Planning

猴群算法(MA)是一种只适于求解连续变量优化问题的群智能算法.针对MA的局限并结合输电网扩展规划问题的特点,设计了能够求解含有离散变量优化问题的离散猴群算法(DMA).算法中提出的大、小2种爬过程解决了原猴群算法求解离散优化问题时爬过程失效的问题,合作过程和随机扰动机制的引入也提高了算法的计算效率.算例结果表明,DMA计算速度快,鲁棒性强,用很小的猴群规模就能够对不同维数的输电网扩展规划问题均达到很好的计算效果.

Monkey algorithm（MA）is a swarm intelligence algorithm only for optimization problems with continuous variables.In view of the limitations of MA and the features of transmission network expansion planning,discrete monkey algorithm（DMA）is proposed for optimization problems with discrete variables.Large-step and small-step climb processes were designed to tackle the problem of invalid climb process in discrete optimization with primary MA.Cooperation process and stochastic perturbation mechanism were also introduced to improve the computational efficiency of the proposed algorithm.The numerical results demonstrate that DMA has strong robustness and is capable of solving expansion planning problems of various dimensions efficiently and rapidly with small population size.