An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and sa...An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.展开更多
The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the proble...The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in- sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm （ACEDA） is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA called Archimedean copula estima- tion of distribution based on the artificial bee colony （ACABC） algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench- mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen- tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best （gbest）-guided ABC （GABC） algorithm in most of the experiments.展开更多
The multi-compartment electric vehicle routing problem(EVRP)with soft time window and multiple charging types(MCEVRP-STW&MCT)is studied,in which electric multi-compartment vehicles that are environmentally friendl...The multi-compartment electric vehicle routing problem(EVRP)with soft time window and multiple charging types(MCEVRP-STW&MCT)is studied,in which electric multi-compartment vehicles that are environmentally friendly but need to be recharged in course of transport process,are employed.A mathematical model for this optimization problem is established with the objective of minimizing the function composed of vehicle cost,distribution cost,time window penalty cost and charging service cost.To solve the problem,an estimation of the distribution algorithm based on Lévy flight(EDA-LF)is proposed to perform a local search at each iteration to prevent the algorithm from falling into local optimum.Experimental results demonstrate that the EDA-LF algorithm can find better solutions and has stronger robustness than the basic EDA algorithm.In addition,when comparing with existing algorithms,the result shows that the EDA-LF can often get better solutions in a relatively short time when solving medium and large-scale instances.Further experiments show that using electric multi-compartment vehicles to deliver incompatible products can produce better results than using traditional fuel vehicles.展开更多
In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in paral...In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in parallel. The search space was projected into multiple subspaces and searched by sub-populations. Also, the whole space was exploited by the other population which exchanges information with the sub-populations. In order to make the evolutionary course efficient, multivariate Gaussian model and Gaussian mixture model were used in both populations separately to estimate the distribution of individuals and reproduce new generations. For the surrogate model, Gaussian process was combined with the algorithm which predicted variance of the predictions. The results on six benchmark functions show that the new algorithm performs better than other surrogate-model based algorithms and the computation complexity is only 10% of the original estimation of distribution algorithm.展开更多
The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this wor...The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.展开更多
Accurate modeling and parameter estimation of sea clutter are fundamental for effective sea surface target detection.With the improvement of radar resolution,sea clutter exhibits a pronounced heavy-tailed characterist...Accurate modeling and parameter estimation of sea clutter are fundamental for effective sea surface target detection.With the improvement of radar resolution,sea clutter exhibits a pronounced heavy-tailed characteristic,rendering traditional distribution models and parameter estimation methods less effective.To address this,this paper proposes a dual compound-Gaussian model with inverse Gaussian texture(CG-IG)distribution model and combines it with an improved Adam algorithm to introduce a method for parameter correction.This method effectively fits sea clutter with heavy-tailed characteristics.Experiments with real measured sea clutter data show that the dual CGIG distribution model,after parameter correction,accurately describes the heavy-tailed phenomenon in sea clutter amplitude distribution,and the overall mean square error of the distribution is reduced.展开更多
Time-frequency-based methods are proven to be effective for parameter estimation of linear frequency modulation （LFM） signals. The smoothed pseudo Winger-Ville distribution （SPWVD） is used for the parameter estima...Time-frequency-based methods are proven to be effective for parameter estimation of linear frequency modulation （LFM） signals. The smoothed pseudo Winger-Ville distribution （SPWVD） is used for the parameter estimation of multi-LFM signals, and a method of the SPWVD binarization by a dynamic threshold based on the Otsu algorithm is proposed. The proposed method is effective in the demand for the estimation of different parameters and the unknown signal-to-noise ratio （SNR） circumstance. The performance of this method is confirmed by numerical simulation.展开更多
The improved weighted-least-square model was used for state simulation of water distribution networks. And DFP algorithm was applied to get the model solution. In order to fit DFP algorithm,the initial model was trans...The improved weighted-least-square model was used for state simulation of water distribution networks. And DFP algorithm was applied to get the model solution. In order to fit DFP algorithm,the initial model was transformed into a non-constrained optimization problem using mass conservation. Then,through one dimensional optimization and scale matrix establishment,the feasible direction of iteration was obtained,and the values of state variables could be calculated. After several iterations,the optimal estimates of state variables were worked out and state simulation of water distribution networks was achieved as a result. A program of DFP algorithm is developed with Delphi 7 for verification. By running on a designed network,which is composed of 55 nodes,94 pipes and 40 loops,it is proved that DFP algorithm can quickly get the convergence. After 36 iterations,the root mean square of all nodal head errors is reduced by 90.84% from 5.57 to 0.51 m,and the maximum error is only 1.30 m. Compared to Marquardt algorithm,the procedure of DFP algorithm is more stable,and the initial values have less influences on calculation accuracy. Therefore,DFP algorithm can be used for real-time simulation of water distribution networks.展开更多
Single passive sensor tracking algorithms have four disadvantages: bad stability, longdynamic time, big bias and sensitive to initial conditions. So the corresponding fusion algorithm results in bad performance. A new...Single passive sensor tracking algorithms have four disadvantages: bad stability, longdynamic time, big bias and sensitive to initial conditions. So the corresponding fusion algorithm results in bad performance. A new error analysis method for two passive sensor tracking system is presented and the error equations are deduced in detail. Based on the equations, we carry out theoretical computation and Monte Carlo computer simulation. The results show the correctness of our error computation equations. With the error equations, we present multiple 'two station'fusion algorithm using adaptive pseudo measurement equations. This greatly enhances the tracking performance and makes the algorithm convergent very fast and not sensitive to initial conditions.Simulation results prove the correctness of our new algorithm.展开更多
Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and miss...Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.展开更多
Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their c...Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their coordinates. Once there are not anchors to be deployed, those localization algorithms will be invalidated. Many papers in this field focus on anchor-based solutions. The use of anchors introduces many limitations, since anchors require external equipments such as global position system, cause additional power consumption. A novel positioning algorithm is proposed to use a virtual coordinate system based on a new concept--virtual anchor. It is executed in a distributed fashion according to the connectivity of a node and the measured distances to its neighbors. Both the adjacent member information and the ranging distance result are combined to generate the estimated position of a network, one of which is independently adopted for localization previously. At the position refinement stage the intermediate estimation of a node begins to be evaluated on its reliability for position mutation; thus the positioning optimization process of the whole network is avoided falling into a local optimal solution. Simulation results prove that the algorithm can resolve the distributed localization problem for anchor-free sensor networks, and is superior to previous methods in terms of its positioning capability under a variety of circumstances.展开更多
构造了一种基于Alopex(Algorithm of pattern extraction)和分布估计算法(Estimation of distribution algorithm,EDA)相融合的进化算法EDA-Alopex。该算法将分布估计算法嵌入到一种基于Alopex的群智能进化算法(Alopex-based evolutiona...构造了一种基于Alopex(Algorithm of pattern extraction)和分布估计算法(Estimation of distribution algorithm,EDA)相融合的进化算法EDA-Alopex。该算法将分布估计算法嵌入到一种基于Alopex的群智能进化算法(Alopex-based evolutionary algorithm,AEA)中,利用分布估计算法收敛速度快及与传统进化算法进化模式不同的特点来改进AEA算法。新算法综合了AEA算法搜索得到的个体间相关性信息和EDA搜索过程中得到的全局概率信息,能够更好地指导种群向有利的区域进化。仿真结果表明:EDA改进的EDA-Alopex算法搜索性能与AEA算法的搜索性能相比有较大提高,特别是其收敛速度与AEA算法相比有明显提高。展开更多
基金supported by the National Key Research and Development Program(2021YFB3502500).
文摘An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.
基金supported by the National Natural Science Foundation of China(61201370)the Special Funding Project for Independent Innovation Achievement Transform of Shandong Province(2012CX30202)the Natural Science Foundation of Shandong Province(ZR2014FM039)
文摘The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in- sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm （ACEDA） is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA called Archimedean copula estima- tion of distribution based on the artificial bee colony （ACABC） algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench- mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen- tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best （gbest）-guided ABC （GABC） algorithm in most of the experiments.
基金supported by the National Natural Science Foundation of China(71571076)the National Key R&D Program for the 13th-Five-Year-Plan of China(2018YFF0300301).
文摘The multi-compartment electric vehicle routing problem(EVRP)with soft time window and multiple charging types(MCEVRP-STW&MCT)is studied,in which electric multi-compartment vehicles that are environmentally friendly but need to be recharged in course of transport process,are employed.A mathematical model for this optimization problem is established with the objective of minimizing the function composed of vehicle cost,distribution cost,time window penalty cost and charging service cost.To solve the problem,an estimation of the distribution algorithm based on Lévy flight(EDA-LF)is proposed to perform a local search at each iteration to prevent the algorithm from falling into local optimum.Experimental results demonstrate that the EDA-LF algorithm can find better solutions and has stronger robustness than the basic EDA algorithm.In addition,when comparing with existing algorithms,the result shows that the EDA-LF can often get better solutions in a relatively short time when solving medium and large-scale instances.Further experiments show that using electric multi-compartment vehicles to deliver incompatible products can produce better results than using traditional fuel vehicles.
基金Project(2009CB320603)supported by the National Basic Research Program of ChinaProject(IRT0712)supported by Program for Changjiang Scholars and Innovative Research Team in University+1 种基金Project(B504)supported by the Shanghai Leading Academic Discipline ProgramProject(61174118)supported by the National Natural Science Foundation of China
文摘In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in parallel. The search space was projected into multiple subspaces and searched by sub-populations. Also, the whole space was exploited by the other population which exchanges information with the sub-populations. In order to make the evolutionary course efficient, multivariate Gaussian model and Gaussian mixture model were used in both populations separately to estimate the distribution of individuals and reproduce new generations. For the surrogate model, Gaussian process was combined with the algorithm which predicted variance of the predictions. The results on six benchmark functions show that the new algorithm performs better than other surrogate-model based algorithms and the computation complexity is only 10% of the original estimation of distribution algorithm.
基金Projects(61573144,61773165,61673175,61174040)supported by the National Natural Science Foundation of ChinaProject(222201717006)supported by the Fundamental Research Funds for the Central Universities,China
文摘The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.
文摘Accurate modeling and parameter estimation of sea clutter are fundamental for effective sea surface target detection.With the improvement of radar resolution,sea clutter exhibits a pronounced heavy-tailed characteristic,rendering traditional distribution models and parameter estimation methods less effective.To address this,this paper proposes a dual compound-Gaussian model with inverse Gaussian texture(CG-IG)distribution model and combines it with an improved Adam algorithm to introduce a method for parameter correction.This method effectively fits sea clutter with heavy-tailed characteristics.Experiments with real measured sea clutter data show that the dual CGIG distribution model,after parameter correction,accurately describes the heavy-tailed phenomenon in sea clutter amplitude distribution,and the overall mean square error of the distribution is reduced.
基金supported by the National Natural Science Foundation of China (61302188)the Nanjing University of Science and Technology Research Foundation (2010ZDJH05)
文摘Time-frequency-based methods are proven to be effective for parameter estimation of linear frequency modulation （LFM） signals. The smoothed pseudo Winger-Ville distribution （SPWVD） is used for the parameter estimation of multi-LFM signals, and a method of the SPWVD binarization by a dynamic threshold based on the Otsu algorithm is proposed. The proposed method is effective in the demand for the estimation of different parameters and the unknown signal-to-noise ratio （SNR） circumstance. The performance of this method is confirmed by numerical simulation.
基金Project(IRT0853) supported by Changjiang Scholars and Innovative Research Team in UniversityProject(DB03086) supported by Talents Fund of Xi’an University of Architecture and TechnologyProject(50978213) supported by National Natural Science Foundation
文摘The improved weighted-least-square model was used for state simulation of water distribution networks. And DFP algorithm was applied to get the model solution. In order to fit DFP algorithm,the initial model was transformed into a non-constrained optimization problem using mass conservation. Then,through one dimensional optimization and scale matrix establishment,the feasible direction of iteration was obtained,and the values of state variables could be calculated. After several iterations,the optimal estimates of state variables were worked out and state simulation of water distribution networks was achieved as a result. A program of DFP algorithm is developed with Delphi 7 for verification. By running on a designed network,which is composed of 55 nodes,94 pipes and 40 loops,it is proved that DFP algorithm can quickly get the convergence. After 36 iterations,the root mean square of all nodal head errors is reduced by 90.84% from 5.57 to 0.51 m,and the maximum error is only 1.30 m. Compared to Marquardt algorithm,the procedure of DFP algorithm is more stable,and the initial values have less influences on calculation accuracy. Therefore,DFP algorithm can be used for real-time simulation of water distribution networks.
文摘Single passive sensor tracking algorithms have four disadvantages: bad stability, longdynamic time, big bias and sensitive to initial conditions. So the corresponding fusion algorithm results in bad performance. A new error analysis method for two passive sensor tracking system is presented and the error equations are deduced in detail. Based on the equations, we carry out theoretical computation and Monte Carlo computer simulation. The results show the correctness of our error computation equations. With the error equations, we present multiple 'two station'fusion algorithm using adaptive pseudo measurement equations. This greatly enhances the tracking performance and makes the algorithm convergent very fast and not sensitive to initial conditions.Simulation results prove the correctness of our new algorithm.
文摘Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.
基金the National Natural Science Foundation of China (60673054, 60773129)theExcellent Youth Science and Technology Foundation of Anhui Province of China.
文摘Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their coordinates. Once there are not anchors to be deployed, those localization algorithms will be invalidated. Many papers in this field focus on anchor-based solutions. The use of anchors introduces many limitations, since anchors require external equipments such as global position system, cause additional power consumption. A novel positioning algorithm is proposed to use a virtual coordinate system based on a new concept--virtual anchor. It is executed in a distributed fashion according to the connectivity of a node and the measured distances to its neighbors. Both the adjacent member information and the ranging distance result are combined to generate the estimated position of a network, one of which is independently adopted for localization previously. At the position refinement stage the intermediate estimation of a node begins to be evaluated on its reliability for position mutation; thus the positioning optimization process of the whole network is avoided falling into a local optimal solution. Simulation results prove that the algorithm can resolve the distributed localization problem for anchor-free sensor networks, and is superior to previous methods in terms of its positioning capability under a variety of circumstances.
文摘构造了一种基于Alopex(Algorithm of pattern extraction)和分布估计算法(Estimation of distribution algorithm,EDA)相融合的进化算法EDA-Alopex。该算法将分布估计算法嵌入到一种基于Alopex的群智能进化算法(Alopex-based evolutionary algorithm,AEA)中,利用分布估计算法收敛速度快及与传统进化算法进化模式不同的特点来改进AEA算法。新算法综合了AEA算法搜索得到的个体间相关性信息和EDA搜索过程中得到的全局概率信息,能够更好地指导种群向有利的区域进化。仿真结果表明:EDA改进的EDA-Alopex算法搜索性能与AEA算法的搜索性能相比有较大提高,特别是其收敛速度与AEA算法相比有明显提高。
