A study of simulated annealing and a revised cascade algorithm for image reconstruction. Simple parallel hierarchical and relaxation algorithms for segmenting noncausal Markovian random elds.

Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process, and as a result several research efforts have been undertaken to parallelize this algorithm. Most previous parallel approaches to cell placement annealing have used a parallel moves approach. In this paper we investigate two new approaches that have been proposed for gen...

Simulated annealing algorithms for VLSI layout tasks produce solutions of high quality but are computationally expensive. This thesis examines some parallel approaches to accelerate simulated annealing using message-passing multiprocessors with a hypercube architecture. Floorplanning is chosen as a typical application of annealing in physical design. Different partitioning strategies which map ...

In this paper a parallel algorithm for simulated annealing (S.A.) in the continuous case, the Multiple Trials and Adaptive Supplementary Search, MTASS algorithm, is presented. It is based on a combination of multiple trials, local improved searchs and an adaptive cooling schedule. The results in optimizing some standard test problems are compared with a sequential S.A. algorithms and another pa...

This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...

this paper addresses the vehicle routing problem with delivery time cost. this problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. in this research, a hybrid metaheuristic approa...

The traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once and returning to the starting city) where the length of this tour is minimized. In this project, we implemented solutions to the traveling salesman problem using parallel genetic algorithm and simulated annealing, and compared the parallel performance and results of these two impl...

In this paper simulated annealing and genetic algorithms are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biology, respectively, and are the most popular meta-heuristics or general-purpose optimization strategies. A hybrid algorithm for circuit partitioning, which uses tabu search to improve the simulated annealing meta-heuristics, is ...

In this paper we present our practical experience with the design and implementation of a suite of parallel algorithms called PARODS, for chromosome reconstruction via ordering of DNA sequences. PARODS contains parallel algorithms based on an earlier serial algorithm ODS which is a physical mapping algorithm based on simulated annealing. The parallel simulated annealing (PSA) algorithms for phy...