SA与GA算法在波束图设计中的比较分析

针对模拟退火算法(SA算法)和遗传算法(GA算法)在阵列波束图设计上的应用进行了比较分析.SA算法和GA算法是近些年发展起来的两种全局优化算法,把这两种算法分别应用到线列阵波束图设计上.并通过改变那些相关参数反复仿真了多次,然后将其结果分别和线列阵的最佳加权-切比雪夫加权进行比较,可以发现它们基本逼近了切比雪夫加权的设计效果,满足了波束图设计的一般要求,并且发现GA算法较SA算法为优.     

PSOSA混合优化策略

本文提出了一种微粒群算法与模拟退火算法相结合的混合优化方法，该方法在群体进化的每一代中，首先通过微粒群算法的进化方法来控制微粒的飞行方向，然后利用模拟退火算法来拓展其搜索领域。这样既可以利用微粒群算法的收敛快速性，又可以利用模拟退火算法的全局收敛性。本文还证明了该混合优化方法依概率1收敛于全局最优解。仿
真结果表明，在搜索空间维数增大时，该方法的全局收敛性明显优于基本微粒群算法。     

基于模拟退火技术的QDPSO算法

提出了一种基于模拟退火技术的量子空间模型粒子群优化(QDPSO)改进算法，利用模拟退火算法(SA)的搜索能力克服QDPSO算法在寻优过程中早熟的缺点，通过标准测试函数进行性能测试，验证了算法的收敛性和快速性，并和标准PSO及QDPSO进行了比较。仿真结果表明，该算法具有更好的稳定性和收敛性，是一种良好的全局优化方法。     

基于模拟退火的粒子群优化算法

粒子群优化算法是一类简单有效的随机全局优化技术。该文把模拟退火思想引入到具有杂交和高斯变异的粒子群优化算法中,给出了一种基于模拟退火的粒子群优化算法。该算法基本保持了粒子群优化算法简单容易实现的特点,但改善了粒子群优化算法摆脱局部极值点的能力,提高了算法的收敛速度和精度。四个基准测试函数的仿真对比结果表明,该算法不仅增强了全局收敛性,而且收敛速度和精度均优于粒子群优化算法。     

求解矩形件优化排样的自适应模拟退火遗传算法

矩形件优化排样是一个NPC问题,在工业界有着广泛的应用.针对该问题,提出一种自适应模拟退火遗传算法.采用一种基于环形交叉算子和环形变异算子的自适应遗传算法来自动调整交叉和变异概率;同时引入模拟退火算法对个体适应度大于平均适应度的个体进行退火处理.自适应模拟退火遗传算法充分发挥了自适应遗传算法与模拟退火算法各自的全局搜索能力与局部搜索能力.对比实验表明,该算法结合改进的最左最下布局算法解决矩形件优化排样问题更加有效.     

模拟退火算法在全局查询优化中的应用

在分布式环境下,全局查询的代价函数空间形状包含了很多局部最小状态,需要多次局部最优化才可以找到全局最小状态。模拟退火算法是目前发展较快的智能优化算法,是一种以概率l收敛于全局最优解的全局优化算法。文中讨论了全局查询优化的过程以及模拟退火算法在全局查询优化中的应用,并对算法进行了一些改进。     

桁架形状优化的一种改进模拟退火算法研究

通过设计一种产生可行解的状态发生器,由该状态发生器产生的新状态均满足所有的约束条件,从而方便地处理约束条件,并提出一种求解桁架形状优化设计问题的改进的模拟退火算法。算例表明该方法能获得较高质量的解,具有现实的工程意义,同时指出改进的SA算法用于桁架形状优化问题得不到全局最优解。     

快速分解模拟退火算法在全局查询优化中的应用

文章提出了一种基于快速分解模拟退火算法的全局查询优化算法。快速分解模拟退火算法是一种改进的模拟退火算法,它退火时间短,收敛速度快,磁盘I/O开销小。仿真结果表明,该算法在数据集成系统环境中,无论参与查询的关系数目多少,均有较好的查询优化性能。     

模拟退火算法在全局查询优化中的应用

在分布式环境下，全局查询的代价函数空间形状包含了很多局部最小状态，需要多次局部最优化才可以找到全局最小状态。模拟退火算法是目前发展较快的智能优化算法，是一种以概率l收敛于全局最优解的全局优化算法。文中讨论了全局查询优化的过程以及模拟退火算法在全局查询优化中的应用，并对算法进行了一些改进。     

