This paper presents a parallel genetic simulated annealing (PGSA) algorithm that has been developed and applied to optimize continuous problems. In PGSA, the entire population is divided into subpopulations, and in each subpopulation the algorithm uses the local search ability of simulated annealing after crossover and mutation. The best individuals of each subpopulation are migrated to neighbo...

We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for th...

In this paper we consider a simulated annealing algorithm for multiobjective optimization problems. With a suitable choice of the acceptance probabilities, the algorithm is shown to converge asymptotically, that is, the Markov chain that describes the algorithm converges with probability one to the Pareto optimal set.

Researchers laid the foundation of evolutionary algorithms in the late 60s and since then, heuristic algorithms have been widely applied to several complex scheduling and sequencing problems during the recent studies. In this paper, memetic algorithm (MA), genetic algorithm (GA) and simulated annealing (SA) are applied to a complex sequencing problem. The problem under study concerns about sequ...

This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, which are originally used to compare two clusterings (the obtained clustering vs. a ground truth clustering) for the evaluation of a clustering algorithm. Though we can follow a greedy strategy to optimize these measures a...

A hybrid simulated annealing algorithm based on a novel immune mechanism is proposed for the job shop scheduling problem with the objective of minimizing total weighted tardiness. The proposed immune procedure is built on the following fundamental idea: the bottleneck jobs existing in each scheduling instance generally constitute the key factors in the attempt to improve the quality of final sc...

Simulated annealing algorithms for VLSI layout tasks produce solutions of high quality but are computationally expensive. This thesis examines some parallel approaches to accelerate simulated annealing using message-passing multiprocessors with a hypercube architecture. Floorplanning is chosen as a typical application of annealing in physical design. Different partitioning strategies which map ...

In this paper, we deal with nonlinear integer programming problem with interval coefficients, and solve it directly keeping the nonlinearly of the objective function based on Hybrid Algorithm (HA) which is hybridized with the Genetic Algorithm (GA), Simulated Annealing (SA) method and Fuzzy Logic Controller (FLC) technique. Also, we demonstrate the efficiency of this method with optimal selecti...

In this paper, a multiobjective simulated annealing (MOSA) method is introduced and discussed with the multiobjective evolutionary algorithms (MOEAs). Though the simulated annealing is a very powerful search algorithm and has shown good results in various singleobjective optimization fields, it has been seldom used for the multiobjective optimization because it conventionally uses only one sear...