The intermittency and volatility of wind and photovoltaic power generation exacerbate issues such as wind and solar curtailment,hindering the efficient utilization of renewable energy and the low-carbon development of...The intermittency and volatility of wind and photovoltaic power generation exacerbate issues such as wind and solar curtailment,hindering the efficient utilization of renewable energy and the low-carbon development of energy systems.To enhance the consumption capacity of green power,the green power system consumption optimization scheduling model(GPS-COSM)is proposed,which comprehensively integrates green power system,electric boiler,combined heat and power unit,thermal energy storage,and electrical energy storage.The optimization objectives are to minimize operating cost,minimize carbon emission,and maximize the consumption of wind and solar curtailment.The multi-objective particle swarm optimization algorithm is employed to solve the model,and a fuzzy membership function is introduced to evaluate the satisfaction level of the Pareto optimal solution set,thereby selecting the optimal compromise solution to achieve a dynamic balance among economic efficiency,environmental friendliness,and energy utilization efficiency.Three typical operating modes are designed for comparative analysis.The results demonstrate that the mode involving the coordinated operation of electric boiler,thermal energy storage,and electrical energy storage performs the best in terms of economic efficiency,environmental friendliness,and renewable energy utilization efficiency,achieving the wind and solar curtailment consumption rate of 99.58%.The application of electric boiler significantly enhances the direct accommodation capacity of the green power system.Thermal energy storage optimizes intertemporal regulation,while electrical energy storage strengthens the system’s dynamic regulation capability.The coordinated optimization of multiple devices significantly reduces reliance on fossil fuels.展开更多
Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algori...Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.展开更多
This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding,called RSA-S...This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding,called RSA-SSA.The proposed method introduces a better search space to find the optimal solution at each iteration.However,we proposed RSA-SSA to avoid the searching problem in the same area and determine the optimal multi-level thresholds.The obtained solutions by the proposed method are represented using the image histogram.The proposed RSA-SSA employed Otsu’s variance class function to get the best threshold values at each level.The performance measure for the proposed method is valid by detecting fitness function,structural similarity index,peak signal-to-noise ratio,and Friedman ranking test.Several benchmark images of COVID-19 validate the performance of the proposed RSA-SSA.The results showed that the proposed RSA-SSA outperformed other metaheuristics optimization algorithms published in the literature.展开更多
In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （S...In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （SI） gasoline engine. The aim of this optimization is to reduce engine emissions in terms of carbon monoxide （CO）, hydrocarbons （HC）, and nitrogen oxides （NOx）, which are the causes of diverse environmental problems such as air pollution and global warming. Stationary engine tests were performed for data generation, covering 60 operating conditions. Artificial neural networks （ANNs） were used to predict exhaust emissions, whose inputs were from six engine operating parameters, and the outputs were three resulting exhaust emissions. The outputs of ANNs were used to evaluate objective functions within the optimization algorithms： NSGA-II and MOPSO. Then a decision-making process was conducted, using a fuzzy method to select a Pareto solution with which the best emission reductions can be achieved. The NSGA-II algorithm achieved reductions of at least 9.84%, 82.44%, and 13.78% for CO, HC, and NOx, respectively. With a MOPSO algorithm the reached reductions were at least 13.68%, 83.80%, and 7.67% for CO, HC, and NOx, respectively.展开更多
In response to the shortcomings of Dwarf Mongoose Optimization(DMO)algorithm,such as insufficient exploitation capability and slow convergence speed,this paper proposes a multi-strategy enhanced DMO,referred to as GLS...In response to the shortcomings of Dwarf Mongoose Optimization(DMO)algorithm,such as insufficient exploitation capability and slow convergence speed,this paper proposes a multi-strategy enhanced DMO,referred to as GLSDMO.Firstly,we propose an improved solution search equation that utilizes the Gbest-guided strategy with different parameters to achieve a trade-off between exploration and exploitation(EE).Secondly,the Lévy flight is introduced to increase the diversity of population distribution and avoid the algorithm getting stuck in a local optimum.In addition,in order to address the problem of low convergence efficiency of DMO,this study uses the strong nonlinear convergence factor Sigmaid function as the moving step size parameter of the mongoose during collective activities,and combines the strategy of the salp swarm leader with the mongoose for cooperative optimization,which enhances the search efficiency of agents and accelerating the convergence of the algorithm to the global optimal solution(Gbest).Subsequently,the superiority of GLSDMO is verified on CEC2017 and CEC2019,and the optimization effect of GLSDMO is analyzed in detail.The results show that GLSDMO is significantly superior to the compared algorithms in solution quality,robustness and global convergence rate on most test functions.Finally,the optimization performance of GLSDMO is verified on three classic engineering examples and one truss topology optimization example.The simulation results show that GLSDMO achieves optimal costs on these real-world engineering problems.展开更多
Pilot pattern has a significant effect on the performance of channel estimation based on compressed sensing.However,because of the influence of the number of subcarriers and pilots,the complexity of the enumeration me...Pilot pattern has a significant effect on the performance of channel estimation based on compressed sensing.However,because of the influence of the number of subcarriers and pilots,the complexity of the enumeration method is computationally impractical.The meta-heuristic algorithm of the salp swarm algorithm(SSA)is employed to address this issue.Like most meta-heuristic algorithms,the SSA algorithm is prone to problems such as local optimal values and slow convergence.In this paper,we proposed the CWSSA to enhance the optimization efficiency and robustness by chaotic opposition-based learning strategy,adaptive weight factor,and increasing local search.Experiments show that the test results of the CWSSA on most benchmark functions are better than those of other meta-heuristic algorithms.Besides,the CWSSA algorithm is applied to pilot pattern optimization,and its results are better than other methods in terms of BER and MSE.展开更多
CognitiveRadio(CR)has been developed as an enabling technology that allows the unused or underused spectrum to be used dynamically to increase spectral efficiency.To improve the overall performance of the CR systemit ...CognitiveRadio(CR)has been developed as an enabling technology that allows the unused or underused spectrum to be used dynamically to increase spectral efficiency.To improve the overall performance of the CR systemit is extremely important to adapt or reconfigure the systemparameters.The Decision Engine is a major module in the CR-based system that not only includes radio monitoring and cognition functions but also responsible for parameter adaptation.As meta-heuristic algorithms offer numerous advantages compared to traditional mathematical approaches,the performance of these algorithms is investigated in order to design an efficient CR system that is able to adapt the transmitting parameters to effectively reduce power consumption,bit error rate and adjacent interference of the channel,while maximized secondary user throughput.Self-Learning Salp Swarm Algorithm(SLSSA)is a recent meta-heuristic algorithm that is the enhanced version of SSA inspired by the swarming behavior of salps.In this work,the parametric adaption of CR system is performed by SLSSA and the simulation results show that SLSSA has high accuracy,stability and outperforms other competitive algorithms formaximizing the throughput of secondary users.The results obtained with SLSSA are also shown to be extremely satisfactory and need fewer iterations to converge compared to the competitive methods.展开更多
Resource management in Underground Wireless Sensor Networks(UWSNs)is one of the pillars to extend the network lifetime.An intriguing design goal for such networks is to achieve balanced energy and spectral resource ut...Resource management in Underground Wireless Sensor Networks(UWSNs)is one of the pillars to extend the network lifetime.An intriguing design goal for such networks is to achieve balanced energy and spectral resource utilization.This paper focuses on optimizing the resource efficiency in UWSNs where underground relay nodes amplify and forward sensed data,received from the buried source nodes through a lossy soil medium,to the aboveground base station.A new algorithm called the Hybrid Chaotic Salp Swarm and Crossover(HCSSC)algorithm is proposed to obtain the optimal source and relay transmission powers to maximize the network resource efficiency.The proposed algorithm improves the standard Salp Swarm Algorithm(SSA)by considering a chaotic map to initialize the population along with performing the crossover technique in the position updates of salps.Through experimental results,the HCSSC algorithm proves its outstanding superiority to the standard SSA for resource efficiency optimization.Hence,the network’s lifetime is prolonged.Indeed,the proposed algorithm achieves an improvement performance of 23.6%and 20.4%for the resource efficiency and average remaining relay battery per transmission,respectively.Furthermore,simulation results demonstrate that the HCSSC algorithm proves its efficacy in the case of both equal and different node battery capacities.展开更多
The Salp Swarm Algorithm(SSA)may have trouble in dropping into stagnation as a kind of swarm intelligence method.This paper developed an adaptive barebones salp swarm algorithm with quasi-oppositional-based learning t...The Salp Swarm Algorithm(SSA)may have trouble in dropping into stagnation as a kind of swarm intelligence method.This paper developed an adaptive barebones salp swarm algorithm with quasi-oppositional-based learning to compensate for the above weakness called QBSSA.In the proposed QBSSA,an adaptive barebones strategy can help to reach both accurate convergence speed and high solution quality;quasi-oppositional-based learning can make the population away from traping into local optimal and expand the search space.To estimate the performance of the presented method,a series of tests are performed.Firstly,CEC 2017 benchmark test suit is used to test the ability to solve the high dimensional and multimodal problems;then,based on QBSSA,an improved Kernel Extreme Learning Machine(KELM)model,named QBSSA–KELM,is built to handle medical disease diagnosis problems.All the test results and discussions state clearly that the QBSSA is superior to and very competitive to all the compared algorithms on both convergence speed and solutions accuracy.展开更多
<div style="text-align:justify;"> In view of the complex problems that freight train ATO (automatic train operation) needs to comprehensively consider punctuality, energy saving and safety, a dynamics ...<div style="text-align:justify;"> In view of the complex problems that freight train ATO (automatic train operation) needs to comprehensively consider punctuality, energy saving and safety, a dynamics model of the freight train operation process is established based on the safety and the freight train dynamics model in the process of its operation. The algorithm of combining elite competition strategy with multi-objective particle swarm optimization technology is introduced, and the winning particles are obtained through the competition between two elite particles to guide the update of other particles, so as to balance the convergence and distribution of multi-objective particle swarm optimization. The performance comparison experimental results verify the superiority of the proposed algorithm. The simulation experiments of the actual line verify the feasibility of the model and the effectiveness of the proposed algorithm. </div>展开更多
The Salp Swarm Algorithm (SSA) is a recently proposed swarm intelligence algorithm inspired by salps, a marine creature similar to jellyfish. Despite its simple structure and solid exploratory ability, SSA suffers fro...The Salp Swarm Algorithm (SSA) is a recently proposed swarm intelligence algorithm inspired by salps, a marine creature similar to jellyfish. Despite its simple structure and solid exploratory ability, SSA suffers from low convergence accuracy and slow convergence speed when dealing with some complex problems. Therefore, this paper proposes an improved algorithm based on SSA and adds three improvements. First, the Real-time Update Mechanism (RUM) underwrites the role of ensuring that excellent individual information will not be lost and information exchange will not lag in the iterative process. Second, the Communication Strategy (CMS), on the other hand, uses the multiplicative relationship of multiple individuals to regulate the exploration and exploitation process dynamically. Third, the Selective Replacement Strategy (SRS) is designed to adaptively adjust the variance ratio of individuals to enhance the accuracy and depth of convergence. The new proposal presented in this study is named RCSSSA. The global optimization capability of the algorithm was tested against various high-performance and novel algorithms at IEEE CEC 2014, and its constrained optimization capability was tested at IEEE CEC 2011. The experimental results demonstrate that the proposed algorithm can converge faster while obtaining better optimization results than traditional swarm intelligence and other improved algorithms. The statistical data in the table support its optimization capabilities, and multiple graphs deepen the understanding and analysis of the proposed algorithm.展开更多
The Salp Swarm Algorithm(SSA)is a population-based Meta-heuristic Algorithm(MA)that simulates the behavior of a group of salps foraging in the ocean.Although the basic SSA has stable exploration capability and converg...The Salp Swarm Algorithm(SSA)is a population-based Meta-heuristic Algorithm(MA)that simulates the behavior of a group of salps foraging in the ocean.Although the basic SSA has stable exploration capability and convergence speed,it still can fall into local optimum when solving complex optimization problems,which may be due to low utilization of population information and unbalanced exploration-to-exploitation ratio.Therefore,this study proposes a Double Mutation Salp Swarm Algorithm(DMSSA).In this study,a Cuckoo Mutation Strategy(CMS)and an Adaptive DE Mutation Strategy(ADMS)are introduced into the structure of the original SSA.The former mutation strategy is summarized as three basic operations:judgment,shuffling,and mutation.The purpose is to fully consider the information among search agents and use the differences between different search agents to participate in the update of positions,making the optimization process both diverse in exploration and minor in randomness.The latter strategy employs three basic operations:selection,mutation,and adaptation.As the follower part,some individuals do not blindly adopt the original follow method.Instead,the global optimal position and differences are considered,and the variation factor is adjusted adaptively,allowing the new algorithm to balance exploration,exploitation,and convergence efficiency.To evaluate the performance of DMSSA,comparisons are made with numerous algorithms on 30 IEEE CEC2014 benchmark functions.The statistical results confirm the better performance and significant difference of DMSSA in solving benchmark function tests.Finally,the applicability and scalability of DMSSA to optimization problems with constraints are further confirmed in three experiments on classical engineering design optimization problems.The source code of the proposed algorithm will be available at:https://github.com/ncjsq/Double-Mutational-Salp-Swarm-Algorithm.展开更多
To consider multi-objective optimization problem with the number of feed array elements and sidelobe level of large antenna array, multi-objective cross entropy(CE) algorithm is proposed by combining fuzzy c-mean clus...To consider multi-objective optimization problem with the number of feed array elements and sidelobe level of large antenna array, multi-objective cross entropy(CE) algorithm is proposed by combining fuzzy c-mean clustering algorithm with traditional cross entropy algorithm, and specific program flow of the algorithm is given.Using the algorithm, large thinned array(200 elements) given sidelobe level(-10,-19 and-30 d B) problem is solved successfully. Compared with the traditional statistical algorithms, the optimization results of the algorithm validate that the number of feed array elements reduces by 51%, 11% and 6% respectively. In addition, compared with the particle swarm optimization(PSO) algorithm, the number of feed array elements from the algorithm is more similar, but the algorithm is more efficient.展开更多
Dynamic multi-objective optimization is a complex and difficult research topic of process systems engineering. In this paper,a modified multi-objective bare-bones particle swarm optimization( MOBBPSO) algorithm is pro...Dynamic multi-objective optimization is a complex and difficult research topic of process systems engineering. In this paper,a modified multi-objective bare-bones particle swarm optimization( MOBBPSO) algorithm is proposed that takes advantage of a few parameters of bare-bones algorithm. To avoid premature convergence,Gaussian mutation is introduced; and an adaptive sampling distribution strategy is also used to improve the exploratory capability. Moreover, a circular crowded sorting approach is adopted to improve the uniformity of the population distribution.Finally, by combining the algorithm with control vector parameterization,an approach is proposed to solve the dynamic optimization problems of chemical processes. It is proved that the new algorithm performs better compared with other classic multiobjective optimization algorithms through the results of solving three dynamic optimization problems.展开更多
In response to the shortcomings of the Salp Swarm Algorithm (SSA) such as low convergence accuracy and slow convergence speed, a Multi-Strategy-Driven Salp Swarm Algorithm (MSD-SSA) was proposed. First, food sources o...In response to the shortcomings of the Salp Swarm Algorithm (SSA) such as low convergence accuracy and slow convergence speed, a Multi-Strategy-Driven Salp Swarm Algorithm (MSD-SSA) was proposed. First, food sources or random leaders were associated with the current bottle sea squirt at the beginning of the iteration, to which Levy flight random walk and crossover operators with small probability were added to improve the global search and ability to jump out of local optimum. Secondly, the position mean of the leader was used to establish a link with the followers, which effectively avoided the blind following of the followers and greatly improved the convergence speed of the algorithm. Finally, Brownian motion stochastic steps were introduced to improve the convergence accuracy of populations near food sources. The improved method switched under changes in the adaptive parameters, balancing the exploration and development of SSA. In the simulation experiments, the performance of the algorithm was examined using SSA and MSD-SSA on the commonly used CEC benchmark test functions and CEC2017-constrained optimization problems, and the effectiveness of MSD-SSA was verified by solving three real engineering problems. The results showed that MSD-SSA improved the convergence speed and convergence accuracy of the algorithm, and achieved good results in practical engineering problems.展开更多
The pylon structure of an airplane is very complex, and its high-fidelity analysis is quite time-consuming. If posterior preference optimization algorithm is used to solve this problem, the huge time consumption will ...The pylon structure of an airplane is very complex, and its high-fidelity analysis is quite time-consuming. If posterior preference optimization algorithm is used to solve this problem, the huge time consumption will be unacceptable in engineering practice due to the large amount of evaluation needed for the algorithm. So, a new interactive optimization algorithm-interactive multi-objective particle swarm optimization （IMOPSO） is presented. IMOPSO is efficient, simple and operable. The decision-maker can expediently determine the accurate preference in IMOPSO. IMOPSO is used to perform the pylon structure optimization design of an airplane, and a satisfactory design is achieved after only 12 generations of IMOPSO evolutions. Compared with original design, the maximum displacement of the satisfactory design is reduced, and the mass of the satisfactory design is decreased for 22%.展开更多
To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was establis...To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.展开更多
Based on improved multi-objective particle swarm optimization（MOPSO） algorithm with principal component analysis（PCA） methodology, an efficient high-dimension multiobjective optimization method is proposed, which,...Based on improved multi-objective particle swarm optimization（MOPSO） algorithm with principal component analysis（PCA） methodology, an efficient high-dimension multiobjective optimization method is proposed, which, as the purpose of this paper, aims to improve the convergence of Pareto front in multi-objective optimization design. The mathematical efficiency,the physical reasonableness and the reliability in dealing with redundant objectives of PCA are verified by typical DTLZ5 test function and multi-objective correlation analysis of supercritical airfoil,and the proposed method is integrated into aircraft multi-disciplinary design（AMDEsign） platform, which contains aerodynamics, stealth and structure weight analysis and optimization module.Then the proposed method is used for the multi-point integrated aerodynamic optimization of a wide-body passenger aircraft, in which the redundant objectives identified by PCA are transformed to optimization constraints, and several design methods are compared. The design results illustrate that the strategy used in this paper is sufficient and multi-point design requirements of the passenger aircraft are reached. The visualization level of non-dominant Pareto set is improved by effectively reducing the dimension without losing the primary feature of the problem.展开更多
To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The se...To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.展开更多
In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based o...In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.展开更多
基金funded by the National Key Research and Development Program of China(2024YFE0106800)Natural Science Foundation of Shandong Province(ZR2021ME199).
文摘The intermittency and volatility of wind and photovoltaic power generation exacerbate issues such as wind and solar curtailment,hindering the efficient utilization of renewable energy and the low-carbon development of energy systems.To enhance the consumption capacity of green power,the green power system consumption optimization scheduling model(GPS-COSM)is proposed,which comprehensively integrates green power system,electric boiler,combined heat and power unit,thermal energy storage,and electrical energy storage.The optimization objectives are to minimize operating cost,minimize carbon emission,and maximize the consumption of wind and solar curtailment.The multi-objective particle swarm optimization algorithm is employed to solve the model,and a fuzzy membership function is introduced to evaluate the satisfaction level of the Pareto optimal solution set,thereby selecting the optimal compromise solution to achieve a dynamic balance among economic efficiency,environmental friendliness,and energy utilization efficiency.Three typical operating modes are designed for comparative analysis.The results demonstrate that the mode involving the coordinated operation of electric boiler,thermal energy storage,and electrical energy storage performs the best in terms of economic efficiency,environmental friendliness,and renewable energy utilization efficiency,achieving the wind and solar curtailment consumption rate of 99.58%.The application of electric boiler significantly enhances the direct accommodation capacity of the green power system.Thermal energy storage optimizes intertemporal regulation,while electrical energy storage strengthens the system’s dynamic regulation capability.The coordinated optimization of multiple devices significantly reduces reliance on fossil fuels.
基金supported by the Foundation of the Scientific and Technological Innovation Team of Colleges and Universities in Henan Province(Grant No.181RTSTHN009)the Foundation of the Key Laboratory of Water Environment Simulation and Treatment in Henan Province(Grant No.2017016).
文摘Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.
文摘This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding,called RSA-SSA.The proposed method introduces a better search space to find the optimal solution at each iteration.However,we proposed RSA-SSA to avoid the searching problem in the same area and determine the optimal multi-level thresholds.The obtained solutions by the proposed method are represented using the image histogram.The proposed RSA-SSA employed Otsu’s variance class function to get the best threshold values at each level.The performance measure for the proposed method is valid by detecting fitness function,structural similarity index,peak signal-to-noise ratio,and Friedman ranking test.Several benchmark images of COVID-19 validate the performance of the proposed RSA-SSA.The results showed that the proposed RSA-SSA outperformed other metaheuristics optimization algorithms published in the literature.
文摘In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （SI） gasoline engine. The aim of this optimization is to reduce engine emissions in terms of carbon monoxide （CO）, hydrocarbons （HC）, and nitrogen oxides （NOx）, which are the causes of diverse environmental problems such as air pollution and global warming. Stationary engine tests were performed for data generation, covering 60 operating conditions. Artificial neural networks （ANNs） were used to predict exhaust emissions, whose inputs were from six engine operating parameters, and the outputs were three resulting exhaust emissions. The outputs of ANNs were used to evaluate objective functions within the optimization algorithms： NSGA-II and MOPSO. Then a decision-making process was conducted, using a fuzzy method to select a Pareto solution with which the best emission reductions can be achieved. The NSGA-II algorithm achieved reductions of at least 9.84%, 82.44%, and 13.78% for CO, HC, and NOx, respectively. With a MOPSO algorithm the reached reductions were at least 13.68%, 83.80%, and 7.67% for CO, HC, and NOx, respectively.
基金National Natural Science Foundation of China,Grant No.52375264.
文摘In response to the shortcomings of Dwarf Mongoose Optimization(DMO)algorithm,such as insufficient exploitation capability and slow convergence speed,this paper proposes a multi-strategy enhanced DMO,referred to as GLSDMO.Firstly,we propose an improved solution search equation that utilizes the Gbest-guided strategy with different parameters to achieve a trade-off between exploration and exploitation(EE).Secondly,the Lévy flight is introduced to increase the diversity of population distribution and avoid the algorithm getting stuck in a local optimum.In addition,in order to address the problem of low convergence efficiency of DMO,this study uses the strong nonlinear convergence factor Sigmaid function as the moving step size parameter of the mongoose during collective activities,and combines the strategy of the salp swarm leader with the mongoose for cooperative optimization,which enhances the search efficiency of agents and accelerating the convergence of the algorithm to the global optimal solution(Gbest).Subsequently,the superiority of GLSDMO is verified on CEC2017 and CEC2019,and the optimization effect of GLSDMO is analyzed in detail.The results show that GLSDMO is significantly superior to the compared algorithms in solution quality,robustness and global convergence rate on most test functions.Finally,the optimization performance of GLSDMO is verified on three classic engineering examples and one truss topology optimization example.The simulation results show that GLSDMO achieves optimal costs on these real-world engineering problems.
文摘Pilot pattern has a significant effect on the performance of channel estimation based on compressed sensing.However,because of the influence of the number of subcarriers and pilots,the complexity of the enumeration method is computationally impractical.The meta-heuristic algorithm of the salp swarm algorithm(SSA)is employed to address this issue.Like most meta-heuristic algorithms,the SSA algorithm is prone to problems such as local optimal values and slow convergence.In this paper,we proposed the CWSSA to enhance the optimization efficiency and robustness by chaotic opposition-based learning strategy,adaptive weight factor,and increasing local search.Experiments show that the test results of the CWSSA on most benchmark functions are better than those of other meta-heuristic algorithms.Besides,the CWSSA algorithm is applied to pilot pattern optimization,and its results are better than other methods in terms of BER and MSE.
基金The authors would like to thank for the support from Taif University Researchers Supporting Project Number(TURSP-2020/239),Taif University,Taif,Saudi Arabia。
文摘CognitiveRadio(CR)has been developed as an enabling technology that allows the unused or underused spectrum to be used dynamically to increase spectral efficiency.To improve the overall performance of the CR systemit is extremely important to adapt or reconfigure the systemparameters.The Decision Engine is a major module in the CR-based system that not only includes radio monitoring and cognition functions but also responsible for parameter adaptation.As meta-heuristic algorithms offer numerous advantages compared to traditional mathematical approaches,the performance of these algorithms is investigated in order to design an efficient CR system that is able to adapt the transmitting parameters to effectively reduce power consumption,bit error rate and adjacent interference of the channel,while maximized secondary user throughput.Self-Learning Salp Swarm Algorithm(SLSSA)is a recent meta-heuristic algorithm that is the enhanced version of SSA inspired by the swarming behavior of salps.In this work,the parametric adaption of CR system is performed by SLSSA and the simulation results show that SLSSA has high accuracy,stability and outperforms other competitive algorithms formaximizing the throughput of secondary users.The results obtained with SLSSA are also shown to be extremely satisfactory and need fewer iterations to converge compared to the competitive methods.
文摘Resource management in Underground Wireless Sensor Networks(UWSNs)is one of the pillars to extend the network lifetime.An intriguing design goal for such networks is to achieve balanced energy and spectral resource utilization.This paper focuses on optimizing the resource efficiency in UWSNs where underground relay nodes amplify and forward sensed data,received from the buried source nodes through a lossy soil medium,to the aboveground base station.A new algorithm called the Hybrid Chaotic Salp Swarm and Crossover(HCSSC)algorithm is proposed to obtain the optimal source and relay transmission powers to maximize the network resource efficiency.The proposed algorithm improves the standard Salp Swarm Algorithm(SSA)by considering a chaotic map to initialize the population along with performing the crossover technique in the position updates of salps.Through experimental results,the HCSSC algorithm proves its outstanding superiority to the standard SSA for resource efficiency optimization.Hence,the network’s lifetime is prolonged.Indeed,the proposed algorithm achieves an improvement performance of 23.6%and 20.4%for the resource efficiency and average remaining relay battery per transmission,respectively.Furthermore,simulation results demonstrate that the HCSSC algorithm proves its efficacy in the case of both equal and different node battery capacities.
基金supported by the National Natural Science Foundation of China(62076185,U1809209)supported by Zhejiang Provincial Natural Science Foundation of China(LY21F020030)+1 种基金Wenzhou Major Scientific and Technological Innovation Project(ZY2019019)Wenzhou Science and Technology Bureau(2018ZG016)。
文摘The Salp Swarm Algorithm(SSA)may have trouble in dropping into stagnation as a kind of swarm intelligence method.This paper developed an adaptive barebones salp swarm algorithm with quasi-oppositional-based learning to compensate for the above weakness called QBSSA.In the proposed QBSSA,an adaptive barebones strategy can help to reach both accurate convergence speed and high solution quality;quasi-oppositional-based learning can make the population away from traping into local optimal and expand the search space.To estimate the performance of the presented method,a series of tests are performed.Firstly,CEC 2017 benchmark test suit is used to test the ability to solve the high dimensional and multimodal problems;then,based on QBSSA,an improved Kernel Extreme Learning Machine(KELM)model,named QBSSA–KELM,is built to handle medical disease diagnosis problems.All the test results and discussions state clearly that the QBSSA is superior to and very competitive to all the compared algorithms on both convergence speed and solutions accuracy.
文摘<div style="text-align:justify;"> In view of the complex problems that freight train ATO (automatic train operation) needs to comprehensively consider punctuality, energy saving and safety, a dynamics model of the freight train operation process is established based on the safety and the freight train dynamics model in the process of its operation. The algorithm of combining elite competition strategy with multi-objective particle swarm optimization technology is introduced, and the winning particles are obtained through the competition between two elite particles to guide the update of other particles, so as to balance the convergence and distribution of multi-objective particle swarm optimization. The performance comparison experimental results verify the superiority of the proposed algorithm. The simulation experiments of the actual line verify the feasibility of the model and the effectiveness of the proposed algorithm. </div>
基金supported by the Key R&D Program of Zhejiang(2022C03114)Zhejiang Provincial Natural Science Foundation of China(LJ19F020001,LZ22F020005)+1 种基金National Natural Science Foundation of China(62076185,U1809209)Guangdong Natural Science Foundation(2021A1515011994).
文摘The Salp Swarm Algorithm (SSA) is a recently proposed swarm intelligence algorithm inspired by salps, a marine creature similar to jellyfish. Despite its simple structure and solid exploratory ability, SSA suffers from low convergence accuracy and slow convergence speed when dealing with some complex problems. Therefore, this paper proposes an improved algorithm based on SSA and adds three improvements. First, the Real-time Update Mechanism (RUM) underwrites the role of ensuring that excellent individual information will not be lost and information exchange will not lag in the iterative process. Second, the Communication Strategy (CMS), on the other hand, uses the multiplicative relationship of multiple individuals to regulate the exploration and exploitation process dynamically. Third, the Selective Replacement Strategy (SRS) is designed to adaptively adjust the variance ratio of individuals to enhance the accuracy and depth of convergence. The new proposal presented in this study is named RCSSSA. The global optimization capability of the algorithm was tested against various high-performance and novel algorithms at IEEE CEC 2014, and its constrained optimization capability was tested at IEEE CEC 2011. The experimental results demonstrate that the proposed algorithm can converge faster while obtaining better optimization results than traditional swarm intelligence and other improved algorithms. The statistical data in the table support its optimization capabilities, and multiple graphs deepen the understanding and analysis of the proposed algorithm.
基金supported by the Key R&D Program of Zhejiang(2022C03114)Zhejiang Provincial Natural Science Foundation of China(LJ19F020001,LZ22F020005)+1 种基金National Natural Science Foundation of China(U1809209,71803136)Guangdong Natural Science Foundation(2021A1515011994).
文摘The Salp Swarm Algorithm(SSA)is a population-based Meta-heuristic Algorithm(MA)that simulates the behavior of a group of salps foraging in the ocean.Although the basic SSA has stable exploration capability and convergence speed,it still can fall into local optimum when solving complex optimization problems,which may be due to low utilization of population information and unbalanced exploration-to-exploitation ratio.Therefore,this study proposes a Double Mutation Salp Swarm Algorithm(DMSSA).In this study,a Cuckoo Mutation Strategy(CMS)and an Adaptive DE Mutation Strategy(ADMS)are introduced into the structure of the original SSA.The former mutation strategy is summarized as three basic operations:judgment,shuffling,and mutation.The purpose is to fully consider the information among search agents and use the differences between different search agents to participate in the update of positions,making the optimization process both diverse in exploration and minor in randomness.The latter strategy employs three basic operations:selection,mutation,and adaptation.As the follower part,some individuals do not blindly adopt the original follow method.Instead,the global optimal position and differences are considered,and the variation factor is adjusted adaptively,allowing the new algorithm to balance exploration,exploitation,and convergence efficiency.To evaluate the performance of DMSSA,comparisons are made with numerous algorithms on 30 IEEE CEC2014 benchmark functions.The statistical results confirm the better performance and significant difference of DMSSA in solving benchmark function tests.Finally,the applicability and scalability of DMSSA to optimization problems with constraints are further confirmed in three experiments on classical engineering design optimization problems.The source code of the proposed algorithm will be available at:https://github.com/ncjsq/Double-Mutational-Salp-Swarm-Algorithm.
基金the National Natural Science Foundation of China(No.51474100)the Youth Science Fund of Heilongjiang Province in China(No.QC2010023)the Youth Outstanding Ability Program in Heilongjiang University of Science and Technology
文摘To consider multi-objective optimization problem with the number of feed array elements and sidelobe level of large antenna array, multi-objective cross entropy(CE) algorithm is proposed by combining fuzzy c-mean clustering algorithm with traditional cross entropy algorithm, and specific program flow of the algorithm is given.Using the algorithm, large thinned array(200 elements) given sidelobe level(-10,-19 and-30 d B) problem is solved successfully. Compared with the traditional statistical algorithms, the optimization results of the algorithm validate that the number of feed array elements reduces by 51%, 11% and 6% respectively. In addition, compared with the particle swarm optimization(PSO) algorithm, the number of feed array elements from the algorithm is more similar, but the algorithm is more efficient.
基金National Natural Science Foundations of China(Nos.61222303,21276078)National High-Tech Research and Development Program of China(No.2012AA040307)+1 种基金New Century Excellent Researcher Award Program from Ministry of Education of China(No.NCET10-0885)the Fundamental Research Funds for the Central Universities and Shanghai Leading Academic Discipline Project,China(No.B504)
文摘Dynamic multi-objective optimization is a complex and difficult research topic of process systems engineering. In this paper,a modified multi-objective bare-bones particle swarm optimization( MOBBPSO) algorithm is proposed that takes advantage of a few parameters of bare-bones algorithm. To avoid premature convergence,Gaussian mutation is introduced; and an adaptive sampling distribution strategy is also used to improve the exploratory capability. Moreover, a circular crowded sorting approach is adopted to improve the uniformity of the population distribution.Finally, by combining the algorithm with control vector parameterization,an approach is proposed to solve the dynamic optimization problems of chemical processes. It is proved that the new algorithm performs better compared with other classic multiobjective optimization algorithms through the results of solving three dynamic optimization problems.
文摘In response to the shortcomings of the Salp Swarm Algorithm (SSA) such as low convergence accuracy and slow convergence speed, a Multi-Strategy-Driven Salp Swarm Algorithm (MSD-SSA) was proposed. First, food sources or random leaders were associated with the current bottle sea squirt at the beginning of the iteration, to which Levy flight random walk and crossover operators with small probability were added to improve the global search and ability to jump out of local optimum. Secondly, the position mean of the leader was used to establish a link with the followers, which effectively avoided the blind following of the followers and greatly improved the convergence speed of the algorithm. Finally, Brownian motion stochastic steps were introduced to improve the convergence accuracy of populations near food sources. The improved method switched under changes in the adaptive parameters, balancing the exploration and development of SSA. In the simulation experiments, the performance of the algorithm was examined using SSA and MSD-SSA on the commonly used CEC benchmark test functions and CEC2017-constrained optimization problems, and the effectiveness of MSD-SSA was verified by solving three real engineering problems. The results showed that MSD-SSA improved the convergence speed and convergence accuracy of the algorithm, and achieved good results in practical engineering problems.
基金Foundation item： National Natural Science Foundation of China （10377015）
文摘The pylon structure of an airplane is very complex, and its high-fidelity analysis is quite time-consuming. If posterior preference optimization algorithm is used to solve this problem, the huge time consumption will be unacceptable in engineering practice due to the large amount of evaluation needed for the algorithm. So, a new interactive optimization algorithm-interactive multi-objective particle swarm optimization （IMOPSO） is presented. IMOPSO is efficient, simple and operable. The decision-maker can expediently determine the accurate preference in IMOPSO. IMOPSO is used to perform the pylon structure optimization design of an airplane, and a satisfactory design is achieved after only 12 generations of IMOPSO evolutions. Compared with original design, the maximum displacement of the satisfactory design is reduced, and the mass of the satisfactory design is decreased for 22%.
基金Project(2012B091100444)supported by the Production,Education and Research Cooperative Program of Guangdong Province and Ministry of Education,ChinaProject(2013ZM0091)supported by Fundamental Research Funds for the Central Universities of China
文摘To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.
基金supported by the National Natural Science Foundation of China (No.11402288)
文摘Based on improved multi-objective particle swarm optimization（MOPSO） algorithm with principal component analysis（PCA） methodology, an efficient high-dimension multiobjective optimization method is proposed, which, as the purpose of this paper, aims to improve the convergence of Pareto front in multi-objective optimization design. The mathematical efficiency,the physical reasonableness and the reliability in dealing with redundant objectives of PCA are verified by typical DTLZ5 test function and multi-objective correlation analysis of supercritical airfoil,and the proposed method is integrated into aircraft multi-disciplinary design（AMDEsign） platform, which contains aerodynamics, stealth and structure weight analysis and optimization module.Then the proposed method is used for the multi-point integrated aerodynamic optimization of a wide-body passenger aircraft, in which the redundant objectives identified by PCA are transformed to optimization constraints, and several design methods are compared. The design results illustrate that the strategy used in this paper is sufficient and multi-point design requirements of the passenger aircraft are reached. The visualization level of non-dominant Pareto set is improved by effectively reducing the dimension without losing the primary feature of the problem.
文摘To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.
文摘In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.
