一种新的遗传算法最优保存策略

提出了一种新的遗传算法最优保存策略,该策略在最优个体保留的基础上,添加一个与最优个体相异因子较大,而适应值不过小的个体.这样做既利用了最优保存策略的全局收敛性,又通过新添加的个体来保持种群的多样性,以防止早熟现象的出现.对典型优化函数进行了测试,结果表明基于新的最优保存策略的遗传算法(DESGA)收敛性能显著好于一般简单遗传算法(SGA)和最优保存简单遗传算法(ESGA).该策略与最优保存策略一样具有一般通用性.     

Effects of information asymmetry on cooperation in the prisoners’ dilemma game

Effects of information asymmetry on cooperation in the prisoners’ dilemma game are investigated. The amplitude A is introduced to describe the degree of information asymmetry. It is found that there exists an optimal value of amplitude Aopt at which the fraction of cooperation reaches its maximal value. The reason lies in that cooperators on the two-dimensional grid form large clusters at Aopt . In addition, the theoretical analysis in terms of the meanfield theory is used to understand this kind of phenomenon. It is confirmed that the information asymmetry plays an important role in the dynamics of the dilemma games of spatial prisoners.     

Design of interdigital transducers for crack detection in plates

Interdigital transducers (IDT) for non-destructive evaluation (NDE) of cracks in plates are designed based on an analytical model established previously. Key considerations include mode selectivity, excitation strength, collimation of wave and cost. The advantage of mode selectivity of IDT over PZT patch is presented both analytically and experimentally. Effects of parameters, namely finger spacing, width, length, number of fingers, and the size of IDT, on the excitation strength and mode selectivity are considered. This led to the design of a mobile double-sided IDT as an efficient device where excitation strength is strong and focused. The device was fabricated in-house using commercially available piezoelectric ceramics and used to develop a procedure for accurate identification of the direction and extent of cracks in plates. Three aluminum plates, one with a linear deep crack, another with a piecewise linear shallower crack and the third with a curved crack, were used to illustrate the accuracy and efficiency of both the proposed device and procedure for effective NDE.     

基于一维标定物和改进进化策略的相机标定

为了解决运动参数光电探测过程中的相机标定问题,制作一种两端及中间各安装一个红外反光标记球的一维标定物.不需要其它复杂标定装置,只要将这种特制的一维标定物在测量空间内多次随意移动并摄取其图像,即可实现标定.算法首先假定主点位于像面中心附近的某个位置,再求出焦距、旋转矩阵、平移向量和比例因子,最后通过评价函数将相机标定转换成寻找两相机最佳主点对的非线性最小化问题.在传统进化策略中引进个体的自我改进系数、个体间距离等概念,提出了求取子代个体间的欧式距离并排序的方法,设计了搜索最佳主点对的改进型进化策略算法.与传统标定方法相比,基于一维标定物的方法克服了多相机场合的遮挡问题,改进进化策略的引入打破了一维标定物需做某种特殊运动的限制,使一维标定物自由运动时相机内、外参数的同时求解成为可能,改进的模拟退火进化策略改善了算法的全局收敛性能并加快了收敛速度.     

On optimal dividends with exponential and linear penalty payments

We study the optimal dividend problem where the surplus process of an insurance company is modelled by a diffusion process. The insurer is not ruined when the surplus becomes negative, but penalty payments occur, depending on the level of the surplus. The penalty payments shall avoid that losses can rise above any number and can be seen as a preference measure or costs for negative capital. As examples, exponential and linear penalty payments are considered. It turns out that a barrier dividend strategy is optimal.     

AN EFFICIENT SEQUENTIAL DESIGN FOR SENSITIVITY EXPERIMENTS

In sensitivity experiments, the response is binary and each experimental unit has a critical stimulus level that cannot be observed directly. It is often of interest to estimate extreme quantiles of the distribution of these critical stimulus levels over the tested products. For this purpose a new sequential scheme is proposed with some commonly used models. By using the bootstrap repeated-sampling principle, reasonable prior distributions based on a historic data set are specified. Then, a Bayesian strategy for the sequential procedure is provided and the estimator is given. Further, a high order approximation for such an estimator is explored and its consistency is proven. A simulation study shows that the proposed method gives superior performances over the existing methods.     

Complex adaptive systems and game theory: An unlikely union

A Complex Adaptive System is a collection of autonomous, heterogeneous agents, whose behavior is defined with a limited number of rules. A Game Theory is a mathematical construct that assumes a small number of rational players who have a limited number of actions or strategies available to them. The CAS method has the potential to alleviate some of the shortcomings of GT. On the other hand, CAS researchers are always looking for a realistic way to define interactions among agents. GT offers an attractive option for defining the rules of such interactions in a way that is both potentially consistent with observed real‐world behavior and subject to mathematical interpretation. This article reports on the results of an effort to build a CAS system that utilizes GT for determining the actions of individual agents. © 2009 Wiley Periodicals, Inc. Complexity, 16,24–42, 2010     

Tracking problem under a time-varying topology

This paper studies the multi-agent tracking problem of a third-order maneuvering target under uncertain communication environments. Each tracking agent is assumed to be a third-order system and can only use its own and neighbors＇ position, velocity, and acceleration information to design its control input. In this work, the uncertain communication environments are modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sufficient conditions for the existence of a tracking strategy have been expressed in terms of the solvability of linear matrix inequalities. Finally, a numerical example is employed to demonstrate the effectiveness of the proposed tracking strategy.     

Convergence of the shifted algorithm for unitary Hessenberg matrices

This paper shows that for unitary Hessenberg matrices the algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with global convergence and cubic rates is also presented.

     

Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows

This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuristic follows a type 3 parallelization strategy (cf. Crainic and Toulouse (2001). In F. Glover and G. Kochenberger (eds.). State-of-the-Art Handbook in Metaheuristics. Norwell, MA: Kluwer Academic Publishers), i.e. several concurrent searches of the solution space are carried out with a differently configured metaheuristic. The concurrently executed processes cooperate through the exchange of solutions. The parallelized two-phase metaheuristic was subjected to a comparative test on the basis of 358 problems from the literature with sizes varying from 100 to 1000 customers. The derived results seem to justify the proposed parallelization concept.