Neural-based tabu search method for solving unit commitment problem

Genetic Algorithms Application to Electric Power Systems

“…Different hybrid algorithms, used to solve the UCP, are available in the literature [58][59][60][61][62][63][64][65][66][67][68][69][70][71][72][73][74]. These algorithms consist of two or more of the following methods: Classical Optimization (e.g.…”

Fuel consumption minimization of a cogeneration system multi machines associated with a photovoltaic

“…The goal [3,6,7] of unit commitment problem is to decide which of the available generators should start up and shut down over a given time horizon so that the overall operating cost is minimised subject to demand and spinning reserve constraints.…”

“…Unit commitment problem (UCP) [5][6][7] and [3] is the problem of selecting the generating units to be in service during a scheduling period and for how long. The overall problem can be divided into two sub problems namely unit commitment and economic dispatch.…”

Tabu Search: A Comparative Study

“…They also mention that their placement method is suitable for quickly initializing the inputs to other nondeterministic placement algorithms. Rajan et al (2003) proposed a neural-based TS method for solving unit commitment problem. Blazewicz et al (2000) proposed a TS-based algorithm for DNA sequencing in the presence of false negatives and false positives.…”