Punctured convolution codes （PCCs） have a lot of applications in modem communication system. The efficient way to search for best PCCs with longer constraint lengths is desired since the complexity of exhaustive sea...Punctured convolution codes （PCCs） have a lot of applications in modem communication system. The efficient way to search for best PCCs with longer constraint lengths is desired since the complexity of exhaustive search becomes unacceptable. An efficient search method to find PCCs is proposed and simulated. At first, PCCs＇ searching problem is turned into an optimization problem through analysis of PCCs＇ judging criteria, and the inefficiency to use pattern search （PS） for many local optimums is pointed out. The simulated annealing （SA） is adapted to the non-convex optimization problem to find best PCCs with low complexity. Simulation indicates that SA performs very well both in complexity and success ratio, and PCCs with memories varying from 9 to 12 and rates varying from 2/3 to 4/5 searched by SA are presented.展开更多
A real-life problem is the rostering of nurses at hospitals.It is a famous nondeterministic,polynomial time(NP)-hard combinatorial optimization problem.Handling the real-world nurse rostering problem(NRP)constraints i...A real-life problem is the rostering of nurses at hospitals.It is a famous nondeterministic,polynomial time(NP)-hard combinatorial optimization problem.Handling the real-world nurse rostering problem(NRP)constraints in distributing workload equally between available nurses is still a difficult task to achieve.The international shortage of nurses,in addition to the spread of COVID-19,has made it more difficult to provide convenient rosters for nurses.Based on the literature,heuristic-based methods are the most commonly used methods to solve the NRP due to its computational complexity,especially for large rosters.Heuristic-based algorithms in general have problems striking the balance between diversification and intensification.Therefore,this paper aims to introduce a novel metaheuristic hybridization that combines the enhanced harmony search algorithm(EHSA)with the simulated annealing(SA)algorithm called the annealing harmony search algorithm(AHSA).The AHSA is used to solve NRP from a Malaysian hospital.The AHSA performance is compared to the EHSA,climbing harmony search algorithm(CHSA),deluge harmony search algorithm(DHSA),and harmony annealing search algorithm(HAS).The results show that the AHSA performs better than the other compared algorithms for all the tested instances where the best ever results reported for the UKMMC dataset.展开更多
Team Formation(TF)is considered one of the most significant problems in computer science and optimization.TF is defined as forming the best team of experts in a social network to complete a task with least cost.Many r...Team Formation(TF)is considered one of the most significant problems in computer science and optimization.TF is defined as forming the best team of experts in a social network to complete a task with least cost.Many real-world problems,such as task assignment,vehicle routing,nurse scheduling,resource allocation,and airline crew scheduling,are based on the TF problem.TF has been shown to be a Nondeterministic Polynomial time(NP)problem,and high-dimensional problem with several local optima that can be solved using efficient approximation algorithms.This paper proposes two improved swarm-based algorithms for solving team formation problem.The first algorithm,entitled Hybrid Heap-Based Optimizer with Simulated Annealing Algorithm(HBOSA),uses a single crossover operator to improve the performance of a standard heap-based optimizer(HBO)algorithm.It also employs the simulated annealing(SA)approach to improve model convergence and avoid local minima trapping.The second algorithm is the Chaotic Heap-based Optimizer Algorithm(CHBO).CHBO aids in the discovery of new solutions in the search space by directing particles to different regions of the search space.During HBO’s optimization process,a logistic chaotic map is used.The performance of the two proposed algorithms(HBOSA)and(CHBO)is evaluated using thirteen benchmark functions and tested in solving the TF problem with varying number of experts and skills.Furthermore,the proposed algorithms were compared to well-known optimization algorithms such as the Heap-Based Optimizer(HBO),Developed Simulated Annealing(DSA),Particle SwarmOptimization(PSO),GreyWolfOptimization(GWO),and Genetic Algorithm(GA).Finally,the proposed algorithms were applied to a real-world benchmark dataset known as the Internet Movie Database(IMDB).The simulation results revealed that the proposed algorithms outperformed the compared algorithms in terms of efficiency and performance,with fast convergence to the global minimum.展开更多
将高频率分辨力谱估计技术与优化算法相结合而提出一种新的异步电动机转子故障检测方法。针对两种典型的高频率分辨力谱估计技术——多重信号分类(multiple signalclassification,MUSIC)与旋转不变信号参数估计技术(estimation of signa...将高频率分辨力谱估计技术与优化算法相结合而提出一种新的异步电动机转子故障检测方法。针对两种典型的高频率分辨力谱估计技术——多重信号分类(multiple signalclassification,MUSIC)与旋转不变信号参数估计技术(estimation of signal parameters via rotational invariancetechnique,ESPRIT),应用模拟转子故障的定子电流信号测试其频率分辨力、精度等性能,结果表明:即使对于短时信号,二者仍具高频率分辨力,可以准确地分辨定子电流信号中转子故障特征分量、主频分量之频率;但对其幅值、初相角,仅能提供"粗糙"估计。为此,尝试以优化算法——模拟退火算法(simulated annealing algorithm,SAA)与模式搜索算法(pattern search algorithm,PSA)确定各分量的幅值与初相角。同时,分别对MUSIC与ESPRIT、SAA与PSA做了性能对比,遴选优者并应用于转子故障检测。最后,针对转子断条故障进行实验,结果表明:基于高频率分辨力谱估计技术与优化算法的异步电动机转子故障检测方法有效、可行,即使在负载波动、噪声等干扰严重情况下仍然适用。展开更多
基金supported by the National Natural Science Foundation of China(61171104)
文摘Punctured convolution codes （PCCs） have a lot of applications in modem communication system. The efficient way to search for best PCCs with longer constraint lengths is desired since the complexity of exhaustive search becomes unacceptable. An efficient search method to find PCCs is proposed and simulated. At first, PCCs＇ searching problem is turned into an optimization problem through analysis of PCCs＇ judging criteria, and the inefficiency to use pattern search （PS） for many local optimums is pointed out. The simulated annealing （SA） is adapted to the non-convex optimization problem to find best PCCs with low complexity. Simulation indicates that SA performs very well both in complexity and success ratio, and PCCs with memories varying from 9 to 12 and rates varying from 2/3 to 4/5 searched by SA are presented.
文摘A real-life problem is the rostering of nurses at hospitals.It is a famous nondeterministic,polynomial time(NP)-hard combinatorial optimization problem.Handling the real-world nurse rostering problem(NRP)constraints in distributing workload equally between available nurses is still a difficult task to achieve.The international shortage of nurses,in addition to the spread of COVID-19,has made it more difficult to provide convenient rosters for nurses.Based on the literature,heuristic-based methods are the most commonly used methods to solve the NRP due to its computational complexity,especially for large rosters.Heuristic-based algorithms in general have problems striking the balance between diversification and intensification.Therefore,this paper aims to introduce a novel metaheuristic hybridization that combines the enhanced harmony search algorithm(EHSA)with the simulated annealing(SA)algorithm called the annealing harmony search algorithm(AHSA).The AHSA is used to solve NRP from a Malaysian hospital.The AHSA performance is compared to the EHSA,climbing harmony search algorithm(CHSA),deluge harmony search algorithm(DHSA),and harmony annealing search algorithm(HAS).The results show that the AHSA performs better than the other compared algorithms for all the tested instances where the best ever results reported for the UKMMC dataset.
文摘Team Formation(TF)is considered one of the most significant problems in computer science and optimization.TF is defined as forming the best team of experts in a social network to complete a task with least cost.Many real-world problems,such as task assignment,vehicle routing,nurse scheduling,resource allocation,and airline crew scheduling,are based on the TF problem.TF has been shown to be a Nondeterministic Polynomial time(NP)problem,and high-dimensional problem with several local optima that can be solved using efficient approximation algorithms.This paper proposes two improved swarm-based algorithms for solving team formation problem.The first algorithm,entitled Hybrid Heap-Based Optimizer with Simulated Annealing Algorithm(HBOSA),uses a single crossover operator to improve the performance of a standard heap-based optimizer(HBO)algorithm.It also employs the simulated annealing(SA)approach to improve model convergence and avoid local minima trapping.The second algorithm is the Chaotic Heap-based Optimizer Algorithm(CHBO).CHBO aids in the discovery of new solutions in the search space by directing particles to different regions of the search space.During HBO’s optimization process,a logistic chaotic map is used.The performance of the two proposed algorithms(HBOSA)and(CHBO)is evaluated using thirteen benchmark functions and tested in solving the TF problem with varying number of experts and skills.Furthermore,the proposed algorithms were compared to well-known optimization algorithms such as the Heap-Based Optimizer(HBO),Developed Simulated Annealing(DSA),Particle SwarmOptimization(PSO),GreyWolfOptimization(GWO),and Genetic Algorithm(GA).Finally,the proposed algorithms were applied to a real-world benchmark dataset known as the Internet Movie Database(IMDB).The simulation results revealed that the proposed algorithms outperformed the compared algorithms in terms of efficiency and performance,with fast convergence to the global minimum.
文摘将高频率分辨力谱估计技术与优化算法相结合而提出一种新的异步电动机转子故障检测方法。针对两种典型的高频率分辨力谱估计技术——多重信号分类(multiple signalclassification,MUSIC)与旋转不变信号参数估计技术(estimation of signal parameters via rotational invariancetechnique,ESPRIT),应用模拟转子故障的定子电流信号测试其频率分辨力、精度等性能,结果表明:即使对于短时信号,二者仍具高频率分辨力,可以准确地分辨定子电流信号中转子故障特征分量、主频分量之频率;但对其幅值、初相角,仅能提供"粗糙"估计。为此,尝试以优化算法——模拟退火算法(simulated annealing algorithm,SAA)与模式搜索算法(pattern search algorithm,PSA)确定各分量的幅值与初相角。同时,分别对MUSIC与ESPRIT、SAA与PSA做了性能对比,遴选优者并应用于转子故障检测。最后,针对转子断条故障进行实验,结果表明:基于高频率分辨力谱估计技术与优化算法的异步电动机转子故障检测方法有效、可行,即使在负载波动、噪声等干扰严重情况下仍然适用。
