This paper deals with a new algorithm of a parallel simulated annealing HGSA which includes genetic crossover operations. The genetic crossover is used as an enhancement of the origin parallel simulated annealing PSA which allows to recombine solutions produced by individual simulate annealing processes at fixed time intervals. It is found that the proposed algorithm can speed—up the search the...

this article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. regarding the np-hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. a number of test problems are randomly generat...

This paper presents a new simulated annealing algorithm to solve constrained multi-global optimization problems. To compute all global solutions in a sequential manner, we combine the function stretching technique with the adaptive simulated annealing variant. Constraint-handling is carried out through a nondifferentiable penalty function. To benchmark our penalty stretched simulated annealing ...

Simulated annealing is a metaheuristic that balances exploration and exploitation to solve global optimization problems. However, deal with multi- many-objective problems, this balance needs be improved due diverse factors such as the number of objectives. To issue, work proposes MOSA/D, hybrid framework for multi-objective simulated based on decomposition evolutionary perturbation functions. A...

In this paper, the author proposes the application of a genetic algorithm and simulated annealing to solve the network planning problem. Compared with other optimisation methods, genetic algorithm and simulated annealing are suitable for traversing large search spaces since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will ...