The development of wind power clusters has scaled in terms of both scale and coverage,and the impact of weather fluctuations on cluster output changes has become increasingly complex.Accurately identifying the forward...The development of wind power clusters has scaled in terms of both scale and coverage,and the impact of weather fluctuations on cluster output changes has become increasingly complex.Accurately identifying the forward-looking information of key wind farms in a cluster under different weather conditions is an effective method to improve the accuracy of ultrashort-term cluster power forecasting.To this end,this paper proposes a refined modeling method for ultrashort-term wind power cluster forecasting based on a convergent cross-mapping algorithm.From the perspective of causality,key meteorological forecasting factors under different cluster power fluctuation processes were screened,and refined training modeling was performed for different fluctuation processes.First,a wind process description index system and classification model at the wind power cluster level are established to realize the classification of typical fluctuation processes.A meteorological-cluster power causal relationship evaluation model based on the convergent cross-mapping algorithm is pro-posed to screen meteorological forecasting factors under multiple types of typical fluctuation processes.Finally,a refined modeling meth-od for a variety of different typical fluctuation processes is proposed,and the strong causal meteorological forecasting factors of each scenario are used as inputs to realize high-precision modeling and forecasting of ultra-short-term wind cluster power.An example anal-ysis shows that the short-term wind power cluster power forecasting accuracy of the proposed method can reach 88.55%,which is 1.57-7.32%higher than that of traditional methods.展开更多
We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following a...We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following advantages: the frame of the algorithms is unified, the method is simple, and its implementation and revision are easy.展开更多
Population-based algorithms have been used in many real-world problems.Bat algorithm(BA)is one of the states of the art of these approaches.Because of the super bat,on the one hand,BA can converge quickly;on the other...Population-based algorithms have been used in many real-world problems.Bat algorithm(BA)is one of the states of the art of these approaches.Because of the super bat,on the one hand,BA can converge quickly;on the other hand,it is easy to fall into local optimum.Therefore,for typical BA algorithms,the ability of exploration and exploitation is not strong enough and it is hard to find a precise result.In this paper,we propose a novel bat algorithm based on cross boundary learning(CBL)and uniform explosion strategy(UES),namely BABLUE in short,to avoid the above contradiction and achieve both fast convergence and high quality.Different from previous opposition-based learning,the proposed CBL can expand the search area of population and then maintain the ability of global exploration in the process of fast convergence.In order to enhance the ability of local exploitation of the proposed algorithm,we propose UES,which can achieve almost the same search precise as that of firework explosion algorithm but consume less computation resource.BABLUE is tested with numerous experiments on unimodal,multimodal,one-dimensional,high-dimensional and discrete problems,and then compared with other typical intelligent optimization algorithms.The results show that the proposed algorithm outperforms other algorithms.展开更多
No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Seve...No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Several methods have been proposed to solve this problem, both exact (i.e. integer programming) and metaheuristic methods. Cross entropy (CE), as a new metaheuristic, can be an alternative method to solve NWJSS problem. This method has been used in combinatorial optimization, as well as multi-external optimization and rare-event simulation. On these problems, CE implementation results an optimal value with less computational time in average. However, using original CE to solve large scale NWJSS requires high computational time. Considering this shortcoming, this paper proposed a hybrid of cross entropy with genetic algorithm (GA), called CEGA, on m-machines NWJSS. The results are compared with other metaheuritics: Genetic Algorithm-Simulated Annealing (GASA) and hybrid tabu search. The results showed that CEGA providing better or at least equal makespans in comparison with the other two methods.展开更多
To consider multi-objective optimization problem with the number of feed array elements and sidelobe level of large antenna array, multi-objective cross entropy(CE) algorithm is proposed by combining fuzzy c-mean clus...To consider multi-objective optimization problem with the number of feed array elements and sidelobe level of large antenna array, multi-objective cross entropy(CE) algorithm is proposed by combining fuzzy c-mean clustering algorithm with traditional cross entropy algorithm, and specific program flow of the algorithm is given.Using the algorithm, large thinned array(200 elements) given sidelobe level(-10,-19 and-30 d B) problem is solved successfully. Compared with the traditional statistical algorithms, the optimization results of the algorithm validate that the number of feed array elements reduces by 51%, 11% and 6% respectively. In addition, compared with the particle swarm optimization(PSO) algorithm, the number of feed array elements from the algorithm is more similar, but the algorithm is more efficient.展开更多
To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root...To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root-min-norm algorithm was described,but it is susceptive to noises with unstable performance in different SNRs.So the modified root-min-norm algorithm based on cross-spectral estimation was proposed,utilizing cross-correlation matrix and independence of different Gaussian noise series.Lots of simulation experiments were carried out to test performance of the algorithm in different conditions,and its statistical characteristics was presented.Simulation results show that the modified algorithm can efficiently suppress influence of the noises,and has high frequency resolution,high precision and high stability,and it is much superior to the classic DFT method.展开更多
A novel adaptive algorithm of IIR lattice notch filter realized by all-pass filter is presented. The time-averaged estimation of cross correlation of the present instantaneous input signal and the past output signal i...A novel adaptive algorithm of IIR lattice notch filter realized by all-pass filter is presented. The time-averaged estimation of cross correlation of the present instantaneous input signal and the past output signal is used to update the step-size, leading to a considerably improved convergence rate in a low SNR situation and reduced steady-state bias and MSE. The theoretical expression for steady-state bounds on the step-size is derived, and the influence factors on the stable performance of the algorithm theoretically are analyzed. A normalized power factor is then introduced to control variation of step-size in its steady-state bounds. This technique prevents divergence due to the influence of large power input signal and improves robustness. Numerical experiments are performed to demonstrate superiority of the proposed method.展开更多
This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, ...This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, based on the traffic conditions. During the periods of peak traffic hours, the vehicles travel at low speeds and during non-peak hours, the vehicles travel at higher speeds. A survey by TCI and IIM-C (2014) found that stoppage delay as percentage of journey time varied between five percent and 25 percent, and was very much dependent on the characteristics of routes. Costs of delay were also estimated and found not to affect margins by significant amounts. This study aims to overcome such problems arising out of traffic congestions that lead to unnecessary delays and hence, loss in customers and thereby valuable revenues to a company. This study suggests alternative routes to minimize travel times and travel distance, assuming a congestion in traffic situation. In this study, an efficient GA-based algorithm has been developed for the TDVRP, to minimize the total distance travelled, minimize the total number of vehicles utilized and also suggest alternative routes for congestion avoidance. This study will help to overcome and minimize the negative effects due to heavy traffic congestions and delays in customer service. The proposed algorithm has been shown to be superior to another existing algorithm in terms of the total distance travelled and also the number of vehicles utilized. Also the performance of the proposed algorithm is as good as the mathematical model for small size problems.展开更多
基金funded by the State Grid Science and Technology Project“Research on Key Technologies for Prediction and Early Warning of Large-Scale Offshore Wind Power Ramp Events Based on Meteorological Data Enhancement”(4000-202318098A-1-1-ZN).
文摘The development of wind power clusters has scaled in terms of both scale and coverage,and the impact of weather fluctuations on cluster output changes has become increasingly complex.Accurately identifying the forward-looking information of key wind farms in a cluster under different weather conditions is an effective method to improve the accuracy of ultrashort-term cluster power forecasting.To this end,this paper proposes a refined modeling method for ultrashort-term wind power cluster forecasting based on a convergent cross-mapping algorithm.From the perspective of causality,key meteorological forecasting factors under different cluster power fluctuation processes were screened,and refined training modeling was performed for different fluctuation processes.First,a wind process description index system and classification model at the wind power cluster level are established to realize the classification of typical fluctuation processes.A meteorological-cluster power causal relationship evaluation model based on the convergent cross-mapping algorithm is pro-posed to screen meteorological forecasting factors under multiple types of typical fluctuation processes.Finally,a refined modeling meth-od for a variety of different typical fluctuation processes is proposed,and the strong causal meteorological forecasting factors of each scenario are used as inputs to realize high-precision modeling and forecasting of ultra-short-term wind cluster power.An example anal-ysis shows that the short-term wind power cluster power forecasting accuracy of the proposed method can reach 88.55%,which is 1.57-7.32%higher than that of traditional methods.
文摘We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following advantages: the frame of the algorithms is unified, the method is simple, and its implementation and revision are easy.
基金Supported by the National Natural Science Foundation of China(61472289)the Open Project Program of the State Key Laboratory of Digital Manufacturing Equipment and Technology(DMETKF2017016)
文摘Population-based algorithms have been used in many real-world problems.Bat algorithm(BA)is one of the states of the art of these approaches.Because of the super bat,on the one hand,BA can converge quickly;on the other hand,it is easy to fall into local optimum.Therefore,for typical BA algorithms,the ability of exploration and exploitation is not strong enough and it is hard to find a precise result.In this paper,we propose a novel bat algorithm based on cross boundary learning(CBL)and uniform explosion strategy(UES),namely BABLUE in short,to avoid the above contradiction and achieve both fast convergence and high quality.Different from previous opposition-based learning,the proposed CBL can expand the search area of population and then maintain the ability of global exploration in the process of fast convergence.In order to enhance the ability of local exploitation of the proposed algorithm,we propose UES,which can achieve almost the same search precise as that of firework explosion algorithm but consume less computation resource.BABLUE is tested with numerous experiments on unimodal,multimodal,one-dimensional,high-dimensional and discrete problems,and then compared with other typical intelligent optimization algorithms.The results show that the proposed algorithm outperforms other algorithms.
文摘No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Several methods have been proposed to solve this problem, both exact (i.e. integer programming) and metaheuristic methods. Cross entropy (CE), as a new metaheuristic, can be an alternative method to solve NWJSS problem. This method has been used in combinatorial optimization, as well as multi-external optimization and rare-event simulation. On these problems, CE implementation results an optimal value with less computational time in average. However, using original CE to solve large scale NWJSS requires high computational time. Considering this shortcoming, this paper proposed a hybrid of cross entropy with genetic algorithm (GA), called CEGA, on m-machines NWJSS. The results are compared with other metaheuritics: Genetic Algorithm-Simulated Annealing (GASA) and hybrid tabu search. The results showed that CEGA providing better or at least equal makespans in comparison with the other two methods.
基金the National Natural Science Foundation of China(No.51474100)the Youth Science Fund of Heilongjiang Province in China(No.QC2010023)the Youth Outstanding Ability Program in Heilongjiang University of Science and Technology
文摘To consider multi-objective optimization problem with the number of feed array elements and sidelobe level of large antenna array, multi-objective cross entropy(CE) algorithm is proposed by combining fuzzy c-mean clustering algorithm with traditional cross entropy algorithm, and specific program flow of the algorithm is given.Using the algorithm, large thinned array(200 elements) given sidelobe level(-10,-19 and-30 d B) problem is solved successfully. Compared with the traditional statistical algorithms, the optimization results of the algorithm validate that the number of feed array elements reduces by 51%, 11% and 6% respectively. In addition, compared with the particle swarm optimization(PSO) algorithm, the number of feed array elements from the algorithm is more similar, but the algorithm is more efficient.
基金Shandong University of Science and Technology Research Fund(No.2010KYTD101)
文摘To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root-min-norm algorithm was described,but it is susceptive to noises with unstable performance in different SNRs.So the modified root-min-norm algorithm based on cross-spectral estimation was proposed,utilizing cross-correlation matrix and independence of different Gaussian noise series.Lots of simulation experiments were carried out to test performance of the algorithm in different conditions,and its statistical characteristics was presented.Simulation results show that the modified algorithm can efficiently suppress influence of the noises,and has high frequency resolution,high precision and high stability,and it is much superior to the classic DFT method.
文摘A novel adaptive algorithm of IIR lattice notch filter realized by all-pass filter is presented. The time-averaged estimation of cross correlation of the present instantaneous input signal and the past output signal is used to update the step-size, leading to a considerably improved convergence rate in a low SNR situation and reduced steady-state bias and MSE. The theoretical expression for steady-state bounds on the step-size is derived, and the influence factors on the stable performance of the algorithm theoretically are analyzed. A normalized power factor is then introduced to control variation of step-size in its steady-state bounds. This technique prevents divergence due to the influence of large power input signal and improves robustness. Numerical experiments are performed to demonstrate superiority of the proposed method.
文摘This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, based on the traffic conditions. During the periods of peak traffic hours, the vehicles travel at low speeds and during non-peak hours, the vehicles travel at higher speeds. A survey by TCI and IIM-C (2014) found that stoppage delay as percentage of journey time varied between five percent and 25 percent, and was very much dependent on the characteristics of routes. Costs of delay were also estimated and found not to affect margins by significant amounts. This study aims to overcome such problems arising out of traffic congestions that lead to unnecessary delays and hence, loss in customers and thereby valuable revenues to a company. This study suggests alternative routes to minimize travel times and travel distance, assuming a congestion in traffic situation. In this study, an efficient GA-based algorithm has been developed for the TDVRP, to minimize the total distance travelled, minimize the total number of vehicles utilized and also suggest alternative routes for congestion avoidance. This study will help to overcome and minimize the negative effects due to heavy traffic congestions and delays in customer service. The proposed algorithm has been shown to be superior to another existing algorithm in terms of the total distance travelled and also the number of vehicles utilized. Also the performance of the proposed algorithm is as good as the mathematical model for small size problems.
