Enhancing Renewable Energy Integration:A Gaussian-Bare-Bones Levy Cheetah Optimization Approach to Optimal Power Flow in Electrical Networks

In the contemporary era,the global expansion of electrical grids is propelled by various renewable energy sources(RESs).Efficient integration of stochastic RESs and optimal power flow(OPF)management are critical for network optimization.This study introduces an innovative solution,the Gaussian Bare-Bones Levy Cheetah Optimizer(GBBLCO),addressing OPF challenges in power generation systems with stochastic RESs.The primary objective is to minimize the total operating costs of RESs,considering four functions:overall operating costs,voltage deviation management,emissions reduction,voltage stability index(VSI)and power loss mitigation.Additionally,a carbon tax is included in the objective function to reduce carbon emissions.Thorough scrutiny,using modified IEEE 30-bus and IEEE 118-bus systems,validates GBBLCO’s superior performance in achieving optimal solutions.Simulation results demonstrate GBBLCO’s efficacy in six optimization scenarios:total cost with valve point effects,total cost with emission and carbon tax,total cost with prohibited operating zones,active power loss optimization,voltage deviation optimization and enhancing voltage stability index(VSI).GBBLCO outperforms conventional techniques in each scenario,showcasing rapid convergence and superior solution quality.Notably,GBBLCO navigates complexities introduced by valve point effects,adapts to environmental constraints,optimizes costs while considering prohibited operating zones,minimizes active power losses,and optimizes voltage deviation by enhancing the voltage stability index(VSI)effectively.This research significantly contributes to advancing OPF,emphasizing GBBLCO’s improved global search capabilities and ability to address challenges related to local minima.GBBLCO emerges as a versatile and robust optimization tool for diverse challenges in power systems,offering a promising solution for the evolving needs of renewable energy-integrated power grids.

Machine Learning Enabled Novel Real-Time IoT Targeted DoS/DDoS Cyber Attack Detection System

The increasing prevalence of Internet of Things(IoT)devices has introduced a new phase of connectivity in recent years and,concurrently,has opened the floodgates for growing cyber threats.Among the myriad of potential attacks,Denial of Service(DoS)attacks and Distributed Denial of Service(DDoS)attacks remain a dominant concern due to their capability to render services inoperable by overwhelming systems with an influx of traffic.As IoT devices often lack the inherent security measures found in more mature computing platforms,the need for robust DoS/DDoS detection systems tailored to IoT is paramount for the sustainable development of every domain that IoT serves.In this study,we investigate the effectiveness of three machine learning(ML)algorithms:extreme gradient boosting(XGB),multilayer perceptron(MLP)and random forest(RF),for the detection of IoTtargeted DoS/DDoS attacks and three feature engineering methods that have not been used in the existing stateof-the-art,and then employed the best performing algorithm to design a prototype of a novel real-time system towards detection of such DoS/DDoS attacks.The CICIoT2023 dataset was derived from the latest real-world IoT traffic,incorporates both benign and malicious network traffic patterns and after data preprocessing and feature engineering,the data was fed into our models for both training and validation,where findings suggest that while all threemodels exhibit commendable accuracy in detectingDoS/DDoS attacks,the use of particle swarmoptimization(PSO)for feature selection has made great improvements in the performance(accuracy,precsion recall and F1-score of 99.93%for XGB)of the ML models and their execution time(491.023 sceonds for XGB)compared to recursive feature elimination(RFE)and randomforest feature importance(RFI)methods.The proposed real-time system for DoS/DDoS attack detection entails the implementation of an platform capable of effectively processing and analyzing network traffic in real-time.This involvesemploying the best-performing ML algorithmfor detection and the integration of warning mechanisms.We believe this approach will significantly enhance the field of security research and continue to refine it based on future insights and developments.

A New Hybrid Method for Constrained Global Optimization

