Adaptive Encoding for Optimization
نویسنده
چکیده
This report describes a general method for rendering search coordinate system independent, Adaptive Encoding (AE). Adaptive Encoding is applicable to any continuous domain search algorithm and includes (incremental) changes of the coordinate system, that is, changes of the representation of solutions. One attractive way to change the representation within AE is derived from the Covariance Matrix Adaptation (CMA). We prove that adaptive encoding recovers the CMA Evolution Strategy, when suitably applied to an evolution strategy with cumulative step-size adaptation. The proof implies that adaptive encoding provides the means to apply CMA-like representation changes to any search algorithm in continuous domain. Key-words: optimization, evolutionary algorithms, encoding, representation, coordinate system, covariance matrix adaptation, invariance ∗ Adaptive Combinatorial Search Team, Microsoft Research–INRIA Joint Centre. 28, rue Jean Rostand, 91893 Orsay Cedex, France. email:[email protected]. Encodage adaptif pour optimisation Résumé : Pas de résumé Mots-clés : Pas de motclef Adaptive Encoding for Optimization 3
منابع مشابه
Airfoil Shape Optimization with Adaptive Mutation Genetic Algorithm
An efficient method for scattering Genetic Algorithm (GA) individuals in the design space is proposed to accelerate airfoil shape optimization. The method used here is based on the variation of the mutation rate for each gene of the chromosomes by taking feedback from the current population. An adaptive method for airfoil shape parameterization is also applied and its impact on the optimum desi...
متن کاملRELIABILITY-BASED DESIGN OPTIMIZATION OF COMPLEX FUNCTIONS USING SELF-ADAPTIVE PARTICLE SWARM OPTIMIZATION METHOD
A Reliability-Based Design Optimization (RBDO) framework is presented that accounts for stochastic variations in structural parameters and operating conditions. The reliability index calculation is itself an iterative process, potentially employing an optimization technique to find the shortest distance from the origin to the limit-state boundary in a standard normal space. Monte Carlo simulati...
متن کاملVibration Optimization of Fiber-Metal Laminated Composite Shallow Shell Panels Using an Adaptive PSO Algorithm
The paper illustrates the application of a combined adaptive particle swarm optimization (A-PSO) algorithm and the finite strip method (FSM) to the lay-up optimization of symmetrically fiber-metal laminated (FML) composite shallow shell panels for maximizing the fundamental frequency. To improve the speed of the optimization process, adaptive inertia weight was used in the particle swarm optimiz...
متن کاملA limited memory adaptive trust-region approach for large-scale unconstrained optimization
This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...
متن کاملAdaptive representation for single objective optimization
A new technique called Adaptive Representation Evolutionary Algorithm (AREA) is proposed in this paper. AREA involves dynamic alphabets for encoding solutions. The proposed adaptive representation is more compact than binary representation. Genetic operators are usually more aggressive when higher alphabets are used. Therefore the proposed encoding ensures an efficient exploration of the search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008