Search Results (34)

The construction of large-scale buildings often faces extended production cycles due to inefficiencies in scheduling processes. To address this challenge, a timed Petri net model was developed to analyze and optimize construction scheduling. Based on the Petri net transition sequence, a scheduling optimization model was proposed. To solve the model efficiently, an improved brainstorming optimization (BSO) algorithm was introduced. Compared with the classical BSO, two targeted enhancements were introduced: a problem-specific encoding and decoding method for Petri net transition sequences to ensure solution feasibility and an embedded simulated annealing local search mechanism to prevent premature convergence in later iterations. The proposed methodology was validated using real-world data from a large high-speed railway hub foundation pit construction project. Results demonstrated a significant reduction of 531 working hours in the total scheduling time, representing a 15.47% improvement in scheduling efficiency compared to traditional sequential scheduling methods. This approach not only shortened the scheduling cycle and enhanced production efficiency but also offered an innovative solution to address scheduling issues in complex construction processes. Full article

With the continuous expansion of the expressway network and the rapid growth of traffic demand, traditional single-source traffic detection data is limited in spatial–temporal coverage and accuracy, which can hardly support the refined operation and management of intelligent expressways. Existing data preprocessing methods often fail to fully capture global spatiotemporal features, and traditional PSO-BP neural networks are prone to local optima. To address these issues, this study investigates multi-source traffic data fusion using ETC-DSRC and RTMS microwave data from the Jiangsu section of the G50 Shanghai-Chongqing Expressway. The HaLRTC tensor completion algorithm is adopted to repair missing and abnormal data, fully mining the spatial–temporal correlation characteristics of traffic flow. The beetle antennae search (BAS) mechanism is introduced into the particle swarm optimization (PSO) process to improve particle search behavior and population diversity. On this basis, a BAS-optimized PSO-BP neural network, referred to as BSO-BP in this study, is constructed for multi-source traffic data fusion. In this model, the improved PSO algorithm is used to optimize the initial weights and thresholds of the backpropagation (BP) neural network, thereby improving the global search capability and convergence stability of the fusion model. Taking the average road speed as the fusion target, MAE, RMSE and MAPE are used for accuracy verification. The results show that the proposed model has significantly higher accuracy than single-source data methods and BP, PSO-BP, and GA-PSO-BP models, and can reflect the real traffic state of road sections more accurately. Full article

Background: Endometrial cancer is the most common gynecologic malignancy in developed countries. Sentinel lymph node (SLN) mapping has emerged as a less invasive alternative to systematic lymphadenectomy and is increasingly incorporated into surgical staging algorithms. Vaginal natural orifice transluminal endoscopic surgery (vNOTES) provides transvaginal access to the retroperitoneum and may facilitate SLN mapping while potentially reducing postoperative morbidity, including lower extremity lymphedema (LEL). Objective: This study aimed to evaluate the feasibility of vNOTES hysterectomy with bilateral salpingo-oophorectomy (BSO) and retroperitoneal SLN mapping and to report early postoperative lymphedema outcomes in patients with newly diagnosed endometrial cancer. Methods: This retrospective cohort study included 113 patients who underwent vNOTES-assisted hysterectomy with BSO and SLN mapping using methylene blue dye at a tertiary referral center between January 2022 and January 2023. Lymphedema was evaluated using the Gynecologic Cancer Lymphedema Questionnaire at 6 and 12 months postoperatively, supported by clinical examination. Descriptive statistical analyses were performed to summarize clinical characteristics and symptom profiles. Results: The mean patient age was 55.0 ± 10.5 years and the mean BMI was 30.94 ± 2.54 kg/m². Endometrioid adenocarcinoma was the most common histological subtype (75.5%), and most tumors were grade 1 (57.1%). SLN mapping was successful in 102 of 113 patients (overall detection rate 90.3%), with bilateral detection in 79.6% and unilateral detection in 10.6% of cases. Limb swelling was reported in 4.1% of patients, while only one patient (1.0%) met the criteria for self-reported mild lymphedema. No clinical signs of inguinal lymphedema were detected. Conclusions: vNOTES hysterectomy combined with retroperitoneal SLN mapping was associated with a low incidence of postoperative lower extremity lymphedema in this single-arm cohort. These findings suggest that vNOTES-assisted SLN mapping may represent a feasible minimally invasive approach for nodal assessment in selected patients with endometrial cancer. Prospective comparative studies are required to confirm these findings and to evaluate long-term oncologic and lymphatic outcomes. Full article

