n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster ...

Received on:2/6/2009 Accepted on:1/4/2010 Abstract Simulated annealing (SA) has been considered as a good tool for search and optimization problems which represent the abstraction of obtaining the crystalline structure through a physical process. This algorithm works sequentially that the current state will produce only one next state. That will make the search to be slower and the important dr...

Beginning in 1983, simulated annealing was marketed as a global optimization methodology that mimics the physical annealing process by which molten substances cool to crystalline lattices of minimal energy. This marketing strategy had a polarizing effect, attracting those who delighted in metaphor and alienating others who found metaphor insufficient at best and facile at worst. In fact, the em...

Parallel algorithms with quality equivalent to the simulated annealing placement algorithm for standard cells [23] are presented. The first, called heuristic spanning, creates parallelism by simultaneously investigating different areas of the plausible combinatorial search space. It is used to replace the high temperature portion of simulated annealing. The low temperature portion of Simulated ...

In this paper we present a new algorithm for segmenting SAR images. A common problem with segmentation algorithms for SAR imagery is the poor placement of the edges of regions and hence of the regions themselves. This usually arises because the algorithm considers only a limited number of placements for regions. The new algorithm circumvents this shortcoming, and produces an optimal segmentatio...

In this paper, we examine the different measures of Fault Tolerance in a Distributed Simulated Annealing process. Optimization by Simulated Annealing on a distributed system is prone to various sources of failure. We analyse simulated annealing algorithm, its architecture in distributed platform and potential sources of failures. We examine the behaviour of tolerant distributed system for optim...

We report a new, simple and versatile method to obtain highly active MOF structures by carefully controlled postsynthesis thermal annealing. The active ZIF-8 structure shows highly enhanced CO2/N2 selectivity and stable cyclic CO2 uptake of ≥1.5 mmol g -1 at 1 bar and 25 °C with a heat of adsorption of ≥30 kJ mol, which is over 100% greater than the ≈0.7 mmol g and ≈17 kJ mol, respectively in t...

In this paper, a mixed-model PC camera assembly line balancing case study is presented. The aim of the study is to establish different line configurations, for varying levels of demand. In the first stage of the study, a heuristic procedure previously developed by some of the authors, based on the simulated annealing meta-heuristic, is used to derive line configurations with a minimum number of...