Hyperheuristics for managing a large collection of low level heuristics to schedule personnel

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 2, Issue , 2003, Pages 1214-1221

  Cowling, Peter ^a   Chakhlevitch, Konstantin ^a  

^a UNIVERSITY OF BRADFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

FINANCIAL INSTITUTION; HYPER-HEURISTICS; HYPERHEURISTIC; OBJECTIVE FUNCTIONS; REAL-WORLD PROBLEM; SCHEDULING PROBLEM; SEARCH METHOD; SOLUTION QUALITY;

GENETIC PROGRAMMING;

EID: 84868531774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299807     Document Type: Conference Paper

References (21)

1. U. Aickelin and K. Dowsland (2000), Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem, Journal of Scheduling 3, 139-153.
2. E. Burke, P. Cowling, P. De Causmaecker, and G. Vanden Berghe (2001), A memetic approach to the nurse rostering problem, Applied Intelligence 15, 199-214.
3. E. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg (2003), Hyperheuristics: An emerging direction in modern search technology, in F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, Kluwer Academic Publishers, 457-474.
4. D. Corne and P. Ross (1995), Peckish initialisation strategies for evolutionary timetabling, in E. Burke and P. Ross (eds.), Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science no. 1153, Springer-Verlag, 227-240.
5. P. Cowling, G. Kendall, and L. Han (2002), An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem, Proceedings of 2002 Congress on Evolutionary Computation (CEC2002), IEEE Computer Society Press, Honolulu, USA, 1185-1190.
6. P. Cowling, G. Kendall, and E. Soubeiga (2000), A Hyperheuristic Approach to Scheduling a Sales Summit, in E. Burke and W. Erben (eds.), Practice and Theory of Automated Timetabling 111: PATAT 2000, Springer Lecture Notes in Computer Science no. 2079, Springer- Verlag, 176-190.
7. P. Cowling, G. Kendall, and E. Soubeiga (2001), A parameter-free hyperheuristic for scheduling a sales summit, Proceedings of the Third Metaheuristic International Conference (MIC2001), Porto, Portugal, 127-131.
8. P. Cowling, G. Kendall, and E. Soubeiga (2002a), Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation, in S. Cagoni, J. Gottlieb, E. Hart, M. Middendorf and R. Giinther (eds.), Applications of Evolutionary Computing: Proceedings of Evo Workshops 2002, Springer Lecture Notes in Computer Science no. 2279, Springer-Verlag, 1-10.
9. B. Dodin, A. A. Elimam, and E. Rolland (1998), Tabu search in audit scheduling, European Journal of Operational Research 106, 373-392.
10. K. Dowsland (1998), Nurse scheduling with tabu search and strategic oscillation, European Journal of Operational Research 106, 393-407.
11. H.-L. Fang, P. Ross, and D. Corne (1994), A promising hybrid GA/heuristic approach for open-shop scheduling problems, in A. Cohn (ed.), Proceedings of ECA1 94: 11th European Conference on Artificial Intelligence, John Wiley & Sons, 590-594.
12. F Glover and M. Laguna (1997). Tabu Search, Kluwer Academic Publishers, Norwell, MA.
13. J. Gratch and S. Chien (1996), Adaptive problem-solving for large-scale scheduling problems: A case study, Journal of Artificial Intelligence Research 4, 365-396.
14. L. Han, G, Kendall, and P. Cowling (2002), An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem, Proceedings of the 4th Asia- Pacific Conference on Simulated Evolution and Learning (SEAL'02), Singapore, 267-271.
15. P. Hansen and N. Mladenovic (2001), Variable neighbourhood search: Principles and applications, European Journal of Operational Research 130, 449-467.
16. E. Hart, P. Ross, and J. Nelson (1998), Solving a real-world problem using an evolving heuristically driven schedule builder, Evolutionary Computation 6(1), 61-80.
17. A. Nareyek (2003), Choosing search heuristics by non- stationary reinforcement learning, in M, Resende, and J. de Sousa (eds.), Metaheuristics: Computer Decision-Making, Kluwer Academic Publishers, 523-544.
18. M. Randall, D. Abramson (2001), A general meta-heuristic based solver for combinatorial optimisation problems, Computational Optimisation and Applications, 20, 185-210.
19. H. Terashima-Marin, P. Ross, and M. Valenzuela-Rendon (1999), Evolution of constraint strategies in examination timetabling, in W. Banzhaf et al. (eds.), Proceedings of the GECC099 Genetic and Evolutionary' Computation Conference, Morgan Kaufmann, 635-642.
20. G Thompson (1996), A simulated annealing heuristic for shift scheduling using non-continuously available employees, Computers and Operations Research 23, 275-288.
21. E. Tsang and C. Voudouris (1997), Fast local search and guided local search and their application to British Telecom's workforce scheduling problem, Operations Research Letters 20, 119-127.