一种高效的函数可微的全局优化模拟退火算法

针对函数可微的全局优化问题,将最速下降法,Newton法和罚函数法引入模拟退火算法中,提出了一种高效的模拟退火算法.该算法可以求得可微函数优化问题的全局最优解,且具有计算量小,效率高的特点.利用罚函数将约束优化问题转化为无约束优化问题后,可以利用提出的算法进行求解.数值算例表明,提出的算法能够高效地求解无约束及带约束的函数可微的全局优化问题.     

基于模拟退火算法下多位相型达曼光栅分束器的设计

针对传统达曼光栅分束器衍射效率与光强度均匀性低等问题,提出了一种基于模拟退火算法下多位相型达曼光栅分束器的设计方法。基于标量衍射理论,对多位相型Dammann光栅分束器的相位结构设计进行研究。在原二值型突变点坐标的基础上,使用模拟退火算法对光栅一个周期内的位相结构进行离散、调制,并合理的控制目标函数来对相位结构进行优化设计。其次,以9×9点阵Dammann光栅分束器的位相结构设计为例进行仿真分析,得到了衍射效率为85.3%、光强不均匀性为0.0952%、均方根误差为8.2×10-5的位相型分束光栅。最后,进行实验验证,得到衍射效率达到73.5%、光强不均匀性达到10.0%、均方根误差达到0.255。结果表明,该方法具有优越性和实用性,为实际应用中三维测量结构光的产生提供了理论基础。     

Improved orthogonal array based simulated annealing for design optimization

Recent research shows that simulated annealing with orthogonal array based neighbourhood functions can help in the search for a solution to a parametrical problem which is closer to an optimum when compared with conventional simulated annealing. Previous studies of simulated annealing analyzed only the main effects of variables of parametrical problems. In fact, both main effects of variables and interactions between variables should be considered, since interactions between variables exist in many parametrical problems. In this paper, an improved orthogonal array based neighbourhood function (IONF) for simulated annealing with the consideration of interaction effects between variables is described. After solving a set of parametrical benchmark function problems where interaction effects between variables exist, results of the benchmark tests show that the proposed simulated annealing algorithm with the IONF outperforms significantly both the simulated annealing algorithms with the existing orthogonal array based neighbourhood functions and the standard neighbourhood functions. Finally, the improved orthogonal array based simulated annealing was applied on the optimization of emulsified dynamite packing-machine design by which the applicability of the algorithm in real world problems can be evaluated and its effectiveness can be further validated.     

A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design

The network design is a well-known problem, both of practical and theoretical significance. Network design models are extensively used to represent a wide range of planning and operations management issues in transportation, telecommunications, logistics, production and distribution. This paper presents a solution method for node-arc formulation of capacitated fixed-charge multicommodity network design problems. The proposed method is a hybrid algorithm of Simplex method and simulated annealing metaheuristic. The basic idea of the proposed algorithm is to use a simulated annealing algorithm to explore the solution space, where the revised Simplex method is used to evaluate, select and implement the moves. In the proposed algorithm, the neighborhood structure is pivoting rules of the Simplex method that provide an efficient way to reach the neighbors of current solution. To evaluate the proposed algorithm, the standard problems with different sizes are used. The algorithm parameters are tuned by design of experiments approach and the most appropriate values for the parameters are adjusted. The performance of the proposed algorithm is evaluated by statistical analysis. The results show high efficiency and effectiveness of the proposed algorithm.     

基于遗传算法和模拟退火算法的特征选择方法

针对模式识别时原始特征数量大而有冗余的现象,提出了一种基于遗传退火算法的特征选优方法。首先对遗传算法和模拟退火做了简要评论,然后在遗传算法中引入模拟退火的Boltzmann更新机制,以克服传统的遗传算法易于过早收敛和易于陷入局部极小的问题。最后阐述、设计了适应度函数和遗传算子。仿真实验表明,该方法在求解的效率和解的质量方面都达到了令人满意的效果。     

基于改进模拟退火算法的软硬件划分

软硬件划分是嵌入式系统协同设计中的关键问题,已经被证明是一个NP问题。模拟退火算法是解决该问题常用的启发式算法,但是其存在收敛速度过慢的问题。通过改进算法的扰动模型和退火进度,提出一种新的代价函数计算方法来提高它的收敛速度。实验结果表明,相对于基于经典的模拟退火算法和已有改进的算法,新算法运行时间大大减少,并且增大了找到近似最优解的概率。     

