Minimizing electricity costs with an auxiliary generator using stochastic programming

This thesis addresses the problem of minimizing a facility's electricity costs by generating optimal responses using an auxiliary generator as the parameter of the control systems. The-goal of the thesis is to find an optimization method that can cope with the uncertainty in the building load while also handles the complex electricity price structures. The building load is the random factor of the stochastic problem and is composed of the weather load and the occupancy load. Several optimization techniques such as Dynamic Programming and Linear Programming (deterministic optimization) are looked at. Stochastic Programming using Nested Bender's Decomposition method is chosen and studied to solve the optimization problem. Stochastic Programming, which is a hybrid of Dynamic Programming and Linear Programming, is used because it can cope with the complex electricity price structures and the uncertainty of the building load while avoiding an explosion in the number of states. However, the method is not suitable for our problem, which is a Mixed Integer Programming problem. Moreover, the random sampling adds some limitations on the method. In addition, the ~high memory requirement and the extensive computational time prohibit the method from being used for a long planning period. Hence, a new control system, which is the combination of Stochastic Programming and Linear Programming, is proposed. The key of this proposed method is the reduction of the problem into a two-stage stochastic problem.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Architecture.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2000

Author dc:creator

• Rafiuly, Paul, 1976-

Advisor dc:contributor.advisor

• Leslie K. Norford and John N. Tsitsiklis.

• Architecture.
• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/69428

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/69428