“…The UC problem will become very difficult and complicated when the scale of the problem increases. For many years, many researchers have developed a variety of solution methodologies from early approaches in the basis of Priority List (PL) [14][15][16], Dynamic Programming (DP) [5,7,[17][18][19] and Lagrangian Relaxation (LR) [20][21][22] to the advanced approaches in the basis of Mixed Integer Programming (MIP) [23][24][25] which is the most commonly adopted. Furthermore, artificial intelligence is being used to solve the UC problem, i.e., Tabu Search (TS) [26,27], Genetic Algorithm (GA) [28][29][30], Simulated Annealing (SA) [31][32][33], Particle Swarm Optimization (PSO) [34][35][36], and Ant Colony Optimization (ACO) [37,38].…”