Dynamic environmental/economic scheduling for microgrid using improved MOEA/D-M2M (Q1792809)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic environmental/economic scheduling for microgrid using improved MOEA/D-M2M |
scientific article; zbMATH DE number 6952893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic environmental/economic scheduling for microgrid using improved MOEA/D-M2M |
scientific article; zbMATH DE number 6952893 |
Statements
Dynamic environmental/economic scheduling for microgrid using improved MOEA/D-M2M (English)
0 references
12 October 2018
0 references
Summary: The environmental/economic dynamic scheduling for microgrids (MGs) is a complex multiobjective optimization problem, which usually has dynamic system parameters and constraints. In this paper, a biobjective optimization model of MG scheduling is established. And various types of microsources (like the conventional sources, various types of renewable sources, etc.), electricity markets, and dynamic constraints are considered. A recently proposed MOEA/D-M2M framework is improved (I-MOEA/D-M2M) to solve the real-world MG scheduling problems. In order to deal with the constraints, the processes of solutions sorting and selecting in the original MOEA/D-M2M are revised. In addition, a self-adaptive decomposition strategy and a modified allocation method of individuals are introduced to enhance the capability of dealing with uncertainties, as well as reduce unnecessary computational work in practice and meet the time requirements for the dynamic optimization tasks. Thereafter, the proposed I-MOEA/D-M2M is applied to the independent MG scheduling problems, taking into account the load demand variation and the electricity price changes. The simulation results by MATLAB show that the proposed method can achieve better distributed fronts in much less running time than the typical multiobjective evolutionary algorithms (MOEAs) like the improved strength Pareto evolutionary algorithm (SPEA2) and the nondominated sorting genetic algorithm II (NSGAII). Finally, I-MOEA/D-M2M is used to solve a 24-hour MG dynamic operation scheduling problem and obtains satisfactory results.
0 references
0.7818886637687683
0 references
0.7406190037727356
0 references