Stacking Sequence Optimizations using Fractal Branch and Bound Method for Unsymmetrical Laminates
نویسندگان
چکیده
منابع مشابه
Permutation genetic algorithm for stacking sequence design of composite laminates
Stacking sequence design of a composite laminate with a given set of plies is a combinatorial problem of seeking an optimal permutation. Permutation genetic algorithms optimizing the stacking sequence of a composite laminate for maximum buckling load are studied. A new permutation GA named gene±rank GA is developed and compared with an existing Partially Mapped Permutation GA, originally develo...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملGlobal Optimization of Stacking Sequence in a Laminated Cylindrical Shell Using Differential Quadrature Method
Based on 3-D elasticity approach, differential quadrature method (DQM) in axial direction is adopted along with Globalized Nelder–Mead (GNM) algorithm to optimize the stacking sequence of a laminated cylindrical shell. The anisotropic cylindrical shell has finite length with simply supported boundary conditions. The elasticity approach, combining the state space method and DQM is used to obtain...
متن کاملA branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on iterative solving via branch and bound decisional versions of the problem. At each node of the branch and bound tree, constraint propagation algorithms adapted to setup times are performed for domain f...
متن کاملBranch Prediction Techniques and Optimizations
Branch prediction is one of the ancient performance improving techniques which still finds relevance into modern architectures. While the simple prediction techniques provide fast lookup and power efficiency they suffer from high misprediction rate. On the other hand, complex branch predictions – either neural based or variants of two-level branch prediction – provide better prediction accuracy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series A
سال: 2005
ISSN: 0387-5008,1884-8338
DOI: 10.1299/kikaia.71.1348