In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on pa...In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.展开更多
Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific...Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific content can not be determined.In this paper, a multi-target vehicle recognition and tracking algorithm based on YOLO v5 network architecture is proposed.The specific content of moving objects are identified by the network architecture, furthermore, the simulated annealing chaotic mechanism is embedded in particle swarm optimization-Gauss particle filter algorithm.The proposed simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm(SA-CPSO-GPF) is used to track moving objects.The experiment shows that the algorithm has a good tracking effect for the vehicle in the monitoring range.The root mean square error(RMSE), running time and accuracy of the proposed method are superior to traditional methods.The proposed algorithm has very good application value.展开更多
A new support vector machine （SVM） optimized by an improved particle swarm optimization （PSO） combined with simulated annealing algorithm （SA） was proposed. By incorporating with the simulated annealing method, ...A new support vector machine （SVM） optimized by an improved particle swarm optimization （PSO） combined with simulated annealing algorithm （SA） was proposed. By incorporating with the simulated annealing method, the global searching capacity of the particle swarm optimization（SAPSO） was enchanced, and the searching capacity of the particle swarm optimization was studied. Then, the improyed particle swarm optimization algorithm was used to optimize the parameters of SVM （c,σ and ε）. Based on the operational data provided by a regional power grid in north China, the method was used in the actual short term load forecasting. The results show that compared to the PSO-SVM and the traditional SVM, the average time of the proposed method in the experimental process reduces by 11.6 s and 31.1 s, and the precision of the proposed method increases by 1.24% and 3.18%, respectively. So, the improved method is better than the PSO-SVM and the traditional SVM.展开更多
With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization p...With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.展开更多
Groundwater inverse modeling is a vital technique for estimating unmeasurable model parameters and enhancing numerical simulation accuracy.This paper comprehensively reviews the current advances and future prospects o...Groundwater inverse modeling is a vital technique for estimating unmeasurable model parameters and enhancing numerical simulation accuracy.This paper comprehensively reviews the current advances and future prospects of metaheuristic algorithm-based groundwater model parameter inversion.Initially,the simulation-optimization parameter estimation framework is introduced,which involves the integration of simulation models with metaheuristic algorithms.The subsequent sections explore the fundamental principles of four widely employed metaheuristic algorithms-genetic algorithm(GA),particle swarm optimization(PSO),simulated annealing(SA),and differential evolution(DE)-highlighting their recent applications in water resources research and related areas.Then,a solute transport model is designed to illustrate how to apply and evaluate these four optimization algorithms in addressing challenges related to model parameter inversion.Finally,three noteworthy directions are presented to address the common challenges among current studies,including balancing the diverse exploration and centralized exploitation within metaheuristic algorithms,local approxi-mate error of the surrogate model,and the curse of dimensionality in spatial variational heterogeneous pa-rameters.In summary,this review paper provides theoretical insights and practical guidance for further advancements in groundwater inverse modeling studies.展开更多
A software defined networking(SDN) system has a logically centralized control plane that maintains a global network view and enables network-wide management, optimization, and innovation. Network-wide management and o...A software defined networking(SDN) system has a logically centralized control plane that maintains a global network view and enables network-wide management, optimization, and innovation. Network-wide management and optimization problems are typicallyvery complex with a huge solution space, large number of variables, and multiple objectives. Heuristic algorithms can solve theseproblems in an acceptable time but are usually limited to some particular problem circumstances. On the other hand, evolutionaryalgorithms(EAs), which are general stochastic algorithms inspired by the natural biological evolution and/or social behavior of species, can theoretically be used to solve any complex optimization problems including those found in SDNs. This paper reviewsfour types of EAs that are widely applied in current SDNs: Genetic Algorithms(GAs), Particle Swarm Optimization(PSO), Ant Colony Optimization(ACO), and Simulated Annealing(SA) by discussing their techniques, summarizing their representative applications, and highlighting their issues and future works. To the best of our knowledge, our work is the first that compares the tech-niques and categorizes the applications of these four EAs in SDNs.展开更多
目前中国西藏地区甚高频(very high frequency,VHF)通信台站在7000 m及以上高空航路通信信号覆盖存在覆盖盲区,但是并没有针对VHF通信信号盲区补盲方面的研究及对应的解决办法。为了解决以上问题,提出了一种以西藏地区的实际地形为优化...目前中国西藏地区甚高频(very high frequency,VHF)通信台站在7000 m及以上高空航路通信信号覆盖存在覆盖盲区,但是并没有针对VHF通信信号盲区补盲方面的研究及对应的解决办法。为了解决以上问题,提出了一种以西藏地区的实际地形为优化算法搜索对象,以拉萨管制区管辖范围内航路通信信号的单重覆盖率、双重覆盖率及管制区的冗余度为指标的补盲部署数学模型。接着,在不改变西藏地区原有VHF通信台站数量和位置的基础上,利用模拟退火粒子群算法,采用最小频率最少台站个数寻找一个最优台站对未覆盖的一段航路进行VHF通信信号覆盖研究。仿真结果表明,该算法不仅实现了采用最小频率最少台站个数解决航路通信信号覆盖盲区的目标,而且克服了粒子群算法在寻优过程中易陷入局部最优解的缺点,同时也证明了提出的补盲部署数学模型的正确性及改进的粒子群算法的高效性。该算法和模型可以为航线网路规划、台站部署优化及最终通过该方法解决频谱资源匮乏问题提供理论支撑和技术支持。展开更多
为解决混合云环境下科学工作流数据布局问题,在考虑数据的安全需求的前提下,以优化跨数据中心传输时延为目标,提出了一种混合云环境下面向安全的科学工作流布局策略。分析数据集的安全需求以及数据中心所能提供的安全服务,提出安全等级...为解决混合云环境下科学工作流数据布局问题,在考虑数据的安全需求的前提下,以优化跨数据中心传输时延为目标,提出了一种混合云环境下面向安全的科学工作流布局策略。分析数据集的安全需求以及数据中心所能提供的安全服务,提出安全等级分级规则;设计并提出基于遗传算法和模拟退火算法的自适应粒子群优化算法(adaptive particle swarm optimization algorithm based on SA and GA,SAGA-PSO),避免算法陷入局部极值,有效提高种群多样性;与其它经典布局算法对比,基于SAGA-PSO的数据布局策略在满足数据安全需求的同时能够大大降低传输时延。展开更多
基金The National Natural Science Foundation of China(No.61741102,61471164,61601122)the Fundamental Research Funds for the Central Universities(No.SJLX_160040)
文摘In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.
基金Supported by the National Key R&D Plan of China (2021YFE0105000)the National Natural Science Foundation of China (52074213)+1 种基金Shaanxi Key R&D Plan Project (2021SF-472)Yulin Science and Technology Plan Project (CXY-2020-036)。
文摘Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific content can not be determined.In this paper, a multi-target vehicle recognition and tracking algorithm based on YOLO v5 network architecture is proposed.The specific content of moving objects are identified by the network architecture, furthermore, the simulated annealing chaotic mechanism is embedded in particle swarm optimization-Gauss particle filter algorithm.The proposed simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm(SA-CPSO-GPF) is used to track moving objects.The experiment shows that the algorithm has a good tracking effect for the vehicle in the monitoring range.The root mean square error(RMSE), running time and accuracy of the proposed method are superior to traditional methods.The proposed algorithm has very good application value.
基金Project(50579101) supported by the National Natural Science Foundation of China
文摘A new support vector machine （SVM） optimized by an improved particle swarm optimization （PSO） combined with simulated annealing algorithm （SA） was proposed. By incorporating with the simulated annealing method, the global searching capacity of the particle swarm optimization（SAPSO） was enchanced, and the searching capacity of the particle swarm optimization was studied. Then, the improyed particle swarm optimization algorithm was used to optimize the parameters of SVM （c,σ and ε）. Based on the operational data provided by a regional power grid in north China, the method was used in the actual short term load forecasting. The results show that compared to the PSO-SVM and the traditional SVM, the average time of the proposed method in the experimental process reduces by 11.6 s and 31.1 s, and the precision of the proposed method increases by 1.24% and 3.18%, respectively. So, the improved method is better than the PSO-SVM and the traditional SVM.
基金This research is supported by the Science and Technology Program of Gansu Province(No.23JRRA880).
文摘With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.
基金supported by the Fundamental Research Funds for the Central Universities(XJ2023005201)the National Natural Science Foundation of China(NSFC:U2267217,42141011,and 42002254).
文摘Groundwater inverse modeling is a vital technique for estimating unmeasurable model parameters and enhancing numerical simulation accuracy.This paper comprehensively reviews the current advances and future prospects of metaheuristic algorithm-based groundwater model parameter inversion.Initially,the simulation-optimization parameter estimation framework is introduced,which involves the integration of simulation models with metaheuristic algorithms.The subsequent sections explore the fundamental principles of four widely employed metaheuristic algorithms-genetic algorithm(GA),particle swarm optimization(PSO),simulated annealing(SA),and differential evolution(DE)-highlighting their recent applications in water resources research and related areas.Then,a solute transport model is designed to illustrate how to apply and evaluate these four optimization algorithms in addressing challenges related to model parameter inversion.Finally,three noteworthy directions are presented to address the common challenges among current studies,including balancing the diverse exploration and centralized exploitation within metaheuristic algorithms,local approxi-mate error of the surrogate model,and the curse of dimensionality in spatial variational heterogeneous pa-rameters.In summary,this review paper provides theoretical insights and practical guidance for further advancements in groundwater inverse modeling studies.
文摘A software defined networking(SDN) system has a logically centralized control plane that maintains a global network view and enables network-wide management, optimization, and innovation. Network-wide management and optimization problems are typicallyvery complex with a huge solution space, large number of variables, and multiple objectives. Heuristic algorithms can solve theseproblems in an acceptable time but are usually limited to some particular problem circumstances. On the other hand, evolutionaryalgorithms(EAs), which are general stochastic algorithms inspired by the natural biological evolution and/or social behavior of species, can theoretically be used to solve any complex optimization problems including those found in SDNs. This paper reviewsfour types of EAs that are widely applied in current SDNs: Genetic Algorithms(GAs), Particle Swarm Optimization(PSO), Ant Colony Optimization(ACO), and Simulated Annealing(SA) by discussing their techniques, summarizing their representative applications, and highlighting their issues and future works. To the best of our knowledge, our work is the first that compares the tech-niques and categorizes the applications of these four EAs in SDNs.
文摘目前中国西藏地区甚高频(very high frequency,VHF)通信台站在7000 m及以上高空航路通信信号覆盖存在覆盖盲区,但是并没有针对VHF通信信号盲区补盲方面的研究及对应的解决办法。为了解决以上问题,提出了一种以西藏地区的实际地形为优化算法搜索对象,以拉萨管制区管辖范围内航路通信信号的单重覆盖率、双重覆盖率及管制区的冗余度为指标的补盲部署数学模型。接着,在不改变西藏地区原有VHF通信台站数量和位置的基础上,利用模拟退火粒子群算法,采用最小频率最少台站个数寻找一个最优台站对未覆盖的一段航路进行VHF通信信号覆盖研究。仿真结果表明,该算法不仅实现了采用最小频率最少台站个数解决航路通信信号覆盖盲区的目标,而且克服了粒子群算法在寻优过程中易陷入局部最优解的缺点,同时也证明了提出的补盲部署数学模型的正确性及改进的粒子群算法的高效性。该算法和模型可以为航线网路规划、台站部署优化及最终通过该方法解决频谱资源匮乏问题提供理论支撑和技术支持。
文摘为解决混合云环境下科学工作流数据布局问题,在考虑数据的安全需求的前提下,以优化跨数据中心传输时延为目标,提出了一种混合云环境下面向安全的科学工作流布局策略。分析数据集的安全需求以及数据中心所能提供的安全服务,提出安全等级分级规则;设计并提出基于遗传算法和模拟退火算法的自适应粒子群优化算法(adaptive particle swarm optimization algorithm based on SA and GA,SAGA-PSO),避免算法陷入局部极值,有效提高种群多样性;与其它经典布局算法对比,基于SAGA-PSO的数据布局策略在满足数据安全需求的同时能够大大降低传输时延。
