The Power Outage Scheduling Problem is a distributed constraint satisfaction problem in which scattered local power stations have to make schedules that are consistent with one another. However, synchronous backtrack algorithms, a well-known method for distributed constraint satisfaction problems, have difficulty handling rapid schedule adjustments and impartial assignment of power station schedules. Thus, we propose two kinds of heuristics: parallel assignment and multiple priority strategies. We also developed a distributed system for the power outage scheduling problem which makes use of the above heuristics in order to ensure efficiency. The system is based on Bee-gent (Bonding and Encapsulation Enhancement aGENT framework) and consists of schedulers for each power station and mediation agents which have cloning and merging functions to support the implementation of the heuristics. The result of the experiment shows an improvement when handling rapid adjustment and impartiality issues and indicates that this improvement is provided with reasonable computational overhead.
|Number of pages||11|
|Journal||Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)|
|Publication status||Published - May 2002|
- Electric power
ASJC Scopus subject areas
- Electrical and Electronic Engineering