By combining properly the simulated annealing algorithm and the nonlinear programming neural network, a new hybrid method for comtrained global optimization is proposed in this paper. To maintain the applicability of the simulated annealing algorithm used in the hybrid method as general as possible, the nonlinear programming neural network is employed at each iteration to find only a feasible solution to the original constrained problem rather than a local optimal solution. Such a feasible solution is obtained by solving an auxiliary optimization problem with a new objective function. The computational results for two numerical examples indicate that the proposed hybrid method for constrained global optimization is not only highly reliable but also much more effcient than the simulated annealing algorithm using the penalty function method to deal with the constraints.

Node deployment strategy optimization for wireless sensor network with mobile base station

The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.

Optimization of clay material mixture ratio and filling process in gypsum mine goaf

Because there is neither waste rock nor mill tailings in the gypsum mine, and the buildings on the goaf of gypsum mine are needed to be protected, the research proposed the scheme of the clay filling technology. Gypsum, cement, lime and water glass were used as adhesive, and the strength of different material ratios were investigated in this study. The influence factors of clay strength were obtained in the order of cement, gypsum, water glass and lime. The results show that the cement content is the determinant influence factor, and gypsum has positive effects, while the water glass can enhance both clay strength and the fluidity of the filing slurry. Furthermore, combining chaotic optimization method with neural network, the optimal ratio of composite cementing agent was obtained. The results show that the optimal ratio of water glass, cement, lime and clay (in quality) is 1.17:6.74:4.17:87.92 in the process of bottom self-flow filling, while the optimal ratio is 1.78:9.58:4.71:83.93 for roof-contacted filling. A novel filling process to fill in gypsum mine goaf with clay is established. The engineering practice shows that the filling cost is low, thus, notable economic benefit is achieved.

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm

Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.

Self-Organized Optimization of Transport on Complex Networks

We propose a self-organized optimization mechanism to improve the transport capacity of complex gradient networks. We find that, regardless of network topology, the congestion pressure can be strongly reduced by the self-organized optimization mechanism. Furthermore, the random scale-free topology is more efficient to reduce congestion compared with the random Poisson topology under the optimization mechanism. The reason is that the optimization mechanism introduces the correlations between the gradient field and the local topology of the substrate network. Due to the correlations, the cutoff degree of the gradient network is strongly reduced and the number of the nodes exerting their maximal transport capacity consumedly increases. Our work presents evidence supporting the idea that scale-free networks can efficiently improve their transport capacity by self- organized mechanism under gradient-driven transport mode.

Integration strategies of hydrogen network in a refinery based on operational optimization of hydrotreating units

Inferior crude oil and fuel oil upgrading lead to escalating increase of hydrogen consumption in refineries.It is imperative to reduce the hydrogen consumption for energy-saving operations of refineries.An integration strategy of hydrogen network and an operational optimization model of hydrotreating(HDT)units are proposed based on the characteristics of reaction kinetics of HDT units.By solving the proposed model,the operating conditions of HDT units are optimized,and the parameters of hydrogen sinks are determined by coupling hydrodesulfurization(HDS),hydrodenitrification(HDN)and aromatic hydrogenation(HDA)kinetics.An example case of a refinery with annual processing capacity of eight million tons is adopted to demonstrate the feasibility of the proposed optimization strategies and the model.Results show that HDS,HDN and HDA reactions are the major source of hydrogen consumption in the refinery.The total hydrogen consumption can be reduced by 18.9%by applying conventional hydrogen network optimization model.When the hydrogen network is optimized after the operational optimization of HDT units is performed,the hydrogen consumption is reduced by28.2%.When the benefit of the fuel gas recovery is further considered,the total annual cost of hydrogen network can be reduced by 3.21×10~7CNY·a^(-1),decreased by 11.9%.Therefore,the operational optimization of the HDT units in refineries should be imposed to determine the parameters of hydrogen sinks base on the characteristics of reaction kinetics of the hydrogenation processes before the optimization of the hydrogen network is performed through the source-sink matching methods.

Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System

The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.

Optimization of press bend forming path of aircraft integral panel

In order to design the press bend forming path of aircraft integral panels,a novel optimization method was proposed, which integrates FEM equivalent model based on previous study,the artificial neural network response surface,and the genetic algorithm.First,a multi-step press bend forming FEM equivalent model was established,with which the FEM experiments designed with Taguchi method were performed.Then,the BP neural network response surface was developed with the sample data from the FEM experiments.Furthermore,genetic algorithm was applied with the neural network response surface as the objective function. Finally,verification was carried out on a simple curvature grid-type stiffened panel.The forming error of the panel formed with the optimal path is only 0.098 39 and the calculating efficiency has been improved by 77%.Therefore,this novel optimization method is quite efficient and indispensable for the press bend forming path designing.

Distributed Chunk-Based Optimization for MultiCarrier Ultra-Dense Networks

In this paper,a distributed chunkbased optimization algorithm is proposed for the resource allocation in broadband ultra-dense small cell networks.Based on the proposed algorithm,the power and subcarrier allocation problems are jointly optimized.In order to make the resource allocation suitable for large scale networks,the optimization problem is decomposed first based on an effective decomposition algorithm named optimal condition decomposition(OCD) algorithm.Furthermore,aiming at reducing implementation complexity,the subcarriers are divided into chunks and are allocated chunk by chunk.The simulation results show that the proposed algorithm achieves more superior performance than uniform power allocation scheme and Lagrange relaxation method,and then the proposed algorithm can strike a balance between the complexity and performance of the multi-carrier Ultra-Dense Networks.

Optimization of a crude distillation unit using a combination of wavelet neural network and line-up competition algorithm

The modeling and optimization of an industrial-scale crude distillation unit （CDU） are addressed. The main spec- ifications and base conditions of CDU are taken from a crude oil refinery in Wuhan, China. For modeling of a com- plicated CDU, an improved wavelet neural network （WNN） is presented to model the complicated CDU, in which novel parametric updating laws are developed to precisely capture the characteristics of CDU. To address CDU in an economically optimal manner, an economic optimization algorithm under prescribed constraints is presented. By using a combination of WNN-based optimization model and line-up competition algorithm （LCA）, the supe- rior performance of the proposed approach is verified. Compared with the base operating condition, it is validat- ed that the increments of products including kerosene and diesel are up to 20% at least by increasing less than 5% duties of intermediate coolers such as second pump-around （PA2） and third Dump-around （PA3）.

Optimization of hydrogen networks with multiple impurities and impurity removal

To explore the effect of removing different impurities to hydrogen networks, an MINLP model is proposed with all matching possibilities and the trade-off between operation cost and capital cost is considered. Furthermore,the impurity remover, hydrogen distribution, compressor and pipe setting are included in the model. Based on this model, the impurity and source(s) that are in higher priority for impurity removal, the optimal targeted concentration, and the hydrogen network with the minimum annual cost can be identified. The efficiency of the proposed model is verified by a case study.

Simultaneous hybrid modeling of a nosiheptide fermentation process using particle swarm optimization

Hybrid modeling approaches have recently been investigated as an attractive alternative to model fermentation processes. Normally, these approaches require estimation data to train the empirical model part of a hybrid model. This may result in decreasing the generalization ability of the derived hybrid model. Therefore, a simultaneous hybrid modeling approach is presented in this paper. It transforms the training of the empirical model part into a dynamic system parameter identification problem, and thus allows training the empirical model part with only measured data. An adaptive escaping particle swarm optimization(AEPSO) algorithm with escaping and adaptive inertia weight adjustment strategies is constructed to solve the resulting parameter identification problem, and thereby accomplish the training of the empirical model part. The uniform design method is used to determine the empirical model structure. The proposed simultaneous hybrid modeling approach has been used in a lab-scale nosiheptide batch fermentation process. The results show that it is effective and leads to a more consistent model with better generalization ability when compared to existing ones. The performance of AEPSO is also demonstrated.

Particle swarm optimization and its application to seismic inversion of igneous rocks

