arXiv subjects

Weiqi Meng

Publications and source records attributed to Weiqi Meng.

5 recordsLinked to original sources

arXiv2026

VEQ: a fast parametric Grad--Shafranov solver for fixed-boundary tokamak equilibria with flexible source profiles

Veloce EQuilibrium (VEQ) is a compact parametric framework for tokamak modeling workflows that repeatedly query continuous fixed-boundary equilibria at low latency. The VEQPy implementation evaluated here is an axisymmetric fixed-boundary Grad-Shafranov solver whose main solve enforces a variationally induced projected residual. Its active unknowns are MXH-type flux-surface harmonics and shifted-Chebyshev coefficients for radial profile and source closures. Six input routes accept pressure-gradient, toroidal-field-function, poloidal-flux-gradient, enclosed toroidal current, current-density and safety-factor information through route-specific closures, while all routes map to the same finite-dimensional residual operator. Controlled tests show route consistency for smooth, mutually compatible inputs generated from a common reference equilibrium. For Pareto-selected reduced configurations in three G-EQDSK cases, the most accurate selected rows correspond to a D-shaped case (9 active parameters, minor-radius-normalized shape error 1.4e-3, solve-only median 1.6 ms), an H-mode case (65, 1.1e-3, 19 ms), and an X-point case treated as a smoothed fixed-boundary representation of a diverted boundary (94, 1.9e-3, 15 ms). Sampled pointwise strong-form Grad-Shafranov diagnostics show that enriching the active representation mainly improves interior force balance, whereas the global RMS and maximum values for the H-mode and X-point cases remain dominated by near-boundary contributions. In an isolated one-dimensional transport-geometry coupling test against the target geometry read from G-EQDSK, the temperature-profile response remains below about one percent. These results support using VEQ for repeated equilibrium-geometry queries, provided that pointwise diagnostics are retained to screen cases requiring boundary refinement, local correction or higher-fidelity equilibrium solves.

physics.plasm-ph↗

arXiv2026

Day-Ahead Offering for Virtual Power Plants: A Stochastic Linear Programming Reformulation and Projected Subgradient Method

Virtual power plants (VPPs) are an emerging paradigm that aggregates distributed energy resources (DERs) for coordinated participation in power systems, including bidding as a single dispatchable entity in the wholesale market. In this paper, we address a critical operational challenge for VPPs: the day-ahead offering problem under highly intermittent and uncertain DER outputs and market prices. The day-ahead offering problem determines the price-quantity pairs submitted by VPPs while balancing profit opportunities against operational uncertainties. First, we formulate the problem as a scenario-based two-stage stochastic adaptive robust optimization problem, where the uncertainty of the locational marginal prices follows a Markov process and DER uncertainty is characterized by static uncertainty sets. Then, motivated by the outer approximation principle of the column-and-constraint generation (CC&G) algorithm, we propose a novel inner approximation-based projected subgradient method. By exploiting the problem structure, we propose two novel approaches to improve computational tractability. First, we show that under mild modeling assumptions, the robust second-stage problem can be equivalently reformulated as a linear program (LP) with a nested resource allocation structure that is amenable to an efficient greedy algorithm. Furthermore, motivated by the computational efficiency of solving the reformulated primal second-stage problem and the isotonic structure of the first-stage feasible region, we propose an efficient projected subgradient algorithm to solve the overall stochastic LP problem. Extensive computational experiments using real-world data demonstrate that the overall projected subgradient descent method achieves about two orders of magnitude speedup over CC&G while maintaining solution quality.

math.OC↗

arXiv2026

Unified Sensitivity-Based Heuristic for Optimal Line Switching and Substation Reconfiguration

Optimal transmission switching (OTS) determines which transmission lines to remove from service to minimize dispatch costs. Unlike topology design, it alters the operational status of operating lines. Sensitivity-based methods, as advanced optimization techniques, select lines whose outage yields a significant cost reduction. However, these methods overlook bus splitting, an effective congestion management strategy that our work incorporates to achieve improved economic gains. In this work, we formulate an optimal transmission reconfiguration (OTR) problem that incorporates both line switching and bus splitting. We develop a novel approach to quantify the sensitivity of the OTR objective to line switching and bus splitting, establish connections between the proposed sensitivity framework and existing heuristic metrics, prove the equivalence between bus splitting and a generalized line switching to enable unified treatment, and provide a simpler derivation of Bus Split Distribution Factor (BSDF). Simulations on nine IEEE test systems spanning 118 to 13,659 buses demonstrate the high effectiveness of our proposed sensitivity method. They also demonstrate that incorporating bus splitting into transmission reconfiguration achieves greater cost savings than line switching alone. The results confirm the economic advantage of this comprehensive approach to transmission system operation.

eess.SY↗

arXiv2026

DER Day-Ahead Offering: A Neural Network Column-and-Constraint Generation Approach

In the day-ahead energy market, the offering strategy of distributed energy resource (DER) aggregators must be submitted before the uncertainty realization in the form of price-quantity pairs. This work addresses the day-ahead offering problem through a two-stage adaptive robust stochastic optimization model, wherein the first-stage price-quantity pairs and second-stage operational commitment decisions are made before and after DER uncertainty is realized, respectively. Uncertainty in day-ahead price is addressed using a stochastic programming-based approach, while uncertainty of DER generation is handled through robust optimization. To address the max-min structure of the second-stage problem, a neural network-accelerated column-and-constraint generation method is developed. A dedicated neural network is trained to approximate the value function, while optimality is maintained by the design of the network architecture. Numerical studies indicate that the proposed method yields high-quality solutions and is up to 100 times faster than Gurobi and 33 times faster than classical column-and-constraint generation on the same 1028-node synthetic distribution network.

eess.SY↗

arXiv2025

R&D of KLM Upgrade for Direct Measurement of Neutral Hadron Momentum via Time-of-Flight in Belle II

Accurate momentum determination of a neutral hadron, such as a KL meson or a neutron, remains a significant challenge in particle physics and nuclear physics experiments. The Belle II experiment presents an opportunity to address this challenge through an upgrade incorporating Time-of-Flight (TOF) capability for its large KL and Muon Detector (KLM). We investigate the feasibility of momentum determination via TOF measurement. To achieve high time resolution for the KLM upgrade, we conduct research and development of cost-effective plastic scintillators in collaboration with GaoNengKeDi Company, and technology utilizing silicon photomultipliers(SiPMs) arrays. A bulk attenuation length of 120 \pm 7 cm has been achieved with a 135 cm-long sample, along with a time resolution of 70 \pm 7 ps at its midpoint. A 50 cm-long scintillator demonstrates an exceptional time resolution of 47 \pm 2 ps. These results highlight the potential of the proposed technology for improving neutral hadron momentum measurements in an upgraded Belle II KLM detector.

physics.ins-det↗