𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

✍ Scribed by Michał Czapiński

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
616 KB
Volume
59
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, parallelisable Simulated Annealing with Genetic Enhancement (SAwGE) algorithm is presented and applied to Permutation Flowshop Scheduling Problem with total flowtime criterion. This problem is proved to be NP-complete in a strong sense for more than one machine. SAwGE is based on a Clustering Algorithm for Simulated Annealing (SA), but introduces a new mechanism for dynamic SA parameters adjustment, based on genetic algorithms. Computational experiments, based on 120 benchmark datasets by Taillard, show that SAwGE outperforms other heuristics and metaheuristics presented recently in literature. Moreover SAwGE obtains 118 best solutions, including 81 newly discovered ones.

📜 SIMILAR VOLUMES

Fast parallel simulated annealing for tr
Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections
✍ Chang-Sung Jeong; Myung-Ho Kim 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 459 KB

Jeong, C.S. and M.H. Kim, Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections, Parallel Computing 17 (1991) 221-228 In this paper, we present a fast parallel simulated annealing algorithm for solving traveling salesman problem(TSP) on SIMD m

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

Trading accuracy for speed in parallel s
Trading accuracy for speed in parallel simulated annealing with simultaneous moves
✍ M.D. Durand; Steve R. White 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 155 KB

A common approach to parallelizing simulated annealing is to generate several perturbations to the current solution simultaneously, requiring synchronization to guarantee correct evaluation of the cost function. The cost of this synchronization may be reduced by allowing inaccuracies in the cost cal