Skip to main content

A Timetabling Applied Case Solved with Ant Colony Optimization

  • Conference paper
Artificial Intelligence Perspectives and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 347))

Abstract

This research present an applied case of the resolution of a timetabling problem called the University course Timetabling problem (UCTP), the resolution technique used is based in Ant Colony Optimization metaheuristic. Ant Colony Optimization is a Swarm Intelligence technique which inspired from the foraging behavior of real ant colonies. We propose a framework to solve the University course Timetabling problem effectively. We show the problem and the resolution design using this framework. First we tested our proposal with some competition instances, and then compare our results with other techniques. The results show that our proposal is feasible and competitive with other techniques. To evaluate this framework in practice way, we build a real instance using the case of the school of Computer Science Engineering of the Pontifical Catholic University of Valparaíso and the Department of Computer Engineering at Playa Ancha University.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abuhamdah, A., Ayob, M., Kendall, G., Sabar, N.: Population based local search for university course timetabling problems. Applied Intelligence, 1–10 (2013)

    Google Scholar 

  2. Babaei, H., Karimpour, J., Hadidi, A.: A survey of approaches for university course timetabling problem. Computers and Industrial Engineering (2014) (in press)

    Google Scholar 

  3. Blum, C., Dorigo, M.: Hc-aco: the hyper-cube framework for ant colony optimization. In: Proc. MIC 2001-Metaheuristics Int. Conf., pp. 399–403 (2001)

    Google Scholar 

  4. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. Trans. Sys. Man Cyber. Part B 34(2), 1161–1172 (2004)

    Article  Google Scholar 

  5. Blum, C., Roli, A., Dorigo, M.: Hc-aco: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics–Part B, 399–403 (2001)

    Google Scholar 

  6. Crawford, B., Soto, R., Castro, C., Monfroy, E.: Extensible CP-based autonomous search. In: Stephanidis, C. (ed.) Posters, Part I, HCII 2011. CCIS, vol. 173, pp. 561–565. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: New Ideas in Optimization, pp. 11–32. McGraw-Hill Ltd., UK (1999)

    Google Scholar 

  8. Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation (1997)

    Google Scholar 

  9. Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, USA (2004)

    Book  MATH  Google Scholar 

  10. ten Eikelder, H.M.M., Willemen, R.J.: Some complexity aspects of secondary school timetabling problems. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 18–27. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Johnson, F., Crawford, B., Palma, W.: Hypercube framework for ACO applied to timetabling. In: Bramer, M. (ed.) Artificial Intelligence in Theory and Practice. IFIP, vol. 217, pp. 237–246. Springer, Boston (2006)

    Chapter  Google Scholar 

  12. Paechter, B.: Course timetabling evonet summer school (2001), http://evonet.dcs.napier.ac.uk/summerschool2001/problems.html

  13. Paechter, B., Rankin, R.C., Cumming, A., Fogarty, T.C.: Timetabling the classes of an entire university with an evolutionary algorithm. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 865–874. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Socha, K., Knowles, J., Sampels, M.: A \(\cal{MAX-MIN}\) ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 1–13. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Soto, R., Crawford, B., Monfroy, E., Bustos, V.: Using autonomous search for generating good enumeration strategy blends in constraint programming. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol. 7335, pp. 607–617. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Stützle, T., Hoos, H.H.: Max-min ant system. Future Gener. Comput. Syst. 16(9), 889–914 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Broderick Crawford .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Crawford, B., Soto, R., Johnson, F., Paredes, F. (2015). A Timetabling Applied Case Solved with Ant Colony Optimization. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds) Artificial Intelligence Perspectives and Applications. Advances in Intelligent Systems and Computing, vol 347. Springer, Cham. https://doi.org/10.1007/978-3-319-18476-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18476-0_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18475-3

  • Online ISBN: 978-3-319-18476-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics