Heuristic selection for stochastic search optimization: Modeling solution quality by extreme value theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 197-211

  Cicirello, Vincent A ^a   Smith, Stephen F ^b  

^a DREXEL UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; LEARNING ALGORITHMS; OPTIMIZATION; SCHEDULING; STOCHASTIC MODELS;

EXTREME VALUE THEORY; HEURISTIC SELECTIONS; RELATIVE PERFORMANCE; REPEATED APPLICATION; RESOURCE CONSTRAINED PROJECT SCHEDULING; STOCHASTIC ALGORITHMS; STOCHASTIC SAMPLING; STOCHASTIC SEARCH OPTIMIZATION;

STOCHASTIC SYSTEMS;

EID: 35048898848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_17     Document Type: Article

References (23)

1. Bresina, J.L.: Heuristic-biased stochastic sampling. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Volume One, AAAI Press (1996) 271-278
2. Cicirello, V.A., Smith, S.F.: Amplification of search performance through randomization of heuristics. In Van Hentenryck, P., ed.: Principles and Practice of Constraint Programming - CP 2002: 8th International Conference, Proceedings. Volume LNCS 2470 of Lecture Notes in Computer Science., Springer-Verlag (2002) 124-138 Ithaca, NY.
3. Cicirello, V.A.: Boosting Stochastic Problem Solvers Through Online Self-Analysis of Performance. PhD thesis, The Robotics Institute, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (2003) Also available as technical report CMU-RI-TR-03-27.
4. Goldberg, D., Cicirello, V., Dias, M.B., Simmons, R., Smith, S., Stentz, A.: Market-based multi-robot planning in a distributed layered architecture. In: Multi-Robot Systems: From Swarms to Intelligent Automata: Proceedings of the 2003 International Workshop on Multi-Robot Systems. Volume 2., Kluwer Academic Publishers (2003) 27-38 Washington, DC.
5. Allen, J.A., Minton, S.: Selecting the right heuristic algorithm: Runtime performance predictors. In: Proceedings of the Canadian AI Conference. (1996)
6. Cowling, P., 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.: Applications of Evolutionary Computing: EvoWorkshops 2002 Proceedings. Number LNCS 2279 in Lecture Notes in Computer Science, Springer-Verlag (2002) 1-10
7. Nareyek, A.: Choosing search heuristics by non-stationary reinforcement learning. In Resende, M.G.C., de Sousa, J.P., eds.: Metaheuristics: Computer Decision Making. Kluwer Academic Publishers (2003)
8. Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126 (2001) 43-62
9. Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous teams: Cooperation schemes for autonomous agents. Journal of Heuristics 4 (1998) 295-321
10. Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Principles and Practices of Constraint Programming (CP-97). Lecture Notes in Computer Science, Springer-Verlag (1997) 121-135
11. Bresina, J., Drummond, M., Swanson, K.: Expected solution quality. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann (1995) 1583-1590
12. Coles, S.: An Introduction to Statistical Modeling of Extreme Values. Springer-Verlag (2001)
13. Hosking, J.R.M.: Algorithm AS 215: Maximum-likelihood estimation of the paramaters of the generalized extreme-value distribution. Applied Statistics 34 (1985) 301-310
14. Silverman, B.W.: Density Estimation for Statistics and Data Analysis. Monographs on Statistics and Applied Probability. Chapman and Hall (1986)
15. Epanechnikov, V.A.: Non-parametric estimation of a multivariate probability density. Theory of Probability and Its Applications 14 (1969) 153-158
16. NIST/SEMATECH: e-Handbook of Statistical Methods. NIST/SEMATECH (2003) http://www.itl.nist.gov/div898/handbook/.
17. Kaelbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: A survey. Journal of Artificial Intelligence Research 4 (1996) 237-285
18. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220 (1983) 671-680
19. Dorndorf, U., Pesch, E., Phan-Huy, T.: A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Science 46 (2000) 1365-1384
20. Franck, B., Neumann, K., Schwindt, C.: Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum 23 (2001) 297-324
21. Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources: Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions. Lecture Notes in Economics and Mathematical Systems. Springer-Verlag (2002)
22. Cesta, A., Oddi, A., Smith, S.F.: A constraint-based method for project scheduling with time windows. Journal of Heuristics 8 (2002) 109-136
23. Franck, B., Neumann, K.: Resource-constrained project scheduling with time windows: Structural questions and priority-rule methods. Technical Report WIOR-492, Universität Karlsruhe, Karlsruhe, Germany (1998)