Finding feasible timetables using group-based operators

IEEE Transactions on Evolutionary Computation

Volumn 11, Issue 3, 2007, Pages 397-413

  Lewis, Rhydian ^a,b   Paechter, Ben ^a  

^a EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

^b CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Diversity; Fitness functions; Grouping problems; Timetabling

Indexed keywords

BIODIVERSITY; POPULATION DYNAMICS; STOCHASTIC MODELS;

FITNESS-FUNCTIONS; GROUPING MEMETIC ALGORITHM; GROUPING-PROBLEMS; TIMETABLING;

GENETIC ALGORITHMS;

EID: 34250174770     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2006.885162     Document Type: Article

References (73)

1. D. Corne, P. Ross, and H. Fang, "Evolving timetables," in Practical Handbook of Genetic Algorithms, L. C. Chambers, Ed. Boca Raton, FL: CRC Press, 1995, vol. 1, pp. 219-276.
2. T. Cooper and J. Kingston, "The complexity of timetable construction problems," in Practice and Theory of Automated Timetabling (PATAT) I ser. Lecture Notes in Computer Science, E. Burke and P. Ross, Eds. Berlin, Germany: Springer-Verlag, 1996, vol. 1153, pp. 283-295.
3. S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multi-commodity flow problems," SIAM J. Comput., vol. 5, pp. 691-703, 1976.
4. G. White and W. Chan, "Towards the construction of optimal examination schedules," INFOR, vol. 17, pp. 219-229, 1979.
5. M. Carter, G. Laporte, and S. Y. Lee, "Examination timetabling: Algorithmic strategies and applications," J. Oper. Res. Soc., vol. 47, pp. 373-383, 1996.
6. E. Erben, "A grouping genetic algorithm for graph coloring and exam timetabling," in Practice and Theory of Automated Timetabling (PATAT) III, ser. Lecture Notes in Computer Science, E. Burke and W. Erben, Eds. Berlin, Germany: Springer-Verlag, 2000, vol. 2079, pp. 132-158.
7. E. A. Akkoyunlu, "A linear algorithm for computing the optimum university timetable," Comput. J., vol. 16, no. 4, pp. 347-350, 1973.
8. S. Daskalaki, T. Birbas, and E. Housos, "An integer programming formulation for a case study in university timetabling," Eur. J. Oper. Res., vol. 153, pp. 117-135, 2004.
9. B. Deris, S. Omatu, H. Ohta, and D. Samat, "University timetabling by constraint-based reasoning: A case study," J. Oper. Res. Soc., vol. 48, no. 12, pp. 1178-1190, 1997.
10. D. Abramson, "Constructing school timetables using simulated annealing: Sequential and parallel algorithms," Manage. Sci., vol. 37, pp. 98-113, 1991.
11. D. Abramson, H. Krishnamoorthy, and H. Dang, "Simulated annealing cooling schedules for the school timetabling problem," Asia-Pacific J. Oper. Res., vol. 16, pp. 1-22, 1996.
12. S. Elmohamed, G. Fox, and P. Coddington, "A comparison of annealing techniques for academic course scheduling," in Practice and Theory of Automated Timetabling (PATAT)II, ser. Lecture Notes in Computer Science, E. Burke and M. Carter, Eds. Berlin, Germany: Springer-Verlag, 1998, vol. 1408, pp. 92-114.
13. J. M. Thompson and K. A. Dowsland, "A robust simulated annealing based examination timetabling system," Comput. Oper. Res., vol. 25, pp. 637-648, 1998.
14. A. Schaerf, "Tabu search techniques for large high-school timetabling problems," in Proc. 13th Nat. Conf. Artif. Intell., Portland, OR, 1996, pp. 363-368.
15. D. Costa, "A tabu search algorithm for computing an operational timetable," Eur. J. Oper. Res., vol. 76, pp. 98-110, 1994.
16. A. Hertz, "Tabu search for large scale timetabling problems," Eur. J. Oper. Res., vol. 54, pp. 39-47, 1991.
17. A. Schaerf, "Local search techniques for large high-school timetabling problems," IEEE Trans. Syst., Man, Cybern., Part A, vol. 29, no. 4, pp. 368-377, Jul. 1999.
18. P. Ross, E. Hart, and D. Corne, "Genetic algorithms and timetabling," in Advances in Evolutionary Computing: Theory and Applications, A. Ghosh and S. Tsutsui, Eds. New York: Springer-Verlag, 2003, pp. 755-772.
19. A. Colorni, M. Dorigo, and V. Maniezzo, "Genetic algorithms and highly constrained problems: The timetable case," in Lecture Notes in Computer Science, H. Schwefel and R. Manner, Eds. Berlin, Germany: Springer-Verlag, 1990, vol. 496, Parallel Problem Solving from Nature (PPSN), pp. 55-59.
20. A. Colorni, M. Dorigo, and V. Maniezzo, "A genetic algorithm to solve the timetable problem," Politecnico di Milano, Milan, Italy, Tech. Rep. 90-060 revised, 1992.
21. D. Abramson and J. Abela, "A parallel genetic algorithm for solving the school timetabling problem," Div. Inf. Technol., C.S.I.R.O., c/o Dept. Commun. Electron. Eng., Royal Melbourne Inst. Technol., Melbourne, Australia, 1991.
22. B. Paechter, R. Rankin, A. Cumming, and T. Fogarty, "Timetabling the classes of an entire university with an evolutionary algorithm," in Lecture Notes in Computer Science, T. Baeck, A. Eiben, M. Schoenauer, and H. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 1998, vol. 1498, Parallel Problem Solving from Nature (PPSN) V, pp. 865-874.
23. E. Burke, D. Elliman, and R. Weare, L. Eshelman, Ed., "A hybrid genetic algorithm for highly constrained timetabling problems," in Proc. 6th Int. Conf. Genetic Algorithms, San Francisco, CA, 1995, pp. 605-610.
24. E. Burke, D. Elliman, and R. Weare, "Specialized recombinative operators for timetabling problems," in Artificial Intelligence and Simulated Behaviour Workshop on Evolutionary Computing, ser. Lecture Notes in Computer Science, T. Fogarty, Ed. Berlin, Germany: Springer-Verlag, 1995, vol. 993, pp. 75-85.
25. E. K. Burke, J. P. Newall, and R. F. Weare, "A memetic algorithm for university exam timetabling," in Practice and Theory of Automated Timetabling (PATAT) I, ser. Lecture Notes in Computer Science, E. Burke and P. Ross, Eds. Berlin, Germany: Springer-Verlag, 1996, vol. 1153, pp. 241-250,.
26. E. Burke and J. Newall, "A multi-stage evolutionary algorithm for the timetable problem," IEEE Trans. Evol. Comput., vol. 3, no. 1, pp. 63-74, Apr. 1999.
27. K. Socha and M. Samples, "Ant algorithms for the university course timetabling problem with regard to the state-of-the-art," in Evolutionary Computation in Combinatorial Optimization (EVOCop) III, ser. Lecture Notes in Computer Science, M. Dorigo, G. Di Caro, and M. Sampels, Eds. Berlin, Germany: Springer-Verlag, 2003, vol. 2611, pp. 334-345.
28. K. Socha, J. Knowles, and M. Sampels, "A MAX-MIN ant system for the university course timetabling problem," in Proc. 3rd Int. Workshop Ant Algorithms, ser. Lecture Notes in Computer Science, M. Dorigo, G. Di Caro, and M. Sampels, Eds. Berlin, Germany: Springer-Verlag, 2002, vol. 2463, pp. 1-13.
29. E. Burke, G. Kendall, and E. Soubeiga, "A tabu-search hyperheuristic for timetabling and rostering," J. Heuristics, vol. 9, no. 6, pp. 451-470, 2003.
30. S. Casey and J. Thompson, "GRASPing the examination scheduling problem," in Practice and Theory of Automated Timetabling (PATAT IV ser. Lecture Notes in Computer Science, E. Burke and P. de Causmaecker, Eds. Berlin, Germany: Springer-Verlag, 2003, vol. 2740, pp. 232-244.
31. P. Cote, T. Wong, and R. Sabourin, "Application of a hybrid multiobjective evolutionary algorithm to the uncapacitated exam proximity problem," in Practice and Theory of Automated Timetabling (PATAT) V, ser. Lecture Notes in Computer Science, E. Burke and M. Trick, Eds. Berlin,Germany: Springer-Verlag, 2004, vol. 3616, pp. 294-312.
32. M. Carrasco and M. Pato, "A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem," in Practice and Theory of Automated Timetabling (PATAT) III, ser. Lecture Notes in Computer Science, E. Burke and W. Erben, Eds. Berlin, Germany: Springer-Verlag, 2000, vol. 2079, pp. 3-17.
33. M. Chiarandini, M. Birattari, K. Socha, and O. Rossi-Doria, "An effective hybrid algorithm for university course timetabling," J. Scheduling, vol. 9, no. 5, pp. 403-432, 2006.
34. L. Merlot, N. Boland, B. Hughes, and P. Stuckey, "A hybrid algorithm for the examination timetabling problem," in Practice and Theory of Automated Timetabling (PATAT) IV, ser. Lecture Notes in Computer Science, E. Burke and P. de Causmaecker, Eds. Berlin, Germany: Springer-Verlag, 2003, vol. 2740, pp. 207-231.
35. O. Rossi-Doria, M. Samples, M. Birattari, M. Chiarandini, J. Knowles, M. Manfrin, M. Mastrolilli, L. Paquete, B. Paechter, and T. Stützle, "A comparison of the performance of different metaheuristics on the timetabling problem," in Practice and Theory of Automated Timetabling (PATAT) IV, ser. Lecture Notes in Computer Science, E. Burke and P. de Causmaecker, Eds. Berlin, Germany: Springer-Verlag, 2003, vol. 2740, pp. 329-351.
36. P. Kostuch, "The university course timetabling problem with a 3-phase approach," in Practice and Theory of Automated Timetabling (PATAT) V ser. Lecture Notes in Computer Science, E. Burke and M. Trick, Eds. Berlin, Germany: Springer-Verlag, 2004, vol. 3616, pp. 109-125.
37. M. Carter, "A survey of practical applications of examination timetabling algorithms," Oper. Res., vol. 34, no. 2, pp. 193-202, 1986.
38. E. K. Burke, D. G. Elliman, P. H. Ford, and R. Weare, "Examination timetabling in british universities: A survey," in Practice and Theory of Automated Timetabling (PATAT) I, ser. Lecture Notes in Computer Science, E. Burke and P. Ross, Eds. Berlin, Germany: Springer-Verlag, 1996, vol. 1153, pp. 76-92.
39. M. Carter and G. Laporte, "Recent developments in practical course timetabling," in Practice and Theory of Automated Timetabling (PATAT) II, ser. Lecture Notes in Computer Science, E. Burke and M. Carter, Eds. Berlin, Germany: Springer-Verlag, 1998, vol. 1408, pp. 3-19.
40. A. Schaerf, "A survey of automated timetabling," Artif. Intell. Rev., vol. 13, no. 2, pp. 87-127, 1999.
41. E. Burke and S. Petrovic, "Recent research directions in automated timetabling," Eur. J. Oper. Res., vol. 140, pp. 266-280, 2002.
42. M. Carter. Online. Available: Ftp://ie.utoronto.ca/mwc/testprob/, Jun. 2005.
43. B. Paechter. [Online]. Available: http://www.idsia.ch/Files/ttcomp2002/, Jun. 2005.
44. R. Lewis. [Online]. Available: http://www.emergentcomputing.org/ timetabling/harderinstances, Jun. 2005.
45. C. Blum and C. Manfrin. [Online]. Available: http:// www.metaheuristics.org/, Jun. 2005.
46. P. Ross, D. Corne, and H. Terashima-Marin, "The phase-transition niche for evolutionary algorithms in timetabling," in Practice and Theory of Automated Timetabling (PATAT) I, ser. Lecture Notes in Computer Science, E. Burke and P. Ross, Eds. Berlin, Germany: Springer-Verlag, 1996, vol. 1153, pp. 309-325.
47. H. Arntzen and A. Løkketangen, "A tabu search heuristic for a university timetabling problem," in Metaheuristics: Progress as Real Problem Solvers, ser. Computer Science Interfaces, T. Ikabaki, K. Nonobe, and M. Yagiura, Eds. Berlin, Germany: Springer-Verlag, 2005, vol. 32, pp. 65-86.
48. J. Cordeau, B. Jaumard, and R. Morales, "Efficient timetabling solution with tabu search." Online. Available: http://www.idsia.ch/Files/ttcomp2002/jaumard.pdf Jun. 2005.
49. E. Burke, Y. Bykov, J. Newall, and S. Petrovic, "Time-predefined approach to course timetabling," Yugoslav J. Oper. Res., vol. 13, no. 2, pp. 139-151, 2003.
50. E. Falkenauer, "A new representation and operators for gas applied to grouping problems," Evol. Comput., vol. 2, pp. 123-144, 1994.
51. E. Falkenauer, Genetic Algorithms and Grouping Problems. New York: Wiley, 1998.
52. N. J. Radcliffe, "Forma analysis and random respectful recombination," in Proc. 4th Int. Conf. Genetic Algorithms, R. Belew and L. Booker, Eds., 1991, pp. 222-229.
53. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
54. E. Falkenauer, "Solving equal piles with the grouping genetic algorithm," in Proc. 6th Int. Conf. Genetic Algorithms, 1995, pp. 492-497.
55. A. E. Eiben, J. K. van der Hauw, and J. I. van Hemert, "Graph coloring with adaptive evolutionary algorithms," J. Heuristics, vol. 4, no. 1, pp. 25-46, 1998.
56. S. Khuri, T. Walters, and Y. Sugono, "A grouping genetic algorithm for coloring the edges of graphs," in Proc. ACM Symp. Appl. Comput., 2000, pp. 422-427.
57. R. Lewis and B. Paechter, "Application of the Grouping Genetic Algorithm to University Course Timetabling," in Evolutionary Computation in Combinatorial Optimisation (EVOCop) V, ser. Lecture Notes in Computer Science, G. Raidl and J. Gottlieb, Eds., L. Davis, K. De Jong, M. Vose, and L. D. Whitley, Eds. Berlin, Germany: Springer-Verlag, 2005, vol. 3448, pp. 144-153.
58. D. Brelaz, "New methods to color the vertices of a graph," in Commun. ACM, 1979, vol. 22, pp. 251-256.
59. E. Falkenauer, "Applying genetic algorithms to real-world problems," in Evolutionary Algorithms. New York: Springer, 1999, vol. 111, pp. 65-88, The IMA Volumes of Mathematics and its Applications.
60. R. Lewis and B. Paechter, "New crossover operators for timetabling with evolutionary algorithms," in Proc. 5th Int. Conf. Recent Advances in Soft Comput., A. Lotfi, Ed., Nottingham, U.K., 2004, pp. 189-195.
61. W. Morrison and K. De Jong, "Measurement of population diversity," in Selected Papers from the 5th European Conference on Artificial Evolution (EA), ser. Lecture Notes in Computer Science, P. Collet, C. Fonlupt, J.-K. Hao, E. Lutton, and M. Schoenauer, Eds. Berlin, Germany: Springer-Verlag, vol. 2310, pp. 31-41.
62. Y. Leung, Y. Gao, and Z. Xu, "Degree of population diversity - A perspective on premature convergence in genetic algorithms and its Markov chain analysis," IEEE Trans. Neural Netw., vol. 8, no. 5, pp. 1165-1765, 1997.
63. C. Mattiussi, M. Waibel, and D. Floreano, "Measures of diversity for populations and distances between individuals with highly reorganizable genomes," Evol. Comput., vol. 12, pp. 495-515, 2004.
64. G. Tao and Z. Michalewicz, "Inver-over operator for the TSP," in Lecture Notes in Computer Science, A. E. Eiben, T. Baeck, M. Schoenauer, and H.-P. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 1998, vol. 1498, Parallel Problem Solving from Nature (PPSN) V, pp. 803-812.
65. R. Lewis and B. Paechter, "An empirical analysis of the grouping genetic algorithm: The timetabling case," in Proc. 2005 IEEE Congr. Evol. Comput., 2005, vol. 3, pp. 2856-2863.
66. X. Yao, "An Overview of Evolutionary Computation," in Chinese Journal of Advanced Software Research. New York: Allerton Press, 1996, pp. 12-29.
67. P. Moscato and M. G. Norman, "A 'memetic' approach for the travelling salesman problem. Implementation of a computational ecology for combinatorial optimization on message-passing systems," in Proc. Int. Conf. Parallel Comput. Transputer Appl., Amsterdam, The Netherlands, 1992, pp. 187-194.
68. P. Moscato, "On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms," Calif. Inst. Technol., Pasadena, CA, Caltech Concurrent Computation Program, Tech. Rep. 826, 1989.
69. R. Dorne and J.-K. Hao, "A new genetic local search algorithm for graph coloring," in Lecture Notes in Computer Science, A. E. Eiben, T. Baeck, M. Schoenauer, and H.-P. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 1998, vol. 1498, Parallel Problem Solving from Nature (PPSN) V, pp. 745-754.
70. P. Galinier and J.-K. Hao, "Hybrid evolutionary algorithms for graph coloring," J. Combinatorial Optimization, vol. 3, no. 4, pp. 379-397, 1999.
71. E. Falkenauer, "A hybrid grouping genetic algorithm for bin packing," J. Heuristics, vol. 2, pp. 5-30, 1996.
72. J. Levine and F. Ducatelle, "Ant colony optimization and local search for bin packing and cutting stock problems. Journal," J. Oper. Res. Soc., vol. 55, no. 12, pp. 705-716, 2003.
73. S. Martello and P. Toth, "Lower bounds and reduction procedures for the bin packing problem," Discrete Appl. Math., vol. 28, no. 1, pp. 59-70, 1990.