Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem

Authors:
Véronique Bouffard;Jacques A. Ferland
Affiliations:
University of Montreal, Montreal, Canada H3C 3J7;University of Montreal, Montreal, Canada H3C 3J7
Venue:
Journal of Scheduling
Year:
2007

Citing 11
Cited 2

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
A large scale timetabling problem

Computers and Operations Research
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Job shop scheduling by simulated annealing

Operations Research
New optimization heuristics

Journal of Computational Physics
A study of diversification strategies for the quadratic assignment problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Characterization and generation of a general class of resource-constrained project scheduling problems

Management Science
Tight approximations for resource constrained scheduling and bin packing

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Variable neighborhood search

Computers and Operations Research
A Survey of Automated Timetabling

Artificial Intelligence Review
Local search techniques for large high school timetabling problems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Multi-objective scheduling of dynamic job shop using variable neighborhood search

Expert Systems with Applications: An International Journal
Enhanced simulated-annealing-based algorithms and their applications to process planning in reconfigurable manufacturing systems

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to improve the simulated annealing method with a variable neighborhood search to solve the resource-constrained scheduling problem. We also compare numerically this method with other neighborhood search (local search) techniques: threshold accepting methods and tabu search. Furthermore, we combine these techniques with multistart diversification strategies and with the variable neighborhood search technique. A thorough numerical study is completed to set the parameters of the different methods and to compare the quality of the solutions that they generate. The numerical results indicate that the simulated annealing method improved with a variable neighborhood search technique is indeed the best solution method.