Multi–dimensional firefly algorithm based on local search for solving unit commitment problem

The Unit Commitment problem (UC) is a complex mixed-integer nonlinear programming problem, so the main challenge faced by many researchers is obtaining the optimal solution. Therefore, this dissertation proposes a new methodology combining the multi-dimensional firefly algorithm with local search called LS-MFA and utilizes it to solve the UC problem. In addition, adaptive adjustment, tolerance mechanism, and pit-jumping random strategy help to improve the optimal path and simplify the redundant solutions. The experimental work of unit commitment with the output of 10–100 machines in the 24-hour period is carried out in this paper. And it shows that compared with the previous UC artificial intelligence algorithms, the total cost obtained by LS-MFA is less and the results are excellent.