The Cross-Domain Heuristic Search Challenge - An International Research Competition

The first Cross-domain Heuristic Search Challenge (CHeSC 2011) seeks to bring together practitioners from operational research, computer science and artificial intelligence who are interested in developing more generally applicable search methodologies. The challenge is to design a search algorithm that works well, not only across different instances of the same problem, but also across different problem domains. This article overviews the main features of this challenge.

[1]  Marco Laumanns,et al.  PISA: A Platform and Programming Language Independent Interface for Search Algorithms , 2003, EMO.

[2]  Sanja Petrovic,et al.  Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms , 2010, IEEE Congress on Evolutionary Computation.

[3]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[4]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[5]  Edmund K. Burke,et al.  HyFlex: A Flexible Framework for the Design and Analysis of Hyper-heuristics , 2009 .

[6]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[7]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[8]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.

[9]  Salvatore Greco,et al.  Evolutionary Multi-Criterion Optimization , 2011, Lecture Notes in Computer Science.