Background and Objectives: Sentinel lymph node (SLN) mapping is an established alternative to systematic lymphadenectomy for early-stage endometrial cancer (EC). While retroperitoneal vNOTES affords direct access to pelvic nodes without abdominal incisions, data regarding its oncologic validity remain sparse. This study evaluates the SLN detection rates, perioperative outcomes, and 12-month oncologic outcomes oncologic results of retroperitoneal vNOTES mapping in presumed early-stage EC. Materials and Methods: This single-center retrospective cohort study analyzed consecutive patients undergoing retroperitoneal vNOTES staging (hysterectomy, BSO, and SLN mapping) for presumed EC between February 2023 and January 2024. Eligible patients had radiologically uterine-confined disease and were candidates for transvaginal surgery. Following cervical methylene blue injection, SLN mapping was executed via the retroperitoneal vNOTES route. Mapped and suspicious nodes were excised, with side-specific lymphadenectomy performed for failed mapping per algorithm. While perioperative outcomes were assessed for the full cohort, oncologic analyses (FIGO 2023 staging, nodal metastasis) were restricted to patients with confirmed carcinoma. Results: Of 98 patients (median age 54; BMI 31 kg/m²), final pathology confirmed carcinoma in 78 (73 endometrioid, 5 serous) and EIN in 20. Bilateral SLN mapping succeeded in 87.8% (86/98), necessitating side-specific lymphadenectomy in the remaining 12.2%. The obturator fossa was the predominant nodal basin (43.9%). Within the carcinoma cohort (n = 78), 57.7% were Grade 1 and 74.4% FIGO Stage I. Nodal metastases (FIGO IIIC1) were identified in 12.8% (10/78), all prompting adjuvant therapy. At a median follow-up of 12 months, no disease recurrences were observed. The complication rate was 6.1% (5.1% Clavien–Dindo ≥ III), with no conversions required. At 12-month follow-up, no recurrences were detected, though the absence of systematic lymphadenectomy precluded formal sensitivity analysis. Conclusions: Retroperitoneal vNOTES represents a feasible and safe strategy for SLN mapping in early-stage EC, demonstrating high bilateral detection with minimal morbidity. However, reliance on methylene blue and limited follow-up necessitate caution. Broader implementation requires validation through prospective, comparative trials utilizing indocyanine green and long-term oncologic surveillance. Full article

Cloud computing has transformed modern IT infrastructure by enabling scalable, on-demand access to virtualized resources. However, the rapid growth of cloud services has intensified energy consumption across data centres, increasing operational costs and carbon footprints. Traditional load-balancing methods, such as Round Robin and First-Fit, often fail to adapt dynamically to fluctuating workloads and heterogeneous resources. To address these limitations, this study introduces a Reinforcement Learning-guided hybrid optimization framework that integrates the Black Eagle Optimizer (BEO) for global exploration with the Pelican Optimization Algorithm (POA) for local refinement. A lightweight RL controller dynamically tunes algorithmic parameters in response to real-time workload and utilization metrics, ensuring adaptive and energy-aware scheduling. The proposed method was implemented in CloudSim 3.0.3 and evaluated under multiple workload scenarios (ranging from 500 to 2000 cloudlets and up to 32 VMs). Compared with state-of-the-art baselines, including PSO-ACO, MS-BWO, and BSO-PSO, the RL-enhanced hybrid BEO–POA achieved up to 30.2% lower energy consumption, 45.6% shorter average response time, 28.4% higher throughput, and 12.7% better resource utilization. These results confirm that combining metaheuristic exploration with RL-based adaptation can significantly improve the energy efficiency, responsiveness, and scalability of cloud scheduling systems, offering a promising pathway toward sustainable, performance-optimized data-centre management. Full article

Given the strong coupling between electricity flow and carbon flow, promoting the low-carbon transformation of the energy sector is a crucial measure to actively responding to climate challenges. As a pivotal hub linking the electricity market with the carbon market, promoting electricity–carbon coordinated scheduling of Virtual Power Plants (VPPs) is of great significance in expediting the energy transition process. Based on the introduction of carbon potential, this manuscript constructs a VPP electricity–carbon coordinated scheduling model that incorporates various typical elements, including renewable energy units and demand response. Furthermore, this paper utilizes Brain Storm Optimization (BSO) to improve the Snow Ablation Optimizer (SAO) algorithm and applies the improved algorithm to solve the model developed in this manuscript. Finally, an analysis was conducted using a small-scale VPP project in eastern China, and the results are the following: Firstly, the SAO improved by BSO demonstrates a significant enhancement in solution efficiency. In particular, for the cases presented in this manuscript, the algorithm’s convergence speed increased by 42.85%. Secondly, under the multi-market conditions and with real-time carbon potential, VPPs will possess greater flexibility in scheduling optimization and stronger incentives to fully explore their emission reduction potential through collaborative electricity–carbon scheduling, thereby improving both economic and environmental performance. However, constrained by factors such as the currently low carbon price level, the extent of improvement in VPPs’ performance under real-time carbon potential, compared to fixed carbon potential, remains relatively limited, with a 1.07% increase in economic benefits and a 2.63% reduction in carbon emissions. Thirdly, an increase in carbon prices can incentivize VPPs to continuously tap into their emission reduction potential, but beyond a certain threshold (120 CNY/t in this case study), the marginal contribution of further carbon price increases to emission reductions will progressively decline. Specifically, for every 20-yuan increase in the carbon price, the carbon emission reduction rate of VPPs drops below 1%. Full article

To address the core challenges in multi-robot path planning (MRPP) within large-scale, complex environments—namely path conflicts, suboptimal task allocation, and computational inefficiency—this paper introduces a Hybrid Clustering-Enhanced Brain Storm Optimization (HC-BSO) algorithm designed to improve both path quality and computational efficiency significantly. For optimizing initial task assignment, the conventional K-Means clustering method is supplanted by a hybrid clustering methodology that integrates Mini-Batch K-Means with Density-Based Spatial Clustering of Applications with Noise (DBSCAN), facilitating an efficient and robust partitioning of task points. Concurrently, we incorporate a two-stage exploration–perturbation evolutionary strategy. This strategy effectively balances global exploration with local exploitation, thereby enhancing solution diversity and search depth. Comparative analyses against the standard Brain Storm Optimization (BSO) and other prominent swarm intelligence algorithms reveal that HC-BSO exhibits significant advantages in terms of total path length, computational time, and path conflict avoidance. Notably, in large-scale, multi-task scenarios, HC-BSO consistently generates high-quality, conflict-free paths, demonstrating superior stability, convergence, and scalability. Full article

As a product of modern development, logistics plays a significant role in economic growth with its advantages of integrated management, unified operations, and speed. With the rapid advancement of technology and economy, traditional manual storage and retrieval methods can no longer meet industry demands. Achieving efficient storage and retrieval of goods on densely packed, symmetrically shaped logistics shelves has become a critical issue that needs urgent resolution. The brain storm optimization (BSO) algorithm, introduced in 2010, has found extensive applications across various fields. This paper presents a modified BSO algorithm (MBSO) aimed at addressing the scheduling challenges of double-end automated storage and retrieval systems (DE-AS/RSs). Traditional AS/RSs suffer from slow scheduling efficiency and the current heuristic algorithms exhibit low accuracy. To overcome these limitations, we propose a new scheduling strategy for the stacker to select I/O stations in DE-AS/RSs. The MBSO incorporates two key enhancements to the basic BSO algorithm. First, it employs an objective space clustering method in place of the standard k-means clustering to achieve more accurate solutions for AS/RS scheduling problems. Second, it utilizes a mutation operation based on a greedy strategy and an improved crossover operation for updating individuals. Extensive comparisons were made between the well-known heuristic algorithms NIGA and BSO in several specific enterprise warehouse scenarios. The experimental results show that the MBSO has significant accuracy, optimization speed, and robustness in solving scheduling of AS/RSs. Full article

