准确的风功率预测对电力系统安全、稳定运行具有重要意义,而风速预测是风功率预测的关键。文章提出一种基于优化模糊C均值(Optimal Fuzzy C means,OFCM)聚类的组合风速短期预测方法。首先,采用模拟退火遗传算法优化模糊C均值聚类算法的...准确的风功率预测对电力系统安全、稳定运行具有重要意义,而风速预测是风功率预测的关键。文章提出一种基于优化模糊C均值(Optimal Fuzzy C means,OFCM)聚类的组合风速短期预测方法。首先,采用模拟退火遗传算法优化模糊C均值聚类算法的初始聚类中心;其次,基于优化模糊C均值聚类算法将初始风速属性样本数据进行分组;再根据不同风速样本组,运用极限学习机(Extremely Learning Machine,ELM)构建组合风速预测模型;最后,通过风速实测值与预测值的对比,验证了该方法的可行性。展开更多
Coverage challenge for small considered to be a optlmlzation is a main cell clusters which are promising solution to provide seamless cellular coverage for large indoor or outdoor areas. This paper focuses on small ce...Coverage challenge for small considered to be a optlmlzation is a main cell clusters which are promising solution to provide seamless cellular coverage for large indoor or outdoor areas. This paper focuses on small cell cluster coverage problems and proposes both centralized and distributed self-optimization methods. Modified Particle swarm optimization （MPSO） is introduced to centralized optimization which employs particle swarm optimization （PSO） and introduces a heuristic power control scheme to accelerate the algorithm to search tbr the global optimum solution. Distributed coverage optimization is modeled as a non-cooperative game, with a utility function considering both throughput and interference. An iterative power control algorithm is then proposed using game theory （DGT） which converges to Nash Equilibrium （NE）. Simulation results show that both MPSO and DGT have excellent performance in coverage optimization and outperform optimization using simulated annealing algorithm （SA）, reaching higher coverage ratio and throughput while with less iterations.展开更多
In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a N...In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a Novel Adaptive Simulated Annealing （NASA） algorithm for constrained multi-objective optimization based on Archived Multi-objective Simulated Annealing （AMOSA）. For han-dling multi-objective, NASA makes improverrents in three aspects： sub-iteration search, sub-archive and adaptive search, which effectively strengthen the stability and efficiency of the algorithnm For handling constraints, NASA introduces corresponding solution acceptance criterion. Furtherrrore, NASA has also been applied to optimize TD-LTE network perform-ance by adjusting antenna paranleters; it can achieve better extension and convergence than AMOSA, NS-GAII and MOPSO. Analytical studies and simulations indicate that the proposed NASA algorithm can play an important role in improving multi-objective optimi-zation performance.展开更多
基金supported by the National High-Tech Development 863 Program of China (Grant DOS. 2012AA012801)National Natural Science Foundation of China(No.61331009)
文摘Coverage challenge for small considered to be a optlmlzation is a main cell clusters which are promising solution to provide seamless cellular coverage for large indoor or outdoor areas. This paper focuses on small cell cluster coverage problems and proposes both centralized and distributed self-optimization methods. Modified Particle swarm optimization （MPSO） is introduced to centralized optimization which employs particle swarm optimization （PSO） and introduces a heuristic power control scheme to accelerate the algorithm to search tbr the global optimum solution. Distributed coverage optimization is modeled as a non-cooperative game, with a utility function considering both throughput and interference. An iterative power control algorithm is then proposed using game theory （DGT） which converges to Nash Equilibrium （NE）. Simulation results show that both MPSO and DGT have excellent performance in coverage optimization and outperform optimization using simulated annealing algorithm （SA）, reaching higher coverage ratio and throughput while with less iterations.
基金supported by the Major National Science & Technology Specific Project of China under Grants No.2010ZX03002-007-02,No.2009ZX03002-002,No.2010ZX03002-002-03
文摘In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a Novel Adaptive Simulated Annealing （NASA） algorithm for constrained multi-objective optimization based on Archived Multi-objective Simulated Annealing （AMOSA）. For han-dling multi-objective, NASA makes improverrents in three aspects： sub-iteration search, sub-archive and adaptive search, which effectively strengthen the stability and efficiency of the algorithnm For handling constraints, NASA introduces corresponding solution acceptance criterion. Furtherrrore, NASA has also been applied to optimize TD-LTE network perform-ance by adjusting antenna paranleters; it can achieve better extension and convergence than AMOSA, NS-GAII and MOPSO. Analytical studies and simulations indicate that the proposed NASA algorithm can play an important role in improving multi-objective optimi-zation performance.
