scholarly journals The Parameters Optimization of MCR-WPT System Based on the Improved Genetic Simulated Annealing Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Sheng Lu ◽  
Chenyang Zuo ◽  
Changhao Piao

To solve the problem of parameter selection during the design of magnetically coupled resonant wireless power transmission system (MCR-WPT), this paper proposed an improved genetic simulated annealing algorithm. Firstly, the equivalent circuit of the system is analysis in this study and a nonlinear programming mathematical model is built. Secondly, in place of the penalty function method in the genetic algorithm, the selection strategy based on the distance between individuals is adopted to select individual. In this way, it reduces the excess empirical parameters. Meanwhile, it can improve the convergence rate and the searching ability by calculating crossover probability and mutation probability according to the variance of population’s fitness. At last, the simulated annealing operator is added to increase local search ability of the method. The simulation shows that the improved method can break the limit of the local optimum solution and get the global optimum solution faster. The optimized system can achieve the practical requirements.

2014 ◽  
Vol 1022 ◽  
pp. 269-272
Author(s):  
Ling Li Zhu ◽  
Lan Wang

Aiming at the characteristic of medical images, this paper presents the improved genetic simulated annealing algorithm with K-means clustering analysis and applies in medical CT image segmentation. This improved genetic simulated annealing algorithm can be used to globally optimize k-means image segmentation functions to solve the locality and the sensitiveness of the initial condition. It can automatically adjust the parameters of genetic algorithm according to the fitness values of individuals and the decentralizing degree of individuals of the population and keep the variety of population for rapidly converging, and it can effectively avoid appearing precocity and plunging into local optimum. The example shows that the method is feasible, and better segmentation results have got to satisfy the request for 3D reconstruction, compared with k-means image segmentation and genetic algorithm based image segmentation.


Sensors ◽  
2020 ◽  
Vol 20 (5) ◽  
pp. 1503 ◽  
Author(s):  
Lijuan Su ◽  
Yue Xu ◽  
Yan Yuan ◽  
Jingyi Yang

Mixed pixels commonly exist in low-resolution remote sensing images, and they are the key factors hindering the classification of land covers and high-precision mapping. To obtain the spatial information at the subpixel level, subpixel mapping (SPM) technologies, including the pixel-swapping algorithm (PSA), that use the unmixed proportions of various land covers and allocate subpixel land covers have been proposed. However, the PSA often falls into a local optimum solution. In this paper, we propose a SPM method, the PSA_MSA algorithm, that combines the PSA and the modified simulated annealing algorithm to find the global optimum solution. The modified simulated annealing algorithm swaps subpixels within a certain range to escape the local optimum solution. The method also optimizes all the mixed pixels in a randomized sequence to further improve the mapping accuracy. The experimental results demonstrate that the proposed PSA_MSA algorithm outperforms the existing PSA-based algorithms for SPM. The images with different spatial dependences are tested and the results show that the proposed algorithm is more suitable for images with high spatial autocorrelation. In addition, the effect of proportion error is analyzed by adding it in the experiments. The result shows that a higher proportion error rate leads to larger degradation of the subpixel mapping accuracy. Finally, the performance of PSA_MSA algorithm with different ranges of selection on subpixel-swapping is analyzed.


2021 ◽  
Vol 28 (2) ◽  
pp. 101-109

Software testing is an important stage in the software development process, which is the key to ensure software quality and improve software reliability. Software fault localization is the most important part of software testing. In this paper, the fault localization problem is modeled as a combinatorial optimization problem, using the function call path as a starting point. A heuristic search algorithm based on hybrid genetic simulated annealing algorithm is used to locate software defects. Experimental results show that the fault localization method, which combines genetic algorithm, simulated annealing algorithm and function correlation analysis method, has a good effect on single fault localization and multi-fault localization. It greatly reduces the requirement of test case coverage and the burden of the testers, and improves the effect of fault localization.


Sign in / Sign up

Export Citation Format

Share Document