Service options for the electric utility industry are increasingly including provisions to dynamically dispatch prices or service interruption calls to customers. When the number of such calls is contractually limited, then the issue of optimally dispatching the calls must be addressed. An algorithm for optimally dispatching interruptible and curtailable (I-C) service options is developed within a stochastic dynamic programming (SDP) framework. The solution yields thresholds for calling load curtailments as a function of: 1. the number of days remaining in the period, 2. the available number of interruptions, and 3. the level of uncertainty regarding future price and cost fluctuations. The SDP approach also provides a framework for optimally designing the I-C program parameters. An illustration of the dispatching routine is provided using data from Niagara Mohawk Power Corp., which is currently using the algorithm as part of its I-C program for industrial and commercial customers.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" 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.
Publisher Info
Paper provided by Iowa State University, Department of Economics in its series Staff General Research Papers with number
10786.
Length: Date of creation: 20 Oct 2003 Date of revision: Publication status: Published in Operations Research, 1992, Vol. 40, No. 1, pp. 104-112. Handle: RePEc:isu:genres:10786
Contact details of provider: Postal: Iowa State University, Dept. of Economics, 260 Heady Hall, Ames, IA 50011-1070 Phone: +1 515.294.6741 Fax: +1 515.294.0221 Email: Web page: http://www.econ.iastate.edu More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Stephanie Bridges).