Skip to main content
SpringerLink
Log in

The Application of GA Based on the Shortest Path in Optimization of Time Table Problem

  • Chapter
  • First Online:
Fuzzy Information & Engineering and Operations Research & Management

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

  • 1243 Accesses

Abstract

Time Table Problem (TTP) is a constraint Combinational Optimization Problem (COP) with multi- objective. Based on the analysis of advantages and disadvantages of Genetic Algorithm (GA) and Kruskal Algorithm (KA), this chapter put forward to a new hybrid algorithm—the Shortest path-based Genetic Algorithm (SPGA), which has the advantages of both GA and KA. In this algorithm, fitness function, selection operator, crossover operator and mutation operator are studied deeply and improved greatly, so that the hybrid algorithm can be used in the actual course arrangement. The simulation results show the effectiveness of this method.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Wang XP., Cao, LM.: Genetic algorithms-theory, application and software implementation. Xi’an Jiaotong University Press, Xi’an (2002)

    Google Scholar 

  2. Yan, W.M., Wu, W.M.: Data Struct. Tsinghua University Press, Beijing (1996)

    Google Scholar 

  3. Zhou, R., Mai, W., Lei, Y.: Minimum spanning tree algorithms based on genetic algorithms. J. ZhengZhou Univ. (Engineering Science) (2002)

    Google Scholar 

  4. Chu, Beasley, P.C.: A genetic algorithm for the generalized assignment problem. Eur. J. Oper. 20–22 (1995)

    Google Scholar 

  5. Safaai, D., Sigeru, O.: Incorporating constraint propagation in genetic for university timetable problem, Engineering Application of, Artificial Intelligence, pp. 241–253(1999)

    Google Scholar 

  6. Luan, F., Yao, X.: Solving real-word lecture room assignment problems by genetic algorithm, Complexity International. Electronic J. Complex Res. 15–18 (1996)

    Google Scholar 

  7. Colorni, A., Dorigomarco, V.: Metaheuristics for high school timetabling. Comput. Optim. Appl , Maniezzo (1998)

    Google Scholar 

  8. Li-juan, Z., Xiao-buo, LE.: Application of genetic algorithm in minimum spanning tree. Comput. Knowl. Technol (2007)

    Google Scholar 

  9. Zhao G.: Study on timetable problem of college based on genetic algorithms. Yanbian University (2006)

    Google Scholar 

  10. Zhao B.: Study of genetic algorithms and application in course arrangement problem. SWJTU J. (2003)

    Google Scholar 

Download references

Acknowledgments

Thanks to the Higher Education Teaching Reform Project of Guangdong Province by Prof Yu-bin Zhong.

Author information

Authors and Affiliations

  1. Maoming Polytechnic, Maoming, 525000, Guangdong, People’s Republic of China

    Zhong-yuan Peng & Lin Ge

  2. School of Mathematics and Information Sciences, Guangzhou University, Guangzhou, 510006, People’s Republic of China

    Yu-bin Zhong

Authors
  1. Zhong-yuan Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu-bin Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lin Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu-bin Zhong .

Editor information

Editors and Affiliations

  1. School of Mathematics and Information Science, Guangzhou University Higher Education Mega Center, Guangzhou, People's Republic of China

    Bing-Yuan Cao

  2. Department of Mathematics and Computer Sciences, Mazandaran University, Babolsar, Iran

    Hadi Nasseri

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Peng, Zy., Zhong, Yb., Ge, L. (2014). The Application of GA Based on the Shortest Path in Optimization of Time Table Problem. In: Cao, BY., Nasseri, H. (eds) Fuzzy Information & Engineering and Operations Research & Management. Advances in Intelligent Systems and Computing, vol 211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38667-1_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38667-1_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38666-4

  • Online ISBN: 978-3-642-38667-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation