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

Quantum annealing is a generic name of quantum algorithms to use quantum-mechanical fluctuations to search for the solution of optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundation of quantum annealing. In particular, theorems are presented for convergence con...

Simulated annealing’s high computational intensity has stimulated researchers to experiment with various parallel and distributed simulated annealing algorithms for shared memory, message-passing, and hybrid-parallel platforms. MapReduce is an emerging distributed computing framework for large-scale data processing on clusters of commodity servers; to our knowledge, MapReduce has not been used ...

in this research, mechanical alloying was used to produce ti-50al, ti-45al-5cr and ti-45al-5w (at%) alloys. the effect of ternary addition (cr and w) on microstructure and production efficiency of tial alloy were investigated. alloying was performed in a planetary mill and the milling time varying from 5 to 70h. the structural evaluation in these powders was done by x-ray diffraction (xrd) tech...

Optimality Theory (OT) requires an algorithm optimising the Harmony function on the set of candidates. Simulated annealing, a well-known heuristic technique for combinatorial optimisation, has been argued to be an empirically adequate solution to this problem. In order to generalise simulated annealing for a non-real valued Harmony function, two representations of a violation profile are propos...

We present and summarize the results from 50-, 100-and 200-city TSP benchmarks presented at the 1989 NIPS post-conference workshop using neural network, elastic net, genetic algorithm and simulated annealing approaches. These results are also compared with a state-of-the-art hybrid approach consisting of greedy solution, simulated annealing, and exhaustive search.

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

alumina nanomaterials were synthesized via a solution combustion technique using tris-(acetylacetonato) aluminum(iii) complex (1) and tris-(2-formylphenolate) aluminum(iii) complex (2) at 600, and 1000 °c for 3h. the obtained data showed that the procedure without using fuel resulted in a better phase and morphology. to investigate the phase formation, powder x-ray diffraction technique was use...

Capabilities of enhanced simulated-annealing-based algorithms in solving process planning problems in reconfigurable manufacturing are investigated. The algorithms are enhanced by combining variants of the simulated annealing technique with other algorithm concepts such as (i) knowledge exploitation and (ii) parallelism. Four configurations of simulated annealing algorithms are devised and enga...

This paper considers the problem of scheduling a given number of jobs on a specified number of identical parallel robots with unequal release dates and precedence constraints in order to minimize mean tardiness. This problem is strongly NP‐hard. The author proposes a hybrid intelligent solution system, which uses Genetic Algorithms and Simulated Annealing (GA+SA). A genetic ...