메뉴 건너뛰기




Volumn 39, Issue 5, 2012, Pages 6029-6040

Solving effectively the school timetabling problem using particle swarm optimization

Author keywords

Artificial intelligence; Computer application; Educational organizations; Particle swarm optimization; School timetabling problem

Indexed keywords

EDUCATIONAL ORGANIZATIONS; HIGH SCHOOL; ITS EFFICIENCIES; PSO ALGORITHMS; REAL WORLD DATA; SCHOOL TIMETABLING PROBLEM; SCHOOL TIMETABLING PROBLEMS;

EID: 84855878217     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.12.013     Document Type: Article
Times cited : (42)

References (39)
  • 1
    • 69249232202 scopus 로고    scopus 로고
    • The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem
    • C.H. Aladag, G. Hocaoglu, and M.A. Basaran The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem Expert Systems with Applications 36 10 2009 12349 12356
    • (2009) Expert Systems with Applications , vol.36 , Issue.10 , pp. 12349-12356
    • Aladag, C.H.1    Hocaoglu, G.2    Basaran, M.A.3
  • 5
    • 2542618333 scopus 로고    scopus 로고
    • A time-predefined local search approach to exam timetabling problems
    • E. Burke, Y. Bykov, J. Newall, and S. Petrovic A time-predefined local search approach to exam timetabling problems IIE Transactions 36 6 2004 509 528
    • (2004) IIE Transactions , vol.36 , Issue.6 , pp. 509-528
    • Burke, E.1    Bykov, Y.2    Newall, J.3    Petrovic, S.4
  • 6
    • 84889608352 scopus 로고    scopus 로고
    • A multicriteria approach to examination timetabling
    • Berlin: Springer
    • Burke, E.; Bykov, Y.; Petrovic, S. (2001). A multicriteria approach to examination timetabling. Lecture Notes in Computer Science Vol. 2079 (pp. 118-131). Berlin: Springer.
    • (2001) Lecture Notes in Computer Science , vol.2079 , pp. 118-131
    • Burke, E.1    Bykov, Y.2    Petrovic, S.3
  • 7
    • 84956675924 scopus 로고    scopus 로고
    • Case-based reasoning in course timetabling: An attribute graph approach
    • Berlin: Springer
    • Burke, E. K.; MacCarthy, B.; Petrovic, S.; Qu, R. (2001). Case-based reasoning in course timetabling: an attribute graph approach. Lecture Notes in Computer Science Vol. 2080 (pp. 90-104). Berlin: Springer.
    • (2001) Lecture Notes in Computer Science , vol.2080 , pp. 90-104
    • Burke, E.K.1    MacCarthy, B.2    Petrovic, S.3    Qu, R.4
  • 8
    • 1442283467 scopus 로고    scopus 로고
    • A tabu-search hyperheuristic for timetabling and rostering
    • E.K. Burke, G. Kendall, and E. Soubeiga A tabu-search hyperheuristic for timetabling and rostering Journal of Heuristics 9 6 2003 451 470
    • (2003) Journal of Heuristics , vol.9 , Issue.6 , pp. 451-470
    • Burke, E.K.1    Kendall, G.2    Soubeiga, E.3
  • 10
    • 3042797792 scopus 로고    scopus 로고
    • Solving examination timetabling problems through adaption of heuristic orderings
    • E.K. Burke, and J.P. Newall Solving examination timetabling problems through adaption of heuristic orderings Annals of Operations Research 129 1-4 2004 107 134
    • (2004) Annals of Operations Research , vol.129 , Issue.14 , pp. 107-134
    • Burke, E.K.1    Newall, J.P.2
  • 13
    • 33645988169 scopus 로고    scopus 로고
    • Interactively solving school timetabling problems using extensions of constraint programming
    • Berlin: Springer
    • Cambazard, H.; Demazeau, F.; Jussien, N.; David, P. (2005). Interactively solving school timetabling problems using extensions of constraint programming. Lecture Notes in Computer Science Vol. 3616 (pp. 190-207). Berlin: Springer.
    • (2005) Lecture Notes in Computer Science , vol.3616 , pp. 190-207
    • Cambazard, H.1    Demazeau, F.2    Jussien, N.3    David, P.4
  • 14
    • 33645988169 scopus 로고    scopus 로고
    • Interactively solving school timetabling problems using extensions of constraint programming
    • Berlin: Springer
    • Cambazard, H.; Demazeau, F.; Jussien, N.; David, P. (2005). Interactively solving school timetabling problems using extensions of constraint programming. Lecture Notes in Computer Science Vol. 3616 (pp. 190-207). Berlin: Springer.
    • (2005) Lecture Notes in Computer Science , vol.3616 , pp. 190-207
    • Cambazard, H.1    Demazeau, F.2    Jussien, N.3    David, P.4
  • 17
    • 84889585340 scopus 로고    scopus 로고
    • Tabu search techniques for examination timetabling
    • Berlin: Springer
    • Di Gaspero, L.; Schaerf, A. (2001). Tabu search techniques for examination timetabling. Lecture Notes in Computer Science Vol. 2079 (pp. 104-17). Berlin: Springer.
    • (2001) Lecture Notes in Computer Science , vol.2079 , pp. 104-17
    • Di Gaspero, L.1    Schaerf, A.2
  • 24
  • 25
    • 33847621636 scopus 로고    scopus 로고
    • Case-based selection of initialisation heuristics for metaheuristic examination timetabling
    • S. Petrovic, Y. Yang, and M. Dror Case-based selection of initialisation heuristics for metaheuristic examination timetabling Expert Systems with Applications 33 3 2007 772 785
    • (2007) Expert Systems with Applications , vol.33 , Issue.3 , pp. 772-785
    • Petrovic, S.1    Yang, Y.2    Dror, M.3
  • 30
    • 35248845686 scopus 로고    scopus 로고
    • University course timetabling with soft constraints
    • Berlin: Springer
    • Rudov, H.; Murray, K. (2003). University course timetabling with soft constraints. Lecture Notes in Computer Science Vol. 2740 (pp. 310-328). Berlin: Springer.
    • (2003) Lecture Notes in Computer Science , vol.2740 , pp. 310-328
    • Rudov, H.1    Murray, K.2
  • 31
    • 57649224431 scopus 로고    scopus 로고
    • Solving employee timetabling problems by generalized local search
    • Berlin: Springer
    • Schaerf, A.; Meisels, A. (2000). Solving employee timetabling problems by generalized local search. Lecture Notes in Computer Science Vol. 1792 (pp. 380-389). Berlin: Springer.
    • (2000) Lecture Notes in Computer Science , vol.1792 , pp. 380-389
    • Schaerf, A.1    Meisels, A.2
  • 32
    • 0037291553 scopus 로고    scopus 로고
    • Hopfield neural networks for timetabling: Formulations, methods, and comparative results
    • K.A. Smith, D. Abramson, and D. Duke Hopfield neural networks for timetabling: formulations, methods, and comparative results Computers and Industrial Engineering 44 2 2003 283 305
    • (2003) Computers and Industrial Engineering , vol.44 , Issue.2 , pp. 283-305
    • Smith, K.A.1    Abramson, D.2    Duke, D.3
  • 33
    • 84974697699 scopus 로고    scopus 로고
    • A MAX-MIN ant system for the university course timetabling problem
    • Berlin: Springer
    • Socha, K.; Knowles, J.; Sampels, M. (2002). A MAX-MIN ant system for the university course timetabling problem. Lecture Notes in Computer Science Vol. 2463 (pp. 1-13). Berlin: Springer.
    • (2002) Lecture Notes in Computer Science , vol.2463 , pp. 1-13
    • Socha, K.1    Knowles, J.2    Sampels, M.3
  • 34
    • 84889597487 scopus 로고    scopus 로고
    • Some complexity aspects of secondary school timetabling problems
    • Berlin: Springer
    • Ten Eikelder, H. M. M.; Willemen, R. J. (2001). Some complexity aspects of secondary school timetabling problems. Lecture Notes in Computer Science Vol. 2079 (pp. 18-27). Berlin: Springer.
    • (2001) Lecture Notes in Computer Science , vol.2079 , pp. 18-27
    • Ten Eikelder, H.M.M.1    Willemen, R.J.2
  • 35
    • 84889602533 scopus 로고    scopus 로고
    • A schedule-then-break approach to sports timetabling
    • Berlin: Springer
    • Trick, M. A. (2001). A schedule-then-break approach to sports timetabling. Lecture Notes in Computer Science Vol. 2079 (pp. 242-253). Berlin: Springer.
    • (2001) Lecture Notes in Computer Science , vol.2079 , pp. 242-253
    • Trick, M.A.1
  • 36
    • 0037954438 scopus 로고    scopus 로고
    • Constraint programming approach for school timetabling
    • C. Valouxis, and E. Housos Constraint programming approach for school timetabling Computers and Operations Research 30 10 2003 1555 1572
    • (2003) Computers and Operations Research , vol.30 , Issue.10 , pp. 1555-1572
    • Valouxis, C.1    Housos, E.2
  • 37
    • 0037411431 scopus 로고    scopus 로고
    • Using genetic algorithm methods to solve course scheduling problems
    • Y.-Z. Wang Using genetic algorithm methods to solve course scheduling problems Expert Systems with Applications 25 1 2003 39 50
    • (2003) Expert Systems with Applications , vol.25 , Issue.1 , pp. 39-50
    • Wang, Y.-Z.1
  • 38
    • 84958744274 scopus 로고    scopus 로고
    • Scheduling, timetabling and rostering - A special relationship?
    • Berlin: Springer
    • Wren, A. (1996). Scheduling, timetabling and rostering - A special relationship? Lecture Notes in Computer Science Vol. 1153 (pp. 46-75). Berlin: Springer.
    • (1996) Lecture Notes in Computer Science , vol.1153 , pp. 46-75
    • Wren, A.1
  • 39
    • 84855900271 scopus 로고    scopus 로고
    • (last accessed: 10/11/2010)
    • http://www.deapt.uwg.gr/timetabling/school-timetabling.html (last accessed: 10/11/2010).


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.