一种新的相位角编码量子进化算法

针对具有连续解空间的数值函数优化问题,基于量子算法和实数编码进化算法的思想,提出一种新的相位角编码量子进化算法(PAQEA).算法的概率表达特性使得量子染色体能够以一定概率表达优化问题的所有可行解,结合动态量子旋转门实现染色体的进化,实现了算法局部搜索与全局搜索的平衡.理论分析证明了算法的全局收敛性.仿真结果表明,该算法适用于复杂数值函数优化问题,具有收敛速度快、搜索能力强和稳定性高的特点.     

基于高能效及公平性的移动设备定位算法

通过分析校园师生基于GPS的真实活动轨迹,以及何种算法才最适合具有自私性的移动用户展开合作,提出一种高能效及用户公平定位技术.通过采用代理设备合作思想,提出一种集中式最优算法,在保证固定精度界限和设备公平的基础上,实现移动设备GPS时间平均功率最小化.通过控制退避时间和GPS关闭时间,提出一种分布式准最优算法.最后,基于多种拓扑结构进行全面的仿真实验,验证了算法的高能效性和公平性.     

Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems

Evolutionary algorithms (EAs) are often employed to multiobjective optimization, because they process an entire population of solutions which can be used as an approximation of the Pareto front of the tackled problem. It is a common practice to couple local search with evolutionary algorithms, especially in the context of combinatorial optimization. In this paper a new local search method is proposed that utilizes the knowledge concerning promising search directions. The proposed method can be used as a general framework and combined with many methods of iterating over a neighbourhood of an initial solution as well as various decomposition approaches. In the experiments the proposed local search method was used with an EA and tested on 2-, 3- and 4-objective versions of two well-known combinatorial optimization problems: the travelling salesman problem (TSP) and the quadratic assignment problem (QAP). For comparison two well-known local search methods, one based on Pareto dominance and the other based on decomposition, were used with the same EA. The results show that the EA coupled with the directional local search yields better results than the same EA coupled with any of the two reference methods on both the TSP and QAP problems.     

Memory-based adaptive partitioning (MAP) of search space for the enhancement of convergence in Pareto-based multi-objective evolutionary algorithms

A new algorithm, dubbed memory-based adaptive partitioning (MAP) of search space, which is intended to provide a better accuracy/speed ratio in the convergence of multi-objective evolutionary algorithms (MOEAs) is presented in this work. This algorithm works by performing an adaptive-probabilistic refinement of the search space, with no aggregation in objective space. This work investigated the integration of MAP within the state-of-the-art fast and elitist non-dominated sorting genetic algorithm (NSGAII). Considerable improvements in convergence were achieved, in terms of both speed and accuracy. Results are provided for several commonly used constrained and unconstrained benchmark problems, and comparisons are made with standalone NSGAII and hybrid NSGAII-efficient local search (eLS).     

基于主应力删除准则的ESO法及其应用

为促进渐进结构优化（Evolutionary Structure Optimization,ESO）法在桥梁找型方面的应用,阐述基于主应力删除准则ESO法的基本原理,研究不同M值对优化结果的影响,并建议在应用该法进行拓扑优化时取M≥10.应用基于拉应力占优删除准则的ESO法分析高跨比对缆索支承桥形式的影响,结果表明：当高跨比大于等于1/7时缆索支承桥的最优形式为斜拉桥;当高跨比低于1/7时最优形式为悬索桥.     

多表达式程序设计的新型评估方法

多表达式程序设计(MEP)是应用十分广泛的自动程序设计方法。从MEP的染色体表示规则及种群演化方式来看,每个染色体中的任何基因都有可能多次被当前或其它后续种群中的其他基因引用,从而造成重复计算,耗费大量时空资源。由此提出并实现了一种新型评估方法,该新型评估方法在不改变传统MEP的染色体表示规则和种群演化方式的情况下,能够准确有效地识别演化过程中所有被重复引用的基因,从而避免了大量重复计算,显著提高了演化效率。     

