期刊文献+
共找到101篇文章
< 1 2 6 >
每页显示 20 50 100
Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem
1
作者 Zhiqi Liu Shihui Zheng +2 位作者 Xingyu Yan Ping Pan Licheng Wang 《Journal of Quantum Computing》 2023年第1期41-54,共14页
The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quan... The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quantum annealing algorithms(QAA)also manifest certain advantages in factoring integers.In experimental aspects,the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms.In this paper,we report some interesting observations about the effects of QAA for solving IFP.More specifically,we introduce a metric,called T-factor that measures the density of occupied qubits to some extent when conducting IFP tasks by using D-wave.We find that T-factor has obvious effects on annealing times for IFP:The larger of T-factor,the quicker of annealing speed.The explanation of this phenomenon is also given. 展开更多
关键词 Quantum annealing algorithm integer factorization problem T-factor D-WAVE
在线阅读 下载PDF
An Optimisation Strategy for Electric Vehicle Charging Station Layout Incorporating Mini Batch K-Means and Simulated Annealing Algorithms
2
作者 Haojie Yang Xiang Wen Peng Geng 《Journal on Artificial Intelligence》 2024年第1期283-300,共18页
To enhance the rationality of the layout of electric vehicle charging stations,meet the actual needs of users,and optimise the service range and coverage efficiency of charging stations,this paper proposes an optimisa... To enhance the rationality of the layout of electric vehicle charging stations,meet the actual needs of users,and optimise the service range and coverage efficiency of charging stations,this paper proposes an optimisation strategy for the layout of electric vehicle charging stations that integrates Mini Batch K-Means and simulated annealing algorithms.By constructing a circle-like service area model with the charging station as the centre and a certain distance as the radius,the maximum coverage of electric vehicle charging stations in the region and the influence of different regional environments on charging demand are considered.Based on the real data of electric vehicle charging stations in Nanjing,Jiangsu Province,this paper uses the model proposed in this paper to optimise the layout of charging stations in the study area.The results show that the optimisation strategy incorporating Mini Batch K-Means and simulated annealing algorithms outperforms the existing charging station layouts in terms of coverage and the number of stations served,and compared to the original charging station layouts,the optimised charging station layouts have flatter Lorentzian curves and are closer to the average distribution.The proposed optimisation strategy not only improves the service efficiency and user satisfaction of EV(Electric Vehicle)charging stations but also provides a reference for the layout optimisation of EV charging stations in other cities,which has important practical value and promotion potential. 展开更多
关键词 Mini Batch K-Means simulated annealing algorithm electric vehicle charging stations layout optimisation
在线阅读 下载PDF
Hybrid genetic simulated annealing algorithm for agile Earth observation satellite scheduling considering cloud cover distribution
3
作者 SUN Haiquan WANG Zhilong +1 位作者 HU Xiaoxuan XIA Wei 《Journal of Systems Engineering and Electronics》 2025年第6期1595-1612,共18页
Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at... Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at any moment within the VTW.However,different observation times demonstrate different cloud cover distributions,which exhibit different effects on the AEOS observation.Previous studies ignored pitch angles,discretized VTWs,or fixed cloud cover for every VTW,which led to the loss of intermediate observation states,thus these studies are not suitable for AEOS scheduling considering cloud cover distribution.In this study,a relationship formula between the cloud cover and observation time is proposed to calculate the cloud cover for every observation time,and a relationship formula between the observation time and pitch angle is designed to calculate the pitch angle for every observation time in the VTW.A refined model including the pitch angle,roll angle,and cloud cover distribution is established,which can make the scheme closer to the actual application of AEOSs.A hybrid genetic simulated annealing(HGSA)algorithm for AEOS scheduling is proposed,which integrates the advantages of genetic and simulated annealing algorithms and can effectively avoid falling into a local optimal solution.The experiments are conducted to compare the proposed algorithm with the traditional algorithms,the results verify that the proposed model and algorithm are efficient and effective for AEOS scheduling considering cloud cover distribution. 展开更多
关键词 agile Earth observation satellite cloud cover distribution hybrid genetic simulated annealing algorithm
在线阅读 下载PDF
Low Power Polarity Conversion Based on the Whole Annealing Genetic Algorithm 被引量:4
4
作者 汪鹏君 陆金刚 +1 位作者 陈恳 徐建 《Journal of Semiconductors》 EI CAS CSCD 北大核心 2008年第2期298-303,共6页
For an n-variable logic function,the power dissipation and area of the REED-MULLER (RM) circuit corresponding to each polarity are different. Based on the propagation algorithm of signal probability,the decompositio... For an n-variable logic function,the power dissipation and area of the REED-MULLER (RM) circuit corresponding to each polarity are different. Based on the propagation algorithm of signal probability,the decomposition algorithm of a multi-input XOR/AND gate,and the multiple segment algorithm of polarity conversion,this paper successfully applies the whole annealing genetic algorithm (WAGA) to find the best polarity of an RM circuit. Through testing eight large-scale circuits from the Microelectronics Center North Carolina (MCNC) Benchmark, the SYNOPSYS synthesis results show that the RM circuits corresponding to the best polarity found using the proposed algorithm attain average power,area,and max delay savings of 77.2% ,62.4% ,and 9.2% respectively,compared with those under polarity 0. 展开更多
关键词 whole annealing genetic algorithm REED-MULLER low power polarity conversion
在线阅读 下载PDF
Compound Genetics Annealing Optimal Algorithm for Realization of Locus Deduction of a Plane Link 被引量:1
5
作者 林晓通 林晓辉 +1 位作者 黄卫 王宁生 《Journal of Southeast University(English Edition)》 EI CAS 2002年第4期310-314,共5页
A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows th... A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value. 展开更多
关键词 genetic annealing algorithm luffing mechanism optimal algorithm
在线阅读 下载PDF
Study on Multi-stream Heat Exchanger Network Synthesis with Parallel Genetic/Simulated Annealing Algorithm 被引量:13
6
作者 魏关锋 姚平经 +1 位作者 LUOXing ROETZELWilfried 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2004年第1期66-77,共12页
The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one opt... The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one optimum and computational difficulty for traditional algorithms to find the global optimum. Compared with deterministic algorithms, evolutionary computation provides a promising approach to tackle this problem. In this paper, a mathematical model of multi-stream heat exchangers network synthesis problem is setup. Different from the assumption of isothermal mixing of stream splits and thus linearity constraints of Yee et al., non-isothermal mixing is supported. As a consequence, nonlinear constraints are resulted and nonconvexity of the objective function is added. To solve the mathematical model, an algorithm named GA/SA (parallel genetic/simulated annealing algorithm) is detailed for application to the multi-stream heat exchanger network synthesis problem. The performance of the proposed approach is demonstrated with three examples and the obtained solutions indicate the presented approach is effective for multi-stream HENS. 展开更多
关键词 multi-stream heat exchanger network synthesis non-isothermal mixing mixed integer nonlinear programming model genetic algorithm simulated annealing algorithm hybrid algorithm
在线阅读 下载PDF
Sequencing Mixed-model Production Systems by Modified Multi-objective Genetic Algorithms 被引量:5
7
作者 WANG Binggang 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2010年第5期537-546,共10页
As two independent problems,scheduling for parts fabrication line and sequencing for mixed-model assembly line have been addressed respectively by many researchers.However,these two problems should be considered simul... As two independent problems,scheduling for parts fabrication line and sequencing for mixed-model assembly line have been addressed respectively by many researchers.However,these two problems should be considered simultaneously to improve the efficiency of the whole fabrication/assembly systems.By far,little research effort is devoted to sequencing problems for mixed-model fabrication/assembly systems.This paper is concerned about the sequencing problems in pull production systems which are composed of one mixed-model assembly line with limited intermediate buffers and two flexible parts fabrication flow lines with identical parallel machines and limited intermediate buffers.Two objectives are considered simultaneously:minimizing the total variation in parts consumption in the assembly line and minimizing the total makespan cost in the fabrication/assembly system.The integrated optimization framework,mathematical models and the method to construct the complete schedules for the fabrication lines according to the production sequences for the first stage in fabrication lines are presented.Since the above problems are non-deterministic polynomial-hard(NP-hard),a modified multi-objective genetic algorithm is proposed for solving the models,in which a method to generate the production sequences for the fabrication lines from the production sequences for the assembly line and a method to generate the initial population are put forward,new selection,crossover and mutation operators are designed,and Pareto ranking method and sharing function method are employed to evaluate the individuals' fitness.The feasibility and efficiency of the multi-objective genetic algorithm is shown by computational comparison with a multi-objective simulated annealing algorithm.The sequencing problems for mixed-model production systems can be solved effectively by the proposed modified multi-objective genetic algorithm. 展开更多
关键词 mixed-model production system SEQUENCING parallel machine BUFFERS multi-objective genetic algorithm multi-objective simulated annealing algorithm
在线阅读 下载PDF
Simulated annealing algorithm for the optimal translation sequence of the jth agent in rough communication 被引量:5
8
作者 Wang Hongkai Guan Yanyong Xue Peijun 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第3期507-512,共6页
In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a le... In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness. 展开更多
关键词 rough sets rough communication translation sequence OPTIMAL simulated annealing algorithm.
在线阅读 下载PDF
Using genetic/simulated annealing algorithm to solve disassembly sequence planning 被引量:5
9
作者 Wu Hao Zuo Hongfu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2009年第4期906-912,共7页
Disassembly sequence planning (DSP) plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassem... Disassembly sequence planning (DSP) plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient. 展开更多
关键词 disassembly sequence planning disassembly hybrid graph connection matrix precedence matrix binary-tree algorithms simulated annealing algorithm genetic algorithm.
在线阅读 下载PDF
Simulated Annealing Study on Structures and Energetics of CO2 in Argon Clusters
10
作者 王乐成 谢代前 《Chinese Journal of Chemical Physics》 SCIE CAS CSCD 2011年第5期620-624,I0004,共6页
The minimum-energy configurations and energetic properties of the ArN-CO2 (N=1-19) van der Waals clusters were investigated by a simulated annealing algorithm. A newly developed Ar-CO2 potential energy surface toget... The minimum-energy configurations and energetic properties of the ArN-CO2 (N=1-19) van der Waals clusters were investigated by a simulated annealing algorithm. A newly developed Ar-CO2 potential energy surface together with the Aziz Ar-Ar interaction potential was employed to construct the high dimensional potential functions by pairwise additive approximation. The global minimal conformations were optimized by sampling the glassy phase space with a circumspectively formulated annealing schedule. Unlike the lighter agg-CO2 clusters, the size-dependent structural and energetic characteristics of ArN-CO2 exhibit a different behavior. The dramatically variations with number of solvent were found for small clusters. After the completion of the first solvation shell at N=17, the clusters were evolved more smoothly. 展开更多
关键词 Molecular structure van der Waals cluster Simulated annealing algorithm
在线阅读 下载PDF
Simulated annealing algorithm for detecting graph isomorphism 被引量:4
11
作者 Geng Xiutang Zhang Kai 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第5期1047-1052,共6页
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem (GIP) is a nondeterministic polynomial problem. A simulated annea... Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem (GIP) is a nondeterministic polynomial problem. A simulated annealing (SA) algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability. 展开更多
关键词 graph isomorphism problem simulated annealing algorithm nondeterministic polynomial problem local search.
在线阅读 下载PDF
Parametric optimization and performance comparison of organic Rankine cycle with simulated annealing algorithm 被引量:3
12
作者 王志奇 周乃君 +2 位作者 张家奇 郭静 王晓元 《Journal of Central South University》 SCIE EI CAS 2012年第9期2584-2590,共7页
Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle (ORC). Working fluids considered were R123,... Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle (ORC). Working fluids considered were R123, R134a, R141b, R227ea and R245fa. Under the given conditions, the parameters including evaporating and condensing pressures, working fluid and cooling water velocities were optimized by simulated annealing algorithm. The results show that the optimal evaporating pressure increases with the heat source temperature increasing. Compared with other working fluids, R123 is the best choice for the temperature range of 100--180℃ and R141 b shows better performance when the temperature is higher than 180 ℃. Economic characteristic of system decreases rapidly with the decrease of heat source temperature. ORC system is uneconomical for the heat source temperature lower than 100℃. 展开更多
关键词 parametric optimization organic Rankine cycle simulated annealing algorithm working fluid low-temperature source
在线阅读 下载PDF
Integrated classification method of tight sandstone reservoir based on principal component analysise simulated annealing genetic algorithmefuzzy cluster means 被引量:3
13
作者 Bo-Han Wu Ran-Hong Xie +3 位作者 Li-Zhi Xiao Jiang-Feng Guo Guo-Wen Jin Jian-Wei Fu 《Petroleum Science》 SCIE EI CSCD 2023年第5期2747-2758,共12页
In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tig... In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method. 展开更多
关键词 Tight sandstone Integrated reservoir classification Principal component analysis Simulated annealing genetic algorithm Fuzzy cluster means
原文传递
Classification of hyperspectral remote sensing images based on simulated annealing genetic algorithm and multiple instance learning 被引量:3
14
作者 高红民 周惠 +1 位作者 徐立中 石爱业 《Journal of Central South University》 SCIE EI CAS 2014年第1期262-271,共10页
A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning (MIL). The band selection method was proposed from subspace decom... A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning (MIL). The band selection method was proposed from subspace decomposition, which combines the simulated annealing algorithm with the genetic algorithm in choosing different cross-over and mutation probabilities, as well as mutation individuals. Then MIL was combined with image segmentation, clustering and support vector machine algorithms to classify hyperspectral image. The experimental results show that this proposed method can get high classification accuracy of 93.13% at small training samples and the weaknesses of the conventional methods are overcome. 展开更多
关键词 hyperspectral remote sensing images simulated annealing genetic algorithm support vector machine band selection multiple instance learning
在线阅读 下载PDF
Optimization of the seismic processing phase-shift plus finite-difference migration operator based on a hybrid genetic and simulated annealing algorithm 被引量:2
15
作者 Luo Renze Huang Yuanyi +2 位作者 Liang Xianghao Luo Jun Cao Ying 《Petroleum Science》 SCIE CAS CSCD 2013年第2期190-194,共5页
Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome... Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation. 展开更多
关键词 Migration operator phase-shift plus finite-difference hybrid algorithm genetic andsimulated annealing algorithm optimization coefficient
原文传递
Optimal control of cobalt crust seabedmining parameters based on simulated annealing genetic algorithm 被引量:2
16
作者 夏毅敏 张刚强 +2 位作者 聂四军 卜英勇 张振华 《Journal of Central South University》 SCIE EI CAS 2011年第3期650-657,共8页
Under the condition of the designated collection ratio and the interfused ratio of mullock, to ensure the least energy consumption, the parameters of collecting head (the feed speed, the axes height of collecting hea... Under the condition of the designated collection ratio and the interfused ratio of mullock, to ensure the least energy consumption, the parameters of collecting head (the feed speed, the axes height of collecting head, and the rotate speed) are chosen as the optimized parameters. According to the force on the cutting pick, the collecting size of the cobalt crust and bedrock and the optimized energy consumption of the collecting head, the optimized design model of collecting head is built. Taking two hundred groups seabed microtopography for grand in the range of depth displacement from 4.5 to 5.5 era, then making use of the improved simulated annealing genetic algorithm (SAGA), the corresponding optimized result can be obtained. At the same time, in order to speed up the controlling of collecting head, the optimization results are analyzed using the regression analysis method, and the conclusion of the second parameter of the seabed microtopography is drawn. 展开更多
关键词 cobalt crust mining parameter specific energy consumption simulated annealing genetic algorithm
在线阅读 下载PDF
CNOP-P-based parameter sensitivity for double-gyre variation in ROMS with simulated annealing algorithm 被引量:3
17
作者 YUAN Shijin ZHANG Huazhen +1 位作者 LI Mi MU Bin 《Journal of Oceanology and Limnology》 SCIE CAS CSCD 2019年第3期957-967,共11页
Reducing the error of sensitive parameters by studying the parameters sensitivity can reduce the uncertainty of the model,while simulating double-gyre variation in Regional Ocean Modeling System(ROMS).Conditional Nonl... Reducing the error of sensitive parameters by studying the parameters sensitivity can reduce the uncertainty of the model,while simulating double-gyre variation in Regional Ocean Modeling System(ROMS).Conditional Nonlinear Optimal Perturbation related to Parameter(CNOP-P)is an effective method of studying the parameters sensitivity,which represents a type of parameter error with maximum nonlinear development at the prediction time.Intelligent algorithms have been widely applied to solving Conditional Nonlinear Optimal Perturbation(CNOP).In the paper,we proposed an improved simulated annealing(SA)algorithm to solve CNOP-P to get the optimal parameters error,studied the sensitivity of the single parameter and the combination of multiple parameters and verified the effect of reducing the error of sensitive parameters on reducing the uncertainty of model simulation.Specifically,we firstly found the non-period oscillation of kinetic energy time series of double gyre variation,then extracted two transition periods,which are respectively from high energy to low energy and from low energy to high energy.For every transition period,three parameters,respectively wind amplitude(WD),viscosity coefficient(VC)and linear bottom drag coefficient(RDRG),were studied by CNOP-P solved with SA algorithm.Finally,for sensitive parameters,their effect on model simulation is verified.Experiments results showed that the sensitivity order is WD>VC>>RDRG,the effect of the combination of multiple sensitive parameters is greater than that of single parameter superposition and the reduction of error of sensitive parameters can effectively reduce model prediction error which confirmed the importance of sensitive parameters analysis. 展开更多
关键词 parameter sensitivity DOUBLE GYRE Regional Ocean Modeling System(ROMS) CONDITIONAL Nonlinear Optimal Perturbation(CNOP-P) simulated annealing(SA)algorithm
在线阅读 下载PDF
Structural optimization and segregation behavior of quaternary alloy nanoparticles based on simulated annealing algorithm 被引量:1
18
作者 陆欣泽 邵桂芳 +2 位作者 许两有 刘暾东 文玉华 《Chinese Physics B》 SCIE EI CAS CSCD 2016年第5期151-158,共8页
Alloy nanoparticles exhibit higher catalytic activity than monometallic nanoparticles, and their stable structures are of importance to their applications. We employ the simulated annealing algorithm to systematically... Alloy nanoparticles exhibit higher catalytic activity than monometallic nanoparticles, and their stable structures are of importance to their applications. We employ the simulated annealing algorithm to systematically explore the stable structure and segregation behavior of tetrahexahedral Pt–Pd–Cu–Au quaternary alloy nanoparticles. Three alloy nanoparticles consisting of 443 atoms, 1417 atoms, and 3285 atoms are considered and compared. The preferred positions of atoms in the nanoparticles are analyzed. The simulation results reveal that Cu and Au atoms tend to occupy the surface, Pt atoms preferentially occupy the middle layers, and Pd atoms tend to segregate to the inner layers. Furthermore, Au atoms present stronger surface segregation than Cu ones. This study provides a fundamental understanding on the structural features and segregation phenomena of multi-metallic nanoparticles. 展开更多
关键词 alloy nanoparticle simulated annealing algorithm structural stability SEGREGATION
原文传递
Usage of Simulated Annealing Algorithm in Design of Optical Thin Film 被引量:1
19
作者 王文梁 戎晓红 《Journal of Shanghai Jiaotong university(Science)》 EI 2011年第3期372-374,共3页
Simulated annealing algorithm is a mathematic model,which imitates the physical process of annealing. And optical thin film is widely used in many industry.Its design is difficult and can be regarded as an optimizatio... Simulated annealing algorithm is a mathematic model,which imitates the physical process of annealing. And optical thin film is widely used in many industry.Its design is difficult and can be regarded as an optimization problem.In this paper,we use the simulated annealing algorithm to design an edge filter,which is composed of 20 dielectric thin film layers with TiO2 and SiO2.The simulated annealing algorithm is a very robust algorithm for optical thin film design. 展开更多
关键词 simulated annealing algorithm optical thin film edge filter
原文传递
Optimal design of hydraulic manifold blocks based on niching genetic simulated annealing algorithm 被引量:1
20
作者 贾春强 Yu Ling +1 位作者 Tian Shujun Gao Yanming 《High Technology Letters》 EI CAS 2007年第4期363-368,共6页
To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( HMB), a hybrid genetic simulated annealing algo- rithm based on ni... To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( HMB), a hybrid genetic simulated annealing algo- rithm based on niche technology is presented. This hybrid algorithm, which combines genetic algorithm, simulated annealing algorithm and niche technology, has a strong capability in global and local search, and all extrema can be found in a short time without strict requests for preferences. For the complex restricted solid spatial layout problems in HMB, the optimizing mathematical model is presented. The key technologies in the integrated layout and connection design of HMB, including the realization of coding, annealing operation and genetic operation, are discussed. The framework of HMB optimal design system based on hybrid optimization strategy is proposed. An example is given to testify the effectiveness and feasibility of the algorithm. 展开更多
关键词 hydraulic manifold blocks (HMB) NICHE genetic annealing algorithm optimization design
在线阅读 下载PDF
上一页 1 2 6 下一页 到第
使用帮助 返回顶部