Search Results (825)

Under the “Dual Carbon” strategy, high-penetration integration of distributed generators (DG) into distribution networks has triggered bidirectional power flow and reactive power-voltage violations. This phenomenon undermines the accuracy guarantee of conventional relaxation models (represented by second-order cone programming, SOCP), causing solutions to deviate from the AC power flow feasible region. Notably, ensuring solution feasibility becomes particularly crucial in engineering practice. To address this problem, this paper proposes a collaborative optimization framework integrating convex inner approximation (CIA) theory and a solution recovery algorithm. First, a system relaxation model is constructed using CIA, which strictly enforces ACPF constraints while preserving the computational efficiency of convex optimization. Second, aiming at the conservatism drawback introduced by the CIA method, an admissible region correction strategy based on Stochastic Gradient Descent is designed to narrow the dual gap of the solution. Furthermore, a multi-objective optimization framework is established, incorporating voltage security, operational economy, and renewable energy accommodation rate. Finally, simulations on the IEEE 33/69/118-bus systems demonstrate that the proposed method outperforms the traditional SOCP approach in the 24 h sequential optimization, reducing voltage deviation by 22.6%, power loss by 24.7%, and solution time by 45.4%. Compared with the CIA method, it improves the DG utilization rate by 30.5%. The proposed method exhibits superior generality compared to conventional approaches. Within the upper limit range of network penetration (approximately 60%), it addresses the issue of conservative power output of DG, thereby effectively promoting the utilization of renewable energy. Full article

Accurate global irradiance (GI) forecasting is essential for improving photovoltaic (PV) energy management, stabilizing renewable power systems, and enabling intelligent control in solar-powered applications, including electric vehicles and smart grids. The highly stochastic and non-stationary nature of solar radiation, influenced by rapid atmospheric fluctuations and seasonal variability, makes short-term GI prediction a challenging task. To overcome these limitations, this work introduces a new hybrid forecasting architecture referred to as WTX–CBO, which integrates a Wavelet Transform (WT)-based decomposition module, an encoder–decoder Transformer model, and an XGBoost regressor, optimized using the Chaotic Billiards Optimizer (CBO) combined with the Adam optimization algorithm. In the proposed architecture, WT decomposes solar irradiance data into multi-scale components, capturing both high-frequency transients and long-term seasonal patterns. The Transformer module effectively models complex temporal and spatio-temporal dependencies, while XGBoost enhances nonlinear learning capability and mitigates overfitting. The CBO ensures efficient hyperparameter tuning and accelerated convergence, outperforming traditional meta-heuristics such as Particle Swarm Optimization (PSO) and Genetic Algorithms (GA). Comprehensive experiments conducted on real-world GI datasets from diverse climatic conditions demonstrate the outperformance of the proposed model. The WTX–CBO ensemble consistently outperformed benchmark models, including LSTM, SVR, standalone Transformer, and XGBoost, achieving improved accuracy, stability, and generalization capability. The proposed WTX–CBO framework is designed as a high-accuracy decision-support forecasting tool that provides short-term global irradiance predictions to enable intelligent energy management, predictive charging, and adaptive control strategies in solar-powered applications, including solar electric vehicles (SEVs), rather than performing end-to-end vehicle or photovoltaic power simulations. Overall, the proposed hybrid framework provides a robust and scalable solution for short-term global irradiance forecasting, supporting reliable PV integration, smart charging control, and sustainable energy management in next-generation solar systems. Full article

Wood flooring manufacturers face complex challenges in dynamically allocating resources across multi-channel markets, characterized by channel conflicts, demand uncertainty, and long-term cumulative effects of decisions. Traditional static optimization or myopic approaches struggle to address these intertwined factors, particularly when critical market states like brand reputation and customer base cannot be precisely observed. This paper establishes a systematic and theoretically grounded online decision framework to tackle this problem. We first model the problem as a Partially Observable Stochastic Dynamic Game. The core innovation lies in introducing an unobservable market position vector as the central system state, whose evolution is jointly influenced by firm investments, inter-channel competition, and macroeconomic randomness. The model further captures production lead times, physical inventory dynamics, and saturation/cross-channel effects of marketing investments, constructing a high-fidelity dynamic system. To solve this complex model, we propose a hierarchical online learning and control algorithm named L-BAP (Lyapunov-based Bayesian Approximate Planning), which innovatively integrates three core modules. It employs particle filters for Bayesian inference to nonparametrically estimate latent market states online. Simultaneously, the algorithm constructs a Lyapunov optimization framework that transforms long-term discounted reward objectives into tractable single-period optimization problems through virtual debt queues, while ensuring stability of physical systems like inventory. Finally, the algorithm embeds a game-theoretic module to predict and respond to rational strategic reactions from each channel. We provide theoretical performance analysis, rigorously proving the mean-square boundedness of system queues and deriving the performance gap between long-term rewards and optimal policies under complete information. This bound clearly quantifies the trade-off between estimation accuracy (determined by particle count) and optimization parameters. Extensive simulations demonstrate that our L-BAP algorithm significantly outperforms several strong baselines—including myopic learning and decentralized reinforcement learning methods—across multiple dimensions: long-term profitability, inventory risk control, and customer service levels. Full article

This study establishes a comprehensive structural isomorphism between Conway’s Game of Life and the entrepreneurial process, analysing the latter as a complex adaptive system governed by non-linear dynamics rather than linear predictability. Through a rigorous qualitative approach based on a systematic literature review and abductive inference, the research identifies and correlates four fundamental dimensions: uncertainty, adaptability, growth, and sustainability. Transcending traditional metaphorical comparisons, this paper introduces a novel mathematical model that modifies Conway’s deterministic logic by incorporating an «Agency» variable (A). This critical addition quantifies how an entrepreneur’s internal capabilities can counterbalance environmental pressures (neighbourhood density) to determine survival thresholds, effectively transforming the simulation into a «Game of Life with Agency» where participants actively influence their viability potential (Ψ). The analysis explicitly correlates specific algorithmic configurations with real-world business phenomena: high-entropy initial states («The Soup») mirror early-stage market uncertainty where outcomes are probabilistic; «gliders» represent the necessity of strategic pivoting and continuous displacement for survival; and «oscillators» symbolise dynamic sustainability through rhythmic equilibrium rather than static permanence. Furthermore, the study validates the «Gosper Glider Gun» pattern as a model for scalable, generative growth. By bridging abstract systems theory with managerial practice, the research positions these simulations as «mental laboratories» for decision-making. The findings theoretically validate iterative methodologies like the Lean Startup and conclude that successful entrepreneurship operates on the «Edge of Chaos», providing a rigorous framework for navigating high stochastic uncertainty. Full article

A pinning boundary control strategy that can achieve the exponentially clustered synchronization of a specific class of complex networks is developed. Firstly, the studied model captures the essential features of networks, including spatial dependence, stochastic switching, noise perturbation, and time delays. Secondly, the proposed control algorithm can save the implementation cost and overcome environmental constraint by acting on the boundary of a few nodes. Thirdly, an average state related to the directed topology of the nodes in the same cluster is calculated as the target network. Finally, nonlinear simulations show that the proposed controller can solve the cluster synchronization of a directed coupled reaction–diffusion neural network with Markovian switching, stochastic noise and time delay. Full article

The increasing proliferation of new energy vehicles and autonomous vehicles has led to the formation of mixed traffic flows characterized by diverse driving behaviors, posing new challenges for intersection signal control. To address this issue, this study proposes a multi-class customer feedback queuing network (MCFFQN) model that incorporates state-dependent road capacity and congestion propagation mechanisms to accurately capture the stochastic and dynamic nature of mixed traffic flows. An evaluation framework for intersection performance is established based on key indicators such as vehicle delay, the energy consumption of new energy vehicles, and the fuel consumption and emissions of conventional vehicles. A recursive solution algorithm is developed and validated through simulations under various traffic demand scenarios. Building on this model, a signal timing optimization model aimed at minimizing total costs—including delay and environmental impacts—is formulated and solved using the Mesh Adaptive Direct Search (MADS) algorithm. A case study demonstrates that the optimized signal timing scheme significantly enhances intersection performance, reducing vehicle delay, energy consumption, fuel consumption, and emissions by over 20%. The proposed methodology provides a theoretical foundation for sustainable traffic management under mixed traffic conditions. Full article

