메뉴 건너뛰기




Volumn 136, Issue , 2008, Pages 3-29

Hyperheuristics: Recent developments

Author keywords

Greedy heuristics; Hyperheuristics; Learning; Multilevel heuristics

Indexed keywords


EID: 45949085601     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-79438-7_1     Document Type: Review
Times cited : (140)

References (65)
  • 2
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34, 391-401 (1988)
    • (1988) Management Science , vol.34 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 4
    • 45949111802 scopus 로고    scopus 로고
    • An investigation of automated planograms using a simulated annealing based hyper-heuristic
    • Kyoto, Japan, August 23-25
    • Bai, R., Kendall, G.: An investigation of automated planograms using a simulated annealing based hyper-heuristic. In: Proceedings of the 5th Metaheuristics International Conference (MIC2003), Kyoto, Japan, August 23-25 (2003)
    • (2003) Proceedings of the 5th Metaheuristics International Conference (MIC2003)
    • Bai, R.1    Kendall, G.2
  • 6
    • 0018456690 scopus 로고
    • New methods to colour the vertices of the graph
    • Brelaz, D.: New methods to colour the vertices of the graph. Communications of the ACM 22, 251-256 (1979)
    • (1979) Communications of the ACM , vol.22 , pp. 251-256
    • Brelaz, D.1
  • 9
    • 84888602565 scopus 로고    scopus 로고
    • Multi-objective hyper-heuristic approaches for space allocation and timetabling
    • Ibaraki, T, Nonobe, K, Yagiura, M, eds, Metaheuristics: Progress as Real Problem Solvers. Selected Papers from the 5th Metaheuristics International Conference MIC, Springer, Heidelberg
    • Burke, E.K., Landa Silva, J.D., Soubeiga, E.: Multi-objective hyper-heuristic approaches for space allocation and timetabling. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers. Selected Papers from the 5th Metaheuristics International Conference (MIC 2003). Operations Research/Computer Science Interfaces Series, vol. 32, pp. 129-158. Springer, Heidelberg (2005)
    • (2003) Operations Research/Computer Science Interfaces Series , vol.32 , pp. 129-158
    • Burke, E.K.1    Landa Silva, J.D.2    Soubeiga, E.3
  • 10
    • 45949098385 scopus 로고    scopus 로고
    • A graph-based hyper heuristic for timetabling problems
    • Technical Report NOTTCS-TR-2004-9, School of Computer Science and Information Technology, University of Nottingham
    • Burke, E., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper heuristic for timetabling problems. Technical Report NOTTCS-TR-2004-9, School of Computer Science and Information Technology, University of Nottingham (2004)
    • (2004)
    • Burke, E.1    Meisels, A.2    Petrovic, S.3    Qu, R.4
  • 11
    • 45949098686 scopus 로고    scopus 로고
    • Burke, E., Petrovic, S., Qu, R.: Case based heuristic selection for examination timetabling. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2002), pp. 277-281. Orchid Country Club, Singapore (2002)
    • Burke, E., Petrovic, S., Qu, R.: Case based heuristic selection for examination timetabling. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2002), pp. 277-281. Orchid Country Club, Singapore (2002)
  • 12
    • 3042708858 scopus 로고    scopus 로고
    • Hyperheuristics: An emerging direction in modern search technology
    • Glover, F, Kochenberger, G.A, eds, Kluwer Academic Publishers, Dordrecht
    • Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyperheuristics: An emerging direction in modern search technology. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 457-474. Kluwer Academic Publishers, Dordrecht (2003)
    • (2003) Handbook of Metaheuristics , pp. 457-474
    • Burke, E.1    Kendall, G.2    Newall, J.3    Hart, E.4    Ross, P.5    Schulenburg, S.6
  • 13
    • 1442283467 scopus 로고    scopus 로고
    • A tabu-search hyperheuristic for timetabling and rostering
    • Burke, E., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9, 451-470 (2003)
    • (2003) Journal of Heuristics , vol.9 , pp. 451-470
    • Burke, E.1    Kendall, G.2    Soubeiga, E.3
  • 14
    • 35248881684 scopus 로고    scopus 로고
    • Knowledge discovery in a hyper-heuristic for course timetabling using case-based reasoning
    • Burke, E.K, De Causmaecker, P, eds, PATAT 2002, Springer, Heidelberg
    • Burke, E.K., MacCarthy, B.L., Petrovic, S., Qu, R.: Knowledge discovery in a hyper-heuristic for course timetabling using case-based reasoning. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 90-103. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2740 , pp. 90-103
    • Burke, E.K.1    MacCarthy, B.L.2    Petrovic, S.3    Qu, R.4
  • 17
    • 24644474633 scopus 로고    scopus 로고
    • Cowling, P.I., Chakhlevitch, K.: Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, 3448, pp. 23-33. Springer, Heidelberg (2005)
    • Cowling, P.I., Chakhlevitch, K.: Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, pp. 23-33. Springer, Heidelberg (2005)
  • 18
    • 84868531774 scopus 로고    scopus 로고
    • Hyperheuristics for managing a large collection of low level heuristics to schedule personnel
    • IEEE Press, Los Alamitos
    • Cowling, P., Chakhlevitch, K.: Hyperheuristics for managing a large collection of low level heuristics to schedule personnel. In: Proceedings of the 2003 IEEE Congress on Evolutionary Computation (CEC 2003), pp. 1214-1221. IEEE Press, Los Alamitos (2003)
    • (2003) Proceedings of the 2003 IEEE Congress on Evolutionary Computation (CEC , pp. 1214-1221
    • Cowling, P.1    Chakhlevitch, K.2
  • 19
    • 45949099923 scopus 로고    scopus 로고
    • Using a large set of low level heuristics in a hyperheuristic approach to personnel scheduling
    • Dahal, K, Tan, K.C, Cowling, P.I, eds, Springer, Heidelberg to appear
    • Cowling, P., Chakhlevitch, K.: Using a large set of low level heuristics in a hyperheuristic approach to personnel scheduling. In: Dahal, K., Tan, K.C., Cowling, P.I. (eds.) Evolutionary Scheduling. Springer, Heidelberg (to appear, 2007)
    • (2007) Evolutionary Scheduling
    • Cowling, P.1    Chakhlevitch, K.2
  • 20
    • 84901458708 scopus 로고    scopus 로고
    • An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem
    • IEEE Computer Society Press, Honolulu, USA
    • Cowling, P., Kendall, G., Han, L.: An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of 2002 Congress on Evolutionary Computation (CEC 2002), pp. 1185-1190. IEEE Computer Society Press, Honolulu, USA (2002)
    • (2002) Proceedings of 2002 Congress on Evolutionary Computation (CEC , pp. 1185-1190
    • Cowling, P.1    Kendall, G.2    Han, L.3
  • 21
    • 84889585310 scopus 로고    scopus 로고
    • A hyperheuristic approach to scheduling a sales summit
    • Burke, E, Erben, W, eds, PATAT 2000, Springer, Heidelberg
    • Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176-190. Springer, Heidelberg (2001)
    • (2001) LNCS , vol.2079 , pp. 176-190
    • Cowling, P.1    Kendall, G.2    Soubeiga, E.3
  • 23
    • 84878654362 scopus 로고    scopus 로고
    • Cowling, P.A Kendall, G., Soubeiga, E.: Hyperheuristics: a tool for rapid prototyping in scheduling and optimisation. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, 2279, pp. 1-10. Springer, Berlin (2002)
    • Cowling, P.A Kendall, G., Soubeiga, E.: Hyperheuristics: a tool for rapid prototyping in scheduling and optimisation. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol. 2279, pp. 1-10. Springer, Berlin (2002)
  • 24
    • 84944317424 scopus 로고    scopus 로고
    • Cowling, P.A Kendall, G., Soubeiga, E.: Hyperheuristics: a robust optimisation method applied to nurse scheduling. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañnas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, 2439, pp. 851-860. Springer, Heidelberg (2002)
    • Cowling, P.A Kendall, G., Soubeiga, E.: Hyperheuristics: a robust optimisation method applied to nurse scheduling. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañnas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 851-860. Springer, Heidelberg (2002)
  • 25
    • 0029215084 scopus 로고
    • Evolution based learning in a job shop scheduling environment
    • Dorndorf, U., Pesch, E.: Evolution based learning in a job shop scheduling environment. Computers and Operations Research 22, 25-40 (1995)
    • (1995) Computers and Operations Research , vol.22 , pp. 25-40
    • Dorndorf, U.1    Pesch, E.2
  • 26
    • 45949083806 scopus 로고    scopus 로고
    • Solving a shipper rationalisation problem with a simulated annealing based hyperheuristic
    • Technical Report NOTTCSTR- 2004-1, School of Computer Science and Information Technology, University of Nottingham
    • Dowsland, K., Soubeiga, E., Burke, E.: Solving a shipper rationalisation problem with a simulated annealing based hyperheuristic. Technical Report NOTTCSTR- 2004-1, School of Computer Science and Information Technology, University of Nottingham (2004)
    • (2004)
    • Dowsland, K.1    Soubeiga, E.2    Burke, E.3
  • 27
    • 0002535331 scopus 로고
    • New optimisaTion heuristics: The great deluge algorithm and the recordto- record travel
    • Dueck, G.: New optimisaTion heuristics: the great deluge algorithm and the recordto- record travel. Journal of Computational Physics 104, 86-92 (1993)
    • (1993) Journal of Computational Physics , vol.104 , pp. 86-92
    • Dueck, G.1
  • 29
    • 85166375551 scopus 로고    scopus 로고
    • How to solve itSautomatically: Selection among problem-solving methods
    • AAAI Press, Menlo Park
    • Fink, E.: How to solve itSautomatically: selection among problem-solving methods. In: Proceedings of the 4th International Conference of AI Planning Systems, pp. 128-136. AAAI Press, Menlo Park (1998)
    • (1998) Proceedings of the 4th International Conference of AI Planning Systems , pp. 128-136
    • Fink, E.1
  • 30
    • 1442349643 scopus 로고
    • Probabilistic learning combinations of local jobshop scheduling rules
    • May 10-12, Carnegie Institute of Technology
    • Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local jobshop scheduling rules. In: Factory Scheduling Conference, May 10-12, 1961, Carnegie Institute of Technology (1961)
    • (1961) Factory Scheduling Conference
    • Fisher, H.1    Thompson, G.L.2
  • 31
    • 0001947856 scopus 로고
    • Probabilistic learning combinations of local jobshop scheduling rules
    • Muth, J.F, Thompson, G.L, eds, Prentice Hall, Englewood Cliffs
    • Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local jobshop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225-251. Prentice Hall, Englewood Cliffs (1963)
    • (1963) Industrial Scheduling , pp. 225-251
    • Fisher, H.1    Thompson, G.L.2
  • 32
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, Norwell
    • Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Norwell (1997)
    • (1997) Tabu search
    • Glover, F.1    Laguna, M.2
  • 34
    • 0029679218 scopus 로고    scopus 로고
    • Adaptive problem-solving for large-scale scheduling problems: A case study
    • Gratch, J., Chien, S.: Adaptive problem-solving for large-scale scheduling problems: A case study. Journal of Artificial Intelligence Research 4, 365-396 (1996)
    • (1996) Journal of Artificial Intelligence Research , vol.4 , pp. 365-396
    • Gratch, J.1    Chien, S.2
  • 37
    • 0346955781 scopus 로고    scopus 로고
    • Han, L., Kendall, G.: Guided operators for a hyper-heuristic genetic algorithm. In: Gedeon, T.D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), 2903, pp. 807-820. Springer, Heidelberg (2003)
    • Han, L., Kendall, G.: Guided operators for a hyper-heuristic genetic algorithm. In: Gedeon, T.D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol. 2903, pp. 807-820. Springer, Heidelberg (2003)
  • 38
    • 11244351342 scopus 로고    scopus 로고
    • An investigation of a tabu assisted hyper-heuristic genetic algorithm
    • IEEE Computer Society Press, Canberra, Australia
    • Han, L., Kendall, G.: An investigation of a tabu assisted hyper-heuristic genetic algorithm. In: Proceedings of the 2003 IEEE Congress on Evolutionary Computation (CEC 2003), pp. 2230-2237. IEEE Computer Society Press, Canberra, Australia (2003)
    • (2003) Proceedings of the 2003 IEEE Congress on Evolutionary Computation (CEC , pp. 2230-2237
    • Han, L.1    Kendall, G.2
  • 39
    • 45949083805 scopus 로고    scopus 로고
    • Han, L., Kendall, G., Cowling, P.: An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2002), pp. 267-271. Orchid Country Club, Singapore (2002)
    • Han, L., Kendall, G., Cowling, P.: An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2002), pp. 267-271. Orchid Country Club, Singapore (2002)
  • 41
    • 84878601846 scopus 로고    scopus 로고
    • Hart, E., Ross, P.: A heuristic combination method for solving job-shop scheduling problems. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, 1498, pp. 845-854. Springer, Heidelberg (1998)
    • Hart, E., Ross, P.: A heuristic combination method for solving job-shop scheduling problems. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 845-854. Springer, Heidelberg (1998)
  • 42
    • 0032009912 scopus 로고    scopus 로고
    • Solving a real-world problem using an evolving heuristically driven schedule builder
    • Hart, E., Ross, P., Nelson, J.: Solving a real-world problem using an evolving heuristically driven schedule builder. Evolutionary Computation 6, 61-80 (1998)
    • (1998) Evolutionary Computation , vol.6 , pp. 61-80
    • Hart, E.1    Ross, P.2    Nelson, J.3
  • 43
    • 0033476091 scopus 로고    scopus 로고
    • Scheduling chicken catching - An investigation into the success of a genetic algorithm on a real-world scheduling problem
    • Hart, E., Ross, P., Nelson, J.: Scheduling chicken catching - An investigation into the success of a genetic algorithm on a real-world scheduling problem. Annals of Operations Research 92, 363-380 (1999)
    • (1999) Annals of Operations Research , vol.92 , pp. 363-380
    • Hart, E.1    Ross, P.2    Nelson, J.3
  • 47
    • 38549095360 scopus 로고    scopus 로고
    • Tabu search hyper-heuristic approach to the examination timetabling problem at University of Technology MARA
    • Burke, E, Trick, M, eds, PATAT 2004, Springer, Heidelberg
    • Kendall, G., Mohd Hussin, N.: Tabu search hyper-heuristic approach to the examination timetabling problem at University of Technology MARA. In: Burke, E., Trick, M. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 199-217. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3616 , pp. 199-217
    • Kendall, G.1    Mohd Hussin, N.2
  • 49
    • 45949093888 scopus 로고    scopus 로고
    • Kendall, G., Soubeiga, E., Cowling, P.: Choice function and random hyperheuristics. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2002), pp. 667-671. Orchid Country Club, Singapore (2002)
    • Kendall, G., Soubeiga, E., Cowling, P.: Choice function and random hyperheuristics. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2002), pp. 667-671. Orchid Country Club, Singapore (2002)
  • 51
    • 45949107644 scopus 로고
    • Integrating heuristics for constraint satisfaction problems: A case study
    • Minton, S.: Integrating heuristics for constraint satisfaction problems: a case study. In: AAAI Proceedings (1993)
    • (1993) AAAI Proceedings
    • Minton, S.1
  • 52
    • 0005811668 scopus 로고
    • An analytic learning system for specializing heuristics
    • International Joint Conference on Artificial Intelligence
    • Minton, S.: An analytic learning system for specializing heuristics. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (1993)
    • (1993) Proceedings of the 13th
    • Minton, S.1
  • 53
    • 4344713562 scopus 로고    scopus 로고
    • Choosing search heuristics by non-stationary reinforcement learning
    • Resende, M, de Sousa, J, eds, Kluwer Academic Publishers, Dordrecht
    • Nareyek, A.: Choosing search heuristics by non-stationary reinforcement learning. In: Resende, M., de Sousa, J. (eds.) Metaheuristics: Computer decision-making, pp. 523-544. Kluwer Academic Publishers, Dordrecht (2003)
    • (2003) Metaheuristics: Computer decision-making , pp. 523-544
    • Nareyek, A.1
  • 55
    • 45949107796 scopus 로고    scopus 로고
    • Norenkov, I., Goodman, E.: Solving scheduling problems via evolutionary methods for rule sequence optimisation. In: Second World Conference on Soft Computing (WSC2) (June 1997)
    • Norenkov, I., Goodman, E.: Solving scheduling problems via evolutionary methods for rule sequence optimisation. In: Second World Conference on Soft Computing (WSC2) (June 1997)
  • 58
    • 0035501699 scopus 로고    scopus 로고
    • A general meta-heuristic based solver for combinatorial optimisation problems
    • Randall, M., Abramson, D.: A general meta-heuristic based solver for combinatorial optimisation problems. Computational Optimisation and Applications 20, 185-210 (2001)
    • (2001) Computational Optimisation and Applications , vol.20 , pp. 185-210
    • Randall, M.1    Abramson, D.2
  • 59
    • 35248823635 scopus 로고    scopus 로고
    • Ross, P., Marín-Blázquez, J.G., Schulenburg, S., Hart, E.: Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyperheuristics. In: Cantéu-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O'Reilly, U.- M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, 2723, pp. 1295-1306. Springer, Heidelberg (2003)
    • Ross, P., Marín-Blázquez, J.G., Schulenburg, S., Hart, E.: Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyperheuristics. In: Cantéu-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O'Reilly, U.- M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 1295-1306. Springer, Heidelberg (2003)
  • 62
    • 0000799803 scopus 로고
    • Problem and heuristic search space strategies for job shop scheduling
    • Storer, R.H., Wu, S.D., Vaccari, R.: Problem and heuristic search space strategies for job shop scheduling. ORSA Journal on Computing 7, 453-467 (1995)
    • (1995) ORSA Journal on Computing , vol.7 , pp. 453-467
    • Storer, R.H.1    Wu, S.D.2    Vaccari, R.3
  • 65
    • 0001387704 scopus 로고
    • Classifier systems based on accuracy
    • Wilson, S.W.: Classifier systems based on accuracy. Evolutionary Computation 3, 149-175 (1995)
    • (1995) Evolutionary Computation , vol.3 , pp. 149-175
    • Wilson, S.W.1


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