This work focuses on optimizing the scheduling of virtual power plants (VPPs)—as implemented in the Portuguese national project New Generation Storage (NGS)—to maximize social welfare and enhance energy trading efficiency within modern energy grids. By integrating distributed energy resources (DERs), including renewable energy sources and energy storage systems, VPPs represent a pivotal element of sustainable urban energy systems. The scheduling problem is formulated as a Mixed-Integer Linear Programming (MILP) task and addressed by using a parallelized simulated annealing (SA) algorithm implemented on high-performance computing (HPC) infrastructure. This parallelization accelerates solution space exploration, enabling the system to efficiently manage the complexity of larger DER networks and more sophisticated scheduling scenarios. The approach demonstrates its capability to align with the objectives of smart cities by ensuring adaptive and efficient energy distribution, integrating dynamic pricing mechanisms, and extending the operational lifespan of critical energy assets such as batteries. Rigorous simulations highlight the method’s ability to reduce optimization time, maintain solution quality, and scale efficiently, facilitating real-time decision making in energy markets. Moreover, the optimized coordination of DERs supports grid stability, enhances market responsiveness, and contributes to developing resilient, low-carbon urban environments. This study underscores the transformative role of computational infrastructure in addressing the challenges of modern energy systems, showcasing how advanced algorithms and HPC can enable scalable, adaptive, and sustainable energy optimization in smart cities. The findings demonstrate a pathway to achieving socially and environmentally responsible energy systems that align with the priorities of urban resilience and sustainable development.

Efficient scheduling of Virtual Power Plants (VPPs) is essential for the integration of distributed energy resources into modern power systems. This study presents a CUDA-accelerated multiple-chain simulated annealing (MC-SA) algorithm tailored for optimizing VPP scheduling. Traditional simulated annealing algorithms are inherently sequential, limiting their scalability for large-scale applications. The proposed MC-SA algorithm mitigates this limitation by executing multiple independent annealing chains concurrently, enhancing the exploration of the solution space and reducing the requisite number of sequential cooling iterations. The algorithm employs a dual-level parallelism strategy: at the prosumer level, individual energy producers and consumers are assessed in parallel; at the algorithmic level, multiple simulated annealing chains operate simultaneously. This architecture not only expedites computation but also improves solution accuracy. Experimental evaluations demonstrate that the CUDA-based MC-SA achieves substantial speedups—up to 10× compared to a single-chain baseline implementation while maintaining or enhancing solution quality. Our analysis reveals an empirical power-law relationship between parallel chains and required sequential iterations (iterations ∝ chains−0.88±0.17), demonstrating that increased parallelism effectively alleviates the sequential bottleneck. The algorithm demonstrates scalable performance across VPP sizes from 250 to 1000 prosumers, with approximately 50 chains providing the optimal balance between solution quality and computational efficiency for practical applications.

Efficient scheduling of virtual power plants (VPPs) is essential for the integration of distributed energy resources into modern power systems. This study presents a CUDA-accelerated Multiple-Chain Simulated Annealing (MC-SA) algorithm tailored for optimizing VPP scheduling. Traditional Simulated Annealing algorithms are inherently sequential, limiting their scalability for large-scale applications. The proposed MC-SA algorithm mitigates this limitation by executing multiple independent annealing chains concurrently, enhancing the exploration of the solution space and reducing the requisite number of sequential cooling iterations. The algorithm employs a dual-level parallelism strategy: at the prosumer level, individual energy producers and consumers are assessed in parallel; at the algorithmic level, multiple Simulated Annealing chains operate simultaneously. This architecture not only expedites computation but also improves solution accuracy. Experimental evaluations demonstrate that the CUDA-based MC-SA achieves substantial speedups—up to 10× compared to a single-chain baseline implementation while maintaining or enhancing solution quality. Our analysis reveals an empirical power-law relationship between parallel chains and required sequential iterations (iterations ∝ chains^{−0.88±0.17}), demonstrating that using 50 chains reduces the required number of sequential iterations by approximately 10× compared to single-chain SA while maintaining equivalent solution quality. The algorithm demonstrates scalable performance across VPP sizes from 250 to 1000 prosumers, with approximately 50 chains providing the optimal balance between solution quality and computational efficiency for practical applications.