Tabu search and design optimization
β Scribed by J.A. Bland; G.P. Dawson
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 629 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, algorithms are presented for the optimum design of geometrically nonlinear steel space frames using tabu search and genetic algorithm. Tabu search utilizes the features of short-term memory facility (tabu list) and aspiration criteria. Genetic algorithm employs reproduction, crossover
This paper investigates the application of TABU search methodology in global optimization. A general multilevel TABU search algorithm is proposed. The algorithm is applied to the problem of finding constrained global minima of a piecewise smooth function of the form β’ (x) --max{~l(X) .... , ~om(x)}
Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty method