Skip to main content
SpringerLink
Log in

Memetic Algorithm for a University Course Timetabling Problem

  • Conference paper
  • First Online:
Informatics in Control, Automation and Robotics

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 132))

Abstract

Evolutionary algorithm is a part of evolution computation. It often induces well approximated solutions to several kinds of hard optimization problems. This paper applies Memetic algorithms - a hybrid evolutionary method to a real-world university timetabling problem in Vietnam. Memetic algorithm and genetic algorithm are both experimentally tested on six real-world instances and obtained results show that memetic algorithm could speed up the convergence much more than genetic algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. McCollum, B., McMullan, P., Paechter, B., Lewis, R., Schaerf, A., Di Gaspero, L., Parkes, A.J., Qu, R., Burke, E.: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. Technical Report, Internaltional Timetabling Competition 07-08 (2007)

    Google Scholar 

  2. Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Technical Report, Caltech Concurrent Computation Program (1989)

    Google Scholar 

  3. Moscato, P.: Memetic algorithms:A short introduction. In: Corne, D., Glover, F., Dorigo, M. (eds.) New Ideas in Optimization, pp. 219–234. McGraw-Hill (1999)

    Google Scholar 

  4. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. of Global Optimization 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HCMC University of Science, Vietnam, Ho Chi Minh

    Khang Nguyen & Nuong Tran

  2. Cao Thang Technology College, Vietnam, Ho Chi Minh

    Tien Lu & Trung Le

Authors
  1. Khang Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tien Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Trung Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nuong Tran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. , School of Electronic Engineering, Wuhan Institute of Technology, Lvting yajing 10-3-102, Wuhan, 430079, China, People's Republic

    Honghua Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, K., Lu, T., Le, T., Tran, N. (2011). Memetic Algorithm for a University Course Timetabling Problem. In: Tan, H. (eds) Informatics in Control, Automation and Robotics. Lecture Notes in Electrical Engineering, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25899-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25899-2_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25898-5

  • Online ISBN: 978-3-642-25899-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation