ACM Home Page
Please provide us with feedback. Feedback
A multi-level search framework for asynchronous cooperation of multiple hyper-heuristics
Full text PdfPdf (388 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers table of contents
Montreal, Québec, Canada
WORKSHOP SESSION: Automated heuristic design: crossing the chasm for search methods table of contents
Pages 2193-2196  
Year of Publication: 2009
ISBN:978-1-60558-505-5
Authors
Djamila Ouelhadj  Automated Scheduling, Optimisation and Planning Research Group , Nottingham, United Kingdom
Sanja Petrovic  Automated Scheduling, Optimisation and Planning Research Group , Nottingham, United Kingdom
Ender Ozcan  Automated Scheduling, Optimisation and Planning Research Group , Nottingham, United Kingdom
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1570256.1570300
What is a DOI?

ABSTRACT

In this paper, we propose an agent-based multi-level search framework for the asynchronous cooperation of hyper-heuristics. This framework contains a population of different hyper-heuristic agents and a coordinator agent. Each hyper-heuristic agent operates on the same set of low level heuristics, while the coordinator agent operates on top of all the hyper-heuristic agents. Starting from the same initial solution, each hyper-heuristic agent performs a search over the space generated by the low level heuristics. The hyper-heuristic agents cooperate asynchronously through the coordinator agent by exchanging their elite solutions. The coordinator agent maintains a pool of elite solutions and manages the communication between the hyper-heuristics agents.

Preliminary computational experiments have been carried out on a set of permutation flow shop benchmark instances. The results illustrated the superior performance of the multi-level framework for asynchronous cooperation of hyper-heuristics.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., and Schulenburg, S. Hyper-heuristics: an emerging direction in modern search technology. In Handbook of Meta-heuristics, F. Glover (ed.), Kluwer, 2003, 457--474.
 
3
Cowling, P. and Chakhlevitch, K. Hyper-heuristics for managing a large collection of low level heuristics to schedule personnel. In Proceedings of the 2003 Congress on Evolutionary Computation, 2003, 1214--1221.
 
4
Crainic, T. G. and Toulouse, M. Parallel strategies for meta-heuristics. In Handbook in Meta-heuristics, F. Glover, G. Kochenberger (eds.), Kluwer Academic Publishers, Norwell, MA, 2003, 475--513.
 
5
 
6
Kendall, G. and Mohamad, M. Channel assignment in cellular communication using a great deluge hyper-heuristic. In Proceedings of the 12th IEEE International Conference on Networks, Singapore, 2004, 769--773.
 
7
 
8
Ouelhadj, D. and Petrovic, S. A cooperative distributed hyper-heuristic framework for scheduling. In Proceedings of the IEEE International Conference on Man, Cybernetics, and Systems, Singapore, 1232--1238, 2008.
 
9
 
10
Soubeiga, E. Development and application of hyper-heuristics to personnel scheduling. Ph.D. Thesis, University of Nottingham, UK, 2003.
 
11
Taillard, E. D. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64 (1993), 278--285.

Collaborative Colleagues:
Djamila Ouelhadj: colleagues
Sanja Petrovic: colleagues
Ender Ozcan: colleagues