메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 2263-2270

An ant algorithm hyperheuristic for the project presentation scheduling problem

Author keywords

[No Author keywords available]

Indexed keywords

ANT ALGORITHM; HYPERHEURISTICS; OPTIMIZATION SYSTEMS; PROJECT PRESENTATION SCHEDULING;

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

References (26)
  • 1
    • 3042708858 scopus 로고    scopus 로고
    • Hyperheuristics: An emerging direction in modern search technology
    • chapter 16, Kluwer Academic Publishers
    • E. Burke, E. Hart, G. Kendall, J. Newall, P. Ross and S. Schulenburg. Handbook of Metaheuristics, chapter 16, Hyperheuristics: An Emerging Direction in Modern Search Technology, pp. 457-474. Kluwer Academic Publishers, 2003.
    • (2003) Handbook of Metaheuristics , pp. 457-474
    • Burke, E.1    Hart, E.2    Kendall, G.3    Newall, J.4    Ross, P.5    Schulenburg, S.6
  • 2
    • 84957656553 scopus 로고    scopus 로고
    • Applying ant algorithms and the no fit polygon to the nesting problem
    • Proceedings of 12th Australian Joint Conference on Artificial Intelligence, Sydney, Australia, December 6-10, 1999, Foo, N. (Ed)
    • E. Burke and G. Kendall, Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem, Proceedings of 12th Australian Joint Conference on Artificial Intelligence, Sydney, Australia, December 6-10, 1999, Lecture Notes in Artificial Intelligence vol. 1747, Foo, N. (Ed), pp. 453-464, 1999.
    • (1999) Lecture Notes in Artificial Intelligence , vol.1747 , pp. 453-464
    • Burke, E.1    Kendall, G.2
  • 3
    • 1442283467 scopus 로고    scopus 로고
    • A tabu-search hyperheuristic for timetabling and rostering
    • E. Burke, G. Kendall and E. Soubeiga, A Tabu-Search Hyperheuristic for Timetabling and Rostering, Journal of Heuristics volume 9 issue 6, pp. 451-470, 2003.
    • (2003) Journal of Heuristics , vol.9 , Issue.6 , pp. 451-470
    • Burke, E.1    Kendall, G.2    Soubeiga, E.3
  • 4
    • 84888603386 scopus 로고    scopus 로고
    • Hybrid graph heuristics in a hyper-heuristic approach to exam timetabling
    • eds. B.L. Golden, S. Raghavan & E.A. Wasil, Springer
    • E. Burke, M. Dror, S. Petrovic and R. Qu, Hybrid Graph Heuristics in a Hyper-Heuristic Approach to Exam Timetabling, in The Next Wave in Computing, Optimization and Decision Technologies (eds. B.L. Golden, S. Raghavan & E.A. Wasil), pp. 79-92, Springer 2005.
    • (2005) The Next Wave in Computing, Optimization and Decision Technologies , pp. 79-92
    • Burke, E.1    Dror, M.2    Petrovic, S.3    Qu, R.4
  • 5
    • 33646016646 scopus 로고    scopus 로고
    • Multi-objective hyper-heuristic approaches for space allocation and timetabling
    • to appear in: Ibaraki T., Nonobe K., Yagiura M. (eds.), Springer
    • E. Burke, J.D. Landa Silva and E. Soubeiga, Multi-objective Hyper-heuristic Approaches for Space Allocation and Timetabling, to appear in: Ibaraki T., Nonobe K., Yagiura M. (eds.), Meta-heuristics: Progress as Real Problem Solvers, Springer, 2005.
    • (2005) Meta-heuristics: Progress As Real Problem Solvers
    • Burke, E.1    Landa Silva, J.D.2    Soubeiga, E.3
  • 7
    • 27144432931 scopus 로고    scopus 로고
    • Case based heuristic selection for timetabling problems
    • Accepted for publication in the
    • E. Burke, S. Petrovic and R. Qu, Case Based Heuristic Selection for Timetabling Problems. Accepted for publication in the Journal of Scheduling, 2005.
    • (2005) Journal of Scheduling
    • Burke, E.1    Petrovic, S.2    Qu, R.3
  • 8
    • 27144499594 scopus 로고    scopus 로고
    • An ant algorithm for the graph colouring problem
    • in proceedings of the First International Workshop on Ant Colony Optimization, Brussels
    • F. Comellas and J. Ozn, An Ant Algorithm for the Graph Colouring Problem, ANTS'98 From Ant Colonies to Artificial Ants; in proceedings of the First International Workshop on Ant Colony Optimization, Brussels, 1998.
    • (1998) ANTS'98 from Ant Colonies to Artificial Ants
    • Comellas, F.1    Ozn, J.2
  • 11
    • 84889585310 scopus 로고    scopus 로고
    • A hyperheuristic approach to scheduling a sales summit
    • Selected papers of Proceedings of the 3rd International Conference on the Practice And Theory of Automated Timetabling
    • P. Cowling, G. Kendall and E. Soubeiga, A Hyperheuristic Approach to Scheduling a Sales Summit. Selected papers of Proceedings of the 3rd International Conference on the Practice And Theory of Automated Timetabling, Springer LNCS vol. 2079, pp. 176-190, 2001.
    • (2001) Springer LNCS , vol.2079 , pp. 176-190
    • Cowling, P.1    Kendall, G.2    Soubeiga, E.3
  • 12
    • 84878654362 scopus 로고    scopus 로고
    • Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation
    • Proceedings of the 2nd European Conference on Evolutionary computation for Combinatorial Optimisation. EvoCop 2002
    • P. Cowling, G. Kendall and E. Soubeiga, Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation. Proceedings of the 2nd European Conference on Evolutionary computation for Combinatorial Optimisation. EvoCop 2002, Springer LNCS vol. 2279, pp. 1-10, 2002.
    • (2002) Springer LNCS , vol.2279 , pp. 1-10
    • Cowling, P.1    Kendall, G.2    Soubeiga, E.3
  • 15
    • 0002400184 scopus 로고
    • Distributed optimization by ant colonies
    • ed. by FJ Varela and P Bourgine, MIT/Press/Bradford Books, Cambridge, Massachusetts
    • M. Dorigo, V. Maniezzo and A. Colorni. Distributed optimization by ant colonies Proceedings of the first European Conference on Artificial Life Paris, ed. by FJ Varela and P Bourgine, MIT/Press/Bradford Books, Cambridge, Massachusetts: pp. 134-142, 1992.
    • (1992) Proceedings of the First European Conference on Artificial Life Paris , pp. 134-142
    • Dorigo, M.1    Maniezzo, V.2    Colorni, A.3
  • 16
    • 27144531630 scopus 로고    scopus 로고
    • Solving a shipper rationalisation problem with a simulated annealing hyperheuristic
    • Accepted for publication in the
    • K. Dowsland, E. Soubeiga and E. Burke, Solving a shipper rationalisation problem with a simulated annealing hyperheuristic. Accepted for publication in the European Journal of Operational Research, 2005.
    • (2005) European Journal of Operational Research
    • Dowsland, K.1    Soubeiga, E.2    Burke, E.3
  • 18
    • 27144492364 scopus 로고    scopus 로고
    • An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem
    • L. Han and G. Kendall, An Adaptive Length Chromosome Hyperheuristic Genetic Algorithm for a Trainer Scheduling Problem, SEAL2002: pp. 267-271, 2002.
    • (2002) SEAL2002 , pp. 267-271
    • Han, L.1    Kendall, G.2
  • 24
    • 84974697699 scopus 로고    scopus 로고
    • A MAX-MIN ant system for the university course timetabling problem
    • Proceedings of the Third International Workshop on Ant Algorithms (ANTS'02)
    • K. Socha, J. Knowles and M. Sampels, A MAX-MIN Ant System for the University Course Timetabling Problem, Proceedings of the Third International Workshop on Ant Algorithms (ANTS'02), Springer LNCS vol. 2463, pp. 1-13, 2002.
    • (2002) Springer LNCS , vol.2463 , pp. 1-13
    • Socha, K.1    Knowles, J.2    Sampels, M.3


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