Analyzing the landscape of a graph based hyper-heuristic for timetabling problems

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 341-348

  Ochoa, Gabriela ^a   Qu, Rong ^a   Burke, Edmund K ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Graph coloring heuristics; Hyper heuristics; Landscape analysis; Timetabling

Indexed keywords

BIG-VALLEY STRUCTURE; FITNESS LANDSCAPE; GRAPH COLORINGS; GRAPH-BASED; HEURISTIC SEARCH; HYPER-HEURISTICS; HYPERHEURISTIC; LANDSCAPE ANALYSIS; LOCAL MINIMUMS; OPTIMAL SOLUTIONS; RESEARCH DIRECTIONS; SEARCH SPACES; SOLUTION METHODS; TIMETABLING; TIMETABLING PROBLEM;

COLORING; GRAPH THEORY; MODULAR ROBOTS; SCHEDULING;

HEURISTIC METHODS;

EID: 72749091966     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569949     Document Type: Conference Paper

References (25)

1. R. Bai, E. K. Burke, and G. Kendall, Heuristic,meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation, Journal of the Operational Research Society 59 (2008), 1387-1397.
2. E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg, Hyper-heuristics: An emerging direction in modern search technology, Handbook of Metaheuristics (F. Glover and G. Kochenberger, eds.), Kluwer, 2003, pp. 457-474.
3. E. K. Burke, G. Kendall, and E. Soubeiga, A tabu-search hyperheuristic for timetabling and rostering, Journal of Heuristics 9 (2003), no. 6, 451-470.
4. E. K. Burke, B. McCollum, A. Meisels, S. Petrovic, and R. Qu, A graph-based hyper-heuristic for educational timetabling problems, European Journal of Operational Research 176 (2007), 177-192.
5. E. K. Burke, S. Petrovic, and R. Qu, Case based heuristic selection for timetabling problems, Journal of Scheduling 9 (2006), no. 2, 115-132.
6. M. W. Carter and G. Laporte, Recent developments in practical course timetabling, PATAT (Edmund K. Burke and Michael W. Carter, eds.), Lecture Notes in Computer Science, vol. 1408, Springer, 1997, pp. 3-19.
7. P. Cowling, G. Kendall, and E. Soubeiga, A hyperheuristic approach to scheduling a sales summit, Selected papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT 2001), Springer, Aug 2001.
8. L. Davis, Handbook of genetic algorithms, Van Nostrand Reinhold, New York, 1991.
9. K. A. Dowsland, E. Soubeiga, and E. K. Burke, A simulated annealing hyper-heuristic for determining shipper sizes, European Journal of Operational Research 179 (2007), no. 3, 759-774.
10. H. H. Hoos and T. Stützle, Stochastic local search: Foundations and applications, Morgan Kaufmann / Elsevier, 2004.
11. W. Hordijk, A measure of landscapes, Evolutionary Computation 4 (1997), no. 4, 335-360.
12. T. Jones, Crossover, macromutation, and population-based search, Proceedings of the Sixth International Conference on Genetic Algorithms (San Francisco, CA) (L. J. Eshelman, ed.), Morgan Kaufmann, 1995, pp. 73-80.
13. B. Manderick, M. de Weger, and P. Spiessens, The genetic algorithm and the structure of the fitness landscape, Proceedings of the 4th International Conference on Genetic Algorithms, Morgan Kaufmann, 1991, pp. 143-150.
14. P. Merz and B.Freisleben, Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitiioning, Evolutionary Computation 8 (2000), no. 1, 61-91.
15. D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Computers and Operations Research 34 (2007), 2403- 2435.
16. R. Qu and E.K. Burke, Hybridisations within a graph based hyper-heuristic framework for university timetabling problems, Journal of the Operational Research Society t.a. (2008), t.a, to appear, doi: 10.1057/jors.2008.102.
17. R. Qu, E.K. Burke, and B.McCollum, Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems, European Journal of Operational Research t.a. (2008), t.a, online publication, doi:10.1016/j.ejor.2008.10.001.
18. R. Qu, E.K. Burke, B.McCollum, L.T. Merlot, and S.Y. Lee, A survey of search methodologies and automated system development for examination timetabling, Journal of Scheduling t.a. (2008), t.a., to appear, doi: 10.1007/s10951-008-0077-5.
19. P. Ross, Hyper-heuristics, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques (E. K. Burke and G. Kendall, eds.), Springer, 2005, pp. 529-556.
20. P. Ross, J. G. Marin-Blazquez, S. Schulenburg, and E. Hart, Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2003, Springer, 2003, pp. 1295-1306.
21. P. F. Stadler, Towards a theory of landscapes, Complex Systems and Binary Networks (R. López-Pena, R. Capovilla, R. García-Pelayo, H. Waelbroeck, and F. Zertuche, eds.), Lecture Notes in Physics, vol. 461, Springer-Verlag, Berlin, Heidelberg, New York, 1995, pp. 77-163.
22. H. Terashima-Marin, A. Moran-Saavedra, and P. Ross, Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems, Proceedings of the 2005 IEEE Congress on Evolutionary Computation (Edinburgh, Scotland, UK), vol. 2, IEEE Press, 2-5 September 2005, pp. 1104-1110.
23. H. Terashima-Marin, P. Ross, and M. Valenzuela-Rendon, Evolution of constraint satisfaction strategies in examination timetabling, Proc. of the Genetic and Evolutionary Computation Conf. GECCO-99 (San Francisco, CA), Morgan Kaufmann, 1999, pp. 635-642.
24. J. A. Vázquez-Rodríguez, S. Petrovic, and A. Salhi, A combined meta-heuristic with hyper-heuristic approach to the scheduling of the hybrid flow shop with sequence dependent setup times and uniform machines, Proceedings of the 3rd Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2007), 2007.
25. E. D. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biological Cybernetics 63 (1990), 325-336.