Adaptive temperature control for simulated annealing: a comparative study

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.

[1]  Kathryn A. Dowsland,et al.  General Cooling Schedules for a Simulated Annealing Based Timetabling System , 1995, PATAT.

[2]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[3]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[4]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[5]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[6]  K. Dowsland Some experiments with simulated annealing techniques for packing problems , 1993 .

[7]  F. Glover HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[8]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

[9]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[10]  Takeshi Yamada,et al.  Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search , 1996 .

[11]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[12]  S. Zolfaghari,et al.  Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach , 1999 .

[13]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[16]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .