A new approach of Design for the Academic Timetabling problem through Genetic Algorithms

被引:1
|
作者
Jorge A, Soria-Alcaraz [1 ]
Martin, Carpio [1 ]
Hector, Puga [1 ]
机构
[1] Leon Inst Technol, Div Estudios Posgrad & Invest, Guanajuato, Mexico
关键词
D O I
10.1109/CERMA.2010.22
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Academic timetabling problem is a common and hard problem inside every educative institution, this problem tries to coordinate Students, Teachers, Classrooms and Timeslots under certain constrains that dependent in many cases the policies of each educational institution. The Genetic Algorithm is a popular methodology used to find solutions in problems with a huge search space, this algorithm have been proved in wide range of discrete problems with encouraging results. This paper present a GA based method that solves the Academic Timetabling Design Problem using the API-Carpio Methodology. This GA uses a variable-length representation; which involves the complete encoding of a solution that is directly applicable to real world. this solution is achieved using several real instances of academic timetabling problem from Leon Institute of Technology (LIT) producing encouraging results for all the instances. Finally we analyze the quality of our solutions against the human expert and inside the context of a real academic timetabling process.
引用
收藏
页码:96 / 101
页数:6
相关论文
共 50 条
  • [1] A Rectification Strategy In Genetic Algorithms for Academic Timetabling Problem
    Chong-Keat, Teoha
    Wibowo, Antoni
    Ngadiman, Salihin
    [J]. JURNAL TEKNOLOGI, 2015, 74 (01):
  • [2] A Survey of Genetic Algorithms for the University Timetabling Problem
    Hosny, Manar
    Fatima, Shameem
    [J]. FUTURE INFORMATION TECHNOLOGY, 2011, 13 : 39 - 44
  • [3] Solving a timetabling problem using hybrid genetic algorithms
    Kragelund, LV
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1997, 27 (10): : 1121 - 1134
  • [4] Solving timetabling problem using genetic and heuristic algorithms
    Thanh, Nguyen Duc
    [J]. SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 472 - 477
  • [5] A Comparison of Genetic Algorithms and Genetic Programming in Solving the School Timetabling Problem
    Raghavjee, Rushil
    Pillay, Nelishia
    [J]. PROCEEDINGS OF THE 2012 FOURTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2012, : 98 - 103
  • [6] Timetabling through constrained heuristic search and genetic algorithms
    Monfroglio, A
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1996, 26 (03): : 251 - 279
  • [7] Timetabling through constrained heuristic search and genetic algorithms
    Monfroglio, Angelo
    [J]. Software - Practice and Experience, 1996, 26 (03): : 251 - 279
  • [8] A comparison of genetic algorithms & tabu search for a course timetabling problem
    Gulcu, Ayla
    Kuzucuoglu, Ahmet Emin
    Bulkan, Serol
    [J]. TECHNICS TECHNOLOGIES EDUCATION MANAGEMENT-TTEM, 2011, 6 (04): : 930 - 938
  • [9] AN APPROACH TO A PROBLEM IN NETWORK DESIGN USING GENETIC ALGORITHMS
    PALMER, CC
    KERSHENBAUM, A
    [J]. NETWORKS, 1995, 26 (03) : 151 - 163
  • [10] A Novel Educational Timetabling Solution through Recursive Genetic Algorithms
    Alves, Shara S. A.
    Oliveira, Saulo A. F.
    Rocha Neto, Ajalmar R.
    [J]. 2015 LATIN AMERICA CONGRESS ON COMPUTATIONAL INTELLIGENCE (LA-CCI), 2015,