ORLibrary-hdtt4

ORLibrary-hdtt4

The following description is copied from http://people.brunel.ac.uk/~mastjjb/jeb/orlib/tableinfo.html. These data files have been contributed by Professor Kate Smith-Miles (kate.smith-miles@monash.edu) who can be contacted for further information about these data sets, and comparative results. These class-teacher-venue timetabling data sets were used by

  • D. Abramson and H. Dang, "School timetables: a case study in simulated annealing: sequential and parallel algorithms", LectureNotes in Economics and Mathematics Systems, edited by V. Vidal, Springer-Verlag: Berlin, Chapter 5, pp. 103-124, 1993.
  • M. Randall, D. Abramson and C. Wild, "A general meta-heuristicbased solver for combinatorial optimisation problems", Technical reportTR99-01, School of Information Technology, Bond University, Queensland 4229, Australia.
  • K. A. Smith, D. Abramson and D. Duke, "Hopfield neural networks for timetabling:formulations, methods, and comparative results", Computers and Industrial Engineering, vol. 44, no. 2, pp. 283-305, 2003.

  • This dataset was converted to XHSTT by Michael Pimmer.

    A summary of the data can be found in the following table:

    Assets

    Times

    Teachers

    Rooms

    Students

    Classes

    # events

    Total duration

    value

    30

    4

    4

    -

    4

    59

    120

    The following constraints are present:
    • Scheduling constraints: AssignTimeConstraint.
    • Event constraints: -
    • Resource constraints: AvoidClashesConstraint.

    The following solution is submitted for this instance:

    SolutionGroup

    Feasibility value

    Objective value

    Submitted by

    Received

    MichaelPimmer_2011-03-01

    0

    0

    Michael Pimmer

    March 1, 2011

    XML file

    ArtificialORLibrary-hdtt4.xml (instance and solution)


    previous versions:

    ArtificialORLibrary-hdtt4.xml (XHSTT2011A)
    [Update to 2014: cost function simplified.]