Skip to main content
SpringerLink
Log in

A Diversity Keeping Strategy for the Multi-objective Examination Timetabling Problem

  • Conference paper
  • First Online:
Bio-inspired Computing – Theories and Applications (BIC-TA 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 682))

  • 1077 Accesses

Abstract

This paper presents a diversity keeping strategy for examination timetabling problems. In this paper, the examination timetabling problem is considered as a two-objective optimization problem while it is modeled as a single-objective optimization problem generally. Within the NNIA framework, a diversity-keeping strategy which consists of an elitism group operator and an extension optimization operator to ensure a sufficient number of solutions in the pareto front. The proposed algorithm was tested on the most widely used un-capacitated Carter benchmarks. Experimental results prove that the proposed algorithm is a competitive 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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Burke, E., Bykov, Y., Petrovic, S.: A multicriteria approach to examination timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 118–131. Springer, Heidelberg (2001). doi:10.1007/3-540-44629-X_8

    Chapter  Google Scholar 

  2. Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A hybrid algorithm for the examination timetabling problem. In: Burke, E., Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 207–231. Springer, Heidelberg (2003). doi:10.1007/978-3-540-45157-0_14

    Chapter  Google Scholar 

  3. Mller, T.: ITC2007 solver description: a hybrid approach. Ann. Oper. Res. 172(1), 429–446 (2009)

    Article  MATH  Google Scholar 

  4. Ross, P., Hart, E., Corne, D.: Some observations about GA-based exam timetabling. In: Burke, E., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 115–129. Springer, Heidelberg (1998). doi:10.1007/BFb0055884

    Chapter  Google Scholar 

  5. Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph based hyper-heuristic for exam timetabling problems. Eur. J. Oper. Res. 176, 177–192 (2007)

    Article  MATH  Google Scholar 

  6. Sabar, N.R., Ayob, M., Kendall, G., Qu, R.: Roulette wheel graph colouring for solving examination timetabling problems. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol. 5573, pp. 463–470. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02026-1_44

    Chapter  Google Scholar 

  7. Eley, M.: Ant algorithms for the exam timetabling problem. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 364–382. Springer, Heidelberg (2007). doi:10.1007/978-3-540-77345-0_23

    Chapter  Google Scholar 

  8. Mansour, N., Isahakian, V., Ghalayini, I.: Scatter search technique for exam timetabling. Appl. Intell. 34, 299–310 (2011)

    Article  Google Scholar 

  9. De Smet G.: ITC2007 examination track, practice and theory of automated timetabling (PATAT 2008), Montreal, pp. 19–22 (2008)

    Google Scholar 

  10. Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S.: A time-predefined local search approach to exam timetabling problems. IIE Trans. Oper. Eng. 36(6), 509–528 (2004)

    Article  Google Scholar 

  11. Thompson, J., Dowsland, K.: A robust simulated annealing based examination timetabling system. Comput. Oper. Res. 25, 637–648 (1998)

    Article  MATH  Google Scholar 

  12. Qu, R., Burke, E.K.: Hybrid variable neighbourhood hype-heuristics for exam timetabling problems. In: Proceedings of the MIC2005: The Sixth Meta-heuristics International Conference, Vienna, Austria (2005)

    Google Scholar 

  13. Burke, E.K., Kingston, J., de Werra, D.: Applications to timetabling. In: Gross, J., Yellen, J. (eds.) Handbook of Graph Theory, pp. 445–474 (2008)

    Google Scholar 

  14. Gong, M., Jiao, L., Du, H., Bo, L.: Multiobjective immune algorithm with nondominated neighbor-based selection. Evol. Comput. 16(2), 225–255 (2008)

    Article  Google Scholar 

  15. Yang, D., Jiao, L., Gong, M., Feng, J.: Adaptive ranks and K-nearest neighbour list based multiobjective immune algorithm. Comput. Intell. 26(4), 359–385 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  16. Yang, D., Jiao, L., Gong, M., Liu, F.: Artificial immune multi-objective sar image segmentation with fused complementary features. Inf. Sci. 181(13), 2797–2812 (2011)

    Article  Google Scholar 

  17. Burke, E., Elliman, D., Ford, P., Weare, R.: Examination timetabling in British universities: a survey. In: Burke, E., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 76–90. Springer, Heidelberg (1996). doi:10.1007/3-540-61794-9_52

    Chapter  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant No. 61603299).

Author information

Authors and Affiliations

  1. School of Electronics and Information, Northwest Polytechnical University, ADD: 127 West Youyi Road, Xi’an, 710072, Shaanxi, China

    Yu Lei, Jiao Shi & Kun Zhang

Authors
  1. Yu Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiao Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu Lei .

Editor information

Editors and Affiliations

  1. Xidian University , Xi’an, China

    Maoguo Gong

  2. Huazhong University of Science and Technology, Wuhan, China

    Linqiang Pan

  3. China University of Petroleum, Qingdao, China

    Tao Song

  4. Southwest Jiaotong University , Chengdu, China

    Gexiang Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Lei, Y., Shi, J., Zhang, K. (2016). A Diversity Keeping Strategy for the Multi-objective Examination Timetabling Problem. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds) Bio-inspired Computing – Theories and Applications. BIC-TA 2016. Communications in Computer and Information Science, vol 682. Springer, Singapore. https://doi.org/10.1007/978-981-10-3614-9_37

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3614-9_37

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3613-2

  • Online ISBN: 978-981-10-3614-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation