IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-43871-8_240.html
   My bibliography  Save this book chapter

An Algorithm for Distribution of On-Grid Bidding Contract Electricity Quantity in Power Plant Unit on Generation Side

In: Liss 2014

Author

Listed:
  • Lei Wu

    (University of Science and Technology Beijing)

  • Shujuan Gu

    (University of Science and Technology Beijing)

  • Yong Liu

    (Tobacco Company of Baotou city)

Abstract

After the reform and opening up, Chinese national economy began to boom, by a central investment power can not meet the needs of national economic development. In this situation, a series of funded power and multi-channel fund-raising run electricity policy, promote the development of electric power industry and independent power generation enterprises, the reform China power industry has taken an important step, at the same time it is also China germination power market. Based on load forecasting and unit output power characteristics of power grid, this paper presented series of algorithms for contract electricity quantity distribution problem in power grid operation management, and meanwhile theoretically analyzed these algorithms. The analysis showed that power market determines the particularity of electric power market bidding strategies. The paper proposed contract power generation allocation scheme and designed the optimization & adjustment algorithm for contract quantity allocation sequence at normal output segment.

Suggested Citation

  • Lei Wu & Shujuan Gu & Yong Liu, 2015. "An Algorithm for Distribution of On-Grid Bidding Contract Electricity Quantity in Power Plant Unit on Generation Side," Springer Books, in: Zhenji Zhang & Zuojun Max Shen & Juliang Zhang & Runtong Zhang (ed.), Liss 2014, edition 127, pages 1667-1672, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-43871-8_240
    DOI: 10.1007/978-3-662-43871-8_240
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:sprchp:978-3-662-43871-8_240. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.