Guided operators for a hyper-heuristic genetic algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2903, Issue , 2003, Pages 807-820

  Han, Limin ^a   Kendall, Graham ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHROMOSOMES; HEURISTIC METHODS; PERSONNEL TRAINING; SCHEDULING; DECISION SUPPORT SYSTEMS; DERMATOLOGY; DIAGNOSIS; TELEMEDICINE; WORLD WIDE WEB;

COMPUTATIONAL RESULTS; COURSE SCHEDULING; GUIDED MUTATION; HYPERHEURISTIC; STUDENT PROJECT; TRAINING STAFF;

GENETIC ALGORITHMS;

COST MATRICES; MISCLASSIFICATION; TELEMEDICINE SYSTEM;

EID: 0346955781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24581-0_69     Document Type: Conference Paper

References (26)

1. Aickelin, U, Dowsland, K, Exploiting Problem structure In A Genetic Algorithm Approach To A Nurse Rostering Problem, 2000, Journal Of Scheduling, vol 3, pp.139-153.
2. Bremermann, H.J. 1958. The Evolution of Intelligence. The Nervous System as a Model of its Environment. Technical Report No. 1, Contract No. 477(17), Dept. of Mathematics, Univ. of Washington, Seattle.
3. Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., and Schulenburg, S., Handbook of metaheuristics, chapter 16, Hyper-heuristics: an emerging direction in modern search technology, pp. 457.474. Kluwer Academic Publishers, 2003.
4. Corne, D, Ogden, J, Evolutionary Optimisation of Methodist Preaching Timetables, Lecture Notes in Computer Science, PATAT1995: 142-155.
5. Cowling, P.I., Kendall, G., and Han, L.. An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. Proceedings of the Congress on Evolutionary Computation 2002, CEC 2002. Morgan Kaufman, pp. 1185-1190, 2002.
6. Cowling, P.I., Kendall, G., Soubeiga, E., Hyperheuristic Approach to Scheduling a Sales Summit, Selected papers of Proceedings of the Third International Conference of Practice And Theory of Automated Timetabling, Springer LNCS vol 2079, pp. 176-190.
7. Cowling, P.I., Kendall, G., Soubeiga, E., A Parameter-free Hyperheuristic for Scheduling a Sales Summit, 2001,Proceedings of the Third Metaheuristic International Conference (MIC 2001), pp. 127-131
8. Cowling, P.I., Kendall, G., Soubeiga, E., Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation, 2002, European Conference on Evolutionary Computation (EvoCop 2002), Springer LNCS.
9. Cowling, P.I., Kendall, G., and Soubeiga, E., Hyperheuristics: A robust optimisation method applied to nurse scheduling, 2002, Seventh International Conference on Parallel Problem Solving from Nature, PPSN2002, Springer LNCS, pp. 851-860.
10. Easton, F, Mansour, N, A Distributed Genetic Algorithm For Deterministic And Stochastic Labor Scheduling Problems, 1999,European Journal of Operational Research, pp. 505-523.
11. Falkenauer, E., A Hybrid Grouping Genetic Algorithm for Bin Packing, 1996, Journal of Heuristics, vol 2, No. 1, pp. 5-30.
12. Fraser, A.S., Simulation of genetic systems by automatic digital computers. II, 1957, Effects of linkage on rates under selection. Australian J. of Biol Sci, vol 10, pp 492-499
13. Gratch, J., Chien, S., Adaptive Problem-Solving for Large-Scale Scheduling Problems: A Case Study, 1996, Journal of Artificial Intelligence Research, vol. 4, pp. 365-396.
14. Han, L., Kendall, G., and Cowling, P., An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem, SEAL2002: 267-271.
15. Han, L., Kendall, G., Investigation of a Tabu Assisted Hyper-Heuristic Genetic Algorithm, 2003, accepted by CEC’03, Perth, Australia.
16. Hart, E, Ross, P, Nelson, J, Solving a Real-World Problem Using an Evolving Heuristically Driven Schedule Builder, 1998, Evolutionary Computation vol. 6, No.1, pp. 61-80.
17. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems, Ann Arbor, MI: University of Michigan Press.
18. Martello, S., Toth, P., Knapsack Problems Algorithms and Computer Implementations, 1990, John Wiley & Son Ltd, Chichester, England.
19. Mitchell, M.. An introduction to genetic algorithms, 1996, MIT Press, Cambridge.
20. Moscato, P., 1989, On Evolution, Search, Optimisation, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, report 826, Caltech Concurrent Computation Program, California Institute of Technology, Pasadena, California, USA.
21. Nareyek, A., Choosing Search Heuristics by Non-Stationary Reinforcement Learning, 2001, in Resende, M.G.C., and de Sousa, J.P. (eds.), Metaheuristics: Computer Decision-Making, Kluwer Academic Publishers, pp.523-544.
22. Randall, M, Abramson, D, A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems, 2001,Computational Optimisation and Applications, vol. 20, pp.185-210.
23. Syswerda, G., Schedule Optimisation Using Genetic Algorithm, 1991, Handbook of Genetic Algorithms, Edited by Davis, L., International Thomson Computer Press.
24. Terashima-Marin, H., Ross, P., Valenzuela-Rendon, M., Evolution of Constraint Satisfaction Strategies in Examination Timetabling, 1999, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO99). pp. 635-642.
25. Whitley, D., Starkweather, T., and Shaner, D., The Travelling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination, 1991,, Handbook of Genetic Algorithm, Edited by Davis, L., International Thomson Computer Press.
26. Wren, A. Scheduling, Timetabling and Rostering-a Special Relationship? 1995, in: ICPTAT’95-Proceedings of the International Conference on the Practice and Theory of Automate Timetabling, pp. 475-495 Napier University