Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleTabu search approach to alarm processing in power systems
dc.contributor.authorWen, F.S.
dc.contributor.authorChang, C.S.
dc.identifier.citationWen, F.S.,Chang, C.S. (1997). Tabu search approach to alarm processing in power systems. IEE Proceedings: Generation, Transmission and Distribution 144 (1) : 31-38. ScholarBank@NUS Repository.
dc.description.abstractA tabu search (TS) based approach is proposed for alarming processing in power systems. First, several existing evaluation criteria describing the alarm processing problem are briefly discussed, and a new criterion is proposed. Secondly, a novel method is developed to solve this problem using a TS based method. Finally, two examples are used to demonstrate the feasibility and efficiency of the developed method. The paper also presents a comparison between the developed TS based and the more established genetic algorithm (GA) based approaches to the alarm processing problem. Many simulation results show that the TS-based approach is more efficient than the GA based approach. Key features of this proposed method are that it has solid mathematical foundation and can find multiple global optimal solutions directly and efficiently in a single run. This is very suitable for complex alarm processing problems especially for situations with missing or false alarms, because different combinations of events can produce the same set of alarms under these circumstances. The test results suggest that the developed TS based method is promising. © IEE, 1997.
dc.subjectAlarm processing
dc.subjectGenetic algoritm
dc.subjectSet covering theory
dc.subjectTabu search
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleIEE Proceedings: Generation, Transmission and Distribution
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jun 29, 2020

Google ScholarTM


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