Adaptive iterated local search for cross-domain optimisation

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 1987-1994

  Burke, Edmund K ^a   Gendreau, Michel ^b   Ochoa, Gabriela ^a   Walker, James D ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Adaptive; Combinatorial optimization; Hyper heuristics; Iterated local search; Meta heuristics

Indexed keywords

ADAPTIVE; BIN PACKING; COMMON SOFTWARE; CROSS-DOMAIN; HEURISTIC SEARCH; HYPER-HEURISTICS; ITERATED LOCAL SEARCH; ITERATION STEP; MAXIMUM SATISFIABILITY; META HEURISTICS; MULTIPLE NEIGHBORHOODS; ONLINE LEARNING; OPTIMISATIONS; PERMUTATION FLOW SHOPS; RANDOM SELECTION; SEARCH STRATEGIES;

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; INDUSTRIAL APPLICATIONS; LEARNING ALGORITHMS; MATHEMATICAL OPERATORS; OPTIMIZATION; SOFTWARE TESTING;

ADAPTIVE ALGORITHMS;

EID: 84860390107     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001843     Document Type: Conference Paper

References (37)

1. J. Baxter. Local optima avoidance in depot location. Journal of the Operational Research Society, 32:815-819, 1981. (Pubitemid 12521959)
2. G. Belov and Guntram Scheithauer. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research, 141(2):274-294, 2002. (Pubitemid 34623937)
3. S. Bleuler, M. Laumanns, L. Thiele, and E. Zitzler. PISA - A Platform and Programming Language Independent Interface for Search Algorithms. In Conference on Evolutionary Multi-Criterion Optimization (EMO 2003), volume 2632 of LNCS, pages 494-508, Berlin, 2003. Springer.
4. 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. (Pubitemid 32897608)
5. E. K. Burke, T. Curtois, M. Hyde, G. Kendall, G. Ochoa, S. Petrovic, and J. A. Vazquez-Rodriguez. HyFlex: A flexible framework for the design and analysis of hyper-heuristics. In Multidisciplinary International Scheduling Conference (MISTA 2009), pages 790-797, Dublin, Ireland, August 2009.
6. E. K. Burke, T. Curtois, M. Hyde, G. Kendall, G. Ochoa, S. Petrovic, J. A. Vazquez-Rodriguez, and M. Gendreau. Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms. In IEEE Congress on Evolutionary Computation (CEC 2010), pages 3073-3080, Barcelona, Spain, July 2010.
7. 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.
8. 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.
9. E. K. Burke, T. Curtois, R. Qu, and G. Vanden Berghe. A scatter search methodology for the nurse rostering problem. Journal of the Operational Research Society, 61:1667-1679, 2010.
10. E. K. Burke, M. Gendreau, M. Hyde, G. Kendall, B. McCollum, G. Ochoa, A. J. Parkes, and S. Petrovic. The cross-domain heuristic search challenge - an international research competition. In International Conference on Learning and Intelligent Optimization (LION5), Lecture Notes in Computer Science. Springer, 2011. (to appear).
11. 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 c G. Kochenberger, editors, Handbook of Metaheuristics, pages 457-474. Kluwer, 2003.
12. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. Woodward. Handbook of Metaheuristics, volume 146 of International Series in Operations Research & Management Science, chapter A Classification of Hyper-heuristic Approaches, pages 449-468. Springer, 2010. Chapter 15.
13. E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward. The scalability of evolved on line bin packing heuristics. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007), pages 2530-2537, Singapore, September 2007.
14. 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.
15. 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. Springer, 2000.
16. T. Curtois. Staff rostering benchmark data sets. Website, 2009. http:///www.cs.nott.ac.uk/~tec/NRP/.
17. T. Curtois, G. Ochoa, M. Hyde, and J. A. Vázquez-Rodríguez. A hyflex module for the personnel scheduling problem. Technical report, School of Computer Science, University of Nottingham, 2011.
18. E. Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30, 1996. (Pubitemid 126714024)
19. A. Fialho, L. Da Costa, M. Schoenauer, and M. Sebag. Extreme value based adaptive operator selection. In Parallel Problem Solving from Nature (PPSN X), volume 5199 of Lecture Notes in Computer Science, pages 175-184. Springer, 2008.
20. I. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for sat. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI'93), pages 28-33, Washington D.C., USA, July 1993.
21. H. H. Hoos and T. Stützle. 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.
22. M. Hyde, G. Ochoa, T. Curtois, and J. A. Vázquez-Rodríguez. A hyflex module for the boolean satisfiability problem. Technical report, School of Computer Science, University of Nottingham, 2011.
23. M. Hyde, G. Ochoa, T. Curtois, and J. A. Vázquez-Rodríguez. A hyflex module for the one dimensional bin-packing problem. Technical report, School of Computer Science, University of Nottingham, 2011.
24. 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.
25. H. R. Lourenco, O. Martin, and T. Stutzle. Iterated Local Search, pages 321-353. Kluwer Academic Publishers" Norwell, MA, 2002.
26. O. Martin, S. W. Otto, and E. W. Felten. Large-step Markov chains for the TSP incorporating local search heuristics. Operations Research Letters, 11(4):219-224, 1992.
27. 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. (Pubitemid 13193807)
28. P. Ross. Hyper-heuristics. In E. K. Burke and G. Kendall, editors, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, chapter 17, pages 529-556. Springer, 2005.
29. R. Ruiz and T. G. Stützle. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research, 187(10):1143-1159, 2007. (Pubitemid 350245722)
30. R. Ruiz and T. G. Stützle. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177:2033-2049, 2007. (Pubitemid 44712036)
31. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI'94), pages 337-343, Seattle, WA, USA, July 1994.
32. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI'92), pages 440-446, San Jose, CA, USA, July 1992. (Pubitemid 23633551)
33. E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2):278-285, 1993. (Pubitemid 23599340)
34. E. G. Talbi. Metaheuristics: from design to implementation. Wiley, 2009.
35. Dirk Thierens. An adaptive pursuit strategy for allocating operator probabilities. In Proceedings of the 2005 conference on Genetic and evolutionary computation, GECCO '05, pages 1539-1546, New York, NY, USA, 2005. ACM. (Pubitemid 43226475)
36. Dirk Thierens. Adaptive operator selection for iterated local search. In Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, volume 5752 of Lecture Notes in Computer Science, pages 140-144. Springer Berlin / Heidelberg, 2009.
37. J. A. Vázquez-Rodríguez, G. Ochoa, T. Curtois, and M. Hyde. A hyflex module for the permutation flow shop problem. Technical report, School of Computer Science, University of Nottingham, 2011.