In this paper a parallel algorithm for simulated annealing (S.A.) in the continuous case, the Multiple Trials and Adaptive Supplementary Search, MTASS algorithm, is presented. It is based on a combination of multiple trials, local improved searchs and an adaptive cooling schedule. The results in optimizing some standard test problems are compared with a sequential S.A. algorithms and another parallel probabilistic algorithm
In this paper we are concerned with global optimization, which can be defined as the problem of find...
Simulated annealing is a global optimization method that distinguishes between different local optim...
This book presents state of the art contributes to Simulated Annealing (SA) that is a well-known pro...
Abstract. Global optimization involves the difficult task of the identification of global extremitie...
All topics in this dissertation are centered around global optimization problems. The major part of ...
Simulated annealing is a widely used algorithm for the computation of global optimization problems i...
Simulated annealing has proven to be a good technique for solving hard combinatorial optimization p...
Stochastische globale Optimierung ist ein wichtiges mathematisches Verfahren für das Er- mitteln von...
This work explores the use of parallel computing to solve multilocal optimization problems with Stre...
In this paper, we propose a population-based optimization algorithm, Sequential Monte Carlo Simulate...
A new multiobjective simulated annealing algorithm for continuous optimization problems is presented...
Abstract Simulated annealing is a popular local search meta-heuristic used to address discrete and, ...
Metaheuristic is a computational method that brings a problem to the best possible state by iterativ...
Simulated annealing (SA) is a stochastic optimization technique which guarantees under certain condi...
International audienceFinding the global minimum of a nonconvex optimization problem is a notoriousl...
In this paper we are concerned with global optimization, which can be defined as the problem of find...
Simulated annealing is a global optimization method that distinguishes between different local optim...
This book presents state of the art contributes to Simulated Annealing (SA) that is a well-known pro...
Abstract. Global optimization involves the difficult task of the identification of global extremitie...
All topics in this dissertation are centered around global optimization problems. The major part of ...
Simulated annealing is a widely used algorithm for the computation of global optimization problems i...
Simulated annealing has proven to be a good technique for solving hard combinatorial optimization p...
Stochastische globale Optimierung ist ein wichtiges mathematisches Verfahren für das Er- mitteln von...
This work explores the use of parallel computing to solve multilocal optimization problems with Stre...
In this paper, we propose a population-based optimization algorithm, Sequential Monte Carlo Simulate...
A new multiobjective simulated annealing algorithm for continuous optimization problems is presented...
Abstract Simulated annealing is a popular local search meta-heuristic used to address discrete and, ...
Metaheuristic is a computational method that brings a problem to the best possible state by iterativ...
Simulated annealing (SA) is a stochastic optimization technique which guarantees under certain condi...
International audienceFinding the global minimum of a nonconvex optimization problem is a notoriousl...
In this paper we are concerned with global optimization, which can be defined as the problem of find...
Simulated annealing is a global optimization method that distinguishes between different local optim...
This book presents state of the art contributes to Simulated Annealing (SA) that is a well-known pro...