๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some experiments with simulated annealing for coloring graphs

โœ Scribed by M. Chams; A. Hertz; D. de Werra

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
555 KB
Volume
32
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 coloring. Experiments on random graphs show evidence that this combination gives better results than anyone of the original non-combined methods.

๐Ÿ“œ SIMILAR VOLUMES

A simulated annealing algorithm with the
A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
โœ Taichi Kaji; Azuma Ohuchi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB

In this paper, we present an approach for ยฎnding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satisยฎed, based on the concept of simulated annealing. Simulated anneali

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

Efficiency of simulated annealing for pe
Efficiency of simulated annealing for peptides with increasing geometrical restrictions
โœ Baysal, Canan; Meirovitch, Hagai ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 236 KB

Simulated annealing SA is a popular global minimizer that can conveniently be applied to complex macromolecular systems. Thus, a molecular dynamics or a Monte Carlo simulation starts at high temperature, which is decreased gradually, and the system is expected to reach the low-energy region on the p