Hybrid simulated annealing with memory: an evolution-based diversification approach

References

• Aarts , EHL . 1994 . A computational study of local search algorithms for job shop scheduling . ORSA Journal on Computing , 6 ( 2 ) : 118 – 125 .
   Google Scholar
• Aiex , RM , Binato , S and Resende , MGC . 2003 . Parallel GRASP with path relinking for job shop scheduling . Parallel Computing , 29 ( 4 ) : 393 – 430 .
   Web of Science ®Google Scholar
• Aydin , ME and Fogarty , TC . 2004 . A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems . Journal of Heuristics , 10 ( 3 ) : 269 – 292 .
   Web of Science ®Google Scholar
• Azizi , N and Zolfaghari , S . 2004 . Adaptive temperature control for simulated annealing: a comparative study . Computers & Operations Research , 31 ( 14 ) : 2439 – 2451 .
   Web of Science ®Google Scholar
• Balas , E , Lenstra , JK and Vazacopoulos , A . 1995 . The one-machine problem with delayed precedence constraints and its use in job shop scheduling . Management Science , 41 ( 1 ) : 94 – 109 .
   Web of Science ®Google Scholar
• Bierwirth, C., Mattfeld, D.C. and Kopfer, H., 1996. On permutation representations for scheduling problems. In: Proceedings of 4th international conference on parallel problem solving from nature. Lecture notes in computer science, vol. 114, 22–26 September Berlin, Germany. London: Springer-Verlag, 310–318
   Google Scholar
• Binato , S . 2001 . A GRASP for job shop scheduling , orwell , MA : Kluwer Academic Publishers .
   Google Scholar
• Boese , KD , Kahng , AB and Muddu , S . 1994 . A new adaptive multi-start technique for combinatorial global optimizations . Operations Research Letters , 16 ( 2 ) : 101 – 113 .
   Web of Science ®Google Scholar
• Della Croce , F , Tadei , R and Volta , G . 1995 . A genetic algorithm for the job shop problem . Computers & Operations Research , 22 ( 1 ) : 15 – 24 .
   Web of Science ®Google Scholar
• Dorigo , M and Gambardella , LM . 1997 . Ant colony system: a cooperative learning approach to the traveling salesman problem . IEEE Transactions on Evolutionary Computation , 1 ( 1 ) : 53 – 66 .
   Google Scholar
• Dell’Amico , M and Trubian , M . 1993 . Applying tabu search to the job shop scheduling problem . Annals of Operations Research , 41 ( 3 ) : 231 – 252 .
   Google Scholar
• El-Bouri , A , Azizi , N and Zolfaghari , S . 2007 . A comparative study of new metaheuristics based on simulated annealing and adaptive memory programming . European Journal of Operational Research , 177 ( 3 ) : 1894 – 1910 .
   Web of Science ®Google Scholar
• Feo , T and Resende , M . 1995 . Greedy randomized adaptive search procedures . Journal of Global Optimization , 16 ( 2 ) : 109 – 133 .
   Web of Science ®Google Scholar
• Glover , F . 1986 . Future paths for integer programming and links to artificial intelligence . Computers and Operations Research , 13 ( 5 ) : 533 – 549 .
   Web of Science ®Google Scholar
• Gonçalves , JF , Mendes , JJM and Resende , MGC . 2005 . A hybrid genetic algorithm for the job shop scheduling problem . European Journal of Operational Research , 167 ( 1 ) : 77 – 95 .
   Web of Science ®Google Scholar
• Holland , JH . 1975 . Adaptation in natural and artificial systems , Ann Arbor , MI : The University of Michigan Press .
   Google Scholar
• Kennedy , J and Eberhart , R . Particle swarm optimization . Proceedings of IEEE international conference on neural networks . 27 November–1 December 1995 , Perth , Australia. Vol. 1 , pp. 1942 – 1948 .
   Google Scholar
• Kirkpatrick , S , Gelatt , CDJr and Vecchi , MP . 1983 . Optimization by simulated annealing . Science , 220 ( 4598 ) : 671 – 680 .
   PubMed Web of Science ®Google Scholar
• Kolonko , M . 1999 . Some new results on simulated annealing applied to the job shop scheduling problem . European Journal of Operational Research , 113 ( 1 ) : 123 – 136 .
   Web of Science ®Google Scholar
• Nowicki , E and Smutnicki , C . 1996 . A fast tabu search algorithm for the job shop problem . Management Science , 42 ( 6 ) : 797 – 813 .
   Web of Science ®Google Scholar
• Nowicki , E. and Smutnicki , C. 2001 . Some new ideas in TS for job shop scheduling , Technical report 50/2001 Wroclaw, Poland : Institute of Engineering Cybernetics, Technical University of Wroclaw .
   Google Scholar
• Nowicki , E. and Smutnicki , C. 2002 . Some new tools to solve the job shop probelm , Technical report 60/2002 Wroclaw , , Poland : Institute of Engineering Cybernetics, Technical University of Wroclaw .
   Google Scholar
• Osman , IH . 1993 . Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem . Annals of Operations Research , 41 ( 4 ) : 421 – 451 .
   Google Scholar
• Rahoual , M and Saad , R . Solving timetabling problems by hybridizing genetic algorithms and tabu search . In: Proceedings of the 6th international conference on practice and theory of automated timetabling, PATAT . 30 August–1 September 2006 , Brno , Czech Republic. pp. 467 – 472 .
   Google Scholar
• Santos, H.G., Ochi, L.S. and Souza, M.J.F., 2004. A tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem. In: Proceedings of the 5th international conference on practice and theory of automated timetabling, PATAT, 18–20 August 2004, Pittsburgh, USA, 343–359
   Google Scholar
• Taillard , ED . 1993 . Benchmark for basic scheduling problems. . European Journal of Operational Research , 64 ( 2 ) : 278 – 285 .
   Web of Science ®Google Scholar
• Taillard , ED . 1997 . A tabu search heuristic for the vehicle routing problem with soft time windows . Transportation Science , 31 ( 2 ) : 170 – 186 .
   Web of Science ®Google Scholar
• Taillard , ED . 2001 . Adaptive memory programming: a unified view of metaheuristics . European Journal of Operational Research , 135 ( 1 ) : 1 – 16 .
   Web of Science ®Google Scholar
• Van Laarhoven , PJM , Aarts , EHL and Lenstra , JK . 1992 . Job shop scheduling by simulated annealing . Operations Research , 40 ( 1 ) : 113 – 126 .
   Web of Science ®Google Scholar
• Wang , L and Zheng , DZ . 2001 . An effective hybrid optimization strategy for job-shop scheduling problems . Computers & Operations Research , 28 ( 6 ) : 585 – 596 .
   Web of Science ®Google Scholar
• Zhang , CY . 2008 . A very fast TS/SA algorithm for the job shop scheduling problem . Computers & Operations Research , 35 ( 1 ) : 282 – 294 .
   Web of Science ®Google Scholar
• Zolfaghari , S and Liang , M . 1999 . Jointly solving the group scheduling and machining speed selection problems: a hybrid tabu search and simulated annealing approach . International Journal of Production Research , 37 ( 10 ) : 2377 – 2397 .
   Web of Science ®Google Scholar