For almost two decades the question of whether tabu search (TS) or simulated annealing (SA) performs better for the quadratic assignment problem has been unresolved. To answer this question satisfactorily, we compare performance at various values of targeted solution quality, running each heuristic at its optimal number of iterations for each target. We find that for a number of varied problem ...

To solve premature phenomenon and falling into local optimum of genetic algorithm, the simulated annealing algorithm is introduced to the genetic algorithm and a simulated annealing is presented based on genetic clustering algorithm, a new effective SA, crossover operator and mutation operator proposed for fitting the partition-based chromosome coding. In addition, the Euclidean distance is rep...

Economic lot scheduling problem has been an important topic in production planning and scheduling research for more than four decades. The problem is known to be NP-hard due to its combinatorial nature. In this paper, a meta-heuristics algorithm based on Simulated Annealing (SA) is proposed. Besides on explaining how to use SA, the effects of changing in production frequency on sequence and als...

With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...

Most nodes of modern massively-parallel computing systems contain processors that use instruction-level parallelism to increase the speed of the individual processor. In order to achieve the greatest speedup possible, the compiler must perform instruction scheduling so that instructions are presented to the processor in the order that is most efficient. Instruction scheduling is a compiler prob...

This paper has been worked on a RAP with multi-state components and the performance rate of each component working state may increase by spending technical and organizational activities costs. Whereas RAP belongs to Np-Hard problems, we used Genetic algorithm (GA) and simulated annealing (SA) and for solving the presented problem and calculating system reliability universal generating function ...

Job Shop Scheduling Problem (JSSP) is an optimization problem in which ideal jobs are assigned to resources at particular times. In recent years many attempts have been made at the solution of JSSP using a various range of tools and techniques such as Branch and Bound and Heuristics algorithms. This paper proposed a new algorithm based on Genetic Algorithm (GA), Tabu Search (TS) and Simulated A...

The Vehicle Routing Problem (VRP) is an important management problem in the field of physical distribution and logistics. Good vehicle routing can not only increase the profit of logistics but also make logistics management more scientific. The Capacitated Vehicle Routing Problem (CVRP) constrained by the capacity of a vehicle is the extension of VRP. Our research applies a two-phase algorithm ...

In this paper we examine the use of compound Gauss Markov random fields (CGMRF) to restore severely blurred high range images. For this deblurring problem, the convergence of the Simulated Annealing (SA) and Iterative Conditional Mode (ICM) algorithms has not been established. We propose two new iterative restoration algorithms which extend the classical SA and ICM approaches. Their convergence...