检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王鹏鲲 王聪[1] 张宏立[1] WANG Peng-kun;WANG Cong;ZHANG Hong-li(College of Electrical Engineering,Xinjiang University,Urumqi Xinjiang 830047,China)
机构地区:[1]新疆大学电气工程学院,新疆乌鲁木齐830047
出 处:《计算机仿真》2022年第9期130-135,155,共7页Computer Simulation
基 金:国家自然科学基金(51767022,51967019);新疆维吾尔自治区自然科学基金(2019D01C082);天山青年计划(2019Q064)。
摘 要:含风电场电力系统动态经济调度问题具有高维度、非线性、多约束的特点,同时需要考虑风电的随机性。针对上述问题提出一种基于镜像变换和动态坐标变换的状态转移算法(MTSTA),并使用一种新型的处理约束的修复方法配合罚函数对约束条件进行处理。镜像变换和动态坐标变换的加入丰富了候选解的多样性,提高了算法的收敛速度和寻优精度。用含一座风电场的10机系统作为算例,与其它几种算法进行对比,仿真结果验证了上述算法求解含风电场电力系统动态经济调度问题的优越性。The dynamic economic dispatch problem of power systems considering wind farms has the characteristics of high dimension, nonlinear, multi-constraint and the randomness of wind power needs to be considered. To solve this problem, an improved state transition algorithm(MTSTA) based on mirror transformation and dynamic axesion transformation was proposed, and a new repair method of constraint handling combined with penalty function was used to deal with constraint conditions. The addition of mirror transformation and dynamic axesion transformation enriches the candidate solutions diversity, and improves the convergence speed and search accuracy of the algorithm. Finally, a ten generator bus system with a wind farm was used as an example to compare with other algorithms. The simulation results demonstrate the superiority of this algorithm in solving the dynamic economic dispatch problem.
分 类 号:TM743[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222