Economic Power Dispatching from Distributed Generations: Review of Optimization Techniques

In the increasingly decentralized energy environment,economical power dispatching from distributed generations(DGs)is crucial to minimizing operating costs,optimizing resource utilization,and guaranteeing a consistent and sustainable supply of electricity.A comprehensive review of optimization techniques for economic power dispatching from distributed generations is imperative to identify the most effective strategies for minimizing operational costs while maintaining grid stability and sustainability.The choice of optimization technique for economic power dispatching from DGs depends on a number of factors,such as the size and complexity of the power system,the availability of computational resources,and the specific requirements of the application.Optimization techniques for economic power dispatching from distributed generations(DGs)can be classified into two main categories:(i)Classical optimization techniques,(ii)Heuristic optimization techniques.In classical optimization techniques,the linear programming(LP)model is one of the most popular optimization methods.Utilizing the LP model,power demand and network constraints are met while minimizing the overall cost of generating electricity from DGs.This approach is efficient in determining the best DGs dispatch and is capable of handling challenging optimization issues in the large-scale system including renewables.The quadratic programming(QP)model,a classical optimization technique,is a further popular optimization method,to consider non-linearity.The QP model can take into account the quadratic cost of energy production,with consideration constraints like network capacity,voltage,and frequency.The metaheuristic optimization techniques are also used for economic power dispatching from DGs,which include genetic algorithms(GA),particle swarm optimization(PSO),and ant colony optimization(ACO).Also,Some researchers are developing hybrid optimization techniques that combine elements of classical and heuristic optimization techniques with the incorporation of droop control,predictive control,and fuzzy-based methods.These methods can deal with large-scale systems with many objectives and non-linear,non-convex optimization issues.The most popular approaches are the LP and QP models,while more difficult problems are handled using metaheuristic optimization techniques.In summary,in order to increase efficiency,reduce costs,and ensure a consistent supply of electricity,optimization techniques are essential tools used in economic power dispatching from DGs.

Optimization Techniques for GPU-Based Parallel Programming Models in High-Performance Computing

This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from graphic-centric processors to versatile computing units,it delves into the nuanced optimization of memory access,thread management,algorithmic design,and data structures.These optimizations are critical for exploiting the parallel processing capabilities of GPUs,addressingboth the theoretical frameworks and practical implementations.By integrating advanced strategies such as memory coalescing,dynamic scheduling,and parallel algorithmic transformations,this research aims to significantly elevate computational efficiency and throughput.The findings underscore the potential of optimized GPU programming to revolutionize computational tasks across various domains,highlighting a pathway towards achieving unparalleled processing power and efficiency in HPC environments.The paper not only contributes to the academic discourse on GPU optimization but also provides actionable insights for developers,fostering advancements in computational sciences and technology.

Analysis of TOPSIS techniques based on bipolar complex fuzzy N-soft setting and their applications in decision-making problems

A novel model termed a bipolar complex fuzzy N-soft set(BCFN-SS)is initiated for tackling information that involves positive and negative aspects,the second dimension,and parameterised grading simultaneously.The theory of BCFN-SS is the generalisation of two various theories,that is,bipolar complex fuzzy(BCF)and N-SS.The invented model of BCFN-SS helps decision-makers to cope with the genuine-life dilemmas containing BCF information along with parameterised grading at the same time.Further,various algebraic operations,including the usual type of union,intersection,complements,and a few others types,are invented.Certain primary operational laws for BCFNSS are also invented.Moreover,a technique for order preference by similarity to the ideal solution(TOPSIS)approach is devised in the setting of BCFN-SS for managing strategic decision-making(DM)dilemmas containing BCFN-SS information.Keeping in mind the usefulness and benefits of the TOPSIS approach,two various types of TOPSIS approaches in the environment of BCFN-SS are devised and then a numerical example for exposing the usefulness of the devised TOPSIS approach is interpreted.To disclose the prominence and benefits of the devised work,the devised approaches with numerous prevailing work are compared.

Modified Black Widow Optimization-Based Enhanced Threshold Energy Detection Technique for Spectrum Sensing in Cognitive Radio Networks

