Solution to dynamic economic dispatch with prohibited operating zones via MILP

TL;DR

This paper introduces a novel MILP-based approach to efficiently solve the complex dynamic economic dispatch problem with prohibited operating zones, ramp constraints, and transmission losses, providing competitive solutions quickly.

Contribution

The paper develops a new MILP formulation and an iterative algorithm to effectively handle the nonlinearities and constraints in DED with POZ and transmission losses.

Findings

MILP-1 formulation effectively models DED without transmission losses.

MILP-IA algorithm achieves fast, competitive solutions.

Method handles complex constraints efficiently.

Abstract

Dynamic economic dispatch (DED) problem considering prohibited operating zones (POZ), ramp rate constraints, transmission losses and spinning reserve constraints is a complicated non-linear problem which is difficult to solve efficiently. In this paper, a mixed integer linear programming (MILP) method is proposed to solve such a DED problem. Firstly, a novel MILP formulation for DED problem without considering the transmission losses, denoted by MILP-1, is presented by using perspective cut reformulation technique. When the transmission losses are considered, the quadratic terms in the transmission losses are replaced by their first order Taylor expansions, and then an MILP formulation for DED considering the transmission losses, denoted by MILP-2, is obtained. Based on MILP-1 and MILP-2, an MILP-iteration algorithm (MILP-IA) is proposed to solve the complicated DED problem. The effectiveness of the MILP-1 and MILP-IA are assessed by several cases and the simulation results show that both of them can solve to competitive solutions in a short time.