Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Burke, Edmund ^a   Curtois, Tim ^a   Hyde, Matthew ^a   Kendall, Graham ^a   Ochoa, Gabriela ^a   Petrovic, Sanja ^a   Vázquez Rodríguez, José A ^a   Gendreau, Michel ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING; COMMON SOFTWARE; COMPETING ALGORITHMS; DIFFERENT DOMAINS; DOMAIN MODULES; EMPIRICAL STUDIES; GENERALISATION; HEURISTIC SEARCH ALGORITHMS; HYPER-HEURISTICS; HYPERHEURISTIC; ITERATED LOCAL SEARCH; LOCAL SEARCH; PERMUTATION FLOW SHOPS; PROBLEM DOMAIN; PROOF OF CONCEPT; ROBUST ALGORITHM; SEARCH ALGORITHMS;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; ENGINEERING RESEARCH; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

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

References (42)

1. J. Denzinger, M. Fuchs, and M. Fuchs, "High performance ATP systems by combining several ai methods," in Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 97), 1997, pp. 102-107.
2. 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, ser. Lecture Notes in Computer Science. Konstanz, Germany: Springer, August 2000, pp. 176-190.
3. E. K. Burke, G. Kendall, and E. Soubeiga, "A tabu-search hyperheuristic for timetabling and rostering," Journal of Heuristics, vol. 9, no. 6, pp. 451-470, 2003.
4. H. Fisher and G. L. Thompson, "Probabilistic learning combinations of local job-shop scheduling rules," in Factory Scheduling Conference, Carnegie Institue of Technology, May 10-12 1961.
5. I. Rechenberg, Evolution strategy: Optimization of technical systems by means of biological evolution. Stuttgart: Fromman-Holzboog, 1973.
6. R. Battiti, M. Brunato, and F. Mascia, Reactive Search and Intelligent Optimization, ser. Operations Research Computer Science Interfaces Series. Springer, 2008, vol. 45.
7. A. E. Eiben, Z. Michalewicz, M. Schoenauer, and J. E. Smith, Parameter Setting in Evolutionary Algorithms. Springer, 2007, ch. Parameter Control in Evolutionary Algorithms, pp. 19-46.
8. Y. S. Ong, M. H. Lim, N. Zhu, and K. W. Wong, "Classification of adaptive memetic algorithms: a comparative study," IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 36, no. 1, pp. 141-152, 2006.
9. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. Woodward, Handbook of Metaheuristics, ser. International Series in Operations Research & Management Science. Springer, 2009, ch. A Classification of Hyper-heuristic Approaches.
10. 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, vol. 59, pp. 1387-1397, 2008.
11. R. Bai and G. Kendall, "An investigation of automated planograms using a simulated annealing based hyper-heuristics," in Metaheuristics: Progress as Real Problem Solver - (Operations Research/Computer Science Interface Serices, Vol.32), T. Ibaraki, K. Nonobe, and M. Yagiura, Eds. Springer, 2005, pp. 87-108.
12. K. A. Dowsland, E. Soubeiga, and E. K. Burke, "A simulated annealing hyper-heuristic for determining shipper sizes," European Journal of Operational Research, vol. 179, no. 3, pp. 759-774, 2007.
13. D. Pisinger and S. Ropke, "A general heuristic for vehicle routing problems," Computers and Operations Research, vol. 34, pp. 2403-2435, 2007.
14. A. Fialho, L. Da Costa, M. Schoenauer, and M. Sebag, "Extreme: dynamic multi-armed bandits for adaptive operator selection," in GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference. NewYork, NY, USA: ACM, 2009, pp. 2213-2216.
15. J. Maturana, A. Fialho, F. Saubion, M. Schoenauer, and M. Sebag, "Extreme compass and dynamic multi-armed bandits for adaptive operator selection," in Proc. IEEE Congress on Evolutionary Computation CEC '09, 2009, pp. 365-372.
16. E. Ozcan, B. Bilgin, and E. E. Korkmaz, "Hill climbers and mutational heuristics in hyperheuristics," in Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN 2006), ser. Lecture Notes in Computer Science, vol. 4193, Reykjavik, Iceland, September 2006, pp. 202-211.
17. P. Cowling, G. Kendall, and E. Soubeiga, "Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation," in Applications of Evolutionary Computing: Proceeding of Evo Workshops 2002, ser. Lecture Notes in Computer Science, S. Cagoni, J. Gottlieb, E. Hart, M. Middendorf, and R. Goenther, Eds., vol. 2279. Kinsale, Ireland: Springer-Verlag, April 3-4 2002, pp. 1-10.
18. A. Nareyek, "Choosing search heuristics by non-stationary reinforcement learning," in Metaheuristics: Computer Decision-Making, M. G. C. Resende and J. P. de Sousa, Eds. Kluwer, 2003, ch. 9, pp. 523-544.
19. G. Kendall and M. Mohamad, "Channel assignment in cellular communication using a great deluge hyper-heuristic," in Proceedings of the 2004 IEEE International Conference on Network (ICON2004), 2004, pp. 769-773.
20. E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg, "Hyper-heuristics: An emerging direction in modern search technology," in Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds. Kluwer, 2003, pp. 457-474.
21. J. Woodward, A. Parkes, and G. Ochoa, "A mathematical framework for hyper-heuristics," 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.
22. T. Curtois, "A hyflex module for the personnel scheduling problem," School of Computer Science, University of Nottingham, Tech. Rep., 2009.
23. M. Hyde, "A hyflex module for the one dimensional bin-packing problem," School of Computer Science, University of Nottingham, Tech. Rep., 2009.
24. J. A. Vázquez-Rodríguez, "A hyflex module for the permutation flow shop problem," School of Computer Science, University of Nottingham, Tech. Rep., 2009.
25. M. Nawaz, E. E. Jr., and I. Ham, "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," OMEGA-International Journal of Management Science, vol. 11, no. 1, pp. 91-95, 1983.
26. 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, vol. 177, pp. 2033-2049, 2007.
27. -, "An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," European Journal of Operational Research, vol. 187, no. 10, pp. 1143-1159, 2007.
28. L. Davis, "Job shop scheduling with genetic algorithms," in Proceedings of the 1st International Conference on Genetic Algorithms. Hillsdale, NJ, USA: L. Erlbaum Associates Inc., 1985, pp. 136-140.
29. D. E. Goldberg and J. R. Lingle., "Alleles, loci, and the traveling salesman problem." in Proceedings of the 1st International Conference on Genetic Algorithms. Hillsdale, NJ, USA: L. Erlbaum Associates Inc., 1985.
30. E. Taillard, "Benchmarks for basic scheduling problems," European Journal of Operational Research, vol. 64, no. 2, pp. 278-285, 1993.
31. D. Johnson, A. Demers, J. Ullman, M. Garey, and R. Graham, "Worstcase performance bounds for simple one-dimensional packaging algorithms," SIAM Journal on Computing, vol. 3, no. 4, pp. 299-325, December 1974.
32. E. Falkenauer, "A hybrid grouping genetic algorithm for bin packing," Journal of Heuristics, vol. 2, pp. 5-30, 1996. [Online]. Available: citeseer.ist.psu.edu/falkenauer96hybrid.html
33. P. Schwerin and G. Wäscher, "The bin-packing problem: A problem generator and some numerical experiments with ffd packing and mtp," International Transactions in Operational Research, vol. 4, no. 5, pp. 377-389, 1997.
34. E. K. Burke, T. Curtois, R. Qu, and G. V. Berghe, "A scatter search for the nurse rostering problem," School of Computer Science, University of Nottingham, Tech. Rep., 2007.
35. -, "A time predefined variable depth search for nurse rostering," School of Computer Science, University of Nottingham, Tech. Rep., 2007.
36. E. K. Burke, P. Cowling, P. D. Causmaecker, , and G. V. Berghe, "A memetic approach to the nurse rostering problem," Applied Intelligence, vol. 15, no. 3, pp. 199-214, 2001.
37. 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, vol. 188, no. 2, pp. 330-341, 2008.
38. J. Baxter, "Local optima avoidance in depot location," Journal of the Operational Research Society, vol. 32, pp. 815-819, 1981.
39. O. Martin, S. W. Otto, and E. W. Felten, "Large-step Markov chains for the TSP incorporating local search heuristics," Operations Research Letters, vol. 11, no. 4, pp. 219-224, 1992.
40. H. R. Lourenco, O. Martin, and T. Stutzle, Iterated Local Search. Norwell, MA: Kluwer Academic Publishers,, 2002, pp. 321-353.
41. G. Dueck, "New optimization hueristics: The great deluge algorithm and the record-to record travel," Journal of Computational Physics, vol. 104, pp. 86-92, 1993.
42. E. K. Burke, T. Curtois, M. Hyde, G. Kendall, G. Ochoa, S. Petrovic, and J. A. Vázquez-Rodríguez, "Towards the decathlon challenge of search heuristics," in Workshop on Automated Heuristic Design - In conjunction with the Genetic and Evolutionary Computation Conference (GECCO-2009), 2009, pp. 2205-2208.