Resolution of the unit commitment problems by using the hybrid Taguchi-ant colony system algorithm

This work presents a hybrid Taguchi-ant colony system (HTACS) algorithm to solve the unit commitment (UC) problem. The proposed algorithm integrates the Taguchi method and the conventional ant colony system (ACS) algorithm, providing a powerful global exploration capability. The Taguchi method is incorporated into the ACS process before its global pheromone update mechanism. Based on the systematic reasoning ability of the Taguchi method, improved UC solutions are selected quickly to represent potential UC schedules, subsequently, enhancing the ACS algorithm. Therefore, the proposed HTACS algorithm can be highly robust, statistically sound and quickly convergent. Additionally, feasibility of the proposed algorithm is demonstrated on a 10-unit system. Analysis results demonstrate that the proposed algorithm is feasible, robust, and more effective in solving the UC problem than conventional ACS methods.

► A novel hybrid Taguchi-ant colony system (HTACS) algorithm is proposed. ► The proposed HTACS method is superior to the traditional ACS method. ► The HTACS method can provide another useful tool for the UC problem. ► The HTACS method can prevent from the premature convergence problem. ► The HTACS can reduce experimental runs for the UC problem.