摘要
研究了电网规划的优化问题。针对传统电网规划问题在计算过程中,由于物理参数和特定参数取值的广泛性,使得对整个电网网络全局搜索能力较差,收敛速度较慢,易出现陷入局部最优和停滞现象。为了解决上述问题,提出一种改进启发式蚁群算法求解电网线路规划问题。改进算法先建立电网网络体系模型,利用启发式蚁群算法对全局进行搜索,并通过信息素挥发因子的动态参数调节以提高路径的搜索能力和搜索概率,提高了对全局搜索精度,并要求对搜索路径进行求解并反复迭代,对局部更新方式进行重新组合,从而确定了电网网络线路规划问题的最优解。仿真结果表明,在求解过程中可以有效地提高计算精度,加快全局收敛速度,降低了计算的复杂度,增强了电网网络的鲁棒性和稳定性。
The optimization of power network planning was studied. This paper proposed an improved heuristic ant colony algorithm for grid lines planning. The algorithm firstly, establishinged a network system model, using a heuris- tic ant colony algorithm for global search ; secondly, through the pheromone of the dynamic parameters and in order to improve the path search ability and search probability, the global search accuracy was improved; again, the search path was solved and iterated and the local updating ways were recombined, thereby to define the optimal splanning of a grid network. FinalLy, simulation results show that, the solution process can effectively improve the calculation pre- cision, fasten the convergence speed, reduce the computational complexity, and enhance the robustness and stability of power network.
出处
《计算机仿真》
CSCD
北大核心
2013年第1期183-187,共5页
Computer Simulation
基金
河南省科技厅计划基金项目(102300410173)
河南省教育厅自然科学基金项目(2011590001)
洛阳理工学院青年基金项目(2010QZ18)
关键词
蚁群算法
线路规划
最短路径
信息素
优化
Ant colony algorithm
Path planning
Shortest path
Pheromone
Optimization
