Under the theory structure of compressive sensing （CS）, an underdetermined equation is deduced for describing the discrete solution of the electromagnetic integral equation of body of revolution （BOR）, which will ...Under the theory structure of compressive sensing （CS）, an underdetermined equation is deduced for describing the discrete solution of the electromagnetic integral equation of body of revolution （BOR）, which will result in a small-scale impedance matrix. In the new linear equation system, the small-scale impedance matrix can be regarded as the measurement matrix in CS, while the excited vector is the measurement of unknown currents. Instead of solving dense full rank matrix equations by the iterative method, with suitable sparse representation, for unknown currents on the surface of BOR, the entire current can be accurately obtained by reconstructed algorithms in CS for small-scale undetermined equations. Numerical results show that the proposed method can greatly improve the computgtional efficiency and can decrease memory consumed.展开更多
An improved genetic algorithm and its application to resolve cutting stock problem arc presented. It is common to apply simple genetic algorithm （SGA） to cutting stock problem, but the huge amount of computing of SG...An improved genetic algorithm and its application to resolve cutting stock problem arc presented. It is common to apply simple genetic algorithm （SGA） to cutting stock problem, but the huge amount of computing of SGA is a serious problem in practical application. Accelerating genetic algorithm （AGA） based on integer coding and AGA＇s detailed steps are developed to reduce the amount of computation, and a new kind of rectangular parts blank layout algorithm is designed for rectangular cutting stock problem. SGA is adopted to produce individuals within given evolution process, and the variation interval of these individuals is taken as initial domain of the next optimization process, thus shrinks searching range intensively and accelerates the evaluation process of SGA. To enhance the diversity of population and to avoid the algorithm stagnates at local optimization result, fixed number of individuals are produced randomly and replace the same number of parents in every evaluation process. According to the computational experiment, it is observed that this improved GA converges much sooner than SGA, and is able to get the balance of good result and high efficiency in the process of optimization for rectangular cutting stock problem.展开更多
基金Supported by the National Natural Science Foundation of China under Grant Nos 51477039 and 51207041the Program of Hefei Normal University under Grant Nos 2014136KJA04 and 2015TD01the Key Project of Provincial Natural Science Research of University of Anhui Province of China under Grant No KJ2015A174
文摘Under the theory structure of compressive sensing （CS）, an underdetermined equation is deduced for describing the discrete solution of the electromagnetic integral equation of body of revolution （BOR）, which will result in a small-scale impedance matrix. In the new linear equation system, the small-scale impedance matrix can be regarded as the measurement matrix in CS, while the excited vector is the measurement of unknown currents. Instead of solving dense full rank matrix equations by the iterative method, with suitable sparse representation, for unknown currents on the surface of BOR, the entire current can be accurately obtained by reconstructed algorithms in CS for small-scale undetermined equations. Numerical results show that the proposed method can greatly improve the computgtional efficiency and can decrease memory consumed.
基金This project is supported by National Natural Science Foundation of China (No.50575153)Provincial Key Technology Projects of Sichuan, China (No.03GG010-002)
文摘An improved genetic algorithm and its application to resolve cutting stock problem arc presented. It is common to apply simple genetic algorithm （SGA） to cutting stock problem, but the huge amount of computing of SGA is a serious problem in practical application. Accelerating genetic algorithm （AGA） based on integer coding and AGA＇s detailed steps are developed to reduce the amount of computation, and a new kind of rectangular parts blank layout algorithm is designed for rectangular cutting stock problem. SGA is adopted to produce individuals within given evolution process, and the variation interval of these individuals is taken as initial domain of the next optimization process, thus shrinks searching range intensively and accelerates the evaluation process of SGA. To enhance the diversity of population and to avoid the algorithm stagnates at local optimization result, fixed number of individuals are produced randomly and replace the same number of parents in every evaluation process. According to the computational experiment, it is observed that this improved GA converges much sooner than SGA, and is able to get the balance of good result and high efficiency in the process of optimization for rectangular cutting stock problem.
