𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adaptive random search for continuous simulation optimization

✍ Scribed by Sigrún Andradóttir; Andrei A. Prudius

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
941 KB
Volume
57
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random search techniques for optimizatio
Random search techniques for optimization problems
✍ Dean C. Karnopp 📂 Article 📅 1963 🏛 Elsevier Science 🌐 English ⚖ 663 KB

The attributes of flexibility and efficiency attainable with random search techniques are discussed as well as a scope of application ranging from uses involving high speed general purpose computers to extremely simple adaptive devices. ## 1. Introduction ONLY IN recent years has serious study bee

Computer-aided optimal design via modifi
Computer-aided optimal design via modified adaptive random-search algorithm
✍ H. Zarefar; S.N. Muthukrishnan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 715 KB

## A modified adaptive random-search algorithm for the design of helical gears has been developed. The proposed methodology allows for the implementation of nonlinear design functions and constraints without the need for linearization. In addition, the technique has the capability of starting from e

Searching for Optimal Block Designs when
Searching for Optimal Block Designs when Block Effects are Random
✍ Dr. B. Jones 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB 👁 1 views

A n algorithm that seercbw for optimal block designs when block effecta are random is deecribed. Some eituatione in which eucb an algorithm will prove ueeful are coneidered. An illuetrative example and mme discurnion are given.

Tabu search method with random moves for
Tabu search method with random moves for globally optimal design
✍ Nanfang Hu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 601 KB

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