SOLVING THE UNIVERSITY COURSE TIMETABLING PROBLEM BY HYPERCUBE FRAMEWORK FOR ACO

Jose Miguel Rubio L, Broderick Crawford L., Franklin Johnson P.

Abstract

We present a resolution technique of the University Course Timetabling Problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We show the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restrictions. We solve experimental instances and competition instances, the results are presented of comparative form to other techniques. We present an appropriate construction graph and pheromone matrix representation. Finally the conclusions are given.

References

  1. T. B. Cooper and J. H. Kingston. The complexity of timetable construction problems. In Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling (PATAT 1995). 1996.
  2. H. M. M. ten Eikelder and R. J. Willemen. Some complexity aspects of secondary school timetabling problems. In Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling (PATAT 2000), 2001.
  3. E. K. Burke, J. P. Newall, and R. F. Weare. A memetic algorithm for university exam timetabling. In Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling (PATAT 1995), 1996.
  4. B. Paechter. Course timetabling. Evonet Summer School, 2001.
  5. B. Paechter, R. C. Rankin, A. Cumming, and T. C. Fogarty. Timetabling the classes of an entire university with an evolutionary algorithm. (1998).
  6. M. Dorigo and G. Di Caro. The Ant Colony Optimization meta-heuristic. New Ideas in Optimization, 1999.
  7. Christian Blum, Marco Dorigo, Andrea Roli, HC-ACO: The Hyper-Cube Framework for Ant Colony Optimization IEEE Transactions on Systems, Man and Cybernetics B, 34(2), 1161 - 1172, 2001.
  8. Krzysztof Socha, Max-Min Ant System for International Timetabling Competition. (2003)
  9. Krzysztof Socha, J. Knowles, y M. Sampels. Max-Min Ant System for the University Course Timetabling Problem.(2003)
  10. Thomas Stützle y H.H. Hoos, MAX-MIN Ant System. Future Genetic Computing System. 2000.
  11. Christian Blum, Marco Dorigo, The Hyper-Cube Framework for Ant Colony. Optimization IEEE Transactions on Systems, Man and Cybernetics B, 2004. HCF 2004.
  12. Rossi-Doria, Blue, Knowles, Sampels, A local search for timetabling problem.(2002)
Download


Paper Citation


in Harvard Style

Miguel Rubio L J., Crawford L. B. and Johnson P. F. (2008). SOLVING THE UNIVERSITY COURSE TIMETABLING PROBLEM BY HYPERCUBE FRAMEWORK FOR ACO . In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8111-37-1, pages 531-534. DOI: 10.5220/0001705505310534


in Bibtex Style

@conference{iceis08,
author={Jose Miguel Rubio L and Broderick Crawford L. and Franklin Johnson P.},
title={SOLVING THE UNIVERSITY COURSE TIMETABLING PROBLEM BY HYPERCUBE FRAMEWORK FOR ACO},
booktitle={Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2008},
pages={531-534},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001705505310534},
isbn={978-989-8111-37-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - SOLVING THE UNIVERSITY COURSE TIMETABLING PROBLEM BY HYPERCUBE FRAMEWORK FOR ACO
SN - 978-989-8111-37-1
AU - Miguel Rubio L J.
AU - Crawford L. B.
AU - Johnson P. F.
PY - 2008
SP - 531
EP - 534
DO - 10.5220/0001705505310534