An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), whic...An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), which is used to replace the global best position (gbest). It is compared with the standard PSO algorithm invented by Kennedy and Eberhart and some improved PSO algorithms based on three different benchmark functions. The simulation results show that the improved PSO based on ensemble technique can get better solutions than the standard PSO and some other improved algorithms under all test cases.展开更多
The previous particle swarm optimizers lack direct mechanism to prevent particles beyond predefined search space, which results in invalid solutions in some special cases. A momentum factor is introduced into the orig...The previous particle swarm optimizers lack direct mechanism to prevent particles beyond predefined search space, which results in invalid solutions in some special cases. A momentum factor is introduced into the original particle swarm optimizer to resolve this problem. Furthermore, in order to accelerate convergence, a new strategy about updating velocities is given. The resulting approach is mromentum-PSO which guarantees that particles are never beyond predefined search space without checking boundary in every iteration. In addition, linearly decreasing wight PSO （LDW-PSO） equipped with a boundary checking strategy is also discussed, which is denoted as LDWBC-PSO. LDW-PSO, LDWBC-PSO and momentum-PSO are compared in optimization on five test functions. The experimental results show that in some special cases LDW-PSO finds invalid solutions and LDWBC-PSO has poor performance, while momentum-PSO not only exhibits good performance but also reduces computational cost for updating velocities.展开更多
The simultaneous transmitting and reflecting reconfigurable intelligent surface(STAR-RIS)can independently adjust surface’s reflection and transmission coefficients so as to enhance space coverage.For a multiple-inpu...The simultaneous transmitting and reflecting reconfigurable intelligent surface(STAR-RIS)can independently adjust surface’s reflection and transmission coefficients so as to enhance space coverage.For a multiple-input multiple-output(MIMO)communication system with a STAR-RIS,a base station(BS),an eavesdropper,and multiple users,the system security rate is studied.A joint design of the power allocation at the transmitter and phase shift matrices for reflection and transmission at the STAR-RIS is conducted,in order to maximize the worst achievable security data rate(ASDR).Since the problem is nonconvex and hence challenging,a particle swarm optimization(PSO)based algorithm is developed to tackle the problem.Both the cases of continuous and discrete phase shift matrices at the STAR-RIS are considered.Simulation results demonstrate the effectiveness of the proposed algorithm and shows the benefits of using STAR-RIS in MIMO mutliuser systems.展开更多
In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired ...In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired by division of the same species into multiple swarms for different objectives and information sharing among these swarms in nature, each physical machine in the data center is considered a swarm and employs improved multi-objective particle swarm optimization to find out non-dominated solutions with one objective in MSMOOA. The particles in each swarm are divided into two classes and adopt different strategies to evolve cooperatively. One class of particles can communicate with several swarms simultaneously to promote the information sharing among swarms and the other class of particles can only exchange information with the particles located in the same swarm. Furthermore, in order to avoid the influence by the elastic available resources, a manager server is adopted in the cloud data center to collect the available resources for scheduling. The quality of the proposed method with other related approaches is evaluated by using hybrid and parallel workflow applications. The experiment results highlight the better performance of the MSMOOA than that of compared algorithms.展开更多
Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence reg...Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence regions.In this paper,we propose an iterative dynamic diversity evolutionary algorithm(IDDEA)with contractive subregions guiding exploitation through local extrema to the global optimum in suitable steps.In IDDEA,a novel optimum estimation strategy with multi-agents evolving diversely is suggested to e?ciently compute dominance trend and establish a subregion.In addition,a subregion converging iteration is designed to redistrict a smaller subregion in current subregion for next iteration,which is based on a special dominance estimation scheme.Meanwhile,an infimum penalty function is embedded into IDDEA to judge agents and penalize adaptively the unfeasible agents with the lowest fitness of feasible agents.Furthermore,several engineering design optimization problems taken from the specialized literature are successfully solved by the present algorithm with high reliable solutions.展开更多
A novel optimization algorithm called stochastic focusing search （SFS） for the real-parameter optimization is proposed. The new algorithm is a swarm intelligence algorithm, which is based on simulating the act of hu...A novel optimization algorithm called stochastic focusing search （SFS） for the real-parameter optimization is proposed. The new algorithm is a swarm intelligence algorithm, which is based on simulating the act of human randomized searching, and the human searching behaviors. The algorithm＇s performance is studied using a challenging set of typically complex functions with comparison of differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms, and the simulation results show that SFS is competitive to solve most parts of the benchmark problems and will become a promising candidate of search algorithms especially when the existing algorithms have some difficulties in solving certain problems.展开更多
With the continuous improvement of radar intelligence, it is difficult for traditional countermeasures to achieve ideal results. In order to deal with complex, changeable, and unknown threat signals in the complex ele...With the continuous improvement of radar intelligence, it is difficult for traditional countermeasures to achieve ideal results. In order to deal with complex, changeable, and unknown threat signals in the complex electromagnetic environment, a waveform intelligent optimization model based on intelligent optimization algorithm is proposed. By virtue of the universality and fast running speed of the intelligent optimization algorithm, the model can optimize the parameters used to synthesize the countermeasure waveform according to different external signals, so as to improve the countermeasure performance.Genetic algorithm(GA) and particle swarm optimization(PSO)are used to simulate the intelligent optimization of interruptedsampling and phase-modulation repeater waveform. The experimental results under different radar signal conditions show that the scheme is feasible. The performance comparison between the algorithms and some problems in the experimental results also provide a certain reference for the follow-up work.展开更多
Field computation, an emerging computation technique, has inspired passion of intelligence science research. A novel field computation model based on the magnetic field theory is constructed. The proposed magnetic fie...Field computation, an emerging computation technique, has inspired passion of intelligence science research. A novel field computation model based on the magnetic field theory is constructed. The proposed magnetic field computation （MFC） model consists of a field simulator, a non-derivative optimization algo- rithm and an auxiliary data processing unit. The mathematical model is deduced and proved that the MFC model is equivalent to a quadratic discriminant function. Furthermore, the finite element prototype is derived, and the simulator is developed, combining with particle swarm optimizer for the field configuration. Two benchmark classification experiments are studied in the numerical experiment, and one notable advantage is demonstrated that less training samples are required and a better generalization can be achieved.展开更多
文摘An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), which is used to replace the global best position (gbest). It is compared with the standard PSO algorithm invented by Kennedy and Eberhart and some improved PSO algorithms based on three different benchmark functions. The simulation results show that the improved PSO based on ensemble technique can get better solutions than the standard PSO and some other improved algorithms under all test cases.
文摘The previous particle swarm optimizers lack direct mechanism to prevent particles beyond predefined search space, which results in invalid solutions in some special cases. A momentum factor is introduced into the original particle swarm optimizer to resolve this problem. Furthermore, in order to accelerate convergence, a new strategy about updating velocities is given. The resulting approach is mromentum-PSO which guarantees that particles are never beyond predefined search space without checking boundary in every iteration. In addition, linearly decreasing wight PSO （LDW-PSO） equipped with a boundary checking strategy is also discussed, which is denoted as LDWBC-PSO. LDW-PSO, LDWBC-PSO and momentum-PSO are compared in optimization on five test functions. The experimental results show that in some special cases LDW-PSO finds invalid solutions and LDWBC-PSO has poor performance, while momentum-PSO not only exhibits good performance but also reduces computational cost for updating velocities.
文摘The simultaneous transmitting and reflecting reconfigurable intelligent surface(STAR-RIS)can independently adjust surface’s reflection and transmission coefficients so as to enhance space coverage.For a multiple-input multiple-output(MIMO)communication system with a STAR-RIS,a base station(BS),an eavesdropper,and multiple users,the system security rate is studied.A joint design of the power allocation at the transmitter and phase shift matrices for reflection and transmission at the STAR-RIS is conducted,in order to maximize the worst achievable security data rate(ASDR).Since the problem is nonconvex and hence challenging,a particle swarm optimization(PSO)based algorithm is developed to tackle the problem.Both the cases of continuous and discrete phase shift matrices at the STAR-RIS are considered.Simulation results demonstrate the effectiveness of the proposed algorithm and shows the benefits of using STAR-RIS in MIMO mutliuser systems.
基金Project(61473078)supported by the National Natural Science Foundation of ChinaProject(2015-2019)supported by the Program for Changjiang Scholars from the Ministry of Education,China+1 种基金Project(16510711100)supported by International Collaborative Project of the Shanghai Committee of Science and Technology,ChinaProject(KJ2017A418)supported by Anhui University Science Research,China
文摘In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired by division of the same species into multiple swarms for different objectives and information sharing among these swarms in nature, each physical machine in the data center is considered a swarm and employs improved multi-objective particle swarm optimization to find out non-dominated solutions with one objective in MSMOOA. The particles in each swarm are divided into two classes and adopt different strategies to evolve cooperatively. One class of particles can communicate with several swarms simultaneously to promote the information sharing among swarms and the other class of particles can only exchange information with the particles located in the same swarm. Furthermore, in order to avoid the influence by the elastic available resources, a manager server is adopted in the cloud data center to collect the available resources for scheduling. The quality of the proposed method with other related approaches is evaluated by using hybrid and parallel workflow applications. The experiment results highlight the better performance of the MSMOOA than that of compared algorithms.
基金Supported by National Natural Science Foundation of China(61074020)
文摘Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence regions.In this paper,we propose an iterative dynamic diversity evolutionary algorithm(IDDEA)with contractive subregions guiding exploitation through local extrema to the global optimum in suitable steps.In IDDEA,a novel optimum estimation strategy with multi-agents evolving diversely is suggested to e?ciently compute dominance trend and establish a subregion.In addition,a subregion converging iteration is designed to redistrict a smaller subregion in current subregion for next iteration,which is based on a special dominance estimation scheme.Meanwhile,an infimum penalty function is embedded into IDDEA to judge agents and penalize adaptively the unfeasible agents with the lowest fitness of feasible agents.Furthermore,several engineering design optimization problems taken from the specialized literature are successfully solved by the present algorithm with high reliable solutions.
基金supported by the Doctor Students Innovation Foundation of Southwest Jiaotong University.
文摘A novel optimization algorithm called stochastic focusing search （SFS） for the real-parameter optimization is proposed. The new algorithm is a swarm intelligence algorithm, which is based on simulating the act of human randomized searching, and the human searching behaviors. The algorithm＇s performance is studied using a challenging set of typically complex functions with comparison of differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms, and the simulation results show that SFS is competitive to solve most parts of the benchmark problems and will become a promising candidate of search algorithms especially when the existing algorithms have some difficulties in solving certain problems.
文摘With the continuous improvement of radar intelligence, it is difficult for traditional countermeasures to achieve ideal results. In order to deal with complex, changeable, and unknown threat signals in the complex electromagnetic environment, a waveform intelligent optimization model based on intelligent optimization algorithm is proposed. By virtue of the universality and fast running speed of the intelligent optimization algorithm, the model can optimize the parameters used to synthesize the countermeasure waveform according to different external signals, so as to improve the countermeasure performance.Genetic algorithm(GA) and particle swarm optimization(PSO)are used to simulate the intelligent optimization of interruptedsampling and phase-modulation repeater waveform. The experimental results under different radar signal conditions show that the scheme is feasible. The performance comparison between the algorithms and some problems in the experimental results also provide a certain reference for the follow-up work.
基金supported by the National Natural Science Foundation of China(60903005)the National Basic Research Program of China(973 Program)(2012CB821206)
文摘Field computation, an emerging computation technique, has inspired passion of intelligence science research. A novel field computation model based on the magnetic field theory is constructed. The proposed magnetic field computation （MFC） model consists of a field simulator, a non-derivative optimization algo- rithm and an auxiliary data processing unit. The mathematical model is deduced and proved that the MFC model is equivalent to a quadratic discriminant function. Furthermore, the finite element prototype is derived, and the simulator is developed, combining with particle swarm optimizer for the field configuration. Two benchmark classification experiments are studied in the numerical experiment, and one notable advantage is demonstrated that less training samples are required and a better generalization can be achieved.
