Please use this identifier to cite or link to this item:
|Title:||Multi-agent modeling for solving profit based unit commitment problem|
Profit based unit commitment
|Citation:||Sharma, D., Trivedi, A., Srinivasan, D., Thillainathan, L. (2013). Multi-agent modeling for solving profit based unit commitment problem. Applied Soft Computing Journal 13 (8) : 3751-3761. ScholarBank@NUS Repository. https://doi.org/10.1016/j.asoc.2013.04.001|
|Abstract:||Profit based unit commitment problem (PBUC) from power system domain is a high-dimensional, mixed variables and complex problem due to its combinatorial nature. Many optimization techniques for solving PBUC exist in the literature. However, they are either parameter sensitive or computationally expensive. The quality of PBUC solution is important for a power generating company (GENCO) because this solution would be the basis for a good bidding strategy in the competitive deregulated power market. In this paper, the thermal generators of a GENCO is modeled as a system of intelligent agents in order to generate the best profit solution. A modeling for multi-agents is done by decomposing PBUC problem so that the profit maximization can be distributed among the agents. Six communication and negotiation stages are developed for agents that can explore the possibilities of profit maximization while respecting PBUC problem constraints. The proposed multi-agent modeling is tested for different systems having 10-100 thermal generators considering a day ahead scheduling. The results demonstrate the superiority of proposed multi-agent modeling for PBUC over the benchmark optimization techniques for generating the best profit solutions in substantially smaller computation time. © 2013 Elsevier B.V.|
|Source Title:||Applied Soft Computing Journal|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 19, 2018
WEB OF SCIENCETM
checked on Jul 3, 2018
checked on May 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.