Improved orthogonal array based simulated annealing for design optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonal Simulated Annealing for Floorplanning

Floorplanning is an essential step in physical design of VLSI. The floorplan design problem is how to place a set of circuit modules on a chip such that the resulting area is minimized. The best known solutions are obtained using simulated annealing based on sequence pairs representing the planning of modules. The conventional simulated annealing algorithm conducts a random perturbation operati...

متن کامل

Optimization of Bioreactor Cultivation Parameters by Taguchi Orthogonal Array Design for Enhanced Prodigiosin Production

One of the major steps toward the industrialization of the microbial product(s) is to optimize the cultivation conditions at the large-scale bioreactor and successfully control the microbial behavior within a large scale production environment. Statistical Design of Experiment was proven to optimize a vast number of microbial processes to achieve robustness and explore possible interactions...

متن کامل

A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

متن کامل

Simulated Annealing for Convex Optimization

We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is specified only by a membership oracle. Using distributions from the Boltzmann-Gibbs family leads to an algorithm that needs only O∗( √ n) phases for instances in R. This gives an optimization algorithm that makes O∗(n4...

متن کامل

A Simulated Annealing-based Immune Optimization Method

This paper proposes a hybrid optimization method based on the fusion of the Simulated Annealing (SA) and Clonal Selection Algorithm (CSA), in which the SA is embedded in the CSA to enhance its search capability. The novel optimization algorithm is also employed to deal with several nonlinear benchmark functions as well as a practical engineering design problem. Simulation results demonstrate th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Expert Systems with Applications

سال: 2009

ISSN: 0957-4174

DOI: 10.1016/j.eswa.2008.09.022