In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed ...In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed tomography（SPECT） with uniform attenuation, and the modified central slice theorem is developed. Numerical simulations are conducted to demonstrate the effec- tiveness of the developed method.展开更多
This paper presents a new genetic algorithm for job-shop scheduling problem. Based on schema theorem and building block hypothesis, a new crossover is proposed. By selecting short, low-order, highly fit schemas for ge...This paper presents a new genetic algorithm for job-shop scheduling problem. Based on schema theorem and building block hypothesis, a new crossover is proposed. By selecting short, low-order, highly fit schemas for genetic operator, the crossover can maintain a diversity of population without disrupting the characteristics and search the global optimization. Simulation results on famous benchmark problems MT06, MT10 and MT20 coded by Matlab show that our genetic operators are suitable to job-shop scheduling problems and outperform the previous GA-based approaches.展开更多
In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new cro...In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.展开更多
基金Supported by the National Natural Science Foundation of China(61271398)the Natural Science Foundation of Ningbo(2012A610031)
文摘In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed tomography（SPECT） with uniform attenuation, and the modified central slice theorem is developed. Numerical simulations are conducted to demonstrate the effec- tiveness of the developed method.
文摘This paper presents a new genetic algorithm for job-shop scheduling problem. Based on schema theorem and building block hypothesis, a new crossover is proposed. By selecting short, low-order, highly fit schemas for genetic operator, the crossover can maintain a diversity of population without disrupting the characteristics and search the global optimization. Simulation results on famous benchmark problems MT06, MT10 and MT20 coded by Matlab show that our genetic operators are suitable to job-shop scheduling problems and outperform the previous GA-based approaches.
文摘In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.
