With the advent of paralleling and implementation of restructuring in the power market some routine rules and patterns of traditional market should be accomplished in a way different from the past . To this end the unit commitment scheduling that has once been aimed at minimizing operating costs in an integrated power market is metamorphosed to profit based unit commitment by adopting a new schema in which generation companies have a common tendency to maximize their own profit . In this paper a novel optimization technique called imperialist competitive algorithm as well as an improved version of this evolutionary algorithm are employed for solving the PBUC problem . Moreover traditional binary approach of coding of initial solutions is replaced with an improved integer based coding method in order to reduce computational complexity and subsequently ameliorate convergence procedure of the proposed method . Then a sub ICA algorithm is proposed to obtain optimal generation power of thermal units . Simulation results validate effectiveness and applicability of the proposed method on two scenarios a set of unimodal and multimodal standard benchmark functions two GENCOs consist of 10 and 100 generating units . fuel consumption coefficient of unit fuel consumption coefficient of unit fuel consumption coefficient of unit cost of imperialist cost of country cost function of unit i for units with ON status P P normalized cost of nth imperialist cold start up cost of unit i cooling constant of unit i ramp down rate of unit i cost of best obtained solution at last iteration of algorithm hot start up cost of unit i initial state of unit i commitment state of unit i at time t number of decades of main sub algorithm total number of generating units number of colonies number of imperialists initial number of colonies of empire n a chaotic vector produced by a chose map total system demand at time t positions of a colony at the current decade positions of an imperialist at the current decade positions of a colony at the next decade maximum active generation of unit i maximum response rate limited active power output of unit i at time t minimum active generation of unit i maximum response rate limited active power output of unit i at time t generation of unit i at time t a randomly generated number within total revenue start up cost of unit i at time t stopping criterion of the algorithm when it converges into 10 6 tolerance dispatch period total cost of generation total cost of imperialist empire n minimum OFF time of unit i minimum ON time of unit i ramp up rate of unit i a vector that is directed toward the imperialist locations and starts from the previous location of the colony v 1 1 a vector perpendicular to vector V time duration for which unit i has been OFF at time t time duration for which unit i has been ON at time t colonies corporation factor in imperialist power a chaotic. 


Summary: Employing ICA as well as ICA combined with chaos as main solvers of PBUC. Utilizing a novel conformational integer coded algorithm for PUBC problem. Proposing a sub ICA cascaded with main solver to determine optimal power of units. Proposing a novel concept to cut down number of integers representing ON OFF status of units. Presenting a heuristic based constraint handling to overcome complexities of PBUC.