scispace - formally typeset
Journal ArticleDOI

Structural design optimization with reliability constraints using tabu search

J. A. Bland
- 01 Jan 1998 - 
- Vol. 30, Iss: 1, pp 55-74
Reads0
Chats0
TLDR
In this article, an implementation of tabu search in a structural design context is presented which features λ-depth neighbourhoods and a search backtrack facility, and the effects of variations in material strength (in tension and compression) and applied loading may be analyzed.
Abstract
Tabu search is a discrete-variable optimization algorithm with the ability to avoid entrapment by local optima and hence continue searching for global optima, in this paper tabu search is applied to optimal structural design, in terms of weight minimization, of a space truss. The design variables are the cross-sectional areas of members, which take discrete values. An implementation of tabu search in a structural design context is presented which features λ-depth neighbourhoods and a search backtrack facility. Furthermore, through the use of reliability constraints, the presented formulation shows how the effects of variations in material strength (in tension and compression) and applied loading may be analysed. Numerical investigations show that tabu search may readily cope with problems that include stochastic variables and, additionally, reveal the effects of displacement constraints and (Euler) buckling on minimum weight designs.

read more

Citations
More filters
Journal ArticleDOI

Efficiently solving the redundancy allocation problem using tabu search

TL;DR: In this article, a Tabu search meta-heuristic has been developed and successfully demonstrated to provide solutions to the system reliability optimization problem of redundancy allocation, which generally involves the selection of components and redundancy levels to maximize system reliability given various system-level constraints.

A survey of multiobjective optimization in engineering design

TL;DR: A survey of techniques to conduct multiobjective optimization in an engineering design context is presented in this article, where the authors discuss some of the difficulties of expressing the value of a deign and how to characterize different design variables.
Journal ArticleDOI

Solving reliability redundancy allocation problems using an artificial bee colony algorithm

TL;DR: Nonlinearly mixed-integer reliability design problems are investigated where both the number of redundancy components and the corresponding component reliability in each subsystem are to be decided simultaneously so as to maximize the reliability of the system.
Journal ArticleDOI

A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems

TL;DR: A novel particle swarm optimization algorithm (PSO) called the two-stage discrete PSO (2D PSO) is presented to solve MMRAP in series systems such that some subsystems or modules consist of different components in series.
Journal ArticleDOI

Penalty guided bees search for redundancy allocation problems with a mix of components in series-parallel systems

TL;DR: A penalty guided strategy based on an artificial bee colony algorithm (PGBC) to solve the redundancy allocation problem (RAP) in reliability series-parallel systems with less cost, higher reliability, and a significantly shorter computational time is used.
References
More filters
Journal ArticleDOI

Tabu Search—Part II

TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Journal ArticleDOI

Paper: Robust taboo search for the quadratic assignment problem

TL;DR: An adaptation of taboo search to the quadratic assignment problem is discussed in this paper, which is efficient and robust, requiring less complexity and fewer parameters than earlier adaptations.
Journal ArticleDOI

Using tabu search techniques for graph coloring

TL;DR: It is shown that tabu search techniques provide almost optimal colorings of graphs having up to 1000 nodes and their efficiency is shown to be significantly superior to the famous simulated annealing.
Journal ArticleDOI

Tabu Search Applied to the Quadratic Assignment Problem

TL;DR: This paper describes an adaptation of Tabu Search, a recent technique to overcome local optimality, to the Quadratic Assignment Problem (QAP), and suggests that good tabu list sizes increase with dimension of the problem.
Book

Application of Structural Systems Reliability Theory

TL;DR: Reliability Analysis of Structural Systems by the ?-Unzipping Method and Various Problems of Probability-Based Optimum Design.- 8.1.
Related Papers (5)