Please use this identifier to cite or link to this item:
Title: Tractability of bilateral transactions considering multiplicity of solution space in real power tracing
Keywords: Sparse Matrices
Electric Power Generation
Linear Programming
Load Flow
Issue Date: 2006
Publisher: IEEE
Citation: Proceedings of the IEEE Power India Conference, New Delhi, India, 10-12 April 2006, 1-8
Abstract: Most of the tracing algorithms proposed so far are the variants of proportionality based tracing algorithm. However, proportional sharing is not an inherent characteristic of the system. It is a rule enforced to attain uniqueness of the solution in a fair manner. Under proportionate tracing regime, the bilateral transactions can be classified as tractable, partially tractable or intractable, based on degree of tractability. In this paper, we develop the concept of optimal tracing whose objective is to enforce maximum tractability of bilateral transactions, while attaining least deviation from the proportionate sharing results, using multiplicity of solution space. The resulting optimization formulation is shown to be a sparse linear programming (LP) problem. A unified formulation that models lossy MW flow network and provides consistent results for generation and load tracing is presented. The maximum tractability is modeled as soft constraint in the formulation. Illustrative examples and simulation results on IEEE-30 bus system demonstrate the claims.
URI: 10.1109/POWERI.2006.1632491
ISBN: 0-7803-9525-5
Appears in Collections:Proceedings papers

Files in This Item:
File Description SizeFormat 
34235-1.pdf195.14 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.