A cooperative hyper-heuristic search framework

Journal of Heuristics

Volumn 16, Issue 6, 2010, Pages 835-857

  Ouelhadj, Djamila ^a   Petrovic, Sanja ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Cooperative search; Distributed problem solving; Hyper heuristics; Permutation flow shop scheduling

Indexed keywords

AGENT BASED; COMPARATIVE STUDIES; COMPUTATIONAL EXPERIMENT; COOPERATIVE SEARCH; DISTRIBUTED PROBLEM SOLVING; HYPER-HEURISTICS; HYPERHEURISTIC; INITIAL SOLUTION; LOCAL SEARCH; LOW LEVEL; PERMUTATION FLOW SHOPS; PERMUTATION FLOW-SHOP SCHEDULING; SOLUTION SPACE;

LAKES; PROBLEM SOLVING; SCHEDULING;

MACHINE SHOP PRACTICE;

EID: 78049530134     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-009-9122-6     Document Type: Conference Paper

References (46)

1. Alba, E.: Parallel Meta-heuristics: A New Class of Algorithms. Wiley, New York (2005)
2. Aydin, M.E.: Meta-heuristic agent teams for job shop scheduling problems. In: Lecture Notes in Computer Science, vol. 4659, pp. 185-194. Springer, Berlin (2007)
3. Ayob, M., Kendall, G.A.: A Monte Carlo hyper-heuristic to optimise component placement sequencing for multi-head placement machine. In: Proceedings of the International Conference on Intelligent Technologies, Chiang Mai, Thailand, pp. 132-141 (2003)
4. R. Bai E.K. Burke G. Kendall 2008 Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation J. Oper. Res. Soc. 59 10 187 197 10.1057/palgrave.jors.2602463
5. C. Blum A. Roli 2003 Metaheuristics in combinatorial optimization: Overview and conceptual comparison ACM Comput. Surv. 35 3 268 308 10.1145/937503.937505
6. Burke, E.K., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-heuristics, pp. 457-474. Kluwer Academic, Dordrecht (2003a)
7. E.K. Burke G. Kendall E. Soubeiga 2003 A tabu search hyper-heuristic for timetabling and rostering J. Heuristic 9 6 451 470 10.1023/B:HEUR.0000012446. 94732.b6
8. Burke, E.K., Kendall, G., Landa-Silva, D., O'Brien, R., Soubeiga, E.: An ant algorithm hyper-heuristic for the project presentation scheduling problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, Edinburgh, Scotland, pp. 2263-2270 (2005)
9. Burke, E.K., Petrovic, S., Qu, R.: Case based heuristic selection for timetabling problems. J. Sched. 115-132 (2006)
10. E.K. Burke B. McCollum A. Meisels S. Petrovic R. Qu 2007 A graph-based hyper-heuristic for educational timetabling problems Eur. J. Oper. Res. 176 1 177 192 1137.90602 10.1016/j.ejor.2005.08.012 2265142 (Pubitemid 44442718)
11. Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Qu, R.: A survey of hyper-heuristics. School of Computer Science, University of Nottingham, Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747 (2009)
12. Cavalcante, C.C.B., Cavalcante, V.C., Ribeiro, C.C., de Souza, C.C.: Parallel cooperative approaches for the labor constrained scheduling problem. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Meta-heuristics, pp. 201-225. Kluwer Academic, Dordrecht (2001)
13. Clearwater, S.H., Huberman, B.A., Hogg, T.: Cooperative problem solving. In: Huberman, B. (ed.) Computation: The Micro and the Macro View, pp. 33-70 (1992)
14. Cowling, P., Chakhlevitch, K.: Hyperheuristics for managing a large collection of low level heuristics to schedule personnel. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1214-1221 (2003)
15. Cowling, P., Kendall, G., Han, L.: An investigation of a hyper-heuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, Hawaii, pp. 1185-1190 (2002)
16. T.G. Crainic M. Gendreau 2002 Cooperative parallel tabu search for capacitated network design J. Heuristics 8 6 601 627 10.1023/A:1020325926188 (Pubitemid 35344142)
17. Crainic, T.G., Toulouse, M.: Parallel strategies for meta-heuristics. In: Glover, F., Kochenberger, G. (eds.) Handbook in Meta-heuristics, pp. 475-513. Kluwer Academic, Dordrecht (2003)
18. Crainic, T.G., Toulouse, M.: Explicit and emergent cooperation schemes for search algorithms. In: Learning and Intelligent Optimization (LION II) Conference. Lecture Notes in Computer Science, vol. 5313, pp. 95-109. Springer, Berlin (2008)
19. T.G. Crainic M. Toulouse M. Gendreau 1995 Parallel asynchronous tabu search for multi-commodity location allocation with balancing requirements Ann. Oper. Res. 63 277 299 10.1007/BF02125458
20. T.G. Crainic M. Toulouse M. Gendreau 1995 Synchronous tabu search parallelization strategies for multi-commodity location allocation with balancing requirements OR Spectrum 17 2-3 113 123 0843.90067
21. T.G. Crainic M. Toulouse M. Gendreau 1997 Towards a taxonomy of parallel tabu search algorithms INFORMS J. Comput. 9 1 61 72 0891.90094 10.1287/ijoc.9.1.61
22. K.A. Dowsland E. Soubeiga E.K. Burke 2007 A simulated annealing hyper-heuristic for determining shipper sizes Eur. J. Oper. Res. 179 3 759 774 1127.90007 10.1016/j.ejor.2005.03.058 (Pubitemid 46038588)
23. Ferber, J.: Multi-agent Systems: An Introduction to Distributed Artificial Intelligence. Addison-Wesley, Reading (1999)
24. Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225-251. Prentice Hall, Englewood Cliffs (1963)
25. Gaw, A., Rattadilok, P., Kwan, R.S.K.: Distributed choice function hyper-heuristics for timetabling and scheduling. In: Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling, pp. 495-498 (2004)
26. Hogg, T., Williams, C.P.: Solving the really hard problems with cooperative search. In: Proceedings of AAAI, pp. 213-235 (1993)
27. T. James C. Rego F. Glover 2009 A cooperative parallel tabu search algorithm for the quadratic assignment problem Eur. J. Oper. Res. 195 3 810 826 1156.90400 10.1016/j.ejor.2007.06.061
28. Kendall, G., Mohamad, M.: Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Proceedings of the 12th IEEE International Conference on Networks, Singapore, pp. 769-773 (2004)
29. Landa-Silva, D., Obit, E.J.: Great deluge with nonlinear decay rate for solving course timetabling problems. In: Proceedings of the IEEE Conference on Intelligent Systems, pp. 8.11-8.18 (2008)
30. A. Le Bouthillier T.G. Crainic 2005 A cooperative meta-heuristic for the vehicle routing problem with time windows Comput. Oper. Res. 32 1685 1708 1074.90006 10.1016/j.cor.2003.11.023
31. Montgomery, D.C.: Design and Analysis of Experiments. Wiley, New York (2000)
32. M. Nawaz E.E. Enscore I. Ham 1983 A heuristic algorithm for the m machine, n job flow shop sequencing problem Omega 11 91 95 10.1016/0305-0483(83) 90088-9 (Pubitemid 13193807)
33. Nareyek, A.: Choosing search heuristics by non-stationary reinforcement learning. In: Resende, M.G.C., de Sousa, J.P. (eds.) Meta-heuristics: Computer Decision-Making, pp. 523-544. Kluwer Academic, Dordrecht (2003)
34. OR: http://mscmga.ms.ic.ac.uk/jeb/orlib/flowshopinfo.html. Accessed January 2008
35. Ouelhadj, D., Petrovic, S.: A cooperative distributed hyper-heuristic framework for scheduling. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Singapore, pp. 1232-1238 (2008)
36. Ouelhadj, D., Petrovic, S.: Asynchronous cooperative hyper-heuristic search. In: Proceedings of the International Conference on Artificial Intelligence, Las Vegas, pp. 78-84 (2009)
37. E. Özcan B. Bilgin E.E. Korkmaz 2008 A comprehensive analysis of hyper-heuristics Intell. Data Anal. 12 1 3 23
38. Pinedo, M.: Scheduling: Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs (1995)
39. Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 529-556. Springer, Berlin (2005)
40. Ross, P., Schulenburg, S., Marin Blazquez, J.G., Hart, E.: Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In: Proceeding of the Genetic and Evolutionary Computation Conference, New York, USA, pp. 942-948 (2002)
41. R. Ruiz C. Maroto 2005 A comprehensive review and evaluation of permutation flow shop heuristics Eur. J. Oper. Res. 165 2 479 494 1066.90038 10.1016/j.ejor.2004.04.017 2121952 (Pubitemid 40206377)
42. Soubeiga, E.: Development and application of hyper-heuristics to personnel scheduling. Ph.D. Thesis, University of Nottingham, UK (2003)
43. E.D. Taillard 1993 Benchmarks for basic scheduling problems Eur. J. Oper. Res. 64 278 285 0769.90052 10.1016/0377-2217(93)90182-M (Pubitemid 23599340)
44. Taillard, E.D.: Summary of best known lower and upper bounds of Taillard's instances. http://ina.eivd.ch/collaborateurs/etd. Accessed January 2008
45. E. Talbi V. Bachelet 2006 COSEARCH: A parallel cooperative metaheuristic J. Math. Model. Algorithms 5 5 22 1099.68742 10.1007/s10852-005-9029-7 2231555 (Pubitemid 43473947)
46. Toulouse, M., Crainic, T.G., Sanso, S.: An experimental study of the systemic behavior of cooperative search algorithms. In: Vo, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 373-392. Kluwer Academic, Dordrecht (1999)