Abstract

Global efforts aiming to shift towards renewable energy and smart grid configurations require accurate unit commitment schedules to guarantee power balance and ensure feasible operation under different complex constraints. Intelligent systems utilizing hybrid and high-level techniques have arisen as promising solutions to provide optimum exploration–exploitation trade-offs at the expense of computational complexity. To ameliorate this requirement, which is extremely expensive in non-interconnected renewable systems, radically different approaches based on enhanced priority schemes and Boolean encoding/decoding have to take place. This compilation encompasses various mappings that convert multi-valued clausal forms into Boolean expressions with equivalent satisfiability. Avoiding any need to introduce prior parameter settings, the solution utilizes state-of-the-art advancements in the field of artificial intelligence models, namely Boolean mapping. It allows for the efficient identification of the optimal configuration of a non-convex system with binary and discontinuous dynamics in the fewest possible trials, providing impressive performance. In this way, Boolean mapping becomes capable of providing global optimum solutions to unit commitment utilizing fully tractable procedures without deteriorating the computational time. The results, considering a non-interconnected power system, show that the proposed model based on artificial intelligence presents advantageous performance in terms of generating cost and complexity. This is particularly important in isolated networks, where even a-not-so great deviation between production and consumption may reflect as a major disturbance in terms of frequency and voltage.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.