Application of nearest neighbor algorithm for critical clearing time (CCT) approximation

Proceedings of the IEEE Power Engineering Society Transmission and Distribution Conference

Volumn 3, Issue ASIA PACIFIC, 2002, Pages 1530-1535

  Jiriwibhakorn, Somchat ^a   Pothisarn, Chaichan ^a  

^a KING MONGKUT'S INSTITUTE OF TECHNOLOGY LADKRABANG   (Thailand)

Author keywords

Critical clearing time (CCT); Nearest neighbor algorithm (NNA); Power systems; Pseudo random sequences (Rand); Sobol sequences (Sob)

Indexed keywords

COMPUTER SIMULATION; ERROR ANALYSIS; NETWORKS (CIRCUITS); TIME DOMAIN ANALYSIS;

TRANSIENT STABILITY;

ELECTRIC POWER SYSTEMS;

EID: 0038307627     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. S. Jiriwibhakorn, A. H. Coonick and B. J. Cory, "Fast Critical Clearing Time Function Approximation Using Neural Networks and Sobol Sequences", IEEE Power Engineering Review, Vol. 20, No. 1, pp. 51-53.
2. I. M. Sobol, "On the Distribution of Points in a Cube and the Approximate Evaluation of Integrals", USSR Computational Mathematics and Mathematical Physics, Vol. 7, No. 4, pp. 86-112, 1967.
3. τ-Sequences", USSR Computational Mathematics and Mathematical Physics, Vol. 19, pp. 252-256, 1979.
4. P. Bratley and B. L. Fox, "Algorithm 659 Implementing Sobol's Quasirandom Sequence Generator", ACM Transactions on Mathematical Software, Vol. 14, No. 1, pp. 88-100, March 1988.
5. The Math Works, "Matlab Reference Guide", The Math Works Inc.