Skip to main content
SpringerLink
Log in

A cooperative hyper-heuristic search framework

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In this paper, we aim to investigate the role of cooperation between low level heuristics within a hyper-heuristic framework. Since different low level heuristics have different strengths and weaknesses, we believe that cooperation can allow the strengths of one low level heuristic to compensate for the weaknesses of another. We propose an agent-based cooperative hyper-heuristic framework composed of a population of heuristic agents and a cooperative hyper-heuristic agent. The heuristic agents perform a local search through the same solution space starting from the same or different initial solution, and using different low level heuristics. The heuristic agents cooperate synchronously or asynchronously through the cooperative hyper-heuristic agent by exchanging the solutions of the low level heuristics. The cooperative hyper-heuristic agent makes use of a pool of the solutions of the low level heuristics for the overall selection of the low level heuristics and the exchange of solutions. Computational experiments carried out on a set of permutation flow shop benchmark instances illustrated the superior performance of the cooperative hyper-heuristic framework over sequential hyper-heuristics. Also, the comparative study of synchronous and asynchronous cooperative hyper-heuristics showed that asynchronous cooperative hyper-heuristics outperformed the synchronous ones.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alba, E.: Parallel Meta-heuristics: A New Class of Algorithms. Wiley, New York (2005)

    Google Scholar 

  • 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)

    Google Scholar 

  • 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)

  • Bai, R., Burke, E.K., Kendall, G.: Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation. J. Oper. Res. Soc. 59(10), 187–197 (2008)

    Article  Google Scholar 

  • Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)

    Article  Google Scholar 

  • 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)

    Google Scholar 

  • Burke, E.K., Kendall, G., Soubeiga, E.: A tabu search hyper-heuristic for timetabling and rostering. J. Heuristic 9(6), 451–470 (2003b)

    Article  Google Scholar 

  • 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)

  • Burke, E.K., Petrovic, S., Qu, R.: Case based heuristic selection for timetabling problems. J. Sched. 115–132 (2006)

  • Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for educational timetabling problems. Eur. J. Oper. Res. 176(1), 177–192 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  • 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)

  • 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)

    Google Scholar 

  • 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)

  • 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)

  • 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)

  • Crainic, T.G., Gendreau, M.: Cooperative parallel tabu search for capacitated network design. J. Heuristics 8(6), 601–627 (2002)

    Article  Google Scholar 

  • 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)

    Google Scholar 

  • 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)

    Chapter  Google Scholar 

  • Crainic, T.G., Toulouse, M., Gendreau, M.: Parallel asynchronous tabu search for multi-commodity location allocation with balancing requirements. Ann. Oper. Res. 63, 277–299 (1995a)

    Article  Google Scholar 

  • Crainic, T.G., Toulouse, M., Gendreau, M.: Synchronous tabu search parallelization strategies for multi-commodity location allocation with balancing requirements. OR Spectrum 17(2–3), 113–123 (1995b)

    MATH  Google Scholar 

  • Crainic, T.G., Toulouse, M., Gendreau, M.: Towards a taxonomy of parallel tabu search algorithms. INFORMS J. Comput. 9(1), 61–72 (1997)

    Article  MATH  Google Scholar 

  • Dowsland, K.A., Soubeiga, E., Burke, E.K.: A simulated annealing hyper-heuristic for determining shipper sizes. Eur. J. Oper. Res. 179(3), 759–774 (2007)

    Article  MATH  Google Scholar 

  • Ferber, J.: Multi-agent Systems: An Introduction to Distributed Artificial Intelligence. Addison-Wesley, Reading (1999)

    Google Scholar 

  • 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)

    Google Scholar 

  • 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)

  • Hogg, T., Williams, C.P.: Solving the really hard problems with cooperative search. In: Proceedings of AAAI, pp. 213–235 (1993)

  • James, T., Rego, C., Glover, F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195(3), 810–826 (2009)

    Article  MATH  Google Scholar 

  • 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)

  • 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)

  • Le Bouthillier, A., Crainic, T.G.: A cooperative meta-heuristic for the vehicle routing problem with time windows. Comput. Oper. Res. 32, 1685–1708 (2005)

    Article  MATH  Google Scholar 

  • Montgomery, D.C.: Design and Analysis of Experiments. Wiley, New York (2000)

    Google Scholar 

  • Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m machine, n job flow shop sequencing problem. Omega 11, 91–95 (1983)

    Article  Google Scholar 

  • 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)

    Google Scholar 

  • OR: http://mscmga.ms.ic.ac.uk/jeb/orlib/flowshopinfo.html. Accessed January 2008

  • 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)

  • Ouelhadj, D., Petrovic, S.: Asynchronous cooperative hyper-heuristic search. In: Proceedings of the International Conference on Artificial Intelligence, Las Vegas, pp. 78–84 (2009)

  • Özcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3–23 (2008)

    Google Scholar 

  • Pinedo, M.: Scheduling: Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs (1995)

    MATH  Google Scholar 

  • 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)

    Google Scholar 

  • 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)

  • Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flow shop heuristics. Eur. J. Oper. Res. 165(2), 479–494 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Soubeiga, E.: Development and application of hyper-heuristics to personnel scheduling. Ph.D. Thesis, University of Nottingham, UK (2003)

  • Taillard, E.D.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)

    Article  MATH  Google Scholar 

  • Taillard, E.D.: Summary of best known lower and upper bounds of Taillard’s instances. http://ina.eivd.ch/collaborateurs/etd. Accessed January 2008

  • Talbi, E., Bachelet, V.: COSEARCH: A parallel cooperative metaheuristic. J. Math. Model. Algorithms 5, 5–22 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, UK

    Djamila Ouelhadj & Sanja Petrovic

  2. Department of Mathematics, University of Portsmouth, Lion Gate Building, Portsmouth, PO1 3HF, UK

    Djamila Ouelhadj

Authors
  1. Djamila Ouelhadj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanja Petrovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Djamila Ouelhadj.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ouelhadj, D., Petrovic, S. A cooperative hyper-heuristic search framework. J Heuristics 16, 835–857 (2010). https://doi.org/10.1007/s10732-009-9122-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-009-9122-6

Search

Navigation