Signal-adaptive discrete evolutionary transform as a sparse time–frequency representation

Discrete evolutionary transform (DET) has usually been applied to signals in a blind-way without using any parameters to characterize the signal. For this reason, it is not optimal and needs improvement by using some information about the signal. In this paper, we propose an improvement for the discrete evolutionary transform in order to obtain a sparse representation and redefine the generalized time-bandwidth product optimal short-time Fourier transform as a special case of it. In case of linear FM-type signals, the optimized kernel function of the transform is determined according to signal parameters including the instantaneous frequency. The performance of the adaptive-DET is illustrated on three distinct cases. In case of multi-component LFM signals, when the concentration of the proposed distribution is compared to the ordinary sinusoidal-DET, the improvement is computed as 28% in terms of the ratio of norms. Furthermore we define a new and a general class of distribution functions named as the short-time generalized discrete Fourier transform (ST-GDFT) which is a larger set of signal representations including the adaptive-DET.     

Twenty years of artificial life art

This essay begins with discussion of four relatively recent works which are representative of major themes and preoccupations in Artificial Life Art: ‘Propagaciones’ by Leo Nuñez; ‘Sniff’ by Karolina Sobecka and Jim George; ‘Universal Whistling Machine’ by Marc Boehlen; and ‘Performative Ecologies’ by Ruari Glynn. This essay is an attempt to contextualise these works by providing an overview of the history and forms of Artificial Life Art as it has developed over two decades, along with some background in the ideas of the Artificial Life movement of the late 1980s and 1990s.1 A more extensive study of the theoretical history of Artificial Life can be found in my paper ‘Artificial Life Art—A Primer’, in the Proceedings of DAC09 and also at http://www.ace.uci.edu/Penny. Excerpts from that essay are included here.      

Parameter estimation for five- and seven-parameter photovoltaic electrical models using evolutionary algorithms

Equivalent electric circuit modeling of PV devices is widely used to predict PV electrical performance. The first task in using the model to calculate the electrical characteristics of a PV device is to find the model parameters which represent the PV device. In the present work, parameter estimation for the model parameter using various evolutionary algorithms is presented and compared. The constraint set on the estimation process is that only the data directly available in module datasheets can be used for estimating the parameters. The electrical model accuracy using the estimated parameters is then compared to several electrical models reported in literature for various PV cell technologies.     

Water quality in the southern Tibetan Plateau: chemical evaluation of the Yarlung Tsangpo (Brahmaputra)

Yarlung Tsangpo (Brahmaputra) is the largest river system draining the northern slopes of the Himalayan ranges on the southern Tibetan Plateau. It remains one of only two large non‐regulated rivers in China. In this paper the chemical composition of Yarlung Tsangpo and its major tributaries (Raga Tsangpo, Nyangchu and Lhasa River) are studied. Water samples (n = 55) were collected and measured for major ions, trace elements and nutrients in order to: (1) define the present chemical quality of this water course; (2) address possible mechanisms governing the water chemical compositions, and (3) identify potential sources for contaminants. Multivariable analysis shows that geology and climate are the major explanatory variables for the spatial variation in water chemistry in this river system. In general, water chemistry is mainly controlled by carbonate weathering, with Ca²⁺ and HCO being the dominant ions. In addition, runoff from brackish/saline lakes and geothermal waters, enriched in Na⁺, Cl^?, SO, Mg²⁺ and Li, are major contributors of elevated concentrations of these solutes in the headwater regions resulting in a relatively high loading of total dissolved solids (TDS, 146–397 mg L^?1). Levels of most heavy metals and total dissolved nutrients were generally found to be low. However, elevated As concentration (avg. 95 μg L^?1) in the headwaters and additions from untreated wastewater were evident at some locations. Copyright © 2009 John Wiley & Sons, Ltd.