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

In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. The problem is known to have local minimum solutions.A simulated annealing algorithm for the clustering problem. The solution of the clustering problem usually solved by the K-means algorithm.In this paper, we explore the applicability of simulated annealing. Clustering problem is investigat...

Simulated Annealing is one the most well known local search methods. In practice, it is often used to solve discrete optimization problems; especially very tough problems, [54, 37, 34, 3, 2, 41]. Global optimization is computationally extremely challenging and for large instances, exact methods reach their limitations quickly. Hence, in practice, often local optimization methods are used. Simul...

We report the occurrence of quenching and annealing in a version of the Minority Game (MG) in which the winning option is to join a given fraction of the population that is a free, external parameter. We compare this to the different dynamics of the Bar Attendance Model (BAM)where the updating of the attendance strategy makes use of all the available information about the system and quenching d...

多峰性の連続最適化問題にシミュレーテッドアニーリング (SA)を適用する場合,著者らがすでに 提案している最適な受理確率を目標とする適応的近傍を持つ SA(SA/AAN)が有効である.本論文 では,並列計算機を用いて組み合わせ最適化問題を解く場合に有効な並列アルゴリズムの 1つである 温度並列シミュレーテッドアニーリング (TPSA)に SA/AAN を組み込んだ手法を提案する.提案 手法は各プロセス (プロセッサ)が担当する各温度において,適応的な近傍拡大率を持つ近傍を用い て探索するため,関数のランドスケープに適応した探索が行うことが可能である.一方,TPSAは温 度スケジュールが不要であるという特徴がある.そのため本論文で提案する手法は,温度,近傍とも に関数のランドスケープに合わせ自律的な調節を行うことができるという優れた特徴を持つことがわ かった.3 つの代表的なテスト関数...