Towards the 'decathlon challenge' of search heuristics

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

Volumn 2009-January, Issue , 2009, Pages 2205-2208

  Burke, Edmund K ^a   Curtois, Tim ^a   Kendall, Graham ^a   Hyde, Matthew ^a   Ochoa, Gabriela ^a   Vazquez Rodriguez, Jose A ^a   Petrovic, Sanja ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

combinatorial optimization; hyperheuristics; metaheuristics; software framework

Indexed keywords

CALCULATIONS; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; OBJECT ORIENTED PROGRAMMING;

COMBINATORIAL OPTIMIZATION PROBLEMS; HEURISTIC SEARCH ALGORITHMS; HYPER-HEURISTICS; IS PROBLEMS; META-EVOLUTIONARY; METAHEURISTIC; OBJECT-ORIENTED FRAMEWORKS; SEARCH HEURISTICS; SOFTWARE FRAMEWORKS; SOFTWARE-TOOLS;

COMBINATORIAL OPTIMIZATION;

EID: 79959414123     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1570256.1570303     Document Type: Conference Paper

References (23)

1. R. Bai, J. Blazewicz, E. K. Burke, G. Kendall, and B. McCollum. A simulated annealing hyper-heuristic methodology for flexible decision support. Technical report, School of Computer Science, University of Nottingham, 2007.
2. S. Bleuler, M. Laumanns, L. Thiele, and E. Zitzler. PISA-A Platform and Programming Language Independent Interface for Search Algorithms. In C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, and L. Thiele, editors, Conference on Evolutionary Multi-Criterion Optimization (EMO 2003), volume 2632 of LNCS, pages 494-508, Berlin, 2003. Springer.
3. E. K. Burke, T. Curtois, R. Qu, and G. Vanden Berghe. A scatter search for the nurse rostering problem. Technical report, School of Computer Science, University of Nottingham, 2007.
4. E. K. Burke, T. Curtois, R. Qu, and G. Vanden Berghe. A time predefined variable depth search for nurse rostering. Technical report, School of Computer Science, University of Nottingham, 2007.
5. E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg. Hyper-heuristics: An emerging direction in modern search technology. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 457-474. Kluwer, 2003.
6. E. K. Burke, G. Kendall, and R. Qu. Hyper-heuristics and theier emploument on search problems. The 25th Workshop of the UK Planning AND Scheduling, PlanSIG 2006, December 2006. Keynote talk.
7. E.K. Burke, P. Cowling, P. De Causmaecker, and G. Vanden Berghe. A memetic approach to the nurse rostering problem. Applied Intelligence, 15(3):199-214, 2001.
8. E.K. Burke, T. Curtois, G. Post, R. Qu, and B. Veltman. A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188(2):330-341, 2008.
9. P. Cowling, G. Kendall, and E. Soubeiga. A hyperheuristic approach for scheduling a sales summit. In Selected Papers of the Third International Conference on the Practice And Theory of Automated Timetabling, PATAT 2000, LNCS, pages 176-190, Konstanz, Germany, 2000. Springer.
10. T. Curtois. A hyflex module for the personnel scheduling problem. Technical report, School of Computer Science, University of Nottingham, 2009.
11. E Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30, 1996.
12. A. S. Fukunaga. Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation (MIT Press), 16(1):31-1, 2008.
13. H. H. Hoos and T. Stäutzle. Satlib: An online resource for research on sat. In I. P. Gent, H. V. Maaren, and T. Walsh, editors, SAT 2000, pages 283-292. IOS Press, 2000. SATLIB is available online at www.satlib.org.
14. M. Hyde. A hyflex module for the boolean satisfiability problem. Technical report, School of Computer Science, University of Nottingham, 2009.
15. M. Hyde. A hyflex module for the one dimensional bin-packing problem. Technical report, School of Computer Science, University of Nottingham, 2009.
16. D. Johnson, A. Demers, J. Ullman, M. Garey, and R. Graham. Worst-case performance bounds for simple one-dimensional packaging algorithms. SIAM Journal on Computing, 3(4):299-325, December 1974.
17. M. Nawaz, E. Enscore Jr., and I. Ham. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA-International Journal of Management Science, 11(1):91-95, 1983.
18. A. J. Parkes. A proposal for a hyper-heuristics software interface. Oral presentation, May 2007. Automated Scheduling, Optimisation and Planning Research Group. Internal Seminar.
19. R. Ruiz and T. G. Stäutzle. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Journal of Operational Research, 187(10):1143-1159, 2007.
20. P. Schwerin and G. Wäascher. The bin-packing problem: A problem generator and some numerical experiments with ffd packing and mtp. International Transactions in Operational Research, 4(5):377-389, 1997.
21. E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2):278-285, 1993.
22. J. A. Vazquez-Rodriguez. A hyflex module for the permutation flow shop problem. Technical report, School of Computer Science, University of Nottingham, 2009.
23. J. Woodward, A. Parkes, and G. Ochoa. A mathematical framework for hyper-heuristics. Oral presentation, 2008 September. Workshop on Hyper-heuristics - Automating the Heuristic Design Process, in conjunction with the 10th International Conference on Parallel Problem Solving From Nature (PPSN X), Dortmund, Germany.