TY - JOUR
T1 - A comparative study of a new heuristic based on adaptive memory programming and simulated annealing
T2 - The case of job shop scheduling
AU - El-Bouri, A.
AU - Azizi, N.
AU - Zolfaghari, S.
N1 - Funding Information:
The authors are grateful to the anonymous reviewers for their valuable suggestions and comments. The support from the Natural Science and Engineering Council of Canada is very much appreciated.
PY - 2007/3/16
Y1 - 2007/3/16
N2 - In this study, a general framework is proposed that combines the distinctive features of three well-known approaches: the adaptive memory programming, the simulated annealing, and the tabu search methods. Four variants of a heuristic based on this framework are developed and presented. The performance of the proposed methods is evaluated and compared with a conventional simulated annealing approach using benchmark problems for job shop scheduling. The unique feature of the proposed framework is the use of two short-term memories. The first memory temporarily prevents further changes in the configuration of a provisional solution by maintaining the presence of good elements of such solutions. The purpose of the second memory is to keep track of good solutions found during an iteration, so that the best of these can be used as the starting point in a subsequent iteration. Our computational results for the job shop scheduling problem clearly indicate that the proposed methods significantly outperform the conventional simulated annealing.
AB - In this study, a general framework is proposed that combines the distinctive features of three well-known approaches: the adaptive memory programming, the simulated annealing, and the tabu search methods. Four variants of a heuristic based on this framework are developed and presented. The performance of the proposed methods is evaluated and compared with a conventional simulated annealing approach using benchmark problems for job shop scheduling. The unique feature of the proposed framework is the use of two short-term memories. The first memory temporarily prevents further changes in the configuration of a provisional solution by maintaining the presence of good elements of such solutions. The purpose of the second memory is to keep track of good solutions found during an iteration, so that the best of these can be used as the starting point in a subsequent iteration. Our computational results for the job shop scheduling problem clearly indicate that the proposed methods significantly outperform the conventional simulated annealing.
KW - Adaptive memory programming
KW - Job shop scheduling
KW - Meta-heuristics
KW - Simulated annealing
KW - Tabu search
UR - http://www.scopus.com/inward/record.url?scp=33750736617&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750736617&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2005.12.013
DO - 10.1016/j.ejor.2005.12.013
M3 - Article
AN - SCOPUS:33750736617
SN - 0377-2217
VL - 177
SP - 1894
EP - 1910
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 3
ER -