Dear Editor,Through distributed machine learning,multi-UAV systems can achieve global optimization goals without a centralized server,such as optimal target tracking,by leveraging local calculation and communication w...Dear Editor,Through distributed machine learning,multi-UAV systems can achieve global optimization goals without a centralized server,such as optimal target tracking,by leveraging local calculation and communication with neighbors.In this work,we implement the stochastic gradient descent algorithm(SGD)distributedly to optimize tracking errors based on local state and aggregation of the neighbors'estimation.However,Byzantine agents can mislead neighbors,causing deviations from optimal tracking.We prove that the swarm achieves resilient convergence if aggregated results lie within the normal neighbors'convex hull,which can be guaranteed by the introduced centerpoint-based aggregation rule.In the given simulated scenarios,distributed learning using average,geometric median(GM),and coordinate-wise median(CM)based aggregation rules fail to track the target.Compared to solely using the centerpoint aggregation method,our approach,which combines a pre-filter with the centroid aggregation rule,significantly enhances resilience against Byzantine attacks,achieving faster convergence and smaller tracking errors.展开更多
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.展开更多
How to obtain accurate channel state information(CSI)at the transmitter with less pilot overhead for frequency division duplexing(FDD) massive multiple-input multiple-output(MIMO)system is a challenging issue due to t...How to obtain accurate channel state information(CSI)at the transmitter with less pilot overhead for frequency division duplexing(FDD) massive multiple-input multiple-output(MIMO)system is a challenging issue due to the large number of antennas. To reduce the overwhelming pilot overhead, a hybrid orthogonal and non-orthogonal pilot distribution at the base station(BS),which is a generalization of the existing pilot distribution scheme,is proposed by exploiting the common sparsity of channel due to the compact antenna arrangement. Then the block sparsity for antennas with hybrid pilot distribution is derived respectively and can be used to obtain channel impulse response. By employing the theoretical analysis of block sparse recovery, the total coherence criterion is proposed to optimize the sensing matrix composed by orthogonal pilots. Due to the huge complexity of optimal pilot acquisition, a genetic algorithm based pilot allocation(GAPA) algorithm is proposed to acquire optimal pilot distribution locations with fast convergence. Furthermore, the Cramer Rao lower bound is derived for non-orthogonal pilot-based channel estimation and can be asymptotically approached by the prior support set, especially when the optimized pilot is employed.展开更多
Estimation of distribution algorithms are a class of evolutionary optimization algorithms based on probability distribution model. In this article, a Pareto-based multi-objective estimation of distribution algorithm w...Estimation of distribution algorithms are a class of evolutionary optimization algorithms based on probability distribution model. In this article, a Pareto-based multi-objective estimation of distribution algorithm with multivariate T-copulas is proposed. The algorithm employs Pareto-based approach and multivariate T-copulas to construct probability distribution model. To estimate joint distribution of the selected solutions, the correlation matrix of T-copula is firstly estimated by estimating Kendall’s tau and using the relationship of Kendall’s tau and correlation matrix. After the correlation matrix is estimated, the degree of freedom of T-copula is estimated by using the maximum likelihood method. Afterwards, the Monte Carte simulation is used to generate new individuals. An archive with maximum capacity is used to maintain the non-dominated solutions. The Pareto optimal solutions are selected from the archive on the basis of the diversity of the solutions, and the crowding-distance measure is used for the diversity measurement. The archive gets updated with the inclusion of the non-dominated solutions from the combined population and current archive, and the archive which exceeds the maximum capacity is cut using the diversity consideration. The proposed algorithm is applied to some well-known benchmark. The relative experimental results show that the algorithm has better performance and is effective.展开更多
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.展开更多
In this paper, we present a distributed consensus-based algorithm to solve the social welfare maximization problem. This is one of typical problems of distributed energy management in smart grid. In this problem, we c...In this paper, we present a distributed consensus-based algorithm to solve the social welfare maximization problem. This is one of typical problems of distributed energy management in smart grid. In this problem, we consider not only the generator and demand, but also the transmission losses which make the feasibility set of the formulated problem a non-convex set. In solving this issue, we find a noticeable result that the primal problem has the same solution with a new convex optimization problem by getting the utmost out of the implied term in practice. Considering the general communication topology among generators and demands, we first design a finite step algorithm to make each generator and demand know the information of parameters of others.Then, we design a distributed algorithm and also prove the optimality and convergence of the proposed algorithm. Finally, the convergence and optimality are examined through extensive simulations.展开更多
实数编码的多目标进化算法常使用模拟二进制交叉(simulated binary crossover,称SBX)算子.通过对SBX以及进化策略中变异算子进行对比分析,并引入进化策略中的离散重组算子,提出了一种正态分布交叉(normal distribution crossover,称NDX...实数编码的多目标进化算法常使用模拟二进制交叉(simulated binary crossover,称SBX)算子.通过对SBX以及进化策略中变异算子进行对比分析,并引入进化策略中的离散重组算子,提出了一种正态分布交叉(normal distribution crossover,称NDX)算子.首先在一维搜索空间实例中对NDX与SBX算子进行比较和分析,然后将NDX算子应用于Deb等人提出的稳态多目标进化算法ε-MOEA(ε-dominance based multiobjective evolutionary algorithm)中.采用NDX算子的ε-MOEA(记为ε-MOEA/NDX)算法在多目标优化标准测试集ZDT和DTLZ的10个函数上进行了实验比较.实验结果和分析表明,采用NDX的ε-MOEA所求得的Pareto最优解集质量明显优于经典算法ε-MOEA/SBX和NSGA-Ⅱ.展开更多
为降低低密度奇偶校验(LDPC:Low-Density Parity-Cheek)码译码算法的复杂度,同时提高通信系统性能,在研究对数似然比置信传播(LLR-BP:Log-Likelihood Ratio Belief Propagation)算法及其简化的译码算法基础上,提出了一种基于归一化最小...为降低低密度奇偶校验(LDPC:Low-Density Parity-Cheek)码译码算法的复杂度,同时提高通信系统性能,在研究对数似然比置信传播(LLR-BP:Log-Likelihood Ratio Belief Propagation)算法及其简化的译码算法基础上,提出了一种基于归一化最小和(NMS:Normalized Min Sum)算法的改进算法。深入研究了Gamma-Gamma分布模型,并将Gamma-Gamma分布作为仿真的信道模型,应用Matlab仿真比较了LLR-BP及其简化算法在不同湍流强度信道下的性能。仿真结果表明,无论在AWGN(Additive White Gaussian Noise)信道还是不同湍流强度的Gamma-Gamma信道下,改进算法在几种算法中都有较好的译码性能,尤其是在中湍流和强湍流信道下改进算法的性能优势更为明显。通过码长对BER(Bit Error Rate)影响的仿真结果表明,适当增加码长可有效改善算法的性能。展开更多
Distributed generation(DG)allocation in the distribution network is generally a multi-objective optimization problem.The maximum benefits of DG injection in the distribution system highly depend on the selection of an...Distributed generation(DG)allocation in the distribution network is generally a multi-objective optimization problem.The maximum benefits of DG injection in the distribution system highly depend on the selection of an appropriate number of DGs and their capacity along with the best location.In this paper,the improved decomposition based evolutionary algorithm(I-DBEA)is used for the selection of optimal number,capacity and site of DG in order to minimize real power losses and voltage deviation,and to maximize the voltage stability index.The proposed I-DBEA technique has the ability to incorporate non-linear,nonconvex and mixed-integer variable problems and it is independent of local extrema trappings.In order to validate the effectiveness of the proposed technique,IEEE 33-bus,69-bus,and 119-bus standard radial distribution networks are considered.Furthermore,the choice of optimal number of DGs in the distribution system is also investigated.The simulation results of the proposed method are compared with the existing methods.The comparison shows that the proposed method has the ability to get the multi-objective optimization of different conflicting objective functions with global optimal values along with the smallest size of DG.展开更多
基金supported By Guangdong Major Project of Basic and Applied Basic Research(2023B0303000009)Guangdong Basic and Applied Basic Research Foundation(2024A1515030153,2025A1515011587)+1 种基金Project of Department of Education of Guangdong Province(2023ZDZX4046)Shen-zhen Natural Science Fund(Stable Support Plan Program 20231122121608001),Ningbo Municipal Science and Technology Bureau(ZX2024000604).
文摘Dear Editor,Through distributed machine learning,multi-UAV systems can achieve global optimization goals without a centralized server,such as optimal target tracking,by leveraging local calculation and communication with neighbors.In this work,we implement the stochastic gradient descent algorithm(SGD)distributedly to optimize tracking errors based on local state and aggregation of the neighbors'estimation.However,Byzantine agents can mislead neighbors,causing deviations from optimal tracking.We prove that the swarm achieves resilient convergence if aggregated results lie within the normal neighbors'convex hull,which can be guaranteed by the introduced centerpoint-based aggregation rule.In the given simulated scenarios,distributed learning using average,geometric median(GM),and coordinate-wise median(CM)based aggregation rules fail to track the target.Compared to solely using the centerpoint aggregation method,our approach,which combines a pre-filter with the centroid aggregation rule,significantly enhances resilience against Byzantine attacks,achieving faster convergence and smaller tracking errors.
基金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(61671176 61671173)the Fundamental Research Funds for the Center Universities(HIT.MKSTISP.2016 13)
文摘How to obtain accurate channel state information(CSI)at the transmitter with less pilot overhead for frequency division duplexing(FDD) massive multiple-input multiple-output(MIMO)system is a challenging issue due to the large number of antennas. To reduce the overwhelming pilot overhead, a hybrid orthogonal and non-orthogonal pilot distribution at the base station(BS),which is a generalization of the existing pilot distribution scheme,is proposed by exploiting the common sparsity of channel due to the compact antenna arrangement. Then the block sparsity for antennas with hybrid pilot distribution is derived respectively and can be used to obtain channel impulse response. By employing the theoretical analysis of block sparse recovery, the total coherence criterion is proposed to optimize the sensing matrix composed by orthogonal pilots. Due to the huge complexity of optimal pilot acquisition, a genetic algorithm based pilot allocation(GAPA) algorithm is proposed to acquire optimal pilot distribution locations with fast convergence. Furthermore, the Cramer Rao lower bound is derived for non-orthogonal pilot-based channel estimation and can be asymptotically approached by the prior support set, especially when the optimized pilot is employed.
文摘Estimation of distribution algorithms are a class of evolutionary optimization algorithms based on probability distribution model. In this article, a Pareto-based multi-objective estimation of distribution algorithm with multivariate T-copulas is proposed. The algorithm employs Pareto-based approach and multivariate T-copulas to construct probability distribution model. To estimate joint distribution of the selected solutions, the correlation matrix of T-copula is firstly estimated by estimating Kendall’s tau and using the relationship of Kendall’s tau and correlation matrix. After the correlation matrix is estimated, the degree of freedom of T-copula is estimated by using the maximum likelihood method. Afterwards, the Monte Carte simulation is used to generate new individuals. An archive with maximum capacity is used to maintain the non-dominated solutions. The Pareto optimal solutions are selected from the archive on the basis of the diversity of the solutions, and the crowding-distance measure is used for the diversity measurement. The archive gets updated with the inclusion of the non-dominated solutions from the combined population and current archive, and the archive which exceeds the maximum capacity is cut using the diversity consideration. The proposed algorithm is applied to some well-known benchmark. The relative experimental results show that the algorithm has better performance and is effective.
基金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.
基金supported by the Science and Technology Project of State Grid Zhejiang Electric Power Co.Ltd.(Grant No.5211JY17000P)the Fundamental Research Funds for the Central Universities(Grant No.2242019K40111)+1 种基金the National Natural Science Foundation of China(Grant No.61673107)the Jiangsu Provincial Key Laboratory of Networked Collective Intelligence(Grant No.BM2017002)
文摘In this paper, we present a distributed consensus-based algorithm to solve the social welfare maximization problem. This is one of typical problems of distributed energy management in smart grid. In this problem, we consider not only the generator and demand, but also the transmission losses which make the feasibility set of the formulated problem a non-convex set. In solving this issue, we find a noticeable result that the primal problem has the same solution with a new convex optimization problem by getting the utmost out of the implied term in practice. Considering the general communication topology among generators and demands, we first design a finite step algorithm to make each generator and demand know the information of parameters of others.Then, we design a distributed algorithm and also prove the optimality and convergence of the proposed algorithm. Finally, the convergence and optimality are examined through extensive simulations.
文摘实数编码的多目标进化算法常使用模拟二进制交叉(simulated binary crossover,称SBX)算子.通过对SBX以及进化策略中变异算子进行对比分析,并引入进化策略中的离散重组算子,提出了一种正态分布交叉(normal distribution crossover,称NDX)算子.首先在一维搜索空间实例中对NDX与SBX算子进行比较和分析,然后将NDX算子应用于Deb等人提出的稳态多目标进化算法ε-MOEA(ε-dominance based multiobjective evolutionary algorithm)中.采用NDX算子的ε-MOEA(记为ε-MOEA/NDX)算法在多目标优化标准测试集ZDT和DTLZ的10个函数上进行了实验比较.实验结果和分析表明,采用NDX的ε-MOEA所求得的Pareto最优解集质量明显优于经典算法ε-MOEA/SBX和NSGA-Ⅱ.
文摘为降低低密度奇偶校验(LDPC:Low-Density Parity-Cheek)码译码算法的复杂度,同时提高通信系统性能,在研究对数似然比置信传播(LLR-BP:Log-Likelihood Ratio Belief Propagation)算法及其简化的译码算法基础上,提出了一种基于归一化最小和(NMS:Normalized Min Sum)算法的改进算法。深入研究了Gamma-Gamma分布模型,并将Gamma-Gamma分布作为仿真的信道模型,应用Matlab仿真比较了LLR-BP及其简化算法在不同湍流强度信道下的性能。仿真结果表明,无论在AWGN(Additive White Gaussian Noise)信道还是不同湍流强度的Gamma-Gamma信道下,改进算法在几种算法中都有较好的译码性能,尤其是在中湍流和强湍流信道下改进算法的性能优势更为明显。通过码长对BER(Bit Error Rate)影响的仿真结果表明,适当增加码长可有效改善算法的性能。
文摘Distributed generation(DG)allocation in the distribution network is generally a multi-objective optimization problem.The maximum benefits of DG injection in the distribution system highly depend on the selection of an appropriate number of DGs and their capacity along with the best location.In this paper,the improved decomposition based evolutionary algorithm(I-DBEA)is used for the selection of optimal number,capacity and site of DG in order to minimize real power losses and voltage deviation,and to maximize the voltage stability index.The proposed I-DBEA technique has the ability to incorporate non-linear,nonconvex and mixed-integer variable problems and it is independent of local extrema trappings.In order to validate the effectiveness of the proposed technique,IEEE 33-bus,69-bus,and 119-bus standard radial distribution networks are considered.Furthermore,the choice of optimal number of DGs in the distribution system is also investigated.The simulation results of the proposed method are compared with the existing methods.The comparison shows that the proposed method has the ability to get the multi-objective optimization of different conflicting objective functions with global optimal values along with the smallest size of DG.
