Improved Pre-Prepared Demand Table and Memory Management Algorithm Solve to Profit Based Unit Commitment Problem with losses

In this paper, IPPD table and Memory management algorithm is used to solve PBUC problem. In conventional market, Unit commitment (UC) is the process of determines the optimal scheduling of the generating unit to meet forecasted load by satisfying certain operating constraints that minimize the operating cost. In restructured power market, unit commitment involves commitment of generating unit of an Individual Generation company (GENCO) for maximizing its profit without satisfying the demand of its consumer. In this proposed method, PBUC problem has two steps. In first step unit commitment scheduling is done by IPPD table and then the problem of fuel cost and revenue function is done by Memory Management Algorithm. The IPPD table gives the information of committed unit for any predicted power demand. Memory management algorithm uses Best fit and Worst bit allocation for scheduling the generator in order to receive maximum profit by considering power and reserve generation. This method is tested on a 3 unit system using MATLAB and the simulation result is compared with the result of existing method obtained by other optimizing technique.