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

A new mapping heuristic is developed based on the recently proposed Mean Field Annealing MFA algorithm An e cient implementation scheme which decreases the complexity of the proposed algorithm by asymptotical factors is also given Per formance of the proposed MFA algorithm is evaluated in comparison with two well known heuristics Simulated Annealing and Kernighan Lin Results of the exper iments...

In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments show usefulness of the parallel GA and SA algorithms.

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

We present a parallel simulated annealing algorithm for crystallization of N-body systems. The implementation uses systolic simulated annealing with additional parallel cost function evaluation. We have a hybrid topology which consists of a systolic ring and attached to each ring processor a tree of processors. Our research topic is crystallization of particles on a spherical surface. Some resu...

optimization of cutting conditions is a non-linear optimization with constraint and it is very important to the increase of productivity and the reduction of costs. in recent years, several evolutionary and meta-heuristic optimization algorithms were introduced. the cuckoo optimization algorithm (coa) is one of several recent and powerful meta-heuristics which is inspired by the cuckoos and the...

In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from local optima. The concept of hierarchical parallel GA is employed to parallelize GSA for the optimization of multimodal functions. In addition, multi-niche crowding is used to maintain the diversity in the population o...

Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process. All previous work in parallel simulated annealing based placement has minimized area, but with deep submicron design, minimizing wirelength delay is also needed. The algorithm discussed in this paper is the first parallel algorithm for timing driven placement. We have us...

the mathematical modeling of fracture networks is critical for the exploration and development ofnatural resources. fractures can help the production of petroleum, water, and geothermal energy. theyalso greatly influence the drainage and production of methane gas from coal beds. orientation andspatial distribution of fractures in rocks are important factors in controlling fluid flow. the object...