Problem Independent Distributed Simulated Annealing and its Applications

Diekmann, Ralf; Lüling, Reinhard; Simon, Jens

doi:10.1007/978-3-642-46787-5_2

Cited by 43 publications

(29 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Following suggestions by Otten and van Ginneken [27] and Diekmann et al [6], σ(T j ) is smoothed out in order to avoid any dependencies of the temperature decrement on large changes in the standard deviation σ. We used the following standard method to provide a smoothed standard deviationσ:…”

Section: Max Hmentioning

confidence: 99%

A comparison of annealing techniques for academic course scheduling

Elmohamed

Coddington

Fox

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simulated annealing, including mean-field annealing, simulated annealing with three different cooling schedules, and the use of a rule-based preprocessor to provide a good initial solution for annealing. The best results were obtained using simulated annealing with adaptive cooling and reheating as a function of cost, and a rule-based preprocessor. This approach enabled us to obtain valid schedules for the timetabling problem for a large university, using a complex cost function that includes student preferences. None of the other methods were able to provide a complete valid schedule.

show abstract

Section: Max Hmentioning

confidence: 99%

A comparison of annealing techniques for academic course scheduling

Elmohamed

Coddington

Fox

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This, however, is not the final run-time result. Further potential is expected by moving to the subchain method [DLS93], for the final phase of the parallel SA algorithm. The problem of drawing arbitrary undirected graphs has received an increasing amount of attention during the last few years.…”

Section: Layout Resultsmentioning

confidence: 99%

“…It can be assumed [DLS93] that an equilibrium is reached, if the ratio between the number of accepted configurations with cost values in a range of =kJ --89 around the expected average value of the costs E, and if the total number of generated configurations is convergent [HRS86].…”

Section: Deg(u) + Deg()mentioning

confidence: 99%

“…The third group of algorithms uses randomness to overcome the problem of ending up in local minima. Its model, called simulated annealing (SA), is a flexible optimization method, suited for large-scale combinatorial optimization problems [DLS93,. To our knowledge, Davidson and Harel [DH93] were the first who used an SA approach for calculating aesthetically pleasing graph layouts.…”

mentioning

confidence: 99%

See 1 more Smart Citation

A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs

1996

View full text Add to dashboard Cite

Abstract. In this paper, we introduce a parallel simulated annealing algorithm for generating aesthetically pleasing straight-fine drawings. The proposed algorithm calculates high quality 3D layouts of arbitrary undirected graphs. Due to the 3D layouts, structure information is presented to the human viewer at a glance. The computing time of the algorithm is reduced by a new parallel method for exploiting promising intermediate configurations. As the algorithm avoids running into a local minimum of the cost function, it is applicable for the animation of graphs of reasonably larger size than it was possible before. Subsequent to the discussion of the algorithm, empirical data for the performance of the algorithm and the quality of the generated layouts are presented.Keywords-" 3D graph layout, straight-line drawing, parallel simulated annealing MotivationDuring the last few years the problem of generating aesthetically pleasing layouts of a given graph G = (V, E) has received an increasing amount of attention [BETT94]. After transforming an abstract graph description into an appealing drawing, a human viewer can, at a glance, derive additional information about the properties of G which are inherent in the abstract description. Due to the high complexity of the problem, which is Aft-hard and the small computational power of the desktop workstations of the past, current layout programs are mostly computing two dimensional straight-line drawings. Only a few authors [FR91,CELR94,FPS94] have considered the challenge of calculating 3D layouts. These kinds of drawings, however, are best suited to present inside information to human viewers. Modern workstations are equipped with fast graphic interfaces which allow the user to rotate a 3D representation without visible disturbance and to create

show abstract

“…The other method uses multiple threads for computing independent chains of solutions and exchanging the obtained results on a regular basis. Broad studies of both techniques can be found in [18,19]. The PSA scheme for GCP, proposed by the authors, includes above strategies with the rate of current solution update used as a distinctive control parameter.…”

Section: ∀(U V) ∈ E : C(u) = C(v) and Number Of Colors K Used Is Minmentioning

confidence: 99%

Parallel Simulated Annealing Algorithm for Graph Coloring Problem

Łukasik

Kokosiński

Świętoń

Parallel Processing and Applied Mathematics

View full text Add to dashboard Cite

Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). Synchronous master-slave model with periodic solution update is being used. The paper contains description of the method, recommendations for optimal parameters settings and summary of results obtained during algorithm's evaluation. A comparison of our novel approach to a PGA metaheuristic proposed in the literature is given. Finally, directions for further work in the subject are suggested.

show abstract

Problem Independent Distributed Simulated Annealing and its Applications

Cited by 43 publications

References 12 publications

A comparison of annealing techniques for academic course scheduling

A comparison of annealing techniques for academic course scheduling

A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs

Parallel Simulated Annealing Algorithm for Graph Coloring Problem

Contact Info

Product

Resources

About