A quickly-speed running watermarking algorithm based on quantum evolutionary algorithm

针对传统基于人类视觉系统特性的空间域与变换域相结合的水印算法中嵌入信息量小、嵌入位置定位及检测准确率低和算法运行速度慢等缺陷,提出并实现一种基于量子进化算法(QEA)的快速水印新算法。仿真实验结果表明,新算法不仅生成水印图像的速度快,而且对各种攻击具有良好的敏感性和鲁棒性。新算法在应用中有较大的灵活性,并且具有可嵌入信息容量大、运算速度快和可操作性强等特点。There are limitations such as smaller embedded information capacity,lower accurate rate for positioning embedded location and detection and slower running speed in traditional watermarking algorithm which combines spatial domain and transform domain based on characteristics of human visual system.A quickly-speed running watermarking algorithm based on quantum evolutionary algorithm is proposed and implemented.The simulation results show that the proposed algorithm owns not only faster watermark image generation,but also have good sensitivity and robustness for all kinds of attacks.The proposed algorithm is more flexible in application,and it can embed more information and improve the computing speed.The method can be easily operated.国家自然科学基金资助项目(60873179);广西教育厅科研资助项目(200707LX196

Statistical Methods for Convergence Detection of Multi-Objective Evolutionary Algorithms

In this paper, two approaches for estimating the generation in which a multi-objective evolutionary algorithm (MOEA) shows statistically significant signs of convergence are introduced. A set-based perspective is taken where convergence is measured by performance indicators. The proposed techniques fulfill the requirements of proper statistical assessment on the one hand and efficient optimisation for real-world problems on the other hand. The first approach accounts for the stochastic nature of the MOEA by repeating the optimisation runs for increasing generation numbers and analysing the performance indicators using statistical tools. This technique results in a very robust offline procedure. Moreover, an online convergence detection method is introduced as well. This method automatically stops the MOEA when either the variance of the performance indicators falls below a specified threshold or a stagnation of their overall trend is detected. Both methods are analysed and compared for two MOEA and on different classes of benchmark functions. It is shown that the methods successfully operate on all stated problems needing less function evaluations while preserving good approximation duality at the same time.Article / Letter to editorLeiden Inst. Advanced Computer Science

Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers

The throughput of an acyclic, general-service time queueing network was optimized, and the total number of buffers and the overall service rate was reduced. To satisfy these conflicting objectives, a multiobjective genetic algorithm was developed and employed. Thus, our method produced a set of efficient solutions for more than one objective in the objective function. A comprehensive set of computational experiments was conducted to determine the efficacy and efficiency of the proposed approach. Interesting insights obtained from the analysis of a complex network may assist practitioners in planning general-service queueing networks

Statistical Methods for Convergence Detection of Multi-Objective Evolutionary Algorithms

In this paper, two approaches for estimating the generation in which a multi-objective evolutionary algorithm (MOEA) shows statistically significant signs of convergence are introduced. A set-based perspective is taken where convergence is measured by performance indicators. The proposed techniques fulfill the requirements of proper statistical assessment on the one hand and efficient optimisation for real-world problems on the other hand. The first approach accounts for the stochastic nature of the MOEA by repeating the optimisation runs for increasing generation numbers and analysing the performance indicators using statistical tools. This technique results in a very robust offline procedure. Moreover, an online convergence detection method is introduced as well. This method automatically stops the MOEA when either the variance of the performance indicators falls below a specified threshold or a stagnation of their overall trend is detected. Both methods are analysed and compared for two MOEA and on different classes of benchmark functions. It is shown that the methods successfully operate on all stated problems needing less function evaluations while preserving good approximation duality at the same time.FWN – Publicaties zonder aanstelling Universiteit Leide

Evolutionary algorithms and other metaheuristics in water resources: Current status, research challenges and future directions

Copyright © 2014 Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in Environmental Modelling and Software. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Environmental Modelling and Software Vol. 62 (2014), DOI: 10.1016/j.envsoft.2014.09.013The development and application of evolutionary algorithms (EAs) and other metaheuristics for the optimisation of water resources systems has been an active research field for over two decades. Research to date has emphasized algorithmic improvements and individual applications in specific areas (e.g. model calibration, water distribution systems, groundwater management, river-basin planning and management, etc.). However, there has been limited synthesis between shared problem traits, common EA challenges, and needed advances across major applications. This paper clarifies the current status and future research directions for better solving key water resources problems using EAs. Advances in understanding fitness landscape properties and their effects on algorithm performance are critical. Future EA-based applications to real-world problems require a fundamental shift of focus towards improving problem formulations, understanding general theoretic frameworks for problem decompositions, major advances in EA computational efficiency, and most importantly aiding real decision-making in complex, uncertain application contexts

Evolutionary algorithms and other metaheuristics in water resources: Current status, research challenges and future directions

Abstract not availableH.R. Maier, Z. Kapelan, Kasprzyk, J. Kollat, L.S. Matott, M.C. Cunha, G.C. Dandy, M.S. Gibbs, E. Keedwell, A. Marchi, A. Ostfeld, D. Savic, D.P. Solomatine, J.A. Vrugt, A.C. Zecchin, B.S. Minsker, E.J. Barbour, G. Kuczera, F. Pasha, A. Castelletti, M. Giuliani, P.M. Ree