In order to improve the fine structure inversion ability of igneous rocks for the exploration of underlying strata, based on particle swarm optimization(PSO), we have developed a method for seismic wave impedance inversion. Through numerical simulation, we tested the effects of different algorithm parameters and different model parameterization methods on PSO wave impedance inversion, and analyzed the characteristics of PSO method. Under the conclusions drawn from numerical simulation, we propose the scheme of combining a cross-moving strategy based on a divided block model and high-frequency filtering technology for PSO inversion. By analyzing the inversion results of a wedge model of a pitchout coal seam and a coal coking model with igneous rock intrusion, we discuss the vertical and horizontal resolution, stability and reliability of PSO inversion. Based on the actual seismic and logging data from an igneous area, by taking a seismic profile through wells as an example, we discuss the characteristics of three inversion methods, including model-based wave impedance inversion, multi-attribute seismic inversion based on probabilistic neural network(PNN) and wave impedance inversion based on PSO.And we draw the conclusion that the inversion based on PSO method has a better result for this igneous area.

Efficient Virtual Network Embedding Algorithm Based on Restrictive Selection and Optimization Theory Approach

Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One main challenge in NV is virtual network embedding(VNE). VNE is a NPhard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.

Workload-aware request routing in cloud data center using software-defined networking

Large latency of applications will bring revenue loss to cloud infrastructure providers in the cloud data center. The existing controllers of software-defined networking architecture can fetch and process traffic information in the network. Therefore, the controllers can only optimize the network latency of applications. However, the serving latency of applications is also an important factor in delivered user-experience for arrival requests. Unintelligent request routing will cause large serving latency if arrival requests are allocated to overloaded virtual machines. To deal with the request routing problem, this paper proposes the workload-aware software-defined networking controller architecture. Then, request routing algorithms are proposed to minimize the total round trip time for every type of request by considering the congestion in the network and the workload in virtual machines（VMs）. This paper finally provides the evaluation of the proposed algorithms in a simulated prototype. The simulation results show that the proposed methodology is efficient compared with the existing approaches.

Optimization of PERT Network and Compression of Time

In the traditional methods of program evaluation and review technique （PERT） network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not considered as well as its time risk. The authors of this paper use the theory of dependent-chance programming to establish a new model about compression of time for project and multi-objective network optimization, which can overcome the shortages of traditional methods and realize the optimization of PERT network directly. By calculating an example with genetic algorithms, the following conclusions are drawn： （ 1 ） compression of time is restricted by cost ratio and completion probability of project; （2） activities with maximal standard difference of duration and minimal cost will be compressed in order of precedence; （3） there is no optimal solutions but noninferior solutions between chance and cost, and the most optimal node time depends on decision-maker＇s preference.

A New Searching Strategy for the Lost Plane Based on RBF Neural Network Model and Global Optimization Model

In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF neural network model, and then determine the searching area according to the trajectory. With the pass of time, the searching area will also be constantly moving along the trajectory. Model 2 develops a maritime search plan to achieve the purpose of completing the search in the shortest time. We optimize the searching time and transform the problem into the 0-1 knapsack problem. Solving this problem by improved genetic algorithm, we can get the shortest searching time and the best choice for the search power.

3D Vehicle Detection Algorithm Based onMultimodal Decision-Level Fusion

3D vehicle detection based on LiDAR-camera fusion is becoming an emerging research topic in autonomous driving.The algorithm based on the Camera-LiDAR object candidate fusion method(CLOCs)is currently considered to be a more effective decision-level fusion algorithm,but it does not fully utilize the extracted features of 3D and 2D.Therefore,we proposed a 3D vehicle detection algorithm based onmultimodal decision-level fusion.First,project the anchor point of the 3D detection bounding box into the 2D image,calculate the distance between 2D and 3D anchor points,and use this distance as a new fusion feature to enhance the feature redundancy of the network.Subsequently,add an attention module:squeeze-and-excitation networks,weight each feature channel to enhance the important features of the network,and suppress useless features.The experimental results show that the mean average precision of the algorithm in the KITTI dataset is 82.96%,which outperforms previous state-ofthe-art multimodal fusion-based methods,and the average accuracy in the Easy,Moderate and Hard evaluation indicators reaches 88.96%,82.60%,and 77.31%,respectively,which are higher compared to the original CLOCs model by 1.02%,2.29%,and 0.41%,respectively.Compared with the original CLOCs algorithm,our algorithm has higher accuracy and better performance in 3D vehicle detection.