The simulated annealing (SA) algorithm has proven to be a good technique for solving dicult combinatorial optimization problems. In engineering optimization the SA has emerged as an alternative tool to solve problems which are dicult to solve by conventional mathematical programming techniques. The
Simulated annealing for discrete optimization with estimation
β Scribed by Talal M. Alkhamis; Mohamed A. Ahmed; Vu Kim Tuan
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 318 KB
- Volume
- 116
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we study the performance of two stochastic search methods: Genetic Algorithms and Simulated Annealing, applied to the optimization of pin-jointed steel bar structures. We show that it is possible to embed these two schemes into a single parametric family of algorithms, and that optimal
This paper is concerned with estimation of the drift parameter in a class of continuous state branching processes by use of the estimating function theory (Heyde, 1992, J. Statist. Plann. Inference 33, 121-129). The main interests are to develop a method of estimating the parameter in case when only