Genetic algorithm is widely used in optimization problems for its excellent global search capabilities and highly parallel processing capabilities; but, it converges prematurely and has a poor local optimization capability in actual operation. Simulated annealing algorithm can avoid the search process falling into local optimum. A hybrid genetic algorithm based on simulated annealing is designe...

This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem; usage o...

Stochastic optimization using simulated annealing has found wide applications in combinatorial optimization of NP-complete problems in recent years, especially in VLSI related problems. The Grid Connection Problem is a combinatorial optimization problem that is proven to be NP-complete. In this paper the simulated annealing algorithm has been applied to the Grid Connection Problem. We also prop...