Intelligent control algorithms have been extensively utilized for adaptive controller parameter adjustment. While the Particle Swarm Optimization (PSO) algorithm has several issues: slow convergence speed requiring a large number of iterations, a tendency to get trapped in local optima, and difficulty escaping from them. It is also sensitive to the distribution of the solution space, where uneven distribution can lead to inefficient contraction. On the other hand, the Beetle Antennae Search (BAS) algorithm is robust, precise, and has strong global search capabilities. However, its limitation lies in focusing on a single individual. As the number of iterations increases, the step size decays, causing it to get stuck in local extrema and preventing escape. Although setting a fixed or larger initial step size can avoid this, it results in poor stability. The PSO algorithm, which targets a population, can help the BAS algorithm increase diversity and address its deficiencies. Conversely, the characteristics of the BAS algorithm can aid the PSO algorithm in finding the optimal solution early in the optimization process, accelerating convergence. Therefore, considering the combination of BAS and PSO algorithms can leverage their respective advantages and enhance overall algorithm performance. This paper proposes an improved algorithm, W-K-BSO, which integrates the Beetle Antennae Search strategy into the local search phase of PSO. By leveraging chaotic mapping, the algorithm enhances population diversity and accelerates convergence speed. Additionally, the adoption of linearly decreasing inertia weight enhances algorithm performance, while the coordinated control of the contraction factor and inertia weight regulates global and local optimization performance. Furthermore, the influence of beetle antennae position increments on particles is incorporated, along with the establishment of new velocity update rules. Simulation experiments conducted on nine benchmark functions demonstrate that the W-K-BSO algorithm consistently exhibits strong optimization capabilities. It significantly improves the ability to escape local optima, convergence precision, and algorithm stability across various dimensions, with enhancements ranging from 7 to 9 orders of magnitude compared to the BAS algorithm. Application of the W-K-BSO algorithm to PID optimization for the Pointing and Tracking System (PTS) reduced system stabilization time by 28.5%, confirming the algorithm’s superiority and competitiveness. Full article

To tackle the problem of the brain storm optimization (BSO) algorithm’s suboptimal capability for avoiding local optima, which contributes to its inadequate optimization precision, we developed a flock decision mutation approach that substantially enhances the efficacy of the BSO algorithm. Furthermore, to solve the problem of insufficient BSO algorithm population diversity, we introduced a strategy that utilizes the good point set to enhance the initial population’s quality. Simultaneously, we substituted the K-means clustering approach with spectral clustering to improve the clustering accuracy of the algorithm. This work introduced an enhanced version of the brain storm optimization algorithm founded on a flock decision mutation strategy (FDIBSO). The improved algorithm was compared against contemporary leading algorithms through the CEC2018. The experimental section additionally employs the AUV intelligence evaluation as an application case. It addresses the combined weight model under various dimensional settings to substantiate the efficacy of the FDIBSO algorithm further. The findings indicate that FDIBSO surpasses BSO and other enhanced algorithms for addressing intricate optimization challenges. Full article

The brain storm optimization (BSO) algorithm has received increased attention in the field of evolutionary computation. While BSO has been applied in numerous industrial scenarios due to its effectiveness and accessibility, there are few theoretical analysis results about its running time. Running-time analysis can be conducted through the estimation of the upper bounds of the expected first hitting time to evaluate the efficiency of BSO. This study estimates the upper bounds of the expected first hitting time on six single individual BSO variants (BSOs with one individual) based on the average gain model. The theoretical analysis indicates the following results. (1) The time complexity of the six BSO variants is $\mathrm{O}\left(\sqrt{n}\right)$ in equal coefficient linear functions regardless of the presence or absence of the disrupting operator, where n is the number of the dimensions. Moreover, the coefficient of the upper bounds on the expected first hitting time shows that the single individual BSOs with the disrupting operator require fewer iterations to obtain the target solution than the single individual BSOs without the disrupting operator. (2) The upper bounds on the expected first hitting time of single individual BSOs with the standard normally distributed mutation operator are lower than those of BSOs with the uniformly distributed mutation operator. (3) The upper bounds on the expected first hitting time of single individual BSOs with the $U\left(-\frac{1}{2},\frac{1}{2}\right)$ mutation operator are approximately twice those of BSOs with the $U(-1,1)$ mutation operator. The corresponding numerical results are also consistent with the theoretical analysis results. Full article