The abundant satellite data have enabled the study of the dynamics of forest logging and its corresponding carbon balance with remote sensing. Change detection techniques with moderate-resolution imagery have been widely developed. Yet the signal processing or machine learning methods are sample-dependent, lacking an understanding of spectral signals of forest growth and logging cycles, which is necessary to distinguish logging from other types of disturbance, and mechanism models addressing post-logging tree changes are too complex for parameter inversion. We therefore proposed an efficient physical-based model for spectral simulation of annual forest logging by coupling forest dynamic model ZELIG and the stochastic radiative transfer (SRT) model. The forest logging simulation was conducted and validated by Abies forest field data before and after logging in Wangqing County, Northeastern China (R² = 0.85, RMSE = 10.82 t/ha). The spectral changes in Abies forest stands with annual growth and varying logging intensities were simulated by the novel model. The annual Landsat-8 and Gaofen-1 fusion multispectral imagery of the study area from 2013 to 2016 was furtherly used to extract annual sequence spectral data of 350 forest plots and perform inversion of the annual difference in above-ground biomass (dAGB). With the inversion method combining the look-up table of the ZELIG-SRT model and the random forest regression, the retrieved dAGB of the 350 plots indicated consistency with the measured data on the whole (R² = 0.71, RMSE = 13.32 t/ha). The novel physical-based approach for AGB monitoring is more efficient than previous 3D computer models and less dependent on field samples than data-driven models. This study provides a theoretical basis for understanding the remote sensing response mechanism of forest logging and a methodological basis for improving forest logging monitoring algorithms. Full article

This paper investigates the planning problem of AC-integrated wind–photovoltaic–hydro–storage (WPHS) bundled transmission systems. To effectively capture the uncertainty and interdependence in renewable power outputs, a Copula-enhanced distributionally robust optimization (DRO) framework is developed, enabling a unified treatment of stochastic and correlated renewable generation within the system planning process. First, a location and capacity planning model based on DRO for WPHS generation bases is formulated, in which a composite-norm ambiguity set is constructed to describe the uncertainty of renewable resources. Second, the Copula function is employed to characterize the nonlinear dependence structure between wind and photovoltaic (PV) power outputs, providing representative scenarios and initial probability distribution (PD) support for the construction of a bivariate ambiguity set that embeds coupling information. The resulting optimization problem is solved using the column and constraint generation (C&CG) algorithm. In addition, an evaluation metric termed the transmission corridor utilization rate (TCUR) is proposed to quantitatively assess the efficiency of external AC transmission planning schemes, offering a new perspective for the evaluation of regional power transmission strategies. Finally, simulation results validate that the proposed model achieves superior performance in terms of system economic efficiency and TCUR. Full article

This study presents an integrated optimization framework for fleet assignment, flight scheduling, and aircraft routing under uncertainty, addressing a core challenge in airline operational planning. A three-stage stochastic mixed-integer nonlinear programming model is developed that, for the first time, simultaneously incorporates station purity constraints, codeshare agreements, and overbooking decisions. The formulation also includes realistic operational factors such as stochastic passenger demand and non-cruise times (NCT), along with adjustable cruise speeds and flexible departure time windows. To handle the computational complexity of this large-scale stochastic problem, a Sample Average Approximation (SAA) scheme is combined with two tailored metaheuristic algorithms: Simulated Annealing and Cuckoo Search. Extensive experiments on real-world flight data demonstrate that the proposed hybrid approach achieves tight optimality gaps below 0.5%, with narrow confidence intervals across all instances. Moreover, the SA-enhanced method consistently yields superior solutions compared with the CS-based variant. The results highlight the significant operational and economic benefits of jointly optimizing codeshare decisions, station purity restrictions, and overbooking policies. The proposed framework provides a scalable and robust decision-support tool for airlines seeking to enhance resource utilization, reduce operational costs, and improve service quality under uncertainty. Full article

Against the backdrop of China’s dual-carbon goals, traditional road transportation has relatively high carbon emissions and is in urgent need of a low-carbon transition. The intermittency of photovoltaic (PV) power generation and the stochastic nature of electric vehicle (EV) charging demand introduce significant uncertainty for PV-energy storage-charging systems in highway service areas. Existing approaches often struggle to balance economic efficiency and reliability. This study develops a min-max-min robust optimization model for a full-route PV-energy storage-charging system. A box uncertainty set is used to characterize uncertainties in PV output and EV load, and a tunable uncertainty parameter is introduced to regulate risk. The model is solved using a column-and-constraint generation (C&CG) algorithm that decomposes the problem into a master problem and a subproblem. Strong duality, combined with a big-M formulation, enables an alternating iterative solution between the master problem and the subproblem. Simulation results demonstrate that the proposed algorithm attains the optimal solution and, relative to deterministic optimization, achieves a desirable trade-off between economic performance and robustness. Full article

Scheduling agricultural machinery across multiple cooperatives is often inefficient because existing rigid, discrete assignment models fail to flexibly coordinate shared resources under tight time windows. To address this limitation, we develop a simulation-based framework for the Multi-cooperative Agricultural Machinery Scheduling Problem (MAMSP) underpinned by a Continuous Collaborative Workload Sharing (CWS) formulation. To mitigate the solution fragmentation inherent in continuous optimization, we propose a Hybrid Particle Swarm Optimization with Sparsity Repair (HPSO-SR). The algorithm integrates a stochastic initialization strategy to enhance global exploration, a mutation injection mechanism to avoid swarm stagnation, and a sparsity repair operator that prunes uneconomical fractional assignments, yielding operationally feasible sparse schedules. A real-world case study from Liyang, China, augmented by synthetic instances of varying scales (small, medium, and large), was conducted to benchmark the proposed approach against a rule-based heuristic, a Genetic Algorithm (GA-CWS), and Simulated Annealing (SA-CWS) under a unified decoding scheme. The results show that HPSO-SR consistently achieves the lowest objective values, reducing the total cost by 74.43% relative to GA-CWS and 59.20% relative to SA-CWS in the medium-scale case. By deliberately trading off minimal additional transfer cost against improved timeliness, the obtained schedules nearly eliminate delay penalties. Sensitivity analysis and mechanism ablation studies further confirm that the sparse solutions exhibit structural resilience and that the proposed repair strategy is essential for algorithmic convergence, supporting the reliability of the proposed approach for time-critical, high-stakes agricultural operations. Full article

This study proposes a novel high-performance computational framework to address the computational challenges in probabilistic large-deformation landslide analysis. By integrating a GPU-accelerated material point method (MPM) solver with a parallelized covariance matrix decomposition (CMD) algorithm for decomposing symmetric matrices, the framework achieves exceptional efficiency, demonstrating speedups of up to 532× (MPM solver) and 120× (random field generation) compared to traditional serial methods. Leveraging this efficiency, extensive Monte Carlo simulations (MCSs) were conducted to quantify the effects of spatial variability in soil properties on landslide behaviors. Quantitative results indicate that runout and influence distances follow normal distributions, while sliding mass volume exhibits log-normal characteristics. Crucially, deterministic analysis was found to systematically underestimate the hazard; the probabilistic mean sliding volume significantly exceeded the deterministic value, with 73–80% of stochastic realizations producing larger failures. Furthermore, sensitivity analyses reveal that increasing the coefficient of variation (COV) and the cross-correlation coefficient (from −0.5 to 0.5) leads to a monotonic increase in both the mean and standard deviation of large-deformation metrics. These findings confirm that positive parameter correlation amplifies failure risk, providing a rigorous physics-based basis for conservative landslide hazard assessment. Full article

The development of shale gas reservoirs relies on complex fracture networks created via multistage hydraulic fracturing, yet most existing models still use oversimplified fracture geometries and therefore cannot fully capture the coupled effects of multiscale fracture topology on flow and production. To address this gap, in this study, we combine fractal geometry with the Embedded Discrete Fracture Model (EDFM) to analyze the production dynamics of hydraulically fractured horizontal wells in shale gas reservoirs. A tree-like fractal fracture network is first generated using a stochastic fractal growth algorithm, where the iteration number, branching number, scale factor, and deviation angle control the self-similar hierarchical structure and spatial distribution of fractures. The resulting fracture network is then embedded into an EDFM-based, fully implicit finite-volume simulator with Non-Neighboring Connections (NNCs) to represent multiscale fracture–matrix flow. A synthetic shale gas reservoir model, constructed using representative geological and engineering parameters and calibrated against field production data, is used for all numerical experiments. The results show that increasing the initial water saturation from 0.20 to 0.35 leads to a 26.4% reduction in cumulative gas production due to enhanced water trapping. Optimizing hydraulic fracture spacing to 200 m increases cumulative production by 3.71% compared with a 100 m spacing, while longer fracture half-lengths significantly improve both early-time and stabilized gas rates. Increasing the fractal iteration number from 1 to 3 yields a 36.4% increase in cumulative production and markedly enlarges the pressure disturbance region. The proposed fractal–EDFM framework provides a synthetic yet field-calibrated tool for quantifying the impact of fracture complexity and design parameters on shale gas well productivity and for guiding fracture network optimization. Full article

With the continuously rising penetration rate of variable renewable energy (VRE), issues related to power balance and frequency stability in power systems have become increasingly prominent. Battery energy storage systems (BESS) with grid-forming capabilities are regarded as an effective solution for providing rapid frequency support. However, the stochastic fluctuations of VRE output also lead to time-varying system inertia, which undoubtedly increases the complexity of energy storage planning. To address these problems, this study constructs a bi-level robust planning model for grid-forming energy storage considering frequency security constraints. First, a frequency response model for grid-forming BESS is established. By accurately describing the delay characteristics of different resources in frequency response, dynamic frequency security constraints (FSC) that can be embedded into the planning model are constructed. Subsequently, the study proposes an evaluation method for the spatial distribution of power system inertia, providing a basis for the optimal siting of BESS in the grid. On this basis, a bi-level robust planning model, considering VRE uncertainty, is constructed, which embeds an operational simulation model and incorporates FSC. To achieve an effective solution of the model, FSC is transformed into a second-order cone form, and a nested column-and-constraint generation (C&CG) algorithm is employed for solving. Simulation results on the modified NPCC-140 bus system verify the effectiveness of the proposed model. While reducing the total cost by 15.9%, this method effectively ensures the dynamic frequency security of the power system, improves the spatial distribution of inertia and significantly enhances the system’s ability to accommodate VRE. Full article

Weighted sum-rate (WSR) maximization in downlink massive multi-user multiple-input (MU-MIMO) with per-antenna power constraints (PAPCs) and imperfect channel state information (CSI) is computationally challenging. Classical weighted minimum mean-square error (WMMSE) algorithms, in particular, have per-iteration costs that scale cubically with the number of base-station antennas. This article proposes a robust low-complexity WMMSE-based precoding framework (RLC-WMMSE) tailored for massive MU-MIMO downlink under PAPCs and stochastic CSI mismatch. The algorithm retains the standard WMMSE structure but incorporates three key enhancements: a diagonal dual-regularization scheme that enforces PAPCs via a lightweight projected dual ascent with row-wise safety projection; a Woodbury-based transmit update that replaces the dominant $M\times M$ inversion with an $\left(NK\right)\times \left(NK\right)$ symmetric positive-definite solve, greatly reducing the per-iteration complexity; and a hybrid switching mechanism with adaptive damping that blends classical and low-complexity updates to improve robustness and convergence under channel estimation errors. We also analyze computational complexity and signaling overhead for both TDD and FDD deployments. Simulation results over i.i.d. and spatially correlated channels show that the proposed RLC-WMMSE scheme achieves WSR performance close to benchmark WMMSE-PAPCs designs while providing substantial runtime savings and strictly satisfying the per-antenna power limits. These properties make RLC-WMMSE a practical and scalable precoding solution for large-scale MU-MIMO systems in future wireless sensor and communication networks. Full article