A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Solving the unit commitment (UC) problem is one of the most complicated issues in power systems that its exact solving can be calculated by perfect counting of entire possible compounds of generative units. UC is equated as a nonlinear optimization with huge size. Purpose of solving this problem is to programming the optimization of the generative units to minimize the full action cost regarding problem constraints. In this article, a modified version of ant colony optimization (MACO) isdoi:10.5121/aeij.2016.3302 fatcat:vopinvupmbcstfkrsntod7u66u