Skip to main content

An Evolutionary Approach to Constraint-Based Timetabling

  • Conference paper
  • First Online:
Advances in Artificial Intelligence. PRICAI 2000 Workshop Reader (PRICAI 2000)

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

Included in the following conference series:

Abstract

In this paper we present a timetabling system that uses a combination of a genetic algorithm and constraint satisfaction to maximally satisfy constraints of different strengths. A prototype system is presented for university examination timetabling. Experiments performed with different parameter settings for the genetic algorithm on some real world data are reported. The results obtained from the prototype are promising. An extension to the system is proposed to support incremental processing of user-supplied constraints. This is needed to support user-guided exploration of the solution space and to capture the incremental nature of human timetabling.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Reference

  1. Colorni, A., Dorigo, M., Maniezzo, V.: Genetic Algorithms and Highly Constrained Problems: The Time-Table Case, in Schwefel, H.-P. and Manner, R (editors), Proceedings of the First International Conference on Parallel Problem Solving from Nature, Springer-Verlag, Lecture Notes in Computer Science (1991), Vol. 496.

    Google Scholar 

  2. Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems, SIAM Journal on Computing (1976), Vol. 5,No. 4, 691–703.

    Article  MATH  MathSciNet  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and Intractability, W.H. Freeman and Company, San Francisco (1979).

    MATH  Google Scholar 

  4. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, New York, (1992).

    MATH  Google Scholar 

  5. Mitchell, M., An Introduction to Genetic Algorithms, The MIT Press, Cambridge, Massachusetts, England, (1996).

    Google Scholar 

  6. Sharma, D., Chandra, N.: An Evolutionary Approach to Constraint-Based Timetabling, Proceedings of Constraint Processing Workshop, Australian Joint Artificial Intelligence Conference, Sydney, Australia (2000).

    Google Scholar 

  7. Whitley, D.: A Genetic Algorithm Tutorial, Colorado State University (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sharma, D., Chandra, N. (2001). An Evolutionary Approach to Constraint-Based Timetabling. In: Kowalczyk, R., Loke, S.W., Reed, N.E., Williams, G.J. (eds) Advances in Artificial Intelligence. PRICAI 2000 Workshop Reader. PRICAI 2000. Lecture Notes in Computer Science(), vol 2112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45408-X_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45408-X_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42597-7

  • Online ISBN: 978-3-540-45408-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics