The advent of microgrids in modern energy systems heralds a promising era of resilience,sustainability,and efficiency.Within the realm of grid-tied microgrids,the selection of an optimal optimization algorithm is crit...The advent of microgrids in modern energy systems heralds a promising era of resilience,sustainability,and efficiency.Within the realm of grid-tied microgrids,the selection of an optimal optimization algorithm is critical for effective energy management,particularly in economic dispatching.This study compares the performance of Particle Swarm Optimization(PSO)and Genetic Algorithms(GA)in microgrid energy management systems,implemented using MATLAB tools.Through a comprehensive review of the literature and sim-ulations conducted in MATLAB,the study analyzes performance metrics,convergence speed,and the overall efficacy of GA and PSO,with a focus on economic dispatching tasks.Notably,a significant distinction emerges between the cost curves generated by the two algo-rithms for microgrid operation,with the PSO algorithm consistently resulting in lower costs due to its effective economic dispatching capabilities.Specifically,the utilization of the PSO approach could potentially lead to substantial savings on the power bill,amounting to approximately$15.30 in this evaluation.Thefindings provide insights into the strengths and limitations of each algorithm within the complex dynamics of grid-tied microgrids,thereby assisting stakeholders and researchers in arriving at informed decisions.This study contributes to the discourse on sustainable energy management by offering actionable guidance for the advancement of grid-tied micro-grid technologies through MATLAB-implemented optimization algorithms.展开更多
The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally opti...The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally optimal solutions for various optimisation problems.Knowing the recent criticises of the originality of equations,the principle of BA is concise and easy to implement,and its mathematical structure can be seen as a hybrid particle swarm with simulated annealing.In this research,the authors focus on the performance optimisation of BA as a solver rather than discussing its originality issues.In terms of operation effect,BA has an acceptable convergence speed.However,due to the low proportion of time used to explore the search space,it is easy to converge prematurely and fall into the local optima.The authors propose an adaptive multi-stage bat algorithm(AMSBA).By tuning the algorithm's focus at three different stages of the search process,AMSBA can achieve a better balance between exploration and exploitation and improve its exploration ability by enhancing its performance in escaping local optima as well as maintaining a certain convergence speed.Therefore,AMSBA can achieve solutions with better quality.A convergence analysis was conducted to demonstrate the global convergence of AMSBA.The authors also perform simulation experiments on 30 benchmark functions from IEEE CEC 2017 as the objective functions and compare AMSBA with some original and improved swarm-based algorithms.The results verify the effectiveness and superiority of AMSBA.AMSBA is also compared with eight representative optimisation algorithms on 10 benchmark functions derived from IEEE CEC 2020,while this experiment is carried out on five different dimensions of the objective functions respectively.A balance and diversity analysis was performed on AMSBA to demonstrate its improvement over the original BA in terms of balance.AMSBA was also applied to the multi-threshold image segmentation of Citrus Macular disease,which is a bacterial infection that causes lesions on citrus trees.The segmentation results were analysed by comparing each comparative algorithm's peak signal-to-noise ratio,structural similarity index and feature similarity index.The results show that the proposed BA-based algorithm has apparent advantages,and it can effectively segment the disease spots from citrus leaves when the segmentation threshold is at a low level.Based on a comprehensive study,the authors think the proposed optimiser has mitigated the main drawbacks of the BA,and it can be utilised as an effective optimisation tool.展开更多
Finding an optimal isolator arrangement for asymmetric structures using traditional conceptual design methods that can significantly minimize torsional response while ensuring efficient horizontal seismic isolation is...Finding an optimal isolator arrangement for asymmetric structures using traditional conceptual design methods that can significantly minimize torsional response while ensuring efficient horizontal seismic isolation is cumbersome and inefficient.Thus,this work develops a multi-objective optimization method to enhance the torsional resistance of asymmetric base-isolated structures.The primary objective is to simultaneously minimize the interstory rotation of the superstructure,the rotation of the isolation layer,and the interstory displacement of the superstructure without exceeding the isolator displacement limits.A fast non-dominated sorting genetic algorithm(NSGA-Ⅱ)is employed to satisfy this optimization objective.Subsequently,the isolator arrangement,encompassing both positions and categories,is optimized according to this multi-objective optimization method.Additionally,an optimization design platform is developed to streamline the design operation.This platform integrates the input of optimization parameters,the output of optimization results,the finite element analysis,and the multi-objective optimization method proposed herein.Finally,the application of this multi-objective optimization method and its associated platform are demonstrated on two asymmetric base-isolated structures of varying heights and plan configurations.The results indicate that the optimal isolator arrangement derived from the optimization method can further improve the control over the lateral and torsional responses of asymmetric base-isolated structures compared to conventional conceptual design methods.Notably,the interstory rotation of the optimal base-isolated structure is significantly reduced,constituting only approximately 33.7%of that observed in the original base-isolated structure.The proposed platform facilitates the automatic generation of the optimal design scheme for the isolators of asymmetric base-isolated structures,offering valuable insights and guidance for the burgeoning field of intelligent civil engineering design.展开更多
Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device ...Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device energy utilization.To tackle these challenges,this study proposes an optimal scheduling model for energy storage power plants based on edge computing and the improved whale optimization algorithm(IWOA).The proposed model designs an edge computing framework,transferring a large share of data processing and storage tasks to the network edge.This architecture effectively reduces transmission costs by minimizing data travel time.In addition,the model considers demand response strategies and builds an objective function based on the minimization of the sum of electricity purchase cost and operation cost.The IWOA enhances the optimization process by utilizing adaptive weight adjustments and an optimal neighborhood perturbation strategy,preventing the algorithm from converging to suboptimal solutions.Experimental results demonstrate that the proposed scheduling model maximizes the flexibility of the energy storage plant,facilitating efficient charging and discharging.It successfully achieves peak shaving and valley filling for both electrical and heat loads,promoting the effective utilization of renewable energy sources.The edge-computing framework significantly reduces transmission delays between energy devices.Furthermore,IWOA outperforms traditional algorithms in optimizing the objective function.展开更多
The increase in bridge structure span and the complex stress characteristics directly affect the optimization of sensor placement,which in turn influences the data acquisition performance of the monitoring system.The ...The increase in bridge structure span and the complex stress characteristics directly affect the optimization of sensor placement,which in turn influences the data acquisition performance of the monitoring system.The key to the information acquisition of a bridge monitoring system is to obtain data that meets the health monitoring requirements of the bridge with a limited number of measurement points.To address this,a hybrid method based on multiple optimization criteria is proposed for optimal sensor placement(OSP).First,the minimum number of modes required for bridge monitoring is determined using the information entropy criterion(IE).Then,the number of measurement points is determined using a sequence method combined with the modal assurance criterion(MAC).Finally,the sensor placement is optimized using the generalized genetic algorithm(GGA)combined with double-structure encoding,and the optimization results are validated through finite element model analysis.The research results show that the hybrid method based on multiple optimization criteria can effectively determine the number of measurement points for bridge structures and optimize sensor placement,with a significant improvement in computational speed.展开更多
The Sine and Wormhole Energy Whale Optimization Algorithm(SWEWOA)represents an advanced solution method for resolving Optimal Power Flow(OPF)problems in power systems equipped with Flexible AC Transmission System(FACT...The Sine and Wormhole Energy Whale Optimization Algorithm(SWEWOA)represents an advanced solution method for resolving Optimal Power Flow(OPF)problems in power systems equipped with Flexible AC Transmission System(FACTS)devices which include Thyristor-Controlled Series Compensator(TCSC),Thyristor-Controlled Phase Shifter(TCPS),and Static Var Compensator(SVC).SWEWOA expands Whale Optimization Algorithm(WOA)through the integration of sine and wormhole energy features thus improving exploration and exploitation capabilities for efficient convergence in complex non-linear OPF problems.A performance evaluation of SWEWOA takes place on the IEEE-30 bus test system through static and dynamic loading scenarios where it demonstrates better results than five contemporary algorithms:Adaptive Chaotic WOA(ACWOA),WOA,Chaotic WOA(CWOA),Sine Cosine Algorithm Differential Evolution(SCADE),and Hybrid Grey Wolf Optimization(HGWO).The research shows that SWEWOA delivers superior generation cost reduction than other algorithms by reaching a minimum of 0.9%better performance.SWEWOA demonstrates superior power loss performance by achieving(P_(loss,min))at the lowest level compared to all other tested algorithms which leads to better system energy efficiency.The dynamic loading performance of SWEWOA leads to a 4.38%reduction in gross costs which proves its capability to handle different operating conditions.The algorithm achieves top performance in Friedman Rank Test(FRT)assessments through multiple performance metrics which verifies its consistent reliability and strong stability during changing power demands.The repeated simulations show that SWEWOA generates mean costs(C_(gen,min))and mean power loss values(P_(loss,min))with small deviations which indicate its capability to maintain cost-effective solutions in each simulation run.SWEWOA demonstrates great potential as an advanced optimization solution for power system operations through the results presented in this study.展开更多
As vehicular networks grow increasingly complex due to high node mobility and dynamic traffic conditions,efficient clustering mechanisms are vital to ensure stable and scalable communication.Recent studies have emphas...As vehicular networks grow increasingly complex due to high node mobility and dynamic traffic conditions,efficient clustering mechanisms are vital to ensure stable and scalable communication.Recent studies have emphasized the need for adaptive clustering strategies to improve performance in Intelligent Transportation Systems(ITS).This paper presents the Grasshopper Optimization Algorithm for Vehicular Network Clustering(GOAVNET)algorithm,an innovative approach to optimal vehicular clustering in Vehicular Ad-Hoc Networks(VANETs),leveraging the Grasshopper Optimization Algorithm(GOA)to address the critical challenges of traffic congestion and communication inefficiencies in Intelligent Transportation Systems(ITS).The proposed GOA-VNET employs an iterative and interactive optimization mechanism to dynamically adjust node positions and cluster configurations,ensuring robust adaptability to varying vehicular densities and transmission ranges.Key features of GOA-VNET include the utilization of attraction zone,repulsion zone,and comfort zone parameters,which collectively enhance clustering efficiency and minimize congestion within Regions of Interest(ROI).By managing cluster configurations and node densities effectively,GOA-VNET ensures balanced load distribution and seamless data transmission,even in scenarios with high vehicular densities and varying transmission ranges.Comparative evaluations against the Whale Optimization Algorithm(WOA)and Grey Wolf Optimization(GWO)demonstrate that GOA-VNET consistently outperforms these methods by achieving superior clustering efficiency,reducing the number of clusters by up to 10%in high-density scenarios,and improving data transmission reliability.Simulation results reveal that under a 100-600 m transmission range,GOA-VNET achieves an average reduction of 8%-15%in the number of clusters and maintains a 5%-10%improvement in packet delivery ratio(PDR)compared to baseline algorithms.Additionally,the algorithm incorporates a heat transfer-inspired load-balancing mechanism,ensuring equitable distribution of nodes among cluster leaders(CLs)and maintaining a stable network environment.These results validate GOA-VNET as a reliable and scalable solution for VANETs,with significant potential to support next-generation ITS.Future research could further enhance the algorithm by integrating multi-objective optimization techniques and exploring broader applications in complex traffic scenarios.展开更多
Due to the climate-dependent nature of renewable energy sources(RESs),solving the optimal power flow(OPF)problem in power systems that integrate RESs,such as photovoltaic(PV)units and wind turbines(WTs),remains a sign...Due to the climate-dependent nature of renewable energy sources(RESs),solving the optimal power flow(OPF)problem in power systems that integrate RESs,such as photovoltaic(PV)units and wind turbines(WTs),remains a significant challenge.To address this problem,this study presents an effective framework that incorporates solar and wind power generation.To manage the nonconvex and nonlinear characteristics of the OPF problem,a modified physics-inspired algorithm termed the Enhanced Coulomb’s and Franklin’s laws Algorithm(ECFA),is deployed.In the proposed OPF model,the power generated from RESs is considered a dependent variable,while voltages at buses equipped with RESs serve as decision variables.Real-time data on solar irradiation and wind speed are used to model the power outputs of PV units and WTs,respectively.Although the Coulomb’s and Franklin’s law algorithm(CFA)offers some advantages,it underperforms on complex optimization tasks compared to SSA,BA,SCA,ABC,and CFA.The enhanced version of the CFA improves the search process across the feasible space by incorporating diverse interaction methods and enhancing exploitation capabilities.The performance of the proposed ECFA is assessed through comprehensive comparisons with state-of-the-art methods for solving the OPF problem.展开更多
A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional an...A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.展开更多
A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows th...A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value.展开更多
A variant constrained genetic algorithm （VCGA） for effective tracking of conditional nonlinear optimal perturbations （CNOPs） is presented. Compared with traditional constraint handling methods, the treatment of th...A variant constrained genetic algorithm （VCGA） for effective tracking of conditional nonlinear optimal perturbations （CNOPs） is presented. Compared with traditional constraint handling methods, the treatment of the constraint condition in VCGA is relatively easy to implement. Moreover, it does not require adjustments to indefinite pararneters. Using a hybrid crossover operator and the newly developed multi-ply mutation operator, VCGA improves the performance of GAs. To demonstrate the capability of VCGA to catch CNOPS in non-smooth cases, a partial differential equation, which has ＂on off＂ switches in its forcing term, is employed as the nonlinear model. To search global CNOPs of the nonlinear model, numerical experiments using VCGA, the traditional gradient descent algorithm based on the adjoint method （ADJ）, and a GA using tournament selection operation and the niching technique （GA-DEB） were performed. The results with various initial reference states showed that, in smooth cases, all three optimization methods are able to catch global CNOPs. Nevertheless, in non-smooth situations, a large proportion of CNOPs captured by the ADJ are local. Compared with ADJ, the performance of GA-DEB shows considerable improvement, but it is far below VCGA. Further, the impacts of population sizes on both VCGA and GA-DEB were investigated. The results were used to estimate the computation time of ~CGA and GA-DEB in obtaining CNOPs. The computational costs for VCGA, GA-DEB and ADJ to catch CNOPs of the nonlinear model are also compared.展开更多
In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a le...In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.展开更多
The gear transmission system has been widely applied in mechanical systems,and many high-performance applications of these systems require low weight.With the aid of establishing the optimization model of the gear tra...The gear transmission system has been widely applied in mechanical systems,and many high-performance applications of these systems require low weight.With the aid of establishing the optimization model of the gear transmission system that consists of an objective function and some constraints(for example,the bending stress,the contact stress,the torsional strength,etc.),the optimal weight design of the gear transmission system can be transformed into the optimization problem for the objective function under the constraints.Moreover,both the shaft and the gear of the gear transmission system are considered simultaneously in our design.The hybrid Taguchi-genetic algorithm(HTGA)is employed to find the optimal design variables and the optimal weight of the system.An illustrated example for the single spur gear reducer is given to show that the optimal weight design problem can be successfully solved using the proposed design scheme.It also proves the high efficiency and feasibility of the algorithm in the gear design.展开更多
The optimal allocation model of regional water resources is built with the purpose of maximizing the comprehensive economic,social and environmental benefits of regional water consumption.In order to solve the problem...The optimal allocation model of regional water resources is built with the purpose of maximizing the comprehensive economic,social and environmental benefits of regional water consumption.In order to solve the problems that easily appear during the model solution of regional water resource optimal allocation with multiple water sources,multiple users and multiple objectives like"curse of dimensionality"or sinking into local optimum,this paper proposes a particle swarm optimization(PSO)algorithm based on immune evolutionary algorithm(IEA).This algorithm introduces immunology principle into particle swarm algorithm.Its immune memorizing and self-adjusting mechanism is utilized to keep the particles in the fitness level at a certain concentration and guarantee the diversity of population.Also,the global search characteristics of IEA and the local search capacity of particle swarm algorithm have been fully utilized to overcome the dependence of PSO on initial swarm and the deficiency of vulnerability to local optimum.After applying this model to the allocation of water resources in Zhoukou,we obtain the scheme for optimization allocation of water resources in the planning level years,i.e.2015and 2025 under the guarantee rate of 50%.The calculation results indicate that the application of this algorithm to solve the issue of optimal allocation of regional water resources is reliable and reasonable.Thus it ofers a new idea for solving the issue of optimal allocation of water resources.展开更多
In this paper, a new hybrid multi-objective evolutionary algorithm （MOEA）, the niched Pareto tabu search combined with a genetic algorithm （NPTSGA）, is proposed for the management of groundwater resources under va...In this paper, a new hybrid multi-objective evolutionary algorithm （MOEA）, the niched Pareto tabu search combined with a genetic algorithm （NPTSGA）, is proposed for the management of groundwater resources under variable density conditions. Relatively few MOEAs can possess global search ability contenting with intensified search in a local area. Moreover, the overall searching ability of tabu search （TS） based MOEAs is very sensitive to the neighborhood step size. The NPTSGA is developed on the thought of integrating the genetic algorithm （GA） with a TS based MOEA, the niched Pareto tabu search （NPTS）, which helps to alleviate both of the above difficulties. Here, the global search ability of the NPTS is improved by the diversification of candidate solutions arising from the evolving genetic algorithm population. Furthermore, the proposed methodology coupled with a density-dependent groundwater flow and solute transport simulator, SEAWAT, is developed and its performance is evaluated through a synthetic seawater intrusion management problem. Optimization results indicate that the NPTSGA offers a tradeoff between the two conflicting objectives. A key conclusion of this study is that the NPTSGA keeps the balance between the intensification of nondomination and the diversification of near Pareto-optimal solutions along the tradeoff curves and is a stable and robust method for implementing the multi-objective design of variable-density groundwater resources.展开更多
Construction of accurate and high-density linkage maps is a key research area of genetics.We investigated the efficiency of genetic map construction(MAP)using modifications of the k-Optimal(k-Opt)algorithm for solving...Construction of accurate and high-density linkage maps is a key research area of genetics.We investigated the efficiency of genetic map construction(MAP)using modifications of the k-Optimal(k-Opt)algorithm for solving the traveling-salesman problem(TSP).For TSP,different initial routes resulted in different optimal solutions.The most optimal solution could be found only by use of as many initial routes as possible.But for MAP,a large number of initial routes resulted in one optimal order.k-Opt using open route length gave a slightly higher proportion of correct orders than the method of adding one virtual marker and using closed route length.Recombination frequency(REC)and logarithm of odds(LOD)score gave similar proportions of correct order,higher than that given by genetic distance.Both missing markers and genotyping error reduced ordering accuracy,but the best order was still achieved with high probability by comparison of the optimal orders from multiple initial routes.Computation time increased rapidly with marker number,and 2-Opt took much less time than 3-Opt.The 2-Opt algorithm was compared with ordering methods used in two other software packages.The best method was 2-Opt using open route length as the criterion to identify the optimal order and using REC or LOD as the measure of distance between markers.We describe a unified software interface for using k-Opt in high-density linkage map construction for a wide range of genetic populations.展开更多
A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK ...A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.展开更多
In view of the poor water supply system’s network properties, the system’s complicated network hydraulic equations were replaced by macroscopic nodal pressure model and the model of relationship between supply flow ...In view of the poor water supply system’s network properties, the system’s complicated network hydraulic equations were replaced by macroscopic nodal pressure model and the model of relationship between supply flow and water source head. By using pump-station pressure head and initial tank water levels as decision variables, the model of optimal allocation of water supply between pump-sources was developed. Genetic algorithm was introduced to deal with the model of optimal allocation of water supply. Methods for handling each constraint condition were put forward, and overcome the shortcoming such as premature convergence of genetic algorithm; a solving method was brought forward in which genetic algorithm was combined with simulated annealing technology and self-adaptive crossover and mutation probabilities were adopted. An application example showed the feasibility of this algorithm.展开更多
The genetic algorithm (GA) to the design of electromagnetic micro motor to optimize parameter design. Besides the different oversize from macro motor, the novel structure of micro motor which the rotor is set betwee...The genetic algorithm (GA) to the design of electromagnetic micro motor to optimize parameter design. Besides the different oversize from macro motor, the novel structure of micro motor which the rotor is set between the two stators make its design different, too. There are constraint satisfaction problems CSP) in the design. It is shown that the use GA offers a high rate of global convergence and the ability to get the optimal design of electromagnetic micro motors.展开更多
A symplectic algorithm is used to solve optimal control problems. Linear and nonlinear examples aregiven. Numerical analyses show that the symplectic algorithm gives satisfactory performance in that it works inlarge s...A symplectic algorithm is used to solve optimal control problems. Linear and nonlinear examples aregiven. Numerical analyses show that the symplectic algorithm gives satisfactory performance in that it works inlarge step and is of high speed and accuracy. This indicates that the symplectic algorithm is more effective andreasonable in solving optimal control problems.展开更多
文摘The advent of microgrids in modern energy systems heralds a promising era of resilience,sustainability,and efficiency.Within the realm of grid-tied microgrids,the selection of an optimal optimization algorithm is critical for effective energy management,particularly in economic dispatching.This study compares the performance of Particle Swarm Optimization(PSO)and Genetic Algorithms(GA)in microgrid energy management systems,implemented using MATLAB tools.Through a comprehensive review of the literature and sim-ulations conducted in MATLAB,the study analyzes performance metrics,convergence speed,and the overall efficacy of GA and PSO,with a focus on economic dispatching tasks.Notably,a significant distinction emerges between the cost curves generated by the two algo-rithms for microgrid operation,with the PSO algorithm consistently resulting in lower costs due to its effective economic dispatching capabilities.Specifically,the utilization of the PSO approach could potentially lead to substantial savings on the power bill,amounting to approximately$15.30 in this evaluation.Thefindings provide insights into the strengths and limitations of each algorithm within the complex dynamics of grid-tied microgrids,thereby assisting stakeholders and researchers in arriving at informed decisions.This study contributes to the discourse on sustainable energy management by offering actionable guidance for the advancement of grid-tied micro-grid technologies through MATLAB-implemented optimization algorithms.
基金BBSRC,Grant/Award Number:RM32G0178B8National Natural Science Foundation of China,Grant/Award Numbers:U19A2061,U1809209,62076185+11 种基金Science and Technology Development Project of Jilin Province,Grant/Award Number:20190301024NYJilin Provincial Industrial Innovation Special Fund Project,Grant/Award Number:2018C039-3MRC,Grant/Award Number:MC_PC_17171Royal Society,Grant/Award Number:RP202G0230BHF,Grant/Award Number:AA/18/3/34220Hope Foundation for Cancer Research,Grant/Award Number:RM60G0680GCRF,Grant/Award Number:P202PF11Sino-UK Industrial Fund,Grant/Award Number:RP202G0289LIAS,Grant/Award Numbers:P202ED10,P202RE969Data Science Enhancement Fund,Grant/Award Number:P202RE237Fight for Sight,Grant/Award Number:24NN201Sino-UK Education Fund,Grant/Award Number:OP202006。
文摘The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally optimal solutions for various optimisation problems.Knowing the recent criticises of the originality of equations,the principle of BA is concise and easy to implement,and its mathematical structure can be seen as a hybrid particle swarm with simulated annealing.In this research,the authors focus on the performance optimisation of BA as a solver rather than discussing its originality issues.In terms of operation effect,BA has an acceptable convergence speed.However,due to the low proportion of time used to explore the search space,it is easy to converge prematurely and fall into the local optima.The authors propose an adaptive multi-stage bat algorithm(AMSBA).By tuning the algorithm's focus at three different stages of the search process,AMSBA can achieve a better balance between exploration and exploitation and improve its exploration ability by enhancing its performance in escaping local optima as well as maintaining a certain convergence speed.Therefore,AMSBA can achieve solutions with better quality.A convergence analysis was conducted to demonstrate the global convergence of AMSBA.The authors also perform simulation experiments on 30 benchmark functions from IEEE CEC 2017 as the objective functions and compare AMSBA with some original and improved swarm-based algorithms.The results verify the effectiveness and superiority of AMSBA.AMSBA is also compared with eight representative optimisation algorithms on 10 benchmark functions derived from IEEE CEC 2020,while this experiment is carried out on five different dimensions of the objective functions respectively.A balance and diversity analysis was performed on AMSBA to demonstrate its improvement over the original BA in terms of balance.AMSBA was also applied to the multi-threshold image segmentation of Citrus Macular disease,which is a bacterial infection that causes lesions on citrus trees.The segmentation results were analysed by comparing each comparative algorithm's peak signal-to-noise ratio,structural similarity index and feature similarity index.The results show that the proposed BA-based algorithm has apparent advantages,and it can effectively segment the disease spots from citrus leaves when the segmentation threshold is at a low level.Based on a comprehensive study,the authors think the proposed optimiser has mitigated the main drawbacks of the BA,and it can be utilised as an effective optimisation tool.
基金National Natural Science Foundation of China under Grant No.52278490。
文摘Finding an optimal isolator arrangement for asymmetric structures using traditional conceptual design methods that can significantly minimize torsional response while ensuring efficient horizontal seismic isolation is cumbersome and inefficient.Thus,this work develops a multi-objective optimization method to enhance the torsional resistance of asymmetric base-isolated structures.The primary objective is to simultaneously minimize the interstory rotation of the superstructure,the rotation of the isolation layer,and the interstory displacement of the superstructure without exceeding the isolator displacement limits.A fast non-dominated sorting genetic algorithm(NSGA-Ⅱ)is employed to satisfy this optimization objective.Subsequently,the isolator arrangement,encompassing both positions and categories,is optimized according to this multi-objective optimization method.Additionally,an optimization design platform is developed to streamline the design operation.This platform integrates the input of optimization parameters,the output of optimization results,the finite element analysis,and the multi-objective optimization method proposed herein.Finally,the application of this multi-objective optimization method and its associated platform are demonstrated on two asymmetric base-isolated structures of varying heights and plan configurations.The results indicate that the optimal isolator arrangement derived from the optimization method can further improve the control over the lateral and torsional responses of asymmetric base-isolated structures compared to conventional conceptual design methods.Notably,the interstory rotation of the optimal base-isolated structure is significantly reduced,constituting only approximately 33.7%of that observed in the original base-isolated structure.The proposed platform facilitates the automatic generation of the optimal design scheme for the isolators of asymmetric base-isolated structures,offering valuable insights and guidance for the burgeoning field of intelligent civil engineering design.
基金supported by the Changzhou Science and Technology Support Project(CE20235045)Open Subject of Jiangsu Province Key Laboratory of Power Transmission and Distribution(2021JSSPD12)+1 种基金Talent Projects of Jiangsu University of Technology(KYY20018)Postgraduate Research&Practice Innovation Program of Jiangsu Province(SJCX23_1633).
文摘Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device energy utilization.To tackle these challenges,this study proposes an optimal scheduling model for energy storage power plants based on edge computing and the improved whale optimization algorithm(IWOA).The proposed model designs an edge computing framework,transferring a large share of data processing and storage tasks to the network edge.This architecture effectively reduces transmission costs by minimizing data travel time.In addition,the model considers demand response strategies and builds an objective function based on the minimization of the sum of electricity purchase cost and operation cost.The IWOA enhances the optimization process by utilizing adaptive weight adjustments and an optimal neighborhood perturbation strategy,preventing the algorithm from converging to suboptimal solutions.Experimental results demonstrate that the proposed scheduling model maximizes the flexibility of the energy storage plant,facilitating efficient charging and discharging.It successfully achieves peak shaving and valley filling for both electrical and heat loads,promoting the effective utilization of renewable energy sources.The edge-computing framework significantly reduces transmission delays between energy devices.Furthermore,IWOA outperforms traditional algorithms in optimizing the objective function.
文摘The increase in bridge structure span and the complex stress characteristics directly affect the optimization of sensor placement,which in turn influences the data acquisition performance of the monitoring system.The key to the information acquisition of a bridge monitoring system is to obtain data that meets the health monitoring requirements of the bridge with a limited number of measurement points.To address this,a hybrid method based on multiple optimization criteria is proposed for optimal sensor placement(OSP).First,the minimum number of modes required for bridge monitoring is determined using the information entropy criterion(IE).Then,the number of measurement points is determined using a sequence method combined with the modal assurance criterion(MAC).Finally,the sensor placement is optimized using the generalized genetic algorithm(GGA)combined with double-structure encoding,and the optimization results are validated through finite element model analysis.The research results show that the hybrid method based on multiple optimization criteria can effectively determine the number of measurement points for bridge structures and optimize sensor placement,with a significant improvement in computational speed.
文摘The Sine and Wormhole Energy Whale Optimization Algorithm(SWEWOA)represents an advanced solution method for resolving Optimal Power Flow(OPF)problems in power systems equipped with Flexible AC Transmission System(FACTS)devices which include Thyristor-Controlled Series Compensator(TCSC),Thyristor-Controlled Phase Shifter(TCPS),and Static Var Compensator(SVC).SWEWOA expands Whale Optimization Algorithm(WOA)through the integration of sine and wormhole energy features thus improving exploration and exploitation capabilities for efficient convergence in complex non-linear OPF problems.A performance evaluation of SWEWOA takes place on the IEEE-30 bus test system through static and dynamic loading scenarios where it demonstrates better results than five contemporary algorithms:Adaptive Chaotic WOA(ACWOA),WOA,Chaotic WOA(CWOA),Sine Cosine Algorithm Differential Evolution(SCADE),and Hybrid Grey Wolf Optimization(HGWO).The research shows that SWEWOA delivers superior generation cost reduction than other algorithms by reaching a minimum of 0.9%better performance.SWEWOA demonstrates superior power loss performance by achieving(P_(loss,min))at the lowest level compared to all other tested algorithms which leads to better system energy efficiency.The dynamic loading performance of SWEWOA leads to a 4.38%reduction in gross costs which proves its capability to handle different operating conditions.The algorithm achieves top performance in Friedman Rank Test(FRT)assessments through multiple performance metrics which verifies its consistent reliability and strong stability during changing power demands.The repeated simulations show that SWEWOA generates mean costs(C_(gen,min))and mean power loss values(P_(loss,min))with small deviations which indicate its capability to maintain cost-effective solutions in each simulation run.SWEWOA demonstrates great potential as an advanced optimization solution for power system operations through the results presented in this study.
基金supported by Institute of Information&Communications Technology Planning&Evaluation(IITP)grant funded by the Korea government(MSIT)(No.RS-2024-00337489Development of Data Drift Management Technology to Overcome Performance Degradation of AI Analysis Models).
文摘As vehicular networks grow increasingly complex due to high node mobility and dynamic traffic conditions,efficient clustering mechanisms are vital to ensure stable and scalable communication.Recent studies have emphasized the need for adaptive clustering strategies to improve performance in Intelligent Transportation Systems(ITS).This paper presents the Grasshopper Optimization Algorithm for Vehicular Network Clustering(GOAVNET)algorithm,an innovative approach to optimal vehicular clustering in Vehicular Ad-Hoc Networks(VANETs),leveraging the Grasshopper Optimization Algorithm(GOA)to address the critical challenges of traffic congestion and communication inefficiencies in Intelligent Transportation Systems(ITS).The proposed GOA-VNET employs an iterative and interactive optimization mechanism to dynamically adjust node positions and cluster configurations,ensuring robust adaptability to varying vehicular densities and transmission ranges.Key features of GOA-VNET include the utilization of attraction zone,repulsion zone,and comfort zone parameters,which collectively enhance clustering efficiency and minimize congestion within Regions of Interest(ROI).By managing cluster configurations and node densities effectively,GOA-VNET ensures balanced load distribution and seamless data transmission,even in scenarios with high vehicular densities and varying transmission ranges.Comparative evaluations against the Whale Optimization Algorithm(WOA)and Grey Wolf Optimization(GWO)demonstrate that GOA-VNET consistently outperforms these methods by achieving superior clustering efficiency,reducing the number of clusters by up to 10%in high-density scenarios,and improving data transmission reliability.Simulation results reveal that under a 100-600 m transmission range,GOA-VNET achieves an average reduction of 8%-15%in the number of clusters and maintains a 5%-10%improvement in packet delivery ratio(PDR)compared to baseline algorithms.Additionally,the algorithm incorporates a heat transfer-inspired load-balancing mechanism,ensuring equitable distribution of nodes among cluster leaders(CLs)and maintaining a stable network environment.These results validate GOA-VNET as a reliable and scalable solution for VANETs,with significant potential to support next-generation ITS.Future research could further enhance the algorithm by integrating multi-objective optimization techniques and exploring broader applications in complex traffic scenarios.
文摘Due to the climate-dependent nature of renewable energy sources(RESs),solving the optimal power flow(OPF)problem in power systems that integrate RESs,such as photovoltaic(PV)units and wind turbines(WTs),remains a significant challenge.To address this problem,this study presents an effective framework that incorporates solar and wind power generation.To manage the nonconvex and nonlinear characteristics of the OPF problem,a modified physics-inspired algorithm termed the Enhanced Coulomb’s and Franklin’s laws Algorithm(ECFA),is deployed.In the proposed OPF model,the power generated from RESs is considered a dependent variable,while voltages at buses equipped with RESs serve as decision variables.Real-time data on solar irradiation and wind speed are used to model the power outputs of PV units and WTs,respectively.Although the Coulomb’s and Franklin’s law algorithm(CFA)offers some advantages,it underperforms on complex optimization tasks compared to SSA,BA,SCA,ABC,and CFA.The enhanced version of the CFA improves the search process across the feasible space by incorporating diverse interaction methods and enhancing exploitation capabilities.The performance of the proposed ECFA is assessed through comprehensive comparisons with state-of-the-art methods for solving the OPF problem.
基金The National Key Technology R&D Program of China during the 11th Five Year Plan Period(No.2008BAJ11B01)
文摘A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.
文摘A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value.
基金supported by the National Natural Science Foundation of China(Grant No.40975063)the National Natural Science Foundation of China(Grant No.41331174)
文摘A variant constrained genetic algorithm （VCGA） for effective tracking of conditional nonlinear optimal perturbations （CNOPs） is presented. Compared with traditional constraint handling methods, the treatment of the constraint condition in VCGA is relatively easy to implement. Moreover, it does not require adjustments to indefinite pararneters. Using a hybrid crossover operator and the newly developed multi-ply mutation operator, VCGA improves the performance of GAs. To demonstrate the capability of VCGA to catch CNOPS in non-smooth cases, a partial differential equation, which has ＂on off＂ switches in its forcing term, is employed as the nonlinear model. To search global CNOPs of the nonlinear model, numerical experiments using VCGA, the traditional gradient descent algorithm based on the adjoint method （ADJ）, and a GA using tournament selection operation and the niching technique （GA-DEB） were performed. The results with various initial reference states showed that, in smooth cases, all three optimization methods are able to catch global CNOPs. Nevertheless, in non-smooth situations, a large proportion of CNOPs captured by the ADJ are local. Compared with ADJ, the performance of GA-DEB shows considerable improvement, but it is far below VCGA. Further, the impacts of population sizes on both VCGA and GA-DEB were investigated. The results were used to estimate the computation time of ~CGA and GA-DEB in obtaining CNOPs. The computational costs for VCGA, GA-DEB and ADJ to catch CNOPs of the nonlinear model are also compared.
基金the Natural Science Foundation of Shandong Province (Y2006A12)the Scientific ResearchDevelopment Project of Shandong Provincial Education Department(J06P01)the Doctoral Foundation of University of Jinan(B0633).
文摘In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.
基金Supported by the Fundamental Research Funds for the Central Universities(20102080201000085)the National Natural Science Foundation of China(50875189)
文摘The gear transmission system has been widely applied in mechanical systems,and many high-performance applications of these systems require low weight.With the aid of establishing the optimization model of the gear transmission system that consists of an objective function and some constraints(for example,the bending stress,the contact stress,the torsional strength,etc.),the optimal weight design of the gear transmission system can be transformed into the optimization problem for the objective function under the constraints.Moreover,both the shaft and the gear of the gear transmission system are considered simultaneously in our design.The hybrid Taguchi-genetic algorithm(HTGA)is employed to find the optimal design variables and the optimal weight of the system.An illustrated example for the single spur gear reducer is given to show that the optimal weight design problem can be successfully solved using the proposed design scheme.It also proves the high efficiency and feasibility of the algorithm in the gear design.
基金the National Natural Science Foundation of China(No.40839902)
文摘The optimal allocation model of regional water resources is built with the purpose of maximizing the comprehensive economic,social and environmental benefits of regional water consumption.In order to solve the problems that easily appear during the model solution of regional water resource optimal allocation with multiple water sources,multiple users and multiple objectives like"curse of dimensionality"or sinking into local optimum,this paper proposes a particle swarm optimization(PSO)algorithm based on immune evolutionary algorithm(IEA).This algorithm introduces immunology principle into particle swarm algorithm.Its immune memorizing and self-adjusting mechanism is utilized to keep the particles in the fitness level at a certain concentration and guarantee the diversity of population.Also,the global search characteristics of IEA and the local search capacity of particle swarm algorithm have been fully utilized to overcome the dependence of PSO on initial swarm and the deficiency of vulnerability to local optimum.After applying this model to the allocation of water resources in Zhoukou,we obtain the scheme for optimization allocation of water resources in the planning level years,i.e.2015and 2025 under the guarantee rate of 50%.The calculation results indicate that the application of this algorithm to solve the issue of optimal allocation of regional water resources is reliable and reasonable.Thus it ofers a new idea for solving the issue of optimal allocation of water resources.
基金funded by the National Basic Research Program of China(the 973 Program,No.2010CB428803)the National Natural Science Foundation of China(Nos.41072175,40902069 and 40725010)
文摘In this paper, a new hybrid multi-objective evolutionary algorithm （MOEA）, the niched Pareto tabu search combined with a genetic algorithm （NPTSGA）, is proposed for the management of groundwater resources under variable density conditions. Relatively few MOEAs can possess global search ability contenting with intensified search in a local area. Moreover, the overall searching ability of tabu search （TS） based MOEAs is very sensitive to the neighborhood step size. The NPTSGA is developed on the thought of integrating the genetic algorithm （GA） with a TS based MOEA, the niched Pareto tabu search （NPTS）, which helps to alleviate both of the above difficulties. Here, the global search ability of the NPTS is improved by the diversification of candidate solutions arising from the evolving genetic algorithm population. Furthermore, the proposed methodology coupled with a density-dependent groundwater flow and solute transport simulator, SEAWAT, is developed and its performance is evaluated through a synthetic seawater intrusion management problem. Optimization results indicate that the NPTSGA offers a tradeoff between the two conflicting objectives. A key conclusion of this study is that the NPTSGA keeps the balance between the intensification of nondomination and the diversification of near Pareto-optimal solutions along the tradeoff curves and is a stable and robust method for implementing the multi-objective design of variable-density groundwater resources.
基金This work was supported by the National Natural Science Foundation of China(31861143003)HarvestPlus(part of the CGIAR Research Program on Agriculture for Nutrition and Health,http://www.harvestplus.org/).
文摘Construction of accurate and high-density linkage maps is a key research area of genetics.We investigated the efficiency of genetic map construction(MAP)using modifications of the k-Optimal(k-Opt)algorithm for solving the traveling-salesman problem(TSP).For TSP,different initial routes resulted in different optimal solutions.The most optimal solution could be found only by use of as many initial routes as possible.But for MAP,a large number of initial routes resulted in one optimal order.k-Opt using open route length gave a slightly higher proportion of correct orders than the method of adding one virtual marker and using closed route length.Recombination frequency(REC)and logarithm of odds(LOD)score gave similar proportions of correct order,higher than that given by genetic distance.Both missing markers and genotyping error reduced ordering accuracy,but the best order was still achieved with high probability by comparison of the optimal orders from multiple initial routes.Computation time increased rapidly with marker number,and 2-Opt took much less time than 3-Opt.The 2-Opt algorithm was compared with ordering methods used in two other software packages.The best method was 2-Opt using open route length as the criterion to identify the optimal order and using REC or LOD as the measure of distance between markers.We describe a unified software interface for using k-Opt in high-density linkage map construction for a wide range of genetic populations.
文摘A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.
基金Project (No. 50078048) supported by the National Natural Science Foundation of China
文摘In view of the poor water supply system’s network properties, the system’s complicated network hydraulic equations were replaced by macroscopic nodal pressure model and the model of relationship between supply flow and water source head. By using pump-station pressure head and initial tank water levels as decision variables, the model of optimal allocation of water supply between pump-sources was developed. Genetic algorithm was introduced to deal with the model of optimal allocation of water supply. Methods for handling each constraint condition were put forward, and overcome the shortcoming such as premature convergence of genetic algorithm; a solving method was brought forward in which genetic algorithm was combined with simulated annealing technology and self-adaptive crossover and mutation probabilities were adopted. An application example showed the feasibility of this algorithm.
文摘The genetic algorithm (GA) to the design of electromagnetic micro motor to optimize parameter design. Besides the different oversize from macro motor, the novel structure of micro motor which the rotor is set between the two stators make its design different, too. There are constraint satisfaction problems CSP) in the design. It is shown that the use GA offers a high rate of global convergence and the ability to get the optimal design of electromagnetic micro motors.
文摘A symplectic algorithm is used to solve optimal control problems. Linear and nonlinear examples aregiven. Numerical analyses show that the symplectic algorithm gives satisfactory performance in that it works inlarge step and is of high speed and accuracy. This indicates that the symplectic algorithm is more effective andreasonable in solving optimal control problems.
