decentralized optimization in the scheduling of three virtual power plants with non-convex constraints

Virtual power plant planning (vpp) has received much attention in recent years. vpp refers to the integration of multiple power units, considered as a single power plant. in this paper, three vpps are considered, each consisting of different power plant units and expected to supply the desired load. in addition to providing the desired load, they must maximize their profits. a decentralized optimization method was used to optimize these three vpps. the reason for using a decentralized approach is to increase network security and eliminate the need for a central computer. however, using decentralized optimization increases the speed of problem-solving. finally, the obtained results are compared with the centralized method. simulations show that almost the same results are achieved using different optimization methods. these results increase the trend of using decentralized methods in vpp. another feature of decentralized methods compared to the centralized method is the reduction in the speed of problem-solving, which in this article has greatly reduced the solution time. if the considered network becomes wider and the number of problem variables and their limitations increases, the use of decentralized methods will become more efficient, and in those problems, the difference in problem-solving time by centralized and decentralized methods will increase.