In order to solve the problem that the resource scheduling time of cloud data center is too long,this paper analyzes the two-stage resource scheduling mechanism of cloud data center.Aiming at the minimum task completi...In order to solve the problem that the resource scheduling time of cloud data center is too long,this paper analyzes the two-stage resource scheduling mechanism of cloud data center.Aiming at the minimum task completion time,a mathematical model of resource scheduling in cloud data center is established.The two-stage resource scheduling optimization simulation is realized by using the conventional genetic algorithm.On the technology of the conventional genetic algorithm,an adaptive transformation operator is designed to improve the crossover and mutation of the genetic algorithm.The experimental results show that the improved genetic algorithm can significantly reduce the total completion time of the task,and has good convergence and global optimization ability.展开更多
A multi-objective improved genetic algorithm is constructed to solve the train operation simulation model of urban rail train and find the optimal operation curve.In the train control system,the conversion point of op...A multi-objective improved genetic algorithm is constructed to solve the train operation simulation model of urban rail train and find the optimal operation curve.In the train control system,the conversion point of operating mode is the basic of gene encoding and the chromosome composed of multiple genes represents a control scheme,and the initial population can be formed by the way.The fitness function can be designed by the design requirements of the train control stop error,time error and energy consumption.the effectiveness of new individual can be ensured by checking the validity of the original individual when its in the process of selection,crossover and mutation,and the optimal algorithm will be joined all the operators to make the new group not eliminate on the best individual of the last generation.The simulation result shows that the proposed genetic algorithm comparing with the optimized multi-particle simulation model can reduce more than 10%energy consumption,it can provide a large amount of sub-optimal solution and has obvious optimization effect.展开更多
Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select...Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.展开更多
This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satell...This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.展开更多
An efficient method is proposed for the design of finite impulse response(FIR) filter with arbitrary pass band edge,stop band edge frequencies and transition width.The proposed FIR band stop filter is designed using c...An efficient method is proposed for the design of finite impulse response(FIR) filter with arbitrary pass band edge,stop band edge frequencies and transition width.The proposed FIR band stop filter is designed using craziness based particle swarm optimization(CRPSO) approach.Given the filter specifications to be realized,the CRPSO algorithm generates a set of optimal filter coefficients and tries to meet the ideal frequency response characteristics.In this paper,for the given problem,the realizations of the optimal FIR band pass filters of different orders have been performed.The simulation results have been compared with those obtained by the well accepted evolutionary algorithms,such as Parks and McClellan algorithm(PMA),genetic algorithm(GA) and classical particle swarm optimization(PSO).Several numerical design examples justify that the proposed optimal filter design approach using CRPSO outperforms PMA and PSO,not only in the accuracy of the designed filter but also in the convergence speed and solution quality.展开更多
This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear c...This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear characteristics of the generators, such as prohibited operating zones, ramp rate limits and non-smooth cost functions of the practical generator operation are considered. The proposed hybrid algorithm is demonstrated for three different systems and the performance is compared with the GA and PSO in terms of solution quality and computation efficiency. Comparison of results proved that the proposed algo- rithm can obtain higher quality solutions efficiently in ED problems. A comprehensive software package is developed using MATLAB.展开更多
The convergence analysis of MaxMin-SOMO algorithm is presented. The SOM-based optimization (SOMO) is an optimization algorithm based on the self-organizing map (SOM) in order to find a winner in the network. Generally...The convergence analysis of MaxMin-SOMO algorithm is presented. The SOM-based optimization (SOMO) is an optimization algorithm based on the self-organizing map (SOM) in order to find a winner in the network. Generally, through a competitive learning process, the SOMO algorithm searches for the minimum of an objective function. The MaxMin-SOMO algorithm is the generalization of SOMO with two winners for simultaneously finding two winning neurons i.e., first winner stands for minimum and second one for maximum of the objective function. In this paper, the convergence analysis of the MaxMin-SOMO is presented. More specifically, we prove that the distance between neurons decreases at each iteration and finally converge to zero. The work is verified with the experimental results.展开更多
When the classical constant false-alarm rate （CFAR） combined with fuzzy C-means （FCM） algorithm is applied to target detection in synthetic aperture radar （SAR） images with complex background, CFAR requires bloc...When the classical constant false-alarm rate （CFAR） combined with fuzzy C-means （FCM） algorithm is applied to target detection in synthetic aperture radar （SAR） images with complex background, CFAR requires block-by-block estimation of clutter models and FCM clustering converges to local optimum. To address these problems, this paper pro-poses a new detection algorithm： knowledge-based combined with improved genetic algorithm-fuzzy C-means （GA-FCM） algorithm. Firstly, the algorithm takes target region＇s maximum and average intensity, area, length of long axis and long-to-short axis ratio of the external ellipse as factors which influence the target appearing probabil- ity. The knowledge-based detection algorithm can produce preprocess results without the need of estimation of clutter models as CFAR does. Afterward the GA-FCM algorithm is improved to cluster pre-process results. It has advantages of incorporating global optimizing ability of GA and local optimizing ability of FCM, which will further eliminate false alarms and get better results. The effectiveness of the proposed technique is experimentally validated with real SAR images.展开更多
基金National Natural Science Foundation of China(61473216)Shaanxi Provincial Fund(2015JM6337)。
文摘In order to solve the problem that the resource scheduling time of cloud data center is too long,this paper analyzes the two-stage resource scheduling mechanism of cloud data center.Aiming at the minimum task completion time,a mathematical model of resource scheduling in cloud data center is established.The two-stage resource scheduling optimization simulation is realized by using the conventional genetic algorithm.On the technology of the conventional genetic algorithm,an adaptive transformation operator is designed to improve the crossover and mutation of the genetic algorithm.The experimental results show that the improved genetic algorithm can significantly reduce the total completion time of the task,and has good convergence and global optimization ability.
基金This work was supported by the Youth Backbone Teachers Training Program of Henan Colleges and Universities under Grant No.2016ggjs-287the Project of Science and Technology of Henan Province under Grant Nos.172102210124 and 202102210269.
文摘A multi-objective improved genetic algorithm is constructed to solve the train operation simulation model of urban rail train and find the optimal operation curve.In the train control system,the conversion point of operating mode is the basic of gene encoding and the chromosome composed of multiple genes represents a control scheme,and the initial population can be formed by the way.The fitness function can be designed by the design requirements of the train control stop error,time error and energy consumption.the effectiveness of new individual can be ensured by checking the validity of the original individual when its in the process of selection,crossover and mutation,and the optimal algorithm will be joined all the operators to make the new group not eliminate on the best individual of the last generation.The simulation result shows that the proposed genetic algorithm comparing with the optimized multi-particle simulation model can reduce more than 10%energy consumption,it can provide a large amount of sub-optimal solution and has obvious optimization effect.
文摘Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.
基金supported by the National Natural Science Foundation of China(7127106671171065+1 种基金71202168)the Natural Science Foundation of Heilongjiang Province(GC13D506)
文摘This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.
文摘An efficient method is proposed for the design of finite impulse response(FIR) filter with arbitrary pass band edge,stop band edge frequencies and transition width.The proposed FIR band stop filter is designed using craziness based particle swarm optimization(CRPSO) approach.Given the filter specifications to be realized,the CRPSO algorithm generates a set of optimal filter coefficients and tries to meet the ideal frequency response characteristics.In this paper,for the given problem,the realizations of the optimal FIR band pass filters of different orders have been performed.The simulation results have been compared with those obtained by the well accepted evolutionary algorithms,such as Parks and McClellan algorithm(PMA),genetic algorithm(GA) and classical particle swarm optimization(PSO).Several numerical design examples justify that the proposed optimal filter design approach using CRPSO outperforms PMA and PSO,not only in the accuracy of the designed filter but also in the convergence speed and solution quality.
文摘This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear characteristics of the generators, such as prohibited operating zones, ramp rate limits and non-smooth cost functions of the practical generator operation are considered. The proposed hybrid algorithm is demonstrated for three different systems and the performance is compared with the GA and PSO in terms of solution quality and computation efficiency. Comparison of results proved that the proposed algo- rithm can obtain higher quality solutions efficiently in ED problems. A comprehensive software package is developed using MATLAB.
基金supported by National Natural Science Foundation of China(Nos.11171367 and 61502068)the Fundamental Research Funds for the Central Universities of China(No.3132014094)+1 种基金the China Postdoctoral Science Foundation(Nos.2013M541213 and 2015T80239)Fundacao da Amaro a Pesquisa do Estado de Sao Paulo(FAPESP)Brazil(No.2012/23329-5)
文摘The convergence analysis of MaxMin-SOMO algorithm is presented. The SOM-based optimization (SOMO) is an optimization algorithm based on the self-organizing map (SOM) in order to find a winner in the network. Generally, through a competitive learning process, the SOMO algorithm searches for the minimum of an objective function. The MaxMin-SOMO algorithm is the generalization of SOMO with two winners for simultaneously finding two winning neurons i.e., first winner stands for minimum and second one for maximum of the objective function. In this paper, the convergence analysis of the MaxMin-SOMO is presented. More specifically, we prove that the distance between neurons decreases at each iteration and finally converge to zero. The work is verified with the experimental results.
基金supported by the National Natural Science Foundation of China(6107113961171122)+1 种基金the Fundamental Research Funds for the Central Universities"New Star in Blue Sky" Program Foundation the Foundation of ATR Key Lab
文摘When the classical constant false-alarm rate （CFAR） combined with fuzzy C-means （FCM） algorithm is applied to target detection in synthetic aperture radar （SAR） images with complex background, CFAR requires block-by-block estimation of clutter models and FCM clustering converges to local optimum. To address these problems, this paper pro-poses a new detection algorithm： knowledge-based combined with improved genetic algorithm-fuzzy C-means （GA-FCM） algorithm. Firstly, the algorithm takes target region＇s maximum and average intensity, area, length of long axis and long-to-short axis ratio of the external ellipse as factors which influence the target appearing probabil- ity. The knowledge-based detection algorithm can produce preprocess results without the need of estimation of clutter models as CFAR does. Afterward the GA-FCM algorithm is improved to cluster pre-process results. It has advantages of incorporating global optimizing ability of GA and local optimizing ability of FCM, which will further eliminate false alarms and get better results. The effectiveness of the proposed technique is experimentally validated with real SAR images.