In the realm of existing intelligent drip irrigation control systems, traditional PID control encounters challenges in delivering satisfactory control outcomes, primarily owing to issues related to non-linearity, time-varying behavior, and hysteresis. In order to solve the problem of the unstable operation of the drip irrigation system in an intelligent irrigation system, this paper proposes chaotic beetle swarm optimization (CBSO) based on the BAS (beetle antennae search) longicorn search algorithm, with inertial weights, variable learning factors, and logistic chaos initialization improving global search capabilities. This was accomplished by formulating the optimization objective, which involved integrating the control input’s time integral term, the square term, and the absolute value of the error. Subsequently, PID parameter tuning was performed. In order to verify the actual effect of the CBSO algorithm on the PID drip irrigation control system, MATLAB was used to simulate and compare PID control optimized by the GA algorithm, PSO algorithm, and BSO (beetle search optimization) algorithm. The results show that PID control based on CBSO optimization has a short response time, small overshoot, and no oscillation in the steady state process. The performance of the controller is improved, which provides a basis for PID parameter setting for a drip irrigation control system. Full article

This paper presents a path-planning strategy for unmanned aerial vehicles (UAVs) in urban environments with a ground risk map. The aim is to generate a UAV path that minimizes the ground risk as well as the flying cost, enforcing safety and efficiency over inhabited areas. A quantitative model is proposed to evaluate the ground risk, which is then used as a risk constraint for UAV path optimization. Subsequently, beetle swarm optimization (BSO) is proposed based on a beetle antennae search (BAS) that considers turning angles and path length. In this proposed BSO, an adaptive step size for every beetle and a random proportionality coefficient mechanism are designed to improve the deficiencies of the local optimum and slow convergence. Furthermore, a global optimum attraction operator is established to share the social information in a swarm to lead to the global best position in the search space. Experiments were performed and compared with particle swarm optimization (PSO), genetic algorithm (GA), firefly algorithm (FA), and BAS. This case study shows that the proposed BSO works well with different swarm sizes, beetle dimensions, and iterations. It outperforms the aforementioned methods not only in terms of efficiency but also in terms of accuracy. The simulation results confirm the suitability of the proposed BSO approach. Full article

In complex environments, path planning for mobile robots faces challenges such as insensitivity to the environment, low efficiency, and poor path quality with the rapidly-exploring random tree (RRT) algorithm. We propose a novel algorithm, the complex environments rapidly-exploring random tree (CERRT), to address these issues. The CERRT algorithm builds upon the RRT approach and incorporates two key components: a pre-allocated extension node method and a vertex death mechanism. These enhancements aim to improve vertex utilization and overcome the problem of becoming trapped in concave regions, a limitation of traditional algorithms. Additionally, the CERRT algorithm integrates environment awareness at collision points, enabling rapid identification and navigation through narrow passages using local simple sampling techniques. We also introduce the bidirectional shrinking optimization strategy (BSOS) based on the pruning optimization strategy (POS) to further enhance the quality of path solutions. Extensive simulations demonstrate that the CERRT algorithm outperforms the RRT and RRV algorithms in various complex environments, such as mazes and narrow passages. It exhibits shorter running times and generates higher-quality paths, making it a promising approach for mobile robot path planning in challenging environments. Full article

Due to the inappropriate or untimely distribution of post-disaster goods, many regions did not receive timely and efficient relief for infected people in the coronavirus disease outbreak that began in 2019. This study develops a model for the emergency relief routing problem (ERRP) to distribute post-disaster relief more reasonably. Unlike general route optimizations, patients’ suffering is taken into account in the model, allowing patients in more urgent situations to receive relief operations first. A new metaheuristic algorithm, the hybrid brain storm optimization (HBSO) algorithm, is proposed to deal with the model. The hybrid algorithm adds the ideas of the simulated annealing (SA) algorithm and large neighborhood search (LNS) algorithm into the BSO algorithm, improving its ability to escape from the local optimum trap and speeding up the convergence. In simulation experiments, the BSO algorithm, BSO+LNS algorithm (combining the BSO with the LNS), and HBSO algorithm (combining the BSO with the LNS and SA) are compared. The results of simulation experiments show the following: (1) The HBSO algorithm outperforms its rivals, obtaining a smaller total cost and providing a more stable ability to discover the best solution for the ERRP; (2) the ERRP model can greatly reduce the level of patient suffering and can prioritize patients in more urgent situations. Full article