Yuzhou Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuzhou Zhou has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
- Qiaozhu Zhai
Xi’an Jiaotong University
19 shared publications - Xiaoyu Cao
School of Automation Science and Engineering, Xian Jiaotong University, Xian, China
10 shared publications Xiaohong Guan
8 shared publications- Lei Wu
Stevens Institute of Technology
7 shared publications - Xiaohong Guan
Xi'an Jiaotong University, Xi'an, China
6 shared publications - Jiexing Zhao
Systems Engineering Institute, MOEKLINNS Lab, Xian Jiaotong University, Xian, China
5 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4306-4318
Historical-Data-Free and System-Independent Training: A Neural Network-Assisted Improved Lagrangian Relaxation Method for Large-Scale Security-Constrained Unit Commitment
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4306-4318
Historical-Data-Free and System-Independent Training: A Neural Network-Assisted Improved Lagrangian Relaxation Method for Large-Scale Security-Constrained Unit Commitment
- Open Access
- 26 August 2026
- Published by Elsevier in SSRN Electronic Journal
Generation expansion planning under decision-dependent renewable output uncertainty: An equivalent model transformation approach
Power systems with high renewable penetration face significant challenges in generation expansion planning (GEP) because renewable output uncertainty is not only inherent but also decision-dependent: newly installed renewable capacity directly expands the feasible range of renewable generation, giving rise to decision‑dependent uncertainty (DDU). Conventional formulations may either neglect the decision dependence or require specialized solution techniques when DDU is embedded in robust optimization. To address this problem, this paper establishes a hybrid stochastic-robust GEP framework that explicitly incorporates DDU and proposes an equivalent model transformation that rigorously converts the DDU set into a decision‑independent one. This transformation renders the problem directly solvable by the classical column-and-constraint generation (CCG) algorithm without altering its convergence mechanism. Interday uncertainty is captured by K‑medoids clustering of historical days supplemented with extreme days, while intraday uncertainty is represented by scenario-specific uncertainty sets and solved using the CCG algorithm. Numerical tests on the IEEE 24‑bus and IEEE 118‑bus systems demonstrate that the proposed method yields cost‑effective and robust expansion plans with high feasibility under additional validation scenarios and competitive computational efficiency.
- 26 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessGeneration expansion planning under decision-dependent renewable output uncertainty: An equivalent model transformation approach
Power systems with high renewable penetration face significant challenges in generation expansion planning (GEP) because renewable output uncertainty is not only inherent but also decision-dependent: newly installed renewable capacity directly expands the feasible range of renewable generation, giving rise to decision‑dependent uncertainty (DDU). Conventional formulations may either neglect the decision dependence or require specialized solution techniques when DDU is embedded in robust optimization. To address this problem, this paper establishes a hybrid stochastic-robust GEP framework that explicitly incorporates DDU and proposes an equivalent model transformation that rigorously converts the DDU set into a decision‑independent one. This transformation renders the problem directly solvable by the classical column-and-constraint generation (CCG) algorithm without altering its convergence mechanism. Interday uncertainty is captured by K‑medoids clustering of historical days supplemented with extreme days, while intraday uncertainty is represented by scenario-specific uncertainty sets and solved using the CCG algorithm. Numerical tests on the IEEE 24‑bus and IEEE 118‑bus systems demonstrate that the proposed method yields cost‑effective and robust expansion plans with high feasibility under additional validation scenarios and competitive computational efficiency.
- 20 August 2026
- Published by Elsevier in Applied Energy
- Vol. 426
Robust capacity planning of hydrogen-based remote microgrids with a co-optimized daily service window
- 20 August 2026
- Published by Elsevier in Applied Energy
- Vol. 426
Robust capacity planning of hydrogen-based remote microgrids with a co-optimized daily service window
- Open Access
- 2 June 2026
- Published by Elsevier in SSRN Electronic Journal
Robust Capacity Planning of Hydrogen-Based Remote Microgrids with a Co-Optimized Daily Service Window
Reliable electricity service in ecologically sensitive remote areas is difficult to provide at low cost when diesel backup is unavailable. Hydrogen-based microgrids can supply clean long-duration backup, but reliability is often purchased passively by oversizing renewable generation, batteries, fuel cells, and hydrogen storage. This paper treats the timing of high-power service as a planning-stage flexibility resource. Remote-service demand is represented by a two-tier service envelope: continuous supply for critical loads and a contiguous daily service window for high-power operations. The proposed framework co-optimizes PV, wind, battery, and fuel-cell capacities with the daily service-window timing while guaranteeing the service envelope under prescribed day-hour renewable-availability bounds. To make this year-round hourly planning problem computationally tractable, the interval robust feasibility condition is reformulated as recursive storage-envelope constraints and solved with an H-shaped temporal-scenario decomposition algorithm. In a real South African remote microgrid case, the framework selects a 09:00-16:00 service window that aligns high-load operation with renewable availability, yields a feasible 360-day zero-carbon design with lifecycle planning cost of $14.93 million, and shows that fixing the window at other start times raises cost by up to 21.6%. Backtested on 300 independent annual profiles, the design exhibits zero service shortfalls under the prescribed service-envelope protocol.
- 2 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessRobust Capacity Planning of Hydrogen-Based Remote Microgrids with a Co-Optimized Daily Service Window
Reliable electricity service in ecologically sensitive remote areas is difficult to provide at low cost when diesel backup is unavailable. Hydrogen-based microgrids can supply clean long-duration backup, but reliability is often purchased passively by oversizing renewable generation, batteries, fuel cells, and hydrogen storage. This paper treats the timing of high-power service as a planning-stage flexibility resource. Remote-service demand is represented by a two-tier service envelope: continuous supply for critical loads and a contiguous daily service window for high-power operations. The proposed framework co-optimizes PV, wind, battery, and fuel-cell capacities with the daily service-window timing while guaranteeing the service envelope under prescribed day-hour renewable-availability bounds. To make this year-round hourly planning problem computationally tractable, the interval robust feasibility condition is reformulated as recursive storage-envelope constraints and solved with an H-shaped temporal-scenario decomposition algorithm. In a real South African remote microgrid case, the framework selects a 09:00-16:00 service window that aligns high-load operation with renewable availability, yields a feasible 360-day zero-carbon design with lifecycle planning cost of $14.93 million, and shows that fixing the window at other start times raises cost by up to 21.6%. Backtested on 300 independent annual profiles, the design exhibits zero service shortfalls under the prescribed service-envelope protocol.
- Open Access
Advances in Smart Grids and Microgrids: Distributed Generation and Energy Storage Systems
The global energy transition toward decarbonization and digitalization is profoundly reshaping modern power systems. Smart grids and microgrids have become core enabling technologies for accommodating high-penetration renewable energy, facilitating flexible source–load interaction, and enhancing system efficiency, reliability, and resilience. Based on the Special Issue “Advances in Smart Grids and Microgrids: Distributed Generation and Energy Storage Systems” and recent state-of-the-art progress, this paper systematically reviews key research advances in four core areas: planning and design paradigms, operation optimization and control under uncertainty, economic and market mechanism design, and resilience and cyber–physical security. Emphasis is placed on the synergistic optimization between distributed renewable generation and advanced energy storage (ES) systems in both single-energy and multi-energy architectures. Typical applications in urban areas, remote islands, and hardware-in-the-loop validation are summarized. Furthermore, major challenges and future trends are highlighted, including cross-scale interoperability, resilient control, cyber–physical security, advanced ES, electricity–carbon integrated markets, and so on. It is demonstrated that the transition from deterministic centralized frameworks to stochastic distributed multi-energy integrated systems has become an inevitable trend, and interdisciplinary collaboration will further promote the development of clean, resilient, cost-effective, and equitable smart grids and microgrids.
Open AccessAdvances in Smart Grids and Microgrids: Distributed Generation and Energy Storage Systems
The global energy transition toward decarbonization and digitalization is profoundly reshaping modern power systems. Smart grids and microgrids have become core enabling technologies for accommodating high-penetration renewable energy, facilitating flexible source–load interaction, and enhancing system efficiency, reliability, and resilience. Based on the Special Issue “Advances in Smart Grids and Microgrids: Distributed Generation and Energy Storage Systems” and recent state-of-the-art progress, this paper systematically reviews key research advances in four core areas: planning and design paradigms, operation optimization and control under uncertainty, economic and market mechanism design, and resilience and cyber–physical security. Emphasis is placed on the synergistic optimization between distributed renewable generation and advanced energy storage (ES) systems in both single-energy and multi-energy architectures. Typical applications in urban areas, remote islands, and hardware-in-the-loop validation are summarized. Furthermore, major challenges and future trends are highlighted, including cross-scale interoperability, resilient control, cyber–physical security, advanced ES, electricity–carbon integrated markets, and so on. It is demonstrated that the transition from deterministic centralized frameworks to stochastic distributed multi-energy integrated systems has become an inevitable trend, and interdisciplinary collaboration will further promote the development of clean, resilient, cost-effective, and equitable smart grids and microgrids.
- 30 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 4028-4041
Topology-Aware Virtual Machine Placement Through the Buffer Migration Mechanism
The virtual machine (VM) placement considering the topology constraints is difficult because the unpredictable topological VMs raise additional structural requirements (including the affinity, anti-affinity and fault-domain) on the resource pool. Thus, the service level agreement (SLA) can be violated even when the occupancy of the resource pool is quite modest. In order to solve this problem, we propose an efficient buffer-migration-based heuristic online algorithm. First, we build an integer programming model for the topology-aware VM placement problem. Second, we propose a hierarchical resource-preserving online approach, where the Rack and physical machine (PM) nodes are selected in the upper and lower layers respectively. Finally, we utilize the buffer to place and migrate the unfitted VMs to enhance the capacity of the resource pool. The proposed approach is tested with high proportional topological VM requests (nearly 60%) in the resource pool with the scale of 500, 1000 and 1500 PMs. The results show that our online approach (with unknown upcoming VM information) can achieve more than 85% of the performance for the offline approach (with complete upcoming VM information). The latency is lower than 5ms per VM.
- 30 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 4028-4041
Topology-Aware Virtual Machine Placement Through the Buffer Migration Mechanism
The virtual machine (VM) placement considering the topology constraints is difficult because the unpredictable topological VMs raise additional structural requirements (including the affinity, anti-affinity and fault-domain) on the resource pool. Thus, the service level agreement (SLA) can be violated even when the occupancy of the resource pool is quite modest. In order to solve this problem, we propose an efficient buffer-migration-based heuristic online algorithm. First, we build an integer programming model for the topology-aware VM placement problem. Second, we propose a hierarchical resource-preserving online approach, where the Rack and physical machine (PM) nodes are selected in the upper and lower layers respectively. Finally, we utilize the buffer to place and migrate the unfitted VMs to enhance the capacity of the resource pool. The proposed approach is tested with high proportional topological VM requests (nearly 60%) in the resource pool with the scale of 500, 1000 and 1500 PMs. The results show that our online approach (with unknown upcoming VM information) can achieve more than 85% of the performance for the offline approach (with complete upcoming VM information). The latency is lower than 5ms per VM.
- Open Access
- 10 February 2026
- Published by Elsevier in SSRN Electronic Journal
Alternative energy storage capacity evaluation of heterogeneous resources and multi-stage robust scheduling for cold chain enterprise microgrid
A B S T R A C TRe-electrification of traditional enterprises is one of the crucial paths to achieve clean energy transformation and reduce carbon emissions. There are two core issues in electrification renovation: i) how to save renovation costs, and ii) how to ensure the safe and economical operation of the renovated system. On the one hand, in terms of saving renovation costs, the government usually requires enterprises to configure additional energy storage (ES) to alleviate renewable uncertainty. This paper designs a capacity evaluation method of alternative ES (AES) that considers actual operation, and aims to save ES configuration investment of cold chain enterprises (CCEs). On the other hand, to ensure the operational security of CCEs after re-electrification, this paper establishes a unified modeling framework for heterogeneous resources and proposes a multi-stage robust scheduling method. More specifically, first, based on the established unified model, a group of nonanticipative bound constraints is derived to guarantee actual feasibility. Then, a single-level multi-stage robust optimization model of CCE microgrid is established against uncertainties of renewables and loads. Last, a rolling real-time economic dispatch model is proposed to obtain actual operation decisions guaranteeing solution feasibility and economy. Numerical tests on a real CCE microgrid verify the efficacy of the proposed methods. Results show that the designed AES evaluation approach achieves a reduction of approximately 300 thousand dollars in ES configuration investment. The proposed scheduling method shows an economic advantage of 2.75% which guarantees solution feasibility compared with the affine decision rules method.
- 10 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAlternative energy storage capacity evaluation of heterogeneous resources and multi-stage robust scheduling for cold chain enterprise microgrid
A B S T R A C TRe-electrification of traditional enterprises is one of the crucial paths to achieve clean energy transformation and reduce carbon emissions. There are two core issues in electrification renovation: i) how to save renovation costs, and ii) how to ensure the safe and economical operation of the renovated system. On the one hand, in terms of saving renovation costs, the government usually requires enterprises to configure additional energy storage (ES) to alleviate renewable uncertainty. This paper designs a capacity evaluation method of alternative ES (AES) that considers actual operation, and aims to save ES configuration investment of cold chain enterprises (CCEs). On the other hand, to ensure the operational security of CCEs after re-electrification, this paper establishes a unified modeling framework for heterogeneous resources and proposes a multi-stage robust scheduling method. More specifically, first, based on the established unified model, a group of nonanticipative bound constraints is derived to guarantee actual feasibility. Then, a single-level multi-stage robust optimization model of CCE microgrid is established against uncertainties of renewables and loads. Last, a rolling real-time economic dispatch model is proposed to obtain actual operation decisions guaranteeing solution feasibility and economy. Numerical tests on a real CCE microgrid verify the efficacy of the proposed methods. Results show that the designed AES evaluation approach achieves a reduction of approximately 300 thousand dollars in ES configuration investment. The proposed scheduling method shows an economic advantage of 2.75% which guarantees solution feasibility compared with the affine decision rules method.
- 1 January 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 179
Topology-aware virtual machine placement for improving cloud servers resource utilization
- 1 January 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 179
Topology-aware virtual machine placement for improving cloud servers resource utilization
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 3097-3108
An Efficient Parallel Single Surrogate Objective Optimization Method for Multi-Objective Black-Box Problems and Its Application in Processor Design
With the growing complexity of modern micro-architectures, processor design must accommodate a wide array of parameters, resulting in vast design spaces. Identifying the optimal trade-offs among various design metrics poses a significant challenge. Performance is inherently difficult to model analytically, while area can be represented by analytical models. Performance evaluation relies on expensive and time-consuming cycle-accurate simulators (CAS), which puts forward strict requirements on the convergence speed and data dependence of the optimization methods. In this paper, based on the characteristics of the design metrics, the processor design problem is modeled as a hybrid black-box and white-box multi-objective discrete optimization problem (BWMO-DOP). In engineering applications, parallel simulation is a common acceleration technology. Therefore, white-box objective, area, is formulated as parallel constraints, while black-box objective, performance, is approximated by order-preserving surrogate objective. And then, BWMO-DOP is simplified into parallel single-objective expensive black-box optimization problems, which are solved by an efficient SOP-MOOA. SOP-MOOA iteratively explores more design points, enhancing the accuracy of the surrogate model while simultaneously updating the Pareto set. Experimental results demonstrate that the proposed algorithm outperforms baseline algorithm in an engineering case and three general numerical cases. In the engineering experiment for performance-area optimization, the proposed algorithm outperforms the baseline algorithm by a factor of more than two when considering the combined effect of performance improvement percentage and area reduction percentage. In numerical tests conducted on three 40-dimensional black-box functions under the same evaluation overhead, the proposed algorithm consistently identified Pareto set of superior quality.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 3097-3108
An Efficient Parallel Single Surrogate Objective Optimization Method for Multi-Objective Black-Box Problems and Its Application in Processor Design
With the growing complexity of modern micro-architectures, processor design must accommodate a wide array of parameters, resulting in vast design spaces. Identifying the optimal trade-offs among various design metrics poses a significant challenge. Performance is inherently difficult to model analytically, while area can be represented by analytical models. Performance evaluation relies on expensive and time-consuming cycle-accurate simulators (CAS), which puts forward strict requirements on the convergence speed and data dependence of the optimization methods. In this paper, based on the characteristics of the design metrics, the processor design problem is modeled as a hybrid black-box and white-box multi-objective discrete optimization problem (BWMO-DOP). In engineering applications, parallel simulation is a common acceleration technology. Therefore, white-box objective, area, is formulated as parallel constraints, while black-box objective, performance, is approximated by order-preserving surrogate objective. And then, BWMO-DOP is simplified into parallel single-objective expensive black-box optimization problems, which are solved by an efficient SOP-MOOA. SOP-MOOA iteratively explores more design points, enhancing the accuracy of the surrogate model while simultaneously updating the Pareto set. Experimental results demonstrate that the proposed algorithm outperforms baseline algorithm in an engineering case and three general numerical cases. In the engineering experiment for performance-area optimization, the proposed algorithm outperforms the baseline algorithm by a factor of more than two when considering the combined effect of performance improvement percentage and area reduction percentage. In numerical tests conducted on three 40-dimensional black-box functions under the same evaluation overhead, the proposed algorithm consistently identified Pareto set of superior quality.