𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some experiments with simulated annealing techniques for packing problems

✍ Scribed by Kathryn A. Dowsland

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
856 KB
Volume
68
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some experiments with simulated annealin
Some experiments with simulated annealing for coloring graphs
✍ M. Chams; A. Hertz; D. de Werra πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 555 KB

Methods of thermodynamical simulation have been used for several famous combinatorial optimization problems. For graph coloring (i.e. partition of the node set into as few independent sets as possible) we describe a method of simulation. Such an approach is combined with other techniques for graph c

Parallel Simulated Annealing with Geneti
Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum
✍ MichaΕ‚ CzapiΕ„ski πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 616 KB

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 Cl

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