Single row layout is one of the most usually used layout patterns in industries, particularly in flexible manufacturing systems. Here actual sequencing of machine and arrangement of parts, no doubt, have a great influence on the throughput of the flexible manufacturing system i.e., (F.M.S). This paper discusses the single row layout design in flexible manufacturing system (F.M.S). This paper fu...

Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...

The simulated annealing (SA) algorithm [14] [5] has been applied to every di cult optimization problem in VLSI CAD. Existing SA implementations use monotone decreasing, or cooling, temperature schedules motivated by the algorithm's proof of optimality as well as by an analogy with statistical thermodynamics. This paper gives strong evidence that challenges the correctness of using such schedule...

Combinatorial optimization problems arise in different fields of science and engineering. There exist some general techniques coping with these problems such as simulated annealing (SA). In spite of SA success, it usually requires costly experimental studies in fine tuning the most suitable annealing schedule. In this Letter, the classical integrated circuit placement problem is faced by Thermo...

this research, for the first time presents the flexible flow shop model of scheduling method for considering runway assignment and operations planning together. one of the advantages of the developed model is considering the procedures of air routes in terminal airspace and separation between consecutive aircraft which is very similar to the real world condition. there are different objective f...

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...

In the last decade, many heuristic methods have evolved for solving optimization problems that were previously difficult or impossible to solve. These methods include simulated annealing (SA), tabu search (TS), genetic algorithm (GA), differential evolution (DE), evolutionary programming (EP), evolutionary strategy (ES), ant colony optimization (ACO), and particle swarm optimization (PSO). This...

This paper presents a simulated annealing (SA)-based algorithm for fast and robust block motion estimation. To reduce computational complexity, the existing fast search algorithms move iteratively toward the winning point based only on a finite set of checking points in every stage. Despite the efficiency of these algorithms, the search process is easily trapped into local minima, especially fo...

Hybrid algorithm based on Particle Swarm Optimization (PSO) and Simulated annealing (SA) is proposed, to solve Flexible Job Shop Scheduling with five objectives to be minimized simultaneously: makespan, maximal machine workload, total workload, machine idle time & total tardiness. Rescheduling strategy used to shuffle workload once the machine breakdown takes place in proposed algorithm. The hy...

Clustering is a very well known technique in data mining. One of the most widely used clustering techniques is the kmeans algorithm. Solutions obtained from this technique depend on the initialization of cluster centers and the final solution converges to local minima. In order to overcome K-means algorithm shortcomings, this paper proposes a hybrid evolutionary algorithm based on the combinati...