Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for real-life problems has been limited by the long execution time. This report presents a new approach to asynchronous simulated annealing for parallel thread oriented multiprocessor operating systems. Experimental results of the 100to 1000-city traveling salesman problems on the two-proce...

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...

The simulated annealing method has recently been applied to several multiparameter optimization problems, including those of geophysical inversion. A new variant of simulated annealing, called very fast simulated annealing (VFSA), overcomes some of the drawbacks of a conventional simulated annealing; it has been found to be a practical tool for geophysical inversion (Sen & Stoffa 1995). The met...

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 ...

This paper presents a new method to pack convex polygons into bins (the nesting problem). To do this polygons are placed in rows within bins using a metaheuristic algorithm (simulated annealing) and by utilising the No Fit Polygon. We show that simulated annealing out performs hill climbing. The nesting algorithm is described in detail, along with various aspects that have been incorporated in ...

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...