A parallel simulated annealing algorithm for short-term hydro scheduling

This paper develops a coarse-grained parallel simulated annealing algorithm for short-term hydro scheduling. The design of the algorithm takes into consideration load balancing, processor synchronization reduction, communication overhead reduction and memory contention elimination. The algorithm is implemented on an i860 processor in a simulated environment and is applied to a test system. The scheduling results are presented and are compared with those found by the systolic, clustered and sequential algorithms.<>