The cross-domain heuristic search challenge – an international research competition

  • Authors:
  • Edmund K. Burke;Michel Gendreau;Matthew Hyde;Graham Kendall;Barry McCollum;Gabriela Ochoa;Andrew J. Parkes;Sanja Petrovic

  • Affiliations:
  • Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK;CIRRELT, University of Montreal, Canada;Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK;Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK;School of Electronics, Electrical Engineering and Computer Science, Queen's University, Belfast, UK;Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK;Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK;Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK

  • Venue:
  • LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.