Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective funct...Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.展开更多
The ant system algorithm （ASA） has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n ＋ 1^ -fold cov...The ant system algorithm （ASA） has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n ＋ 1^ -fold coverage rate is put forward to evaluate the coverage performance of a satellite constellation. An optimization model of constellation parameters is established on the basis of the coverage performance. As a newly developed method, ASA can be applied to optimize the constellation parameters. In order to improve the ASA, a rule for adaptive number of ants is proposed, by which the search range is obviously enlarged and the convergence speed increased. Simulation results have shown that the ASA is more quick and efficient than other methodV211.71s.展开更多
A chip mounter is the core equipment in the production line of the surface-mount technology,which is responsible for finishing the mount operation.It is the most complex and time-consuming stage in the production proc...A chip mounter is the core equipment in the production line of the surface-mount technology,which is responsible for finishing the mount operation.It is the most complex and time-consuming stage in the production process.Therefore,it is of great significance to optimize the load balance and mounting efficiency of the chip mounter and improve the mounting efficiency of the production line.In this study,according to the specific type of chip mounter in the actual production line of a company,a maximum and minimum model is established to minimize the maximum cycle time of the chip mounter in the production line.The production efficiency of the production line can be improved by optimizing the workload scheduling of each chip mounter.On this basis,a hybrid adaptive optimization algorithm is proposed to solve the load scheduling problem of the mounter.The hybrid algorithm is a hybrid of an adaptive genetic algorithm and the improved ant colony algorithm.It combines the advantages of the two algorithms and improves their global search ability and convergence speed.The experimental results show that the proposed hybrid optimization algorithm has a good optimization effect and convergence in the load scheduling problem of chip mounters.展开更多
The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method...The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method for the path planning. In the paper the traditional ant colony algorithm is improved, and measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, by which better path at higher convergence speed can be found. Finally the algorithm is implemented with computer simulation and preferable results are obtained.展开更多
The proposed system uses an algorithm that works on the admittance of the system,for estimating the reference values of generated currents for an off-grid wind power harnessing unit(WPHU).The controller controls the v...The proposed system uses an algorithm that works on the admittance of the system,for estimating the reference values of generated currents for an off-grid wind power harnessing unit(WPHU).The controller controls the voltage and maintains the frequency within the limits while working with both linear and nonlinear loads for varying wind speeds.The admittance algorithm is simple and easy to implement and works very efficiently to generate the triggering signals for the controller of the WPHU.The wind power harnessing unit comprising of a squirrel cage induction generator,a star-delta transformer,a battery storage system and the control unit are modeled using Matlab/Simulink R2019.An isolated transformer with a star-delta configuration connects the load and the generator circuit with the controller to reduce the dc bus voltage and mitigate current in the neutral line.The response of the system during the dynamic loading depends on the best possible compensator proportional-integral(PI)gains.The antlion optimization algorithm is compared with particle swarm optimization and grey wolf optimization and is found to have the advantages of good convergence,high efficiency and fast calculating speed.It is therefore used to extract the optimal values of frequency and voltage PI gains.The simulation results of the control algorithm for the WPHU are validated in a real-time environment in a dSpace1104 laboratory set up.This algorithm is proven to have a quick response,maintain the required frequency,suppress the current harmonics,regulate voltage,help in balancing the load and compensating for the neutral current.展开更多
机组最优投入问题(optimal Unit Commitment,UC)是寻求1个周期内各个负荷水平下机组的最优组合方式及开停机计划,使运行费用为最小。该问题是一个高维数、非凸的、离散的、非线性的优化问题,很难找出理论上的最优解,但由于它能带来显著...机组最优投入问题(optimal Unit Commitment,UC)是寻求1个周期内各个负荷水平下机组的最优组合方式及开停机计划,使运行费用为最小。该问题是一个高维数、非凸的、离散的、非线性的优化问题,很难找出理论上的最优解,但由于它能带来显著的经济效益,所以受到了国内外很多学者的广泛关注。作者尝试采用一种新型的模拟进化优化算法——蚁群优化算法(ACO)来求解该问题。首先,利用状态、决策及作者提出的路径概念把UC设计成类似于旅行商(TSP)问题的模式,从而可以方便地利用ACO来求解。其次,由于ACO处理的是无约束优化问题,对于UC这一约束优化问题,提出了不同的方法来处理各种约束。用tabu表限制不满足旋转备用约束和机组最小启/停时间约束的状态;通过附加惩罚项来处理线路N安全性约束。数值算例验证了此算法的可行性和有效性。展开更多
基金supported by the the Youth Science and Technology Innovation Fund (Science)(Nos.NS2014070, NS2014070)
文摘Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.
文摘The ant system algorithm （ASA） has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n ＋ 1^ -fold coverage rate is put forward to evaluate the coverage performance of a satellite constellation. An optimization model of constellation parameters is established on the basis of the coverage performance. As a newly developed method, ASA can be applied to optimize the constellation parameters. In order to improve the ASA, a rule for adaptive number of ants is proposed, by which the search range is obviously enlarged and the convergence speed increased. Simulation results have shown that the ASA is more quick and efficient than other methodV211.71s.
基金supported by the National Natural Science Foundation of China(Nos.U1911205,62073300,and 62076225)the National Key Research and Development Program of China(No.2021YFB3301602).
文摘A chip mounter is the core equipment in the production line of the surface-mount technology,which is responsible for finishing the mount operation.It is the most complex and time-consuming stage in the production process.Therefore,it is of great significance to optimize the load balance and mounting efficiency of the chip mounter and improve the mounting efficiency of the production line.In this study,according to the specific type of chip mounter in the actual production line of a company,a maximum and minimum model is established to minimize the maximum cycle time of the chip mounter in the production line.The production efficiency of the production line can be improved by optimizing the workload scheduling of each chip mounter.On this basis,a hybrid adaptive optimization algorithm is proposed to solve the load scheduling problem of the mounter.The hybrid algorithm is a hybrid of an adaptive genetic algorithm and the improved ant colony algorithm.It combines the advantages of the two algorithms and improves their global search ability and convergence speed.The experimental results show that the proposed hybrid optimization algorithm has a good optimization effect and convergence in the load scheduling problem of chip mounters.
文摘The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method for the path planning. In the paper the traditional ant colony algorithm is improved, and measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, by which better path at higher convergence speed can be found. Finally the algorithm is implemented with computer simulation and preferable results are obtained.
文摘The proposed system uses an algorithm that works on the admittance of the system,for estimating the reference values of generated currents for an off-grid wind power harnessing unit(WPHU).The controller controls the voltage and maintains the frequency within the limits while working with both linear and nonlinear loads for varying wind speeds.The admittance algorithm is simple and easy to implement and works very efficiently to generate the triggering signals for the controller of the WPHU.The wind power harnessing unit comprising of a squirrel cage induction generator,a star-delta transformer,a battery storage system and the control unit are modeled using Matlab/Simulink R2019.An isolated transformer with a star-delta configuration connects the load and the generator circuit with the controller to reduce the dc bus voltage and mitigate current in the neutral line.The response of the system during the dynamic loading depends on the best possible compensator proportional-integral(PI)gains.The antlion optimization algorithm is compared with particle swarm optimization and grey wolf optimization and is found to have the advantages of good convergence,high efficiency and fast calculating speed.It is therefore used to extract the optimal values of frequency and voltage PI gains.The simulation results of the control algorithm for the WPHU are validated in a real-time environment in a dSpace1104 laboratory set up.This algorithm is proven to have a quick response,maintain the required frequency,suppress the current harmonics,regulate voltage,help in balancing the load and compensating for the neutral current.
文摘机组最优投入问题(optimal Unit Commitment,UC)是寻求1个周期内各个负荷水平下机组的最优组合方式及开停机计划,使运行费用为最小。该问题是一个高维数、非凸的、离散的、非线性的优化问题,很难找出理论上的最优解,但由于它能带来显著的经济效益,所以受到了国内外很多学者的广泛关注。作者尝试采用一种新型的模拟进化优化算法——蚁群优化算法(ACO)来求解该问题。首先,利用状态、决策及作者提出的路径概念把UC设计成类似于旅行商(TSP)问题的模式,从而可以方便地利用ACO来求解。其次,由于ACO处理的是无约束优化问题,对于UC这一约束优化问题,提出了不同的方法来处理各种约束。用tabu表限制不满足旋转备用约束和机组最小启/停时间约束的状态;通过附加惩罚项来处理线路N安全性约束。数值算例验证了此算法的可行性和有效性。
