Received on:2/6/2009 Accepted on:1/4/2010 Abstract Simulated annealing (SA) has been considered as a good tool for search and optimization problems which represent the abstraction of obtaining the crystalline structure through a physical process. This algorithm works sequentially that the current state will produce only one next state. That will make the search to be slower and the important dr...

Stereo-correspondence is the most important issue in stereopsis. Feature extraction and matching are the basic steps involved in the solution of stereocorrespondence problem. This work examines the effectiveness of Gabor Logons as pre-processing technique compared to intensity image. The matching is performed using Hopfield network and Simulated Annealing. Performance of these matching techniqu...

In this paper a Simulated Annealing algorithm (SA) for solving the Protein Folding Problem (PFP) is presented. This algorithm has two phases: quenching and annealing. The first phase is applied at very high temperatures and the annealing phase is applied at high and low temperatures. The temperature during the quenching phase is decreased by an exponential function. We run through an efficient ...

We analyze simulated annealing applied to multiple-valued programmable logic array (MVL PLA) design. Of spec@c interest is the use of parallel processors. We consider the use of loosely-coupled, coarsegrainedparallel systems, and study the relationship between the quality of the solution and computation time, on the one hand, and simulated annealing parameters, start temperature, cooling rate, ...

With the diversified and personalized commodity requirements as well as small batch dispatch and frequent dispatch features under the circumstance of E-commerce, the environment for logistics dispatching system becomes increasingly complicated and the interinfluence between different subsystems in logistics system optimization becomes increasingly significant. As a result, judged from the aspec...

Here we report a very simple method to convert conventional CuO powders to nanoparticle interlinked microsphere cages by solution method. CuO is dissolved into aqueous ammonia, and the solution is diluted by alcohol and dip coating onto a glass substrate. Drying at 80 C, the nanostructures with bunchy nanoparticles of Cu(OH)2 can be formed. After the substrate immerges into the solution and we ...

In this paper, an improved Simulated Annealing algorithm for Protein Folding Problem (PFP) is presented. This algorithm called Cluster Perturbation Simulated Annealing (CPSA) is based on a brand new scheme to generate new solutions using a cluster perturbation. The algorithm is divided into two phases: Cluster Perturbation Phase and the Reheat Phase. The first phase obtains a good solution in a...

The forward kinematics of the 6-6 leg parallel manipulator is solved using hybrid meta-heuristic techniques in which the simulated annealing algorithm replaces the mutation operator in a genetic algorithm. The results are compared with the standard simulated annealing and genetic algorithm. It shows that the standard simulated annealing algorithm outperforms standard genetic algorithm in terms ...

Ž . In this paper a solution in the continual plane to the Facility Layout Problem FLP is presented. It is based on Simulated Ž . Annealing SA , a relatively recent algorithm for solving hard combinatorial optimization problems, like FLP. This approach Ž . may be applied either in General Facility Layout Problems GFLP considering facilities areas, shapes and orientations or in Ž . Machine Layou...

Institute of Physics, University of Freiburg, 7 [email protected] Hermann Staudinger Graduate School, U Germany School of Materials Science & Engineering, Z People's Republic of China Chair of Chemical Materials Science, D Konstanz, 78464 Konstanz, Germany Institute of Macromolecular Chemistry, U Germany Freiburg Materials Research Centre, Univers † Electronic supplementary informa ...