메뉴 건너뛰기




Volumn 2, Issue , 2004, Pages 1691-1698

Hyper-heuristics applied to class and exam timetabling problems

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC NUMBERS; PERFORMANCE EVALUATION; TIMETABLING;

EID: 4344673374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (23)

References (11)
  • 1
    • 1442325240 scopus 로고    scopus 로고
    • Hyper-heuristics: Learning to combine simple heuristics in bin packing problems
    • New York, NY. Winner of the Best Paper Award in the Learning Classifier Systems Category of GECCO 2002
    • Peter Ross, Sonia Schulenburg, Javier G. Marín-Blázquez, and Emma Hart. Hyper-heuristics: learning to combine simple heuristics in bin packing problems. In Genetic and Evolutionary Computation Conference, New York, NY, 2002. Winner of the Best Paper Award in the Learning Classifier Systems Category of GECCO 2002.
    • (2002) Genetic and Evolutionary Computation Conference
    • Ross, P.1    Schulenburg, S.2    Marín-Blázquez, J.G.3    Hart, E.4
  • 2
    • 4344575422 scopus 로고    scopus 로고
    • A hyper-heuristic approach to single and multiple step environments in Bin-packing problems
    • Pier Luca Lanzi, Wolfgang Stolzmann, and Stewart W. Wilson, editors, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin. In press
    • Sonia Schulenburg, Peter Ross, Javier G. Marín-Blázquez, and Emma Hart. A Hyper-Heuristic Approach to Single and Multiple Step Environments in Bin-Packing Problems. In Pier Luca Lanzi, Wolfgang Stolzmann, and Stewart W. Wilson, editors, Learning Classifier Systems: From Foundations to Applications, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 2003. In press.
    • (2003) Learning Classifier Systems: From Foundations to Applications
    • Schulenburg, S.1    Ross, P.2    Marín-Blázquez, J.G.3    Hart, E.4
  • 3
    • 35248823635 scopus 로고    scopus 로고
    • Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics
    • E. Cantú-Paz et al, editor, volume 2 of LNCS. Springer
    • Peter Ross, Javier Marín-Blázquez, Sonia Schulenburg, and Emma Hart. Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics. In E. Cantú-Paz et al, editor, Genetic and Evolutionary Computation - GECCO 2003, volume 2 of LNCS, 70ages 1295-1306. Springer, 2003.
    • (2003) Genetic and Evolutionary Computation - GECCO 2003 , pp. 1295-1306
    • Ross, P.1    Marín-Blázquez, J.2    Schulenburg, S.3    Hart, E.4
  • 7
    • 0018456690 scopus 로고
    • New methods to color the vertices of a graph
    • D. Brelaz. New methods to color the vertices of a graph. Communications of the ACM, 22:251-256, 1979.
    • (1979) Communications of the ACM , vol.22 , pp. 251-256
    • Brelaz, D.1


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