期刊文献+
共找到169篇文章
< 1 2 9 >
每页显示 20 50 100
PHUI-GA: GPU-based efficiency evolutionary algorithm for mining high utility itemsets
1
作者 JIANG Haipeng WU Guoqing +3 位作者 SUN Mengdan LI Feng SUN Yunfei FANG Wei 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2024年第4期965-975,共11页
Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining perform... Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining performance,but they still require huge computational resource and may miss many HUIs.Due to the good combination of EA and graphics processing unit(GPU),we propose a parallel genetic algorithm(GA)based on the platform of GPU for mining HUIM(PHUI-GA).The evolution steps with improvements are performed in central processing unit(CPU)and the CPU intensive steps are sent to GPU to eva-luate with multi-threaded processors.Experiments show that the mining performance of PHUI-GA outperforms the existing EAs.When mining 90%HUIs,the PHUI-GA is up to 188 times better than the existing EAs and up to 36 times better than the CPU parallel approach. 展开更多
关键词 high utility itemset mining(HUIM) graphics process-ing unit(GPU)parallel genetic algorithm(ga) mining perfor-mance
下载PDF
New Antenna Array Beamforming Techniques Based on Hybrid Convolution/Genetic Algorithm for 5G and Beyond Communications
2
作者 Shimaa M.Amer Ashraf A.M.Khalaf +3 位作者 Amr H.Hussein Salman A.Alqahtani Mostafa H.Dahshan Hossam M.Kassem 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第3期2749-2767,共19页
Side lobe level reduction(SLL)of antenna arrays significantly enhances the signal-to-interference ratio and improves the quality of service(QOS)in recent and future wireless communication systems starting from 5G up t... Side lobe level reduction(SLL)of antenna arrays significantly enhances the signal-to-interference ratio and improves the quality of service(QOS)in recent and future wireless communication systems starting from 5G up to 7G.Furthermore,it improves the array gain and directivity,increasing the detection range and angular resolution of radar systems.This study proposes two highly efficient SLL reduction techniques.These techniques are based on the hybridization between either the single convolution or the double convolution algorithms and the genetic algorithm(GA)to develop the Conv/GA andDConv/GA,respectively.The convolution process determines the element’s excitations while the GA optimizes the element spacing.For M elements linear antenna array(LAA),the convolution of the excitation coefficients vector by itself provides a new vector of excitations of length N=(2M−1).This new vector is divided into three different sets of excitations including the odd excitations,even excitations,and middle excitations of lengths M,M−1,andM,respectively.When the same element spacing as the original LAA is used,it is noticed that the odd and even excitations provide a much lower SLL than that of the LAA but with amuch wider half-power beamwidth(HPBW).While the middle excitations give the same HPBWas the original LAA with a relatively higher SLL.Tomitigate the increased HPBWof the odd and even excitations,the element spacing is optimized using the GA.Thereby,the synthesized arrays have the same HPBW as the original LAA with a two-fold reduction in the SLL.Furthermore,for extreme SLL reduction,the DConv/GA is introduced.In this technique,the same procedure of the aforementioned Conv/GA technique is performed on the resultant even and odd excitation vectors.It provides a relatively wider HPBWthan the original LAA with about quad-fold reduction in the SLL. 展开更多
关键词 Array synthesis convolution process genetic algorithm(ga) half power beamwidth(HPBW) linear antenna array(LAA) side lobe level(SLL) quality of service(QOS)
下载PDF
Quantitatively characterizing sandy soil structure altered by MICP using multi-level thresholding segmentation algorithm 被引量:1
3
作者 Jianjun Zi Tao Liu +3 位作者 Wei Zhang Xiaohua Pan Hu Ji Honghu Zhu 《Journal of Rock Mechanics and Geotechnical Engineering》 SCIE CSCD 2024年第10期4285-4299,共15页
The influences of biological,chemical,and flow processes on soil structure through microbially induced carbonate precipitation(MICP)are not yet fully understood.In this study,we use a multi-level thresholding segmenta... The influences of biological,chemical,and flow processes on soil structure through microbially induced carbonate precipitation(MICP)are not yet fully understood.In this study,we use a multi-level thresholding segmentation algorithm,genetic algorithm(GA)enhanced Kapur entropy(KE)(GAE-KE),to accomplish quantitative characterization of sandy soil structure altered by MICP cementation.A sandy soil sample was treated using MICP method and scanned by the synchrotron radiation(SR)micro-CT with a resolution of 6.5 mm.After validation,tri-level thresholding segmentation using GAE-KE successfully separated the precipitated calcium carbonate crystals from sand particles and pores.The spatial distributions of porosity,pore structure parameters,and flow characteristics were calculated for quantitative characterization.The results offer pore-scale insights into the MICP treatment effect,and the quantitative understanding confirms the feasibility of the GAE-KE multi-level thresholding segmentation algorithm. 展开更多
关键词 Soil structure MICRO-CT Multi-level thresholding MICP genetic algorithm(ga)
下载PDF
FPGA PLACEMENT OPTIMIZATION BY TWO-STEP UNIFIED GENETIC ALGORITHM AND SIMULATED ANNEALING ALGORITHM 被引量:6
4
作者 Yang Meng A.E.A. Almaini Wang Pengjun 《Journal of Electronics(China)》 2006年第4期632-636,共5页
Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it... Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing (SA) converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route (VPR) Tool. 展开更多
关键词 genetic algorithm ga Simulated Annealing (SA) PLACEMENT FPga EDA
下载PDF
A New Image Watermarking Scheme Using Genetic Algorithm and Residual Numbers with Discrete Wavelet Transform
5
作者 Peter Awonnatemi Agbedemnab Mohammed Akolgo Moses Apambila Agebure 《Journal of Information Security》 2023年第4期422-436,共15页
Transmission of data over the internet has become a critical issue as a result of the advancement in technology, since it is possible for pirates to steal the intellectual property of content owners. This paper presen... Transmission of data over the internet has become a critical issue as a result of the advancement in technology, since it is possible for pirates to steal the intellectual property of content owners. This paper presents a new digital watermarking scheme that combines some operators of the Genetic Algorithm (GA) and the Residue Number (RN) System (RNS) to perform encryption on an image, which is embedded into a cover image for the purposes of watermarking. Thus, an image watermarking scheme uses an encrypted image. The secret image is embedded in decomposed frames of the cover image achieved by applying a three-level Discrete Wavelet Transform (DWT). This is to ensure that the secret information is not exposed even when there is a successful attack on the cover information. Content creators can prove ownership of the multimedia content by unveiling the secret information in a court of law. The proposed scheme was tested with sample data using MATLAB2022 and the results of the simulation show a great deal of imperceptibility and robustness as compared to similar existing schemes. 展开更多
关键词 Discrete Wavelet Transform (DWT) Digital Watermarking Encryption genetic algorithm (ga) Residue Number System (RNS) gaRN
下载PDF
NOVEL APPROACH TO LOCATOR LAYOUT OPTIMIZATION BASED ON GENETIC ALGORITHM 被引量:5
6
作者 吴铁军 楼佩煌 秦国华 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2011年第2期176-182,共7页
Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture ... Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture design process. However, the design of a fixture relies heavily on the designerts expertise and experience up to now. Therefore, a new approach to loeator layout determination for workpieces with arbitrary complex surfaces is pro- posed for the first time. Firstly, based on the fuzzy judgment method, the proper locating reference and locator - numbers are determined with consideration of surface type, surface area and position tolerance. Secondly, the lo- cator positions are optimized by genetic algorithm(GA). Finally, a typical example shows that the approach is su- perior to the experiential method and can improve positioning accuracy effectively. 展开更多
关键词 locator layout locating error fuzzy judgment genetic algorithmga
下载PDF
Reconstruction of the linac photon spectrum based on prior knowledge and the genetic algorithm 被引量:1
7
作者 周正东 陈元华 +1 位作者 王东东 余子丽 《Journal of Southeast University(English Edition)》 EI CAS 2014年第3期311-314,共4页
In order to derive the linac photon spectrum accurately both the prior constrained model and the genetic algorithm GA are employed using the measured percentage depth dose PDD data and the Monte Carlo simulated monoen... In order to derive the linac photon spectrum accurately both the prior constrained model and the genetic algorithm GA are employed using the measured percentage depth dose PDD data and the Monte Carlo simulated monoenergetic PDDs where two steps are involved.First the spectrum is modeled as a prior analytical function with two parameters αand Ep optimized with the GA.Secondly the linac photon spectrum is modeled as a discretization constrained model optimized with the GA. The solved analytical function in the first step is used to generate initial solutions for the GA’s first run in this step.The method is applied to the Varian iX linear accelerator to derive the energy spectra of its 6 and 15 MV photon beams.The experimental results show that both the reconstructed spectrums and the derived PDDs with the proposed method are in good agreement with those calculated using the Monte Carlo simulation. 展开更多
关键词 reconstruction of the photon spectrum priorknowledge genetic algorithm ga percent depth dose(PDD) Monte Carlo simulation
下载PDF
RESEARCH ON THE MINIMUM ZONE CYLINDRICITY EVALUATION BASED ON GENETIC ALGORITHMS 被引量:9
8
作者 Cui ChangcaiChe RenshengYe DongHuang QingchengDepartment of Automatic Measurement and Control,Harbin Institute of Technology, Harbin 150001, China 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2003年第2期167-170,共4页
A genetic algorithm (GA)-based method is proposed to solve the nonlinearoptimization problem of minimum zone cylindricity evaluation. First, the background of the problemis introduced. Then the mathematical model and ... A genetic algorithm (GA)-based method is proposed to solve the nonlinearoptimization problem of minimum zone cylindricity evaluation. First, the background of the problemis introduced. Then the mathematical model and the fitness function are derived from themathematical definition of dimensioning and tolerancing principles. Thirdly with the least squaressolution as the initial values, the whole implementation process of the algorithm is realized inwhich some key techniques, for example, variables representing, population initializing and suchbasic operations as selection, crossover and mutation, are discussed in detail. Finally, examplesare quoted to verify the proposed algorithm. The computation results indicate that the GA-basedoptimization method performs well on cylindricity evaluation. The outstanding advantages concludehigh accuracy, high efficiency and capabilities of solving complicated nonlinear and large spaceproblems. 展开更多
关键词 genetic algorithm (ga) CYLINDRICITY form error minimum zone
下载PDF
Job shop scheduling problem with alternative machines using genetic algorithms 被引量:10
9
作者 I.A.Chaudhry 《Journal of Central South University》 SCIE EI CAS 2012年第5期1322-1333,共12页
The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job ther... The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines. 展开更多
关键词 alternative machine genetic algorithm ga job shop scheduling SPREADSHEET
下载PDF
Improved genetic algorithm for nonlinear programming problems 被引量:8
10
作者 Kezong Tang Jingyu Yang +1 位作者 Haiyan Chen Shang Gao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2011年第3期540-546,共7页
An improved genetic algorithm(IGA) based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector w... An improved genetic algorithm(IGA) based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals' feature vector.Additionally,a local search(LS) process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms. 展开更多
关键词 genetic algorithmga nonlinear programming problem constraint handling non-dominated solution optimization problem.
下载PDF
FORM ERROR EVALUATION OF CIRCLES BASED ON A FINELY-DESIGNED GENETIC ALGORITHM 被引量:5
11
作者 CuiChangcai CheRensheng LiZhongyan YeDong 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2004年第1期59-62,共4页
A genetic algorithm(GA)-based new method is designed to evaluate thecircularity error of mechanical parts. The method uses the capability of nonlinear optimization ofGA to search for the optimal solution of circularit... A genetic algorithm(GA)-based new method is designed to evaluate thecircularity error of mechanical parts. The method uses the capability of nonlinear optimization ofGA to search for the optimal solution of circularity error. The finely-designed GA (FDGA)characterized dynamical bisexual recombination and Gaussian mutation. The mathematical model of thenonlinear problem is given. The implementation details in FDGA are described such as the crossoveror recombination mechanism which utilized a bisexual reproduction scheme and the elitist reservationmethod; and the adaptive mutation which used the Gaussian probability distribution to determine thevalues of the offspring produced by mutation mechanism. The examples are provided to verify thedesigned FDGA. The computation results indicate that the FDGA works very well in the field of formerror evaluation such as circularity evaluation. 展开更多
关键词 genetic algorithm(ga) Form error CIRCULARITY Bisexual recombination gaussian mutation
下载PDF
A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery 被引量:10
12
作者 Fang-Geng Zhao Jiang-Sheng Sun +1 位作者 Su-Jian Li Wei-Min Liu 《International Journal of Automation and computing》 EI 2009年第1期97-102,共6页
In this paper, a hybrid genetic algorithm (GA) is proposed for the traveling salesman problem (TSP) with pickup and delivery (TSPPD). In our algorithm, a novel pheromone-based crossover operator is advanced that... In this paper, a hybrid genetic algorithm (GA) is proposed for the traveling salesman problem (TSP) with pickup and delivery (TSPPD). In our algorithm, a novel pheromone-based crossover operator is advanced that utilizes both local and global information to construct offspring. In addition, a local search procedure is integrated into the GA to accelerate convergence. The proposed GA has been tested on benchmark instances, and the computational results show that it gives better convergence than existing heuristics. 展开更多
关键词 genetic algorithm ga pheromone-based crossover local search pickup and delivery traveling salesman problem(TSP).
下载PDF
Memristive network-based genetic algorithm and its application to image edge detection 被引量:5
13
作者 YU Yongbin YANG Chenyu +3 位作者 DENG Quanxin NYIMA Tashi LIANG Shouyi ZHOU Chen 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第5期1062-1070,共9页
This paper proposes a mem-computing model of memristive network-based genetic algorithm(MNGA)by building up the relationship between the memristive network(MN)and the genetic algorithm(GA),and a new edge detection alg... This paper proposes a mem-computing model of memristive network-based genetic algorithm(MNGA)by building up the relationship between the memristive network(MN)and the genetic algorithm(GA),and a new edge detection algorithm where image pixels are defined as individuals of population.First,the computing model of MNGA is designed to perform mem-computing,which brings new possibility of the hardware implementation of GA.Secondly,MNGA-based edge detection integrating image filter and GA operator deployed by MN is proposed.Finally,simulation results demonstrate that the figure of merit(FoM)of our model is better than the latest memristor-based swarm intelligence.In summary,a new way is found to build proper matching of memristor to GA and aid image edge detection. 展开更多
关键词 memristive network(MN) genetic algorithm(ga) edge detection mem-computing
下载PDF
A hybrid genetic-simulated annealing algorithm for optimization of hydraulic manifold blocks 被引量:7
14
作者 刘万辉 田树军 +1 位作者 贾春强 曹宇宁 《Journal of Shanghai University(English Edition)》 CAS 2008年第3期261-267,共7页
This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks (HMB). Due to the limitation o... This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks (HMB). Due to the limitation of its local search ability of genetic algorithm (GA) in solving a massive combinatorial optimization problem, simulated annealing (SA) is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality. 展开更多
关键词 hydraulic manifold blocks (HMB) genetic algorithm ga simulated annealing (SA) optimal design
下载PDF
Application of GA, PSO, and ACO Algorithms to Path Planning of Autonomous Underwater Vehicles 被引量:8
15
作者 Mohammad Pourmahmood Aghababa Mohammad Hossein Amrollahi Mehdi Borjkhani 《Journal of Marine Science and Application》 2012年第3期378-386,共9页
In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwa... In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a nnmerical solution of a nonlinear optimal control problem (NOCP). An energy performance index as a cost function, which should be minimized, was defmed. The resulting problem was a two-point boundary value problem (TPBVP). A genetic algorithm (GA), particle swarm optimization (PSO), and ant colony optimization (ACO) algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account. 展开更多
关键词 path planning autonomous underwater vehicle genetic algorithm ga particle swarmoptimization (PSO) ant colony optimization (ACO) collision avoidance
下载PDF
Optimal design of pressure vessel using an improved genetic algorithm 被引量:5
16
作者 Peng-fei LIU Ping XU +1 位作者 Shu-xin HAN Jin-yang ZHENG 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2008年第9期1264-1269,共6页
As the idea of simulated annealing (SA) is introduced into the fitness function, an improved genetic algorithm (GA) is proposed to perform the optimal design of a pressure vessel which aims to attain the minimum weigh... As the idea of simulated annealing (SA) is introduced into the fitness function, an improved genetic algorithm (GA) is proposed to perform the optimal design of a pressure vessel which aims to attain the minimum weight under burst pressure con- straint. The actual burst pressure is calculated using the arc-length and restart analysis in finite element analysis (FEA). A penalty function in the fitness function is proposed to deal with the constrained problem. The effects of the population size and the number of generations in the GA on the weight and burst pressure of the vessel are explored. The optimization results using the proposed GA are also compared with those using the simple GA and the conventional Monte Carlo method. 展开更多
关键词 Pressure vessel Optimal design genetic algorithm ga Simulated annealing (SA) Finite element analysis (FEA)
下载PDF
Fingerprint Directional Image Partitioning Based on Genetic Algorithm
17
作者 张朝鸣 刘云超 《Advances in Manufacturing》 SCIE CAS 2000年第S1期98-103,共6页
In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to gui... In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to guide the partitioning procedure. Finding best fitted mask application is converted to an functional optimizing problem, and we give out a GA solution to the problem. At last, we discuss the application of the proposed method in Fingerprint Classification. 展开更多
关键词 fingerprint classification directional image partitioning dynamic mask cost estimating function genetic algorithm (ga)
下载PDF
Self-adaptive Bat Algorithm With Genetic Operations 被引量:4
18
作者 Jing Bi Haitao Yuan +2 位作者 Jiahui Zhai MengChu Zhou H.Vincent Poor 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2022年第7期1284-1294,共11页
Swarm intelligence in a bat algorithm(BA)provides social learning.Genetic operations for reproducing individuals in a genetic algorithm(GA)offer global search ability in solving complex optimization problems.Their int... Swarm intelligence in a bat algorithm(BA)provides social learning.Genetic operations for reproducing individuals in a genetic algorithm(GA)offer global search ability in solving complex optimization problems.Their integration provides an opportunity for improved search performance.However,existing studies adopt only one genetic operation of GA,or design hybrid algorithms that divide the overall population into multiple subpopulations that evolve in parallel with limited interactions only.Differing from them,this work proposes an improved self-adaptive bat algorithm with genetic operations(SBAGO)where GA and BA are combined in a highly integrated way.Specifically,SBAGO performs their genetic operations of GA on previous search information of BA solutions to produce new exemplars that are of high-diversity and high-quality.Guided by these exemplars,SBAGO improves both BA’s efficiency and global search capability.We evaluate this approach by using 29 widely-adopted problems from four test suites.SBAGO is also evaluated by a real-life optimization problem in mobile edge computing systems.Experimental results show that SBAGO outperforms its widely-used and recently proposed peers in terms of effectiveness,search accuracy,local optima avoidance,and robustness. 展开更多
关键词 Bat algorithm(BA) genetic algorithm(ga) hybrid algorithm learning mechanism meta-heuristic optimization algorithms
下载PDF
Improved genetic operator for genetic algorithm 被引量:4
19
作者 林峰 杨启文 《Journal of Zhejiang University Science》 CSCD 2002年第4期431-434,共4页
The mutation operator has been seldom improved because researchers hardly suspect its ability to prevent genetic algorithm (GA) from converging prematurely. Due to its importance to GA, the authors of this paper study... The mutation operator has been seldom improved because researchers hardly suspect its ability to prevent genetic algorithm (GA) from converging prematurely. Due to its importance to GA, the authors of this paper study its influence on the diversity of genes in the same locus, and point out that traditional mutation, to some extent, can result in premature convergence of genes (PCG) in the same locus. The above drawback of the traditional mutation operator causes the loss of critical alleles. Inspired by digital technique, we introduce two kinds of boolean operation into GA to develop a novel mutation operator and discuss its contribution to preventing the loss of critical alleles. The experimental results of function optimization show that the improved mutation operator can effectively prevent premature convergence, and can provide a wide selection range of control parameters for GA. 展开更多
关键词 genetic algorithm(ga) Mutation operator Premature convergence
下载PDF
Kinetic simulation of oxidative coupling of methane over perovskite catalyst by genetic algorithm:Mechanistic aspects 被引量:3
20
作者 Nastaran Razmi Farooji Ali Vatani Shahrnaz Mokhtari 《Journal of Natural Gas Chemistry》 EI CAS CSCD 2010年第4期385-392,共8页
The reaction kinetics of oxidative coupling of methane catalyzed by perovskite was studied in a fixed bed flow reactor.At atmospheric pressure,the reactions were carried out at 725,750 and 775℃,inlet methane to oxyge... The reaction kinetics of oxidative coupling of methane catalyzed by perovskite was studied in a fixed bed flow reactor.At atmospheric pressure,the reactions were carried out at 725,750 and 775℃,inlet methane to oxygen ratios of 2 to 4.5 and gas hourly space velocity (GHSV) of 100 min^-1.Correlation of the kinetic data has been performed with the proposed mechanisms.The selected equations have been regressed with experimental data accompanied by genetic algorithm (GA) in order to obtain optimized parameters.After investigation the Langmuir-Hinshelwood mechanism was selected as the best mechanism,and Arrhenius and adsorption parameters of this model were obtained by linear regression.In this research the Marquardt algorithm was also used and its results were compared with those of genetic algorithm.It should be noted that the Marquardt algorithm is sensitive to the selection of initial values and there is possibility to trap in a local minimum. 展开更多
关键词 oxidative coupling of methane (OCM) reaction mechanism kinetic model surface coverage genetic algorithm ga
下载PDF
上一页 1 2 9 下一页 到第
使用帮助 返回顶部