A simulated annealing algorithm with a new neighborhood structure for the timetabling problem

2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09

Volumn , Issue , 2009, Pages 381-386

  Yongkai, Liu ^a   Defu, Zhang ^a   Leung, Stephen C H ^b  

^a XIAMEN UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Neighborhood; Simulated Annealing; Timetabling

Indexed keywords

HIGH SCHOOL; NEIGHBORHOOD; NEIGHBORHOOD STRUCTURE; REAL-WORLD; SIMULATED ANNEALING ALGORITHMS; TIME SLOTS; TIMETABLING; TIMETABLING PROBLEM;

ANNEALING; CALCULATIONS; EVOLUTIONARY ALGORITHMS; SEMICONDUCTING GERMANIUM COMPOUNDS;

SIMULATED ANNEALING;

EID: 67650673040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1543834.1543885     Document Type: Conference Paper

References (18)

1. T.B.Cooper, J.H.Kingston. 1995. The complexity of timetabling construction problems. Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling LNCS 1153, Berlin: Springer, 283-295.
2. Krzysztof Socha, Joshua Knowles, Michael Sampels. 2002. A MAX-MIN Ant System for the University Course Timetabling Problem. Lecture notes in computer science, vol 2463, Berlin: Springer, 1-13.
3. Grigorios N. Beligiannis, Charalampos N. Moschopoulos, Georgios P. Kaperonis, Spiridon D.Likothanassia. 2008. Applying evolutionary computation to the school timetabling problem: The Greek case. Computer &Operations Research, 35(4): 1265-1280.
4. Di Gaspero, L., Schaerf. 2001. A. Tabu search techniques for examination timetabling. Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, vol. 2079, 104-117.
5. Halvard Arntzen, Halvard Arntzen, Arne Lφkketangen. 2003. A tabu search heuristic for a university timetabling problem. The Fifth Metaheuristics Internetional Conference.
6. E. Burke, Y. Bykov, J. Newall, S. Petrovic. 2001. A Time-Predefined Local Search Approach to Exam Timetabling Problems. Computer Science Technical Report No. NOTTCSTR- 2001-6, Univ. of Nottingham.
7. Abramson, D., Krishnamoorthy, M., Dang, H. 1999. Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research 16, 1-22.
8. Pasquale Avella, Bernardo D'Auria Saverio Salerno, Igor Vasil'ev. 2007. A computational study of local search algorithms for Italian high-school timetabling. Springer Science+Business Media, LLC.
9. Philipp Kostuch. 2004. The University Course Timetabling Problem with a Three-Phase Approach. Proceedings of the 5th International Conference on Practice and Theory of Automated Timetabling V LNCS 1153, Berlin: Springer, 109-125.
10. ZHANG De-Fu, CHEN Sheng-Da, LIU Yan-Juan. 2007. An improved heuristic recursive strategy for genetic algorithm of the orthogonal packing of rectangles ACTA AUTOMATICA SINICA 33(9):911-916.
11. ZHANG De-Fu, Li Xin. 2005. A Personified Annealing Algorithm for Circles Packing Problem ACTA AUTOMATICA SINICA. 31(4):590-595.
12. Lijun Wei, Defu Zhang,Qingshan Chen. 2008. A least wasted first heuristic algorithm for rectangular packing problem Computers &Operations Research 2008.In press, http://dx.doi.org/10.1016/j.cor.
13. D. Abramson. 1991. Constructing School Timetables using Simulated Annealing: Sequential and Parallel Algorithms. Management Science, vol. 37, no.1, 98-113.
14. Burke, E.K., Jackson, K.S., Kingston, J.H, Weare, R.F. 1997. Automated timetabling: The state of art. Comput. J. 40(9), 565-571
15. http://prlab.ceid.upatras.gr/timetabling/.
16. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/tableinfo.html.
17. Smith KA, Abramson D, Duke D. 2003. Hopfield neural networks for timetabling: formulations, methods, and omparative results. Computers and Industrial Engineering 44(2): 283-305.
18. K Papoutsis, C Valouxis and E Housos. 2003. A column generation approach for the timetabling problem of Greek high schools, Journal of the Operational Research Society, 54: 230-238.