Bees algorithm for design of dual‐beam linear antenna arrays with digital attenuators and digital phase shifters

This article describes a method of designing a reconfigurable dual‐beam linear antenna array using bees algorithm (BA). The BA is an optimization algorithm inspired by the behavior of the honey bees to find the optimal way of harvesting food resources around the hive. The proposed method is very simple and can be used directly in practice to synthesize multiple beam antenna arrays with digital attenuators and digital phase shifters. A good agreement between the desired pattern and the synthesized pattern using BA is obtained. © 2008 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2008.     

求解巡警调度问题的遗传退火算法

科学合理地调度巡警服务资源是提高公安部门执法能力的重要因素,为了优化调度方案并提高执法信息化水平,建立了巡警调度问题的数学模型,提出一种求解巡警调度问题的遗传退火算法。通过化简约束条件,方便了遗传算法的编码与解码、遗传与变异算子的设计。在遗传算法中引入模拟退火算法的Boltzmann更新机制,有效提高了算法的寻优能力。实验结果证明,遗传退火算法具有比传统遗传算法更强的寻优能力。     

Design of large-angle distortion-free and spot adjustable LED spot array projector based on microlens array and eyepiece

The spot array projector has long been a challenging and intriguing research focus in the fields of projection and lighting applications. In the current literature, there is a lack of a comprehensive and detailed presentation on the design and analysis method for a spot array generator based on the structure of imaging eyepiece and MLA. We present a novel design and optimization method for a large-angle, distortion-free and spot adjustable LED spot array projector that is composed of an eyepiece, two microlens arrays (MLAs), and a micro-LED array (MLEDA). The eyepiece system is optimized using imaging optical methods to project sub-beams to the target plane with a large angle. The sub-lens of condenser MLA is also optimized using imaging optical methods to refocus the collimating beam and match the numerical aperture (NA) with the eyepiece, and the sub-lens of the collimating MLA is acquired by using simulated annealing (SA) global illumination optics optimization method to achieve collimation and far-field homogenization. The predistortion MLEDA and the MLAs are proposed and implemented by the radial basis function (RBF) interpolation method, which correct the large-angle distortion introduced by the eyepiece. Both near-field and far-field applications can be realized by the proposed system. In the near-field applications, different spot geometries at the near-field target plane can be achieved. In the far-field applications, the power matching of the MLEDA is used to improve far-field uniformity of spot array. Moreover, the predefined-geometry arrangement spot array can be realized in both near and far fields. Two design examples with full field of view (FOV) projection of 80° and 100° are provided to validate the proposed method. Overall, the proposed system offers a promising solution for various applications requiring target identification or 3D calibration.     

Two-dimensional equilibrium constraint layout using simulated annealing

This paper studies the layout optimization problem with equilibrium constraint. It is a two-dimensional packing problem with the industrial background of simplified satellite module layout design, and is known as NP-hard problem. By incorporating the heuristic neighborhood search mechanism and the adaptive gradient method into the simulated annealing procedure, a heuristic simulated annealing algorithm is put forward for this problem. The special neighborhood search mechanism can avoid the disadvantage of blind search in the simulated annealing algorithm, and the adaptive gradient method is used to execute local search and speed up finding the global optimal solution. Numerical examples are illustrated to verify the effectiveness of the proposed algorithm.     

A comparison of global optimization algorithms applied to a ride comfort optimization problem

This study presents a comparison of global optimization algorithms applied to an industrial engineering optimization problem. Three global stochastic optimization algorithms using continuous variables, i.e. the domain elimination method, the zooming method and controlled random search, have been applied to a previously studied ride comfort optimization problem. Each algorithm is executed three times and the total number of objective function evaluations needed to locate a global optimum is averaged and used as a measure of efficiency. The results show that the zooming method, with a proposed modification, is most efficient in terms of number of objective function evaluations and ability to locate the global optimum. Each design variable is thereafter given a set of discrete values and two optimization algorithms using discrete variables, i.e. a genetic algorithm and simulated annealing, are applied to the discrete ride comfort optimization problem. The results show that the genetic algorithm is more efficient than the simulated annealing algorithm for this particular optimization problem.