Solving optimization problems in highdimensional stochastic search spaces is a difficult task. In this work, we present a hybrid parallel simulated annealing algorithm to find optimal solutions in such domains. The algorithm uses a population of several starting points initially to explore the search space in a parallel fashion and after each evaluation better members reproduce asexually while ...

This paper presents parallel simulated annealing techniques realized on a multiDSP system with distributed memory and a point-to-point communication structure. Four parallelization techniques are assessed. The main aspects of our research are solution quality, computation time, speedup and scalability. Finally, experimental results for typical NP-hard problems with di erent complexity are compa...

2 Contents page 1 Introduction 3 1.1 Aim of the research 3 1.2 Background 3 2 Functional Aspects of the S.A. procedure 5 2.1 The sequential version 5 2.2 The vector version 6 2.3 The parallel version 6 3 Implementation Aspects 8 3.1 The vector version 8 3.1.1 Short description of vector processing 8 3.1.2 Description of the implementation 9 3.2 The parallel version 12 4 Time complexities 14 4.1...

Network Processors (NPs) are promising components to build a performance-scalable and function-flexible network systems. A clear trend has been observed that more and more NPs employ multiple simple processors to run multiple packet processing applications in parallel. The key challenge for application developers is how to program NPs for high performance. This paper presents an automated task ...

7 This paper shows an innovative implementation of simulated annealing in the 8 context of parallel computing. Details regarding the use of parallel computing 9 through a cluster of processors, as well as the implementation decisions, 10 are provided. Simulated annealing is presented aiming at the generation 11 of stochastic realizations of categorical variables reproducing multiple-point 12 st...

Abstract – Simulated annealing (SA) is an effective general heuristic method for solving many optimization problems. This paper deals with the two problems in SA. One is the long computational time of the numerical annealings, and the solution to it is the parallel processing of SA. The other one is the determination of the appropriate neighborhood range in SA, and the solution to it is the int...

In this paper, we present a parallel simulated annealing (SA) on distributed computing resources. The parallel SA include two types of cooperation mechanism: inner group and inter group cooperations. In the inner group cooperation, SA processes start from the same initial point, however, move to different direction. That is, two concepts: concentration and diversity are included. On the other h...