IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/562462.html
   My bibliography  Save this article

Energy-Saving Generation Dispatch Using Minimum Cost Flow

Author

Listed:
  • Zhan’an Zhang
  • Xingguo Cai

Abstract

This study uses a minimum cost flow method to solve a dispatch problem in order to minimize the consumption of coal in the dispatching of a thermal power system. Low-carbon generation dispatching is also considered here since the scheduling results are consistent with energy-saving generation dispatch. Additionally, this study employs minimum coal consumption as an objective function in considering the output constraints, load balance constraints, line loss, ramp rate limits, spinning reverse needs, prohibited operating zone requirements, security constraints, and other common constraints. The minimum cost flow problem, considering the loss of network flow, is known as a generalized network flow problem, which can be expressed as a quadratic programming problem in mathematics. Accordingly, the objective function was solved by LINGO11, which was used to calculate a network in a single time; a continuous period dispatch plan was obtained by accumulating each period network flow together. This analysis proves it feasible to solve a minimal cost flow problem with LINGO11. Theoretical analysis and numerical results prove the correctness and effectiveness of the proposed method.

Suggested Citation

  • Zhan’an Zhang & Xingguo Cai, 2015. "Energy-Saving Generation Dispatch Using Minimum Cost Flow," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-9, October.
  • Handle: RePEc:hin:jnlmpe:562462
    DOI: 10.1155/2015/562462
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/562462.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2015/562462.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/562462?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:562462. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.