Adaptive temperature control for simulated annealing: a comparative study

Authors:
Nader Azizi;Saeed Zolfaghari
Affiliations:
Department of Mechanical and Industrial Engineering, Ryerson University, Toronto, Ont., Canada M5B 2K3;Department of Mechanical and Industrial Engineering, Ryerson University, Toronto, Ont., Canada M5B 2K3
Venue:
Computers and Operations Research
Year:
2004

Citing 5
Cited 9

The shifting bottleneck procedure for job shop scheduling

Management Science
Cooling schedules for optimal annealing

Mathematics of Operations Research
Job shop scheduling by simulated annealing

Operations Research
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science
General Cooling Schedules for a Simulated Annealing Based Timetabling System

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling

Decision support tool for multi-objective job shop scheduling problems with linguistically quantified decision functions

Decision Support Systems
The efficient search method of simulated annealing using fuzzy logic controller

Expert Systems with Applications: An International Journal
The interacting-particle algorithm with dynamic heating and cooling

Journal of Global Optimization
On the modelling and controller design for the outpouring phase of the pouring process

WSEAS Transactions on Systems and Control
Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility

Computers and Operations Research
A hybrid algorithm with diversification and intensification for permutation flow shop scheduling

MS '08 Proceedings of the 19th IASTED International Conference on Modelling and Simulation
Force identification of prestressed pin-jointed structures

Computers and Structures
Multi-agent simulated annealing algorithm based on differential evolution algorithm

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, two variations of simulated annealing method have been proposed and tested on the minimum makespan job shop scheduling problems. In the conventional simulated annealing, the temperature declines constantly, providing the search with a higher transition probability in the beginning of the search and lower probability toward the end of the search. In the first proposed method, an adaptive temperature control scheme is used that changes temperature based on the number of consecutive improving moves. In the second method, a tabu list has been added to the adaptive simulated annealing algorithm in order to avoid revisits. The performance of these two algorithms is evaluated and favorably compared with the conventional simulated annealing.