To better regulate the speed of brushless DC motors,an improved algorithm based on the original Glowworm Swarm Optimization is proposed.The proposed algorithm solves the problems of poor robustness,slow convergence,an...To better regulate the speed of brushless DC motors,an improved algorithm based on the original Glowworm Swarm Optimization is proposed.The proposed algorithm solves the problems of poor robustness,slow convergence,and low accuracy exhibited by traditional PID controllers.When selecting the glowworm neighborhood set,an optimization scheme based on the growth and competition behavior of weeds is applied to a single glowworm to prevent falling into a local optimal solution.After the glowworm’s position is updated,the league selection operator is introduced to search for the global optimal solution.Combining the local search ability of the invasive weed optimization with the global search ability of the league selection operator enhances the robustness of the algorithm and also accelerates the convergence speed of the algorithm.The mathematical model of the brushless DC motor is established,the PID parameters are tuned and optimized using improved Glowworm Swarm Optimization algorithm,and the speed of the brushless DC motor is adjusted.In a Simulink environment,a double closed-loop speed control model was established to simulate the speed control of a brushless DC motor,and this simulation was compared with a traditional PID control.The simulation results show that the model based on the improved Glowworm Swarm Optimization algorithm has good robustness and a steady-state response speed for motor speed control.展开更多
This paper proposes a new algorithm—binary glowworm swarm optimization(BGSO)to solve the unit commitment(UC)problem.After a certain quantity of initial feasible solutions is obtained by using the priority list and th...This paper proposes a new algorithm—binary glowworm swarm optimization(BGSO)to solve the unit commitment(UC)problem.After a certain quantity of initial feasible solutions is obtained by using the priority list and the decommitment of redundant unit,BGSO is applied to optimize the on/off state of the unit,and the Lambda-iteration method is adopted to solve the economic dispatch problem.In the iterative process,the solutions that do not satisfy all the constraints are adjusted by the correction method.Furthermore,different adjustment techniques such as conversion from cold start to hot start,decommitment of redundant unit,are adopted to avoid falling into local optimal solution and to keep the diversity of the feasible solutions.The proposed BGSO is tested on the power system in the range of 10–140 generating units for a 24-h scheduling period and compared to quantuminspired evolutionary algorithm(QEA),improved binary particle swarm optimization(IBPSO)and mixed integer programming(MIP).Simulated results distinctly show that BGSO is very competent in solving the UC problem in comparison to the previously reported algorithms.展开更多
针对历史轨迹加噪发布干扰轨迹时数据集的冗余问题和轨迹形状相似带来的隐私泄露风险,提出轨迹数据先约简后泛化再进行差分隐私加噪的基于改进萤火虫群优化求解的干扰轨迹发布保护机制(IGSO-SDTP)。首先,基于位置显著点约简历史轨迹数据...针对历史轨迹加噪发布干扰轨迹时数据集的冗余问题和轨迹形状相似带来的隐私泄露风险,提出轨迹数据先约简后泛化再进行差分隐私加噪的基于改进萤火虫群优化求解的干扰轨迹发布保护机制(IGSO-SDTP)。首先,基于位置显著点约简历史轨迹数据集;其次,结合k⁃匿名和差分隐私对简化后的轨迹数据集分别进行泛化和加噪;最后,设计了兼顾距离误差和轨迹相似性的加权距离,并以加权距离为评价指标,基于改进萤火虫群优化(IGSO)算法求解加权距离小的干扰轨迹。在多个数据集上的实验结果表明,与RD(Differential privacy for Raw trajectory data)、SDTP(Trajectory Protection of Simplification and Differential privacy)、LIC(Linear Index Clustering algorithm)、DPKTS(Differential Privacy based on K-means Trajectory shape Similarity)相比,IGSO-SDTP方法得到的加权距离分别降低了21.94%、9.15%、14.25%、10.55%,说明所提方法发布的干扰轨迹可用性和稳定性更好。展开更多
基金This research was funded by the Hebei Science and Technology Support Program Project(19273703D)the Hebei Higher Education Science and Technology Research Project(ZD2020318).
文摘To better regulate the speed of brushless DC motors,an improved algorithm based on the original Glowworm Swarm Optimization is proposed.The proposed algorithm solves the problems of poor robustness,slow convergence,and low accuracy exhibited by traditional PID controllers.When selecting the glowworm neighborhood set,an optimization scheme based on the growth and competition behavior of weeds is applied to a single glowworm to prevent falling into a local optimal solution.After the glowworm’s position is updated,the league selection operator is introduced to search for the global optimal solution.Combining the local search ability of the invasive weed optimization with the global search ability of the league selection operator enhances the robustness of the algorithm and also accelerates the convergence speed of the algorithm.The mathematical model of the brushless DC motor is established,the PID parameters are tuned and optimized using improved Glowworm Swarm Optimization algorithm,and the speed of the brushless DC motor is adjusted.In a Simulink environment,a double closed-loop speed control model was established to simulate the speed control of a brushless DC motor,and this simulation was compared with a traditional PID control.The simulation results show that the model based on the improved Glowworm Swarm Optimization algorithm has good robustness and a steady-state response speed for motor speed control.
文摘This paper proposes a new algorithm—binary glowworm swarm optimization(BGSO)to solve the unit commitment(UC)problem.After a certain quantity of initial feasible solutions is obtained by using the priority list and the decommitment of redundant unit,BGSO is applied to optimize the on/off state of the unit,and the Lambda-iteration method is adopted to solve the economic dispatch problem.In the iterative process,the solutions that do not satisfy all the constraints are adjusted by the correction method.Furthermore,different adjustment techniques such as conversion from cold start to hot start,decommitment of redundant unit,are adopted to avoid falling into local optimal solution and to keep the diversity of the feasible solutions.The proposed BGSO is tested on the power system in the range of 10–140 generating units for a 24-h scheduling period and compared to quantuminspired evolutionary algorithm(QEA),improved binary particle swarm optimization(IBPSO)and mixed integer programming(MIP).Simulated results distinctly show that BGSO is very competent in solving the UC problem in comparison to the previously reported algorithms.
文摘针对历史轨迹加噪发布干扰轨迹时数据集的冗余问题和轨迹形状相似带来的隐私泄露风险,提出轨迹数据先约简后泛化再进行差分隐私加噪的基于改进萤火虫群优化求解的干扰轨迹发布保护机制(IGSO-SDTP)。首先,基于位置显著点约简历史轨迹数据集;其次,结合k⁃匿名和差分隐私对简化后的轨迹数据集分别进行泛化和加噪;最后,设计了兼顾距离误差和轨迹相似性的加权距离,并以加权距离为评价指标,基于改进萤火虫群优化(IGSO)算法求解加权距离小的干扰轨迹。在多个数据集上的实验结果表明,与RD(Differential privacy for Raw trajectory data)、SDTP(Trajectory Protection of Simplification and Differential privacy)、LIC(Linear Index Clustering algorithm)、DPKTS(Differential Privacy based on K-means Trajectory shape Similarity)相比,IGSO-SDTP方法得到的加权距离分别降低了21.94%、9.15%、14.25%、10.55%,说明所提方法发布的干扰轨迹可用性和稳定性更好。
