数字图像散斑相关技术的蚁群优化方法

基于蚁群优化方法提出新的数字图像散斑相关算法。该方法模仿了真实蚂蚁从其巢到食物找到最短路径的方式,通过对蚁群优化方法改进,减少迭代次数并改善解的质量。将新的数字图像散斑相关算法应用到计算机模拟的散斑图像和实验获得的散斑图像中,并与广泛使用的Newton-Raphson算法进行了比较。实验结果展示了新算法的精度、可行性和有效性。当数量级为0.01像素,误差离散均方根小于0.002像素。     

大口径旋转偏摆棱镜径向支撑优化设计

支撑方式对大型光学元件的镜面变形及应力集中具有重要影响。以大口径、非均匀质量分布、二维旋转棱镜为研究对象,综述了多点支撑和面支撑方式,提出了可调分段面支撑方法,并给出具体的方案设计。系统地分析了面支撑方式下棱镜的运动过程,得到最危工况。采用两步优化方法对该工况下的支撑夹角进行优化,优化后棱镜运动过程中的最大变形峰谷值与最大等效应力值相比优化前分别减小了7.40%和11.45%,支撑效果得到了明显改善,验证了该支撑方式的合理性及可行性。     

Initial guess by improved population-based intelligent algorithms for large inter-frame deformation measurement using digital image correlation

Digital image correlation (DIC) has received a widespread research and application in experimental mechanics. In DIC, the performance of subpixel registration algorithm (e.g., Newton-Raphson method, quasi-Newton method) relies heavily on the initial guess of deformation. In the case of small inter-frame deformation, the initial guess could be found by simple search scheme, the coarse-fine search for instance. While for large inter-frame deformation, it is difficult for simple search scheme to robustly estimate displacement parameters and deformation parameters simultaneously with low computational cost. In this paper, we proposed three improving strategies, i.e. Q-stage evolutionary strategy (T), parameter control strategy (C) and space expanding strategy (E), and then combined them into three population-based intelligent algorithms (PIAs), i.e. genetic algorithm (GA), differential evolution (DE) and particle swarm optimization (PSO), and finally derived eighteen different algorithms to calculate the initial guess for qN. The eighteen algorithms were compared in three sets of experiments including large rigid body translation, finite uniaxial strain and large rigid body rotation, and the results showed the effectiveness of proposed improving strategies. Among all compared algorithms, DE-TCE is the best which is robust, convenient and efficient for large inter-frame deformation measurement.     

广义不可逆卡诺制冷机的生态学最优性能

以反映制冷机火用输出与熵产率之间最佳折衷的“生态学”准则为目标 ,综合考虑热阻、热漏及工质内不可逆性 ,导出了牛顿传热定律系统广义不可逆制冷机的生态学最优性能 ,由数值算例对不同损失情况下制冷机的性能变化规律进行了比较。文中结果对实际制冷机的设计工作具有一定的理论指导意义     

基于遗传算法和分布式计算的气动优化设计

采用求解NS方程作为气动优化设计的CFD分析方法,为了提高基于遗传算法的气动优化设计的效率,发展了一种基于分布式并行计算的混合遗传算法,并应用该方法进行了气动优化设计.设计实践表明,该方法是可行的,且由于采用了混合遗传算法和分布式并行计算而提高了优化的质量和效率.     

A class of polynomial variable metric algorithms for linear optimization

In the paper, the behaviour of interior point algorithms is analyzed by using a variable metric method approach. A class of polynomial variable metric algorithms is given achieving O ((n/β)L) iterations for solving a canonical form linear optimization problem with respect to a wide class of Riemannian metrics, wheren is the number of dimensions and β a fixed value. It is shown that the vector fields of several interior point algorithms for linear optimization is the negative Riemannian gradient vector field of a linear a potential or a logarithmic barrier function for suitable Riemannian metrics. Research Partially supported by the Hungarian National Research Foundation, Grant Nos. OTKA-T016413 and OTKA-2116.     

Heuristic methods for evolutionary computation techniques

Evolutionary computation techniques, which are based on a powerful principle of evolution—survival of the fittest, constitute an interesting category of heuristic search. In other words, evolutionary techniques are stochastic algorithms whose search methods model some natural phenomena: genetic inheritance and Darwinian strife for survival.Any evolutionary algorithm applied to a particular problem must address the issue of genetic representation of solutions to the problem and genetic operators that would alter the genetic composition of offspring during the reproduction process. However, additional heuristics should be incorporated in the algorithm as well; some of these heuristic rules provide guidelines for evaluating (feasible and infeasible) individuals in the population. This paper surveys such heuristics and discusses their merits and drawbacks.An abridged version of this paper appears in the volume entitled META-HEURISTICS: Theory & Application, edited by Ibrahim H. Osman and James P. Kelly, to be published by Kluwer Academic Publishers in March 1996.     

Solving multiple-objective problems in the objective space

Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, etc.) render its solution efficient by a number of methods. Representatives of two different classes of multiobjective methods [the Geoffrion, Dyer, Feinberg (GDF) method and the fuzzy method of Baptistella and Ollero] are implemented and applied within this context to a water resources allocation problem. The results attest the computational viability of the overall procedure and its usefulness for the solution of multiobjective problems.This work was partially sponsored by grants from CNP_q and FAPESP, Brazil. The authors are indebted to the anonymous reviewers for their valuable comments.     

Optimizing flow rates in a queueing network with side constraints

In this paper, modified versions of the classical deterministic maximum flow and minimum cost network flow problems are presented in a stochastic queueing environment. In the maximum flow network model, the throughput rate in the network is maximized such that for each arc of the network the resulting probability of finding congestion along that arc in excess of a desirable threshold does not exceed an acceptable value. In the minimum cost network flow model, the minimum cost routing of a flow of given magnitude is determined under the same type of constraints on the arcs. After proper transformations, these models are solved by Ford and Fulkerson's labeling algorithm and out-of-kilter algorithm, respectively.     

Perturbed steepest-descent technique in multiextremal problems

The steepest-descent technique dealing with the perturbed values of the objective function and its gradients and with nonexact line searches is considered. Attention is given to the case where the perturbations do not decrease on the algorithm trajectories; the aim is to investigate how perturbations at every iteration of the algorithm perturb its original attractor set.Based on the Liapunov direct method for attraction analysis of discrete-time processes, a sharp estimation of the attractor set generated by a perturbed steepest-descent technique with respect to the perturbation magnitudes is obtained. Some global optimization properties of finite-difference analogues of the gradient method are discovered. These properties are not inherent in methods which use exact gradients.The author is grateful to the referees for many useful suggestions.