摘要
研究了含电动汽车的机组组合模型,将满足电动汽车充电量需求和时间纳入约束条件,针对传统前向动态规划法求解大规模机组组合问题时的"维数灾"问题,在评估值函数时对访问路径集进行局部存优处理,根据机组单位燃料成本和旋转备用容量裕度确定存优指标,减少了路径评估的计算量。为避免改动后的算法陷入局部极值,通过设置禁忌列表防止重复路径的搜索。还提出一种基于试停优化的压缩状态空间的构造法,缩减了初始状态空间的规模。10—60机组算例仿真比较了考虑爬坡约束和电动汽车接入前后不同算法的计算速度和优化效果,结果验证了所提算法的有效性。
To the problem of dimensionality when the large scale unit commitment problems are solved by the traditional forward dynamic programming method,the storage of local optimizations and the small probability mutation mechanism are adopted to select the path storage in dynamic programming,which reduces the calculation of the path evaluation and also improves the exploration ability of the algorithm.In order to avoid the local extreme value of the modified algorithm,the tabu list is set up to prevent the repeated path searching.A constructing method which compresses state space based on trial stop optimization is proposed,which reduces the size of initial state space and adjusts the neighborhood path exploration method for the problem of over compression.The simulation results of 10-60 units verify the feasibility of the proposed algorithm.
作者
梁捷
LIANG Jie(China Southern Power Grid Guangxi Power Gird Corporation with Limited Liability Electric Power Research Institute,Nanning 530023,China)
出处
《电力工程技术》
2018年第2期67-72,共6页
Electric Power Engineering Technology
基金
国家自然科学基金资助项目(51377119)