This study develops an Enhanced Threshold Based Energy Detection approach(ETBED)for spectrum sensing in a cognitive radio network.The threshold identification method is implemented in the received signal at the secondary user based on the square law.The proposed method is implemented with the signal transmission of multiple outputs-orthogonal frequency division multiplexing.Additionally,the proposed method is considered the dynamic detection threshold adjustments and energy identification spectrum sensing technique in cognitive radio systems.In the dynamic threshold,the signal ratio-based threshold is fixed.The threshold is computed by considering the Modified Black Widow Optimization Algorithm(MBWO).So,the proposed methodology is a combination of dynamic threshold detection and MBWO.The general threshold-based detection technique has different limitations such as the inability optimal signal threshold for determining the presence of the primary user signal.These limitations undermine the sensing accuracy of the energy identification technique.Hence,the ETBED technique is developed to enhance the energy efficiency of cognitive radio networks.The projected approach is executed and analyzed with performance and comparison analysis.The proposed method is contrasted with the conventional techniques of theWhale Optimization Algorithm(WOA)and GreyWolf Optimization(GWO).It indicated superior results,achieving a high average throughput of 2.2 Mbps and an energy efficiency of 3.8,outperforming conventional techniques.

Optimal Placement and Sizing of Distributed Generations for Power Losses Minimization Using PSO-Based Deep Learning Techniques

The integration of distributed generations (DGs) into distribution systems (DSs) is increasingly becoming a solution for compensating for isolated local energy systems (ILESs). Additionally, distributed generations are used for self-consumption with excess energy injected into centralized grids (CGs). However, the improper sizing of renewable energy systems (RESs) exposes the entire system to power losses. This work presents an optimization of a system consisting of distributed generations. Firstly, PSO algorithms evaluate the size of the entire system on the IEEE bus 14 test standard. Secondly, the size of the system is allocated using improved Particles Swarm Optimization (IPSO). The convergence speed of the objective function enables a conjecture to be made about the robustness of the proposed system. The power and voltage profile on the IEEE 14-bus standard displays a decrease in power losses and an appropriate response to energy demands (EDs), validating the proposed method.

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.

APPROXIMATION TECHNIQUES FOR APPLICATION OF GENETIC ALGORITHMS TO STRUCTURAL OPTIMIZATION

Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex structural optimization problems, if the structural reanalysis technique is not adopted, the more the number of finite element analysis (FEA) is, the more the consuming time is. In the conventional structural optimization the number of FEA can be reduced by the structural reanalysis technique based on the approximation techniques and sensitivity analysis. With these techniques, this paper provides a new approximation model-segment approximation model, adopted for the GA application. This segment approximation model can decrease the number of FEA and increase the convergence rate of GA. So it can apparently decrease the computation time of GA. Two examples demonstrate the availability of the new segment approximation model.

Application of several optimization techniques for estimating TBM advance rate in granitic rocks

This study aims to develop several optimization techniques for predicting advance rate of tunnel boring machine(TBM)in different weathered zones of granite.For this purpose,extensive field and laboratory studies have been conducted along the 12,649 m of the Pahang-Selangor raw water transfer tunnel in Malaysia.Rock properties consisting of uniaxial compressive strength(UCS),Brazilian tensile strength(BTS),rock mass rating(RMR),rock quality designation(RQD),quartz content(q)and weathered zone as well as machine specifications including thrust force and revolution per minute(RPM)were measured to establish comprehensive datasets for optimization.Accordingly,to estimate the advance rate of TBM,two new hybrid optimization techniques,i.e.an artificial neural network(ANN)combined with both imperialist competitive algorithm(ICA)and particle swarm optimization(PSO),were developed for mechanical tunneling in granitic rocks.Further,the new hybrid optimization techniques were compared and the best one was chosen among them to be used for practice.To evaluate the accuracy of the proposed models for both testing and training datasets,various statistical indices including coefficient of determination(R^2),root mean square error(RMSE)and variance account for(VAF)were utilized herein.The values of R^2,RMSE,and VAF ranged in 0.939-0.961,0.022-0.036,and 93.899-96.145,respectively,with the PSO-ANN hybrid technique demonstrating the best performance.It is concluded that both the optimization techniques,i.e.PSO-ANN and ICA-ANN,could be utilized for predicting the advance rate of TBMs;however,the PSO-ANN technique is superior.

Recent advances in cobalt phosphide-based materials for electrocatalytic water splitting:From catalytic mechanism and synthesis method to optimization design

Electrochemical water splitting has long been considered an effective energy conversion technology for trans-ferring intermittent renewable electricity into hydrogen fuel,and the exploration of cost-effective and high-performance electrocatalysts is crucial in making electrolyzed water technology commercially viable.Cobalt phosphide(Co-P)has emerged as a catalyst of high potential owing to its high catalytic activity and durability in water splitting.This paper systematically reviews the latest advances in the development of Co-P-based materials for use in water splitting.The essential effects of P in enhancing the catalytic performance of the hydrogen evolution reaction and oxygen evolution reaction are first outlined.Then,versatile synthesis techniques for Co-P electrocatalysts are summarized,followed by advanced strategies to enhance the electrocatalytic performance of Co-P materials,including heteroatom doping,composite construction,integration with well-conductive sub-strates,and structure control from the viewpoint of experiment.Along with these optimization strategies,the understanding of the inherent mechanism of enhanced catalytic performance is also discussed.Finally,some existing challenges in the development of highly active and stable Co-P-based materials are clarified,and pro-spective directions for prompting the wide commercialization of water electrolysis technology are proposed.

Multi-target Collaborative Combat Decision-Making by Improved Particle Swarm Optimizer

A decision-making problem of missile-target assignment with a novel particle swarm optimization algorithm is proposed when it comes to a multiple target collaborative combat situation.The threat function is established to describe air combat situation.Optimization function is used to find an optimal missile-target assignment.An improved particle swarm optimization algorithm is utilized to figure out the optimization function with less parameters,which is based on the adaptive random learning approach.According to the coordinated attack tactics,there are some adjustments to the assignment.Simulation example results show that it is an effective algorithm to handle with the decision-making problem of the missile-target assignment(MTA)in air combat.

Multi-objective optimization and evaluation of supercritical CO_(2) Brayton cycle for nuclear power generation

The supercritical CO_(2) Brayton cycle is considered a promising energy conversion system for Generation IV reactors for its simple layout,compact structure,and high cycle efficiency.Mathematical models of four Brayton cycle layouts are developed in this study for different reactors to reduce the cost and increase the thermohydraulic performance of nuclear power generation to promote the commercialization of nuclear energy.Parametric analysis,multi-objective optimizations,and four decision-making methods are applied to obtain each Brayton scheme’s optimal thermohydraulic and economic indexes.Results show that for the same design thermal power scale of reactors,the higher the core’s exit temperature,the better the Brayton cycle’s thermo-economic performance.Among the four-cycle layouts,the recompression cycle(RC)has the best overall performance,followed by the simple recuperation cycle(SR)and the intercooling cycle(IC),and the worst is the reheating cycle(RH).However,RH has the lowest total cost of investment(C_(tot))of$1619.85 million,and IC has the lowest levelized cost of energy(LCOE)of 0.012$/(kWh).The nuclear Brayton cycle system’s overall performance has been improved due to optimization.The performance of the molten salt reactor combined with the intercooling cycle(MSR-IC)scheme has the greatest improvement,with the net output power(W_(net)),thermal efficiencyη_(t),and exergy efficiency(η_(e))improved by 8.58%,8.58%,and 11.21%,respectively.The performance of the lead-cooled fast reactor combined with the simple recuperation cycle scheme was optimized to increase C_(tot) by 27.78%.In comparison,the internal rate of return(IRR)increased by only 7.8%,which is not friendly to investors with limited funds.For the nuclear Brayton cycle,the molten salt reactor combined with the recompression cycle scheme should receive priority,and the gas-cooled fast reactor combined with the reheating cycle scheme should be considered carefully.

Enhanced Cuckoo Search Optimization Technique for Skin Cancer Diagnosis Application

Skin cancer segmentation is a critical task in a clinical decision support system for skin cancer detection.The suggested enhanced cuckoo search based optimization model will be used to evaluate several metrics in the skin cancer pic-ture segmentation process.Because time and resources are always limited,the proposed enhanced cuckoo search optimization algorithm is one of the most effec-tive strategies for dealing with global optimization difficulties.One of the most significant requirements is to design optimal solutions to optimize their use.There is no particular technique that can answer all optimization issues.The proposed enhanced cuckoo search optimization method indicates a constructive precision for skin cancer over with all image segmentation in computerized diagnosis.The accuracy of the proposed enhanced cuckoo search based optimization for melanoma has increased with a 23%to 29%improvement than other optimization algorithm.The total sensitivity and specificity attained in the proposed system are 99.56%and 99.73%respectively.The proposed method outperforms by offering accuracy of 99.26%in comparisons to other conventional methods.The proposed enhanced optimization technique achieved 98.75%,98.96%for Dice and Jaccard coefficient.The model trained using the suggested measure outperforms those trained using the conventional method in the segmentation of skin cancer picture data.

Applying Analytical Derivative and Sparse Matrix Techniques to Large-Scale Process Optimization Problems

The performance of analytical derivative and sparse matrix techniques applied to a traditional dense sequential quadratic programming (SQP) is studied, and the strategy utilizing those techniques is also presented.Computational results on two typical chemical optimization problems demonstrate significant enhancement in efficiency, which shows this strategy is promising and suitable for large-scale process optimization problems.

Optimal Selection of Hybrid Renewable Energy System Using Multi-Criteria Decision-Making Algorithms

Several models of multi-criteria decision-making(MCDM)have identified the optimal alternative electrical energy sources to supply certain load in an isolated region in Al-Minya City,Egypt.The load demand consists of water pumping system with a water desalination unit.Various options containing three different power sources:only DG,PV-B system,and hybrid PV-DG-B,two different sizes of reverse osmosis(RO)units;RO-250 and RO-500,two strategies of energy management;load following(LF)and cycle charging(CC),and two sizes of DG;5 and 10 kW were taken into account.Eight attributes,including operating cost,renewable fraction,initial cost,the cost of energy,excess energy,unmet load,breakeven grid extension distance,and the amount of CO_(2),were used during the evaluation process.To estimate these parameters,HOMER®software was employed to perform both the simulation and optimization process.Four different weight estimation methods were considered;no priority of criteria,based on a pairwise comparisons matrix of the criteria,CRITIC-method,and entropy-based method.The main findings(output results)confirmed that the optimal option for the case study was hybrid PV-DG-B with the following specification:5 kW DG,RO-500,and load following control strategy.Under this condition,the annual operating cost and initial costs were$5546 and$161022,respectively,whereas the cost of energy was 0.077$/kWh.The excess energy and unmet loads were 40998 and 2371 kWh,respectively.The breakeven grid extension distance and the amount of CO_(2) were 3.31 km and 5171 kg per year,respectively.Compared with DG only,the amount of CO_(2) has been sharply reduced by 113939 kg per year.

An Adaptive Hybrid Optimization Strategy for Resource Allocation in Network Function Virtualization

With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both localand global allocation of resources in data centers.Hence,we propose an adaptive hybrid optimization strategy thatcombines dynamic programming and neural networks to improve resource utilization and service quality in datacenters.Our approach encompasses a service function chain simulation generator,a parallel architecture servicesystem,a dynamic programming strategy formaximizing the utilization of local server resources,a neural networkfor predicting the global utilization rate of resources and a global resource optimization strategy for bottleneck andredundant resources.With the implementation of our local and global resource allocation strategies,the systemperformance is significantly optimized through simulation.

Advanced Optimized Anomaly Detection System for IoT Cyberattacks Using Artificial Intelligence

While emerging technologies such as the Internet of Things(IoT)have many benefits,they also pose considerable security challenges that require innovative solutions,including those based on artificial intelligence(AI),given that these techniques are increasingly being used by malicious actors to compromise IoT systems.Although an ample body of research focusing on conventional AI methods exists,there is a paucity of studies related to advanced statistical and optimization approaches aimed at enhancing security measures.To contribute to this nascent research stream,a novel AI-driven security system denoted as“AI2AI”is presented in this work.AI2AI employs AI techniques to enhance the performance and optimize security mechanisms within the IoT framework.We also introduce the Genetic Algorithm Anomaly Detection and Prevention Deep Neural Networks(GAADPSDNN)sys-tem that can be implemented to effectively identify,detect,and prevent cyberattacks targeting IoT devices.Notably,this system demonstrates adaptability to both federated and centralized learning environments,accommodating a wide array of IoT devices.Our evaluation of the GAADPSDNN system using the recently complied WUSTL-IIoT and Edge-IIoT datasets underscores its efficacy.Achieving an impressive overall accuracy of 98.18%on the Edge-IIoT dataset,the GAADPSDNN outperforms the standard deep neural network(DNN)classifier with 94.11%accuracy.Furthermore,with the proposed enhancements,the accuracy of the unoptimized random forest classifier(80.89%)is improved to 93.51%,while the overall accuracy(98.18%)surpasses the results(93.91%,94.67%,94.94%,and 94.96%)achieved when alternative systems based on diverse optimization techniques and the same dataset are employed.The proposed optimization techniques increase the effectiveness of the anomaly detection system by efficiently achieving high accuracy and reducing the computational load on IoT devices through the adaptive selection of active features.

Prediction of high-embankment settlement combining joint denoising technique and enhanced GWO-v-SVR method

Reliable long-term settlement prediction of a high embankment relates to mountain infrastructure safety.This study developed a novel hybrid model(NHM)that combines a joint denoising technique with an enhanced gray wolf optimizer(EGWO)-n-support vector regression(n-SVR)method.High-embankment field measurements were preprocessed using the joint denoising technique,which in-cludes complete ensemble empirical mode decomposition,singular value decomposition,and wavelet packet transform.Furthermore,high-embankment settlements were predicted using the EGWO-n-SVR method.In this method,the standard gray wolf optimizer(GWO)was improved to obtain the EGWO to better tune the n-SVR model hyperparameters.The proposed NHM was then tested in two case studies.Finally,the influences of the data division ratio and kernel function on the EGWO-n-SVR forecasting performance and prediction efficiency were investigated.The results indicate that the NHM suppresses noise and restores details in high-embankment field measurements.Simultaneously,the NHM out-performs other alternative prediction methods in prediction accuracy and robustness.This demonstrates that the proposed NHM is effective in predicting high-embankment settlements with noisy field mea-surements.Moreover,the appropriate data division ratio and kernel function for EGWO-n-SVR are 7:3 and radial basis function,respectively.

An Opposition-Based Learning-Based Search Mechanism for Flying Foxes Optimization Algorithm

The flying foxes optimization(FFO)algorithm,as a newly introduced metaheuristic algorithm,is inspired by the survival tactics of flying foxes in heat wave environments.FFO preferentially selects the best-performing individuals.This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area.To address this issue,the paper introduces an opposition-based learning-based search mechanism for FFO algorithm(IFFO).Firstly,this paper introduces niching techniques to improve the survival list method,which not only focuses on the adaptability of individuals but also considers the population’s crowding degree to enhance the global search capability.Secondly,an initialization strategy of opposition-based learning is used to perturb the initial population and elevate its quality.Finally,to verify the superiority of the improved search mechanism,IFFO,FFO and the cutting-edge metaheuristic algorithms are compared and analyzed using a set of test functions.The results prove that compared with other algorithms,IFFO is characterized by its rapid convergence,precise results and robust stability.

The Research on and Application of the Multi-regression Technique in the Course of the Marketing Decision-making of Enterprises

The reformation of the economy system has led the f un ctional department and status of the enterprises into a variable state. Under th e condition of the market economy, the kernel of the enterprises’ functional dep artment has diverted to that of marketing decision-making, which face to market and meet with the need of consumption. Assuredly, the kernel of marketing decis ion-making is to prognosticate the future market demand of the production of en terprises accurately, so that it can ensure and realize the maximum of the enter prises’ profit increase. Using empirical research and the multi-regression technique, this paper ana lyzes the enterprises’ production demand forecast of the GMC (Global Management Challenge, held every year globally) and changes most of uncontrollable factors of demand forecast to the controllable ones of the enterprises. The method we us ed to forecast demand by using the multi-regression technique is as follows: 1. Look for the main factors which influence the demand of productions; 2. Establish the regression model; 3. Using the historical data, find the resolution of the correlative index an d do the prominent test; 4. Analyze and compare, regression, adjust parameter and optimize the regress ion model. Our method will make the forecast data closer to the actual prices of the future market requirement quantity in the production marketing decision-making of the enterprises and realize the optimizing combination and the working object w ith the minimum of the cost and the maximum of the profit. And it can ensure the realization of the equity maximum of the enterprises and increase the lifecycle of the production.

Feasibility-Guided Constraint-Handling Techniques for Engineering Optimization Problems

The particle swarm optimization(PSO)algorithm is an established nature-inspired population-based meta-heuristic that replicates the synchronizing movements of birds and sh.PSO is essentially an unconstrained algorithm and requires constraint handling techniques(CHTs)to solve constrained optimization problems(COPs).For this purpose,we integrate two CHTs,the superiority of feasibility(SF)and the violation constraint-handling(VCH),with a PSO.These CHTs distinguish feasible solutions from infeasible ones.Moreover,in SF,the selection of infeasible solutions is based on their degree of constraint violations,whereas in VCH,the number of constraint violations by an infeasible solution is of more importance.Therefore,a PSO is adapted for constrained optimization,yielding two constrained variants,denoted SF-PSO and VCH-PSO.Both SF-PSO and VCH-PSO are evaluated with respect to ve engineering problems:the Himmelblau’s nonlinear optimization,the welded beam design,the spring design,the pressure vessel design,and the three-bar truss design.The simulation results show that both algorithms are consistent in terms of their solutions to these problems,including their different available versions.Comparison of the SF-PSO and the VCHPSO with other existing algorithms on the tested problems shows that the proposed algorithms have lower computational cost in terms of the number of function evaluations used.We also report our disagreement with some unjust comparisons made by other researchers regarding the tested problems and their different variants.