In this paper scatter search algorithm has been hybridized with simulated annealing algorithm. Scatter search algorithm has some disadvantages which will be solved by using concepts of simulated annealing algorithm. Simulated annealing algorithm will provide scatter search algorithm with more of exploration for problem search space, this will increase ratio of getting optimal solutions. The hyb...

Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...

Parallel algorithms developed for CAD problems today suuer from three important drawbacks. First, they are machine speciic and tend to perform poorly on architectures other than the one for which they were designed. Second, they cannot use the latest advances in improved versions of the sequential algorithms for solving the problem. Third, the quality of results degrade signiicantly during para...

A parallel algorithm solving the radiosity equation is presented. It is based on the hierarchical approach (HR) 5] and realized on a massively parallel supercomputer | the ConnectionMachine 5. Our algorithm considers the HR approach as a process that manipulates an huge graph structure. Simulated annealing is used in the graph's rearranging procedure to achieve a good work-balance and nearly op...

Population annealing Monte Carlo is an efficient sequential algorithm for simulating k-local Boolean Hamiltonians. Because of its structure, the algorithm is inherently parallel and therefore well-suited for large-scale simulations of computationally hard problems. Here we present various ways of optimizing population annealing Monte Carlo using 2-local spin-glass Hamiltonians as a case study. ...

In this paper we describe a simulation of Boolean circuits using bio-molecular techniques. Boolean circuits embody the notion of massively parallel signal processing and are frequently encountered in many parallel algorithms. This model operates on the gates and the inputs by standard molecular techniques of sequence-specific annealing, ligation, melting, cleavage, separation and detection by s...

The Metropolis algorithm is simulated annealing with a fixed temperature. Surprisingly enough, many problems cannot be solved more efficiently by simulated annealing than by the Metropolis algorithm with the best temperature. The problem of finding a natural example (artificial examples are known) where simulated annealing outperforms the Metropolis algorithm for all temperatures has been discu...