CCTP, Graph Coloring Algorithms - Soft Computing Solutions

Graph coloring problem is NP-complete. It is polynomially reducible to classical and practical university timetabling problem. College course timetabling problem (CCTP) is a parallel instance of University course timetabling problem (UCTP). Obviously, heuristic and approximate algorithms are only ammunitions for solution of search problems. Soft computing approaches namely GA & ACO are particularly suitable to attack CCTP problems. We have seen that, in general timetabling problems need two criteria, compactness & balancing, that are obtainable by GA & ACO approaches. While it is observed that duo processor architecture based computers are readily available in the market, these approaches need cultivations afresh. In this paper we have initiated the process and hope for better culmination.

[1]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[2]  Samar Sen Sarma,et al.  Performance Profile of a Hybrid Heuristic Search Technique Using Graph Coloring as a Seed Example , 2006, 2006 5th IEEE International Conference on Cognitive Informatics.

[3]  Ronald D. Dutton,et al.  A New Graph Colouring Algorithm , 1981, Comput. J..

[4]  Ben Paechter,et al.  A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem , 2002, PATAT.

[5]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[6]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[7]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[8]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[9]  G. Grimmett,et al.  On colouring random graphs , 1975 .

[10]  Lance D. Chambers.  Practical handbook of genetic algorithms , 1995 .

[11]  G. K. Winter,et al.  The Impact of Automated Timetabling on Universities — A Case Study , 1986 .

[12]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[13]  Michael W. Carter,et al.  OR Practice - A Survey of Practical Applications of Examination Timetabling Algorithms , 1986, Oper. Res..

[14]  Sanja Petrovic,et al.  A time-predefined approach to course timetabling , 2003 .

[15]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[16]  Ben Paechter,et al.  Application of the Grouping Genetic Algorithm to University Course Timetabling , 2005, EvoCOP.

[17]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[18]  Jeffrey H. Kingston,et al.  The Complexity of Timetable Construction Problems , 1995, PATAT.

[19]  Thomas Bäck,et al.  An Overview of Evolutionary Computation , 1993, ECML.

[20]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[21]  A. J. Cole,et al.  The preparation of examination time-tables using a small-store computer , 1964, Comput. J..

[22]  Sol Broder,et al.  Final examination scheduling , 1964, Commun. ACM.

[23]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..