Skip to main content

Constraint-Based School Timetabling Using Hybrid Genetic Algorithms

  • Conference paper
AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (AI*IA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4733))

Included in the following conference series:

Abstract

In this paper, a hybrid genetic algorithm (HGA) has been developed to solve the constraint-based school timetabling problem (CB-STTP). HGA has a new operator called repair operator, in addition to standard crossover and mutation operators. A timetabling tool has been developed for HGA to solve CB-STTP. The timetabling tool has been tested extensively using real-word data obtained the Technical and Vocational High Schools in Turkey. Experimental results have presented that performance of HGA is better than performance of standard GA.

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. de Werra, D.: An introduction to timetabling. Europan Journal Of Operations Research 19, 151–162 (1985)

    Article  MATH  Google Scholar 

  2. Abramson, D.: Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science 37, 98–113 (1991)

    Article  Google Scholar 

  3. Hertz, A.: Tabu search for large scale timetabling problems. European Journal of Operations Research 54, 39–47 (1991)

    Article  MATH  Google Scholar 

  4. Colorni, A., Dorigo, M., Maniezzo, V.: Genetic Algorithms and Highly Constrained Problems; The Timetable Case, Parallel Problem Solving from Nature I, pp. 55–59. Springer, Heidelberg (1990)

    Google Scholar 

  5. Calderia, J.P., Rosa, A.C.: School Timetabling using Genetic Search. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 115–122. Springer, Heidelberg (1998)

    Google Scholar 

  6. Wilke, P., Grobner, M., Oster, N.: A Hybrid Genetic Algorithm for School Timetabling. In: McKay, B., Slaney, J. (eds.) AI 2002: Advances in Artificial Intelligence, pp. 455–464. Springer-Verlag, New York (2002)

    Chapter  Google Scholar 

  7. Di Stefano, C., Tettamanzi, A.: An Evolutionary Algorithm for Solving the School Time-Tabling Problem. In: EvoWorkshops, pp. 452–462 (2001)

    Google Scholar 

  8. Burke, E.K., Petrovic, S., Qu, R.: Case Based Heuristic Selection for Timetabling Problems. Journal of Scheduling 9, 15–132 (2006)

    Google Scholar 

  9. Deris, S., Omatu, S., Ohta, H., Saad, P.: Incorporating Constraint Propagation in Genetic Algorithm for University Timetable Planning. Engineering Applications of Artificial Intelligence 12, 241–253 (1999)

    Article  Google Scholar 

  10. Michalewicz, Z.: Genetic Algorithms+Data Structure=Evoluation Programs, 3rd edn. Springer, Heidelberg (1996)

    Google Scholar 

  11. Goldberg, D.E.: Genetic Algorithm in Search, Optimization, and Machine Learning. Addison- Wesley Publishing Company Inc., Canada (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Roberto Basili Maria Teresa Pazienza

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yigit, T. (2007). Constraint-Based School Timetabling Using Hybrid Genetic Algorithms. In: Basili, R., Pazienza, M.T. (eds) AI*IA 2007: Artificial Intelligence and Human-Oriented Computing. AI*IA 2007. Lecture Notes in Computer Science(), vol 4733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74782-6_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74782-6_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74781-9

  • Online ISBN: 978-3-540-74782-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics