Skip to content
naulon
Not checkedNot checked for notices yet.

A New Multi-Objective Unit Commitment Model Solved by Decomposition-Coordination

Shaopeng Zhai, Zhihua Wang, Jia Cao and 1 more

Applied Sciences · 2019

doi:10.3390/app9050829 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Multi-objective unit commitment (MOUC) considers concurrently both economic and environmental objectives, then finds the best trade-off with respect to these objectives. This paper proposes a novel model for MOUC, and a decomposition coordination approach is presented to solve the model. The economic objective is to reduce the fuel cost while the environmental objective is to reduce the CO<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>2</mn> </msub> </semantics> </math> </inline-formula> emission. The MOUC model considers these objectives by minimizing the distance to the Utopian point, which avoids generating Pareto optimal solutions. The model is solved by a decomposition coordination approach, which decomposes the whole system into subsystems and performs an iterative process. During each iteration step, the tie-line power flow is updated based on the margin price in connected subsystems, then, each subsystem is solved by branch and bound method, and the result is improved during iterations as shown in case studies. Besides, as the process does not require uploading units parameters, it protects the privacy of generating companies. Numerical case studies conducted using the proposed multi-objective model are applied to illustrate the performance of the approach.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.