𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimizing simulated annealing schedules with genetic programming

✍ Scribed by Andreas Bölte; Ulrich Wilhelm Thonemann

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
1004 KB
Volume
92
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving structural optimization problems
Solving structural optimization problems with genetic algorithms and simulated annealing
✍ Salvador Botello; Jose L. Marroquin; Eugenio Oñate; Johan Van Horebeek 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

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

Optimizing brain tissue contrast with EP
Optimizing brain tissue contrast with EPI: A simulated annealing approach
✍ Vasiliki N. Ikonomidou; Peter van Gelderen; Jacco A. de Zwart; Masaki Fukunaga; 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

## Abstract A new magnetization preparation and image acquisition scheme was developed to obtain high‐resolution brain images with optimal tissue contrast. The pulse sequence was derived from an optimization process using simulated annealing, without prior assumptions with regard to the number of r

Simulated Annealing and Genetic Algorith
Simulated Annealing and Genetic Algorithms for Optimal Regression Testing
✍ Mansour, Nashat; El-Fakih, Khalid 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 2 views

The optimal regression testing problem is one of determining the minimum number of test cases needed for revalidating modified software in the maintenance phase. We present two natural optimization algorithms, namely, a simulated annealing and a genetic algorithm, for solving this problem. The algor

Optimization of job scheduling on parall
Optimization of job scheduling on parallel machines by simulated annealing algorithms
✍ Zhen-Ping Lo; B. Bavarian 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap