The paper focuses on a parallel implementation of a simulated annealing algorithm. In order to take advantage of the properties of modern clustered SMP architectures a hybrid method using a combination of OpenMP nested in MPI is advocated. The development of the reference implementation is proposed. Furthermore, a few load balancing strategies are introduced: time scheduling at the annealing pr...

Article History: Received 05 January 2017 Accepted 23 February 2017 Available 15 July 2017 This study focuses on identical parallel machine scheduling of jobs with deteriorating processing times and rate-modifying activities. We consider nonlinearly increasing processing times of jobs based on their position assignment. Rate modifying activities (RMAs) are also considered to recover the increas...

This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes a population-based simulated annealing algorithm with both intensification and diversification. The algorithm is organized as a series of simulated annealing waves, each wave being followed by a macro-intensification. The diversification...

We compare the two well-known global optimization methods, simulated annealing and genetic optimization, to a local gradient-based optimization technique. We rate the applicability of each method in terms of the minimal achievable target value for a given number of simulation runs in an inverse modeling application. The gradient-based optimizer used in the experiment is based on the Levenberg-M...

We consider the automatic generation of parallel templates as basis for the implementation of n 2-problem solvers on parallel systems. The automatic template generator relies on the embedding of a virtual systolic loop on the given machine's network and optimizes hyper-systolic data communication by means of Simulated Annealing techniques. We have generated a parallel template to eeciently prog...

A detailed study is presented on the combinatorial optimization problem of allocating parallel tasks to a parallel computer. Depending on two application/machine-specific parameters, both a sequential and a parallel optimal allocation phase are shown to exist. A sudden “phase” transition is observed if one of these parameters is varied. Simulated annealing is used to find the optimal allocation...