Reactive search and intelligent optimization

Operations Research/ Computer Science Interfaces Series

Volumn 45, Issue , 2009, Pages

  Battiti, Roberto ^a   Brunato, Mauro ^a   Mascia, Franco ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84859122606     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-09624-7     Document Type: Article

References (276)

1. Aarts, E., Korst, J.: Boltzmann machines for travelling salesman problems. European Journal of Operational Research 39, 79-95 (1989)
2. Aarts, E. H. L., Korst, J., Zwietering, P.: Deterministic and randomized local search. In: M. C. Mozer, P. Smolensky, D. E. Rumelhart (eds.) Mathematical Perspectives on Neural Networks. Lawrence Erlbaum, Hillsdale, NJ (1995)
3. Abramson, D., Dang, H., Krisnamoorthy, M.: Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research 16, 1-22 (1999). URL citeseer. ist. psu. edu/article/abramson97simulated. html
4. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: Data Structures and Algorithms. Addison-Wesley, Reading, MA (1983)
5. Alimonti, P.: New local search approximation techniques for maximum generalized satisfiability problems. In: Proceedings of the Second Italian Conference on Algorithms and Complexity, pp. 40-53 (1994)
6. Altenberg, L.: Fitness distance correlation analysis: An instructive counterexample. Proceedings of the 7th International Conference on Genetic Algorithms (ICGA97), pp. 57-64 (1997)
7. Anderson, B., Moore, A., Cohn, D.: A nonparametric approach to noisy and costly optimization. In: Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), pp. 17-24 (2000)
8. Anzellotti, G., Battiti, R., Lazzizzera, I., Soncini, G., Zorat, A., Sartori, A., Tecchiolli, G., Lee, P.: Totem: A highly parallel chip for triggering applications with inductive learning based on the reactive tabu search. International Journal of Modern Physics C 6(4), 555-560 (1995)
9. Atkeson, C. G., Schaal, S. A., Moore, A.: Locally weighted learning. AI Review 11, 11-73 (1997)
10. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2/3), 235-256 (2002). URL citeseer. ist. psu. edu/auer00finite time. html
11. Bahren, J., Protopopescu, V., Reister, D.: Trust: A deterministic algorithm for global optimization. Science 276, 10941, 097 (1997)
12. Baluja, S.: Using a priori knowledge to create probabilistic models for optimization. International Journal of Approximate Reasoning 31(3), 193-220 (2002)
13. Baluja, S., Barto, A., Boyan, K. B. J., Buntine, W., Carson, T., Caruana, R., Cook, D., Davies, S., Dean, T., et al.: Statistical machine learning for large-scale optimization. Neural Computing Surveys 3, 1-58 (2000)
14. Baluja, S., Caruana, R.: Removing the genetics from the standard genetic algorithm. Tech. Rep. CMU-CS-95-141, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1995)
15. Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., Stewart, W.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1(1), 9-32 (1995)
16. Barricelli, N.: Numerical testing of evolution theories. Acta Biotheoretica 16(1), 69-98 (1962)
17. Barto, A. G., Sutton, R. S., Anderson, C. W.: Neurolike adaptive elements that can solve difficult learning problems. IEEE Transactions on Systems, Man and Cybernetics 13, 834-846 (1983)
18. Battiti, R.: First-and second-order methods for learning: Between steepest descent and newton's method. Neural Computation 4, 141-166 (1992)
19. Battiti, R.: Using the mutual information for selecting features in supervised neural net learning. IEEE Transactions on Neural Networks 5(4), 537-550 (1994)
20. Battiti, R.: Partially persistent dynamic sets for history-sensitive heuristics. Tech. Rep. UTM-96-478, Dip. di Matematica, Universita' di Trento, Trento, Italy (1996). Revised version, Presented at the Fifth DIMACS Challenge, Rutgers, NJ, 1996
21. Battiti, R.: Reactive search: Toward self-tuning heuristics. In: V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, G. D. Smith (eds.) Modern Heuristic Search Methods, chap. 4, pp. 61-83. Wiley, New York, NY (1996)
22. Battiti, R.: Time-and space-efficient data structures for history-based heuristics. Tech. Rep. UTM-96-478, Dip. di Matematica, Universita' di Trento, Trento, Italy (1996)
23. Battiti, R., Bertossi, A. A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers 48(4), 361-385 (1999)
24. Battiti, R., Brunato, M.: Reactive search for traffic grooming in WDM networks. In: S. Palazzo (ed.) Evolutionary Trends of Internet, IWDC2001, Taormina, LNCS, vol. 2170, pp. 56-66. Springer, Berlin (2001)
25. Battiti, R., Colla, A. M.: Democracy in neural nets: Voting schemes for accuracy. Neural Networks 7(4), 691-707 (1994)
26. Battiti, R., Tecchiolli, G.: Parallel biased search for combinatorial optimization: Genetic algorithms and tabu. Microprocessor and Microsystems 16, 351-367 (1992)
27. Battiti, R., Protasi, M.: Solving max-sat with non-oblivious functions and history-based heuristics. Tech. Rep., Dipartimento di Matematica, Unversita' di Trento, Trento, Italy (1996)
28. Battiti, R., Protasi, M.: Reactive search, a history-sensitive heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics 2(ARTICLE 2) (1997). http://www. jea. acm. org/
29. Battiti, R., Protasi, M.: Solving MAX-SAT with non-oblivious functions and history-based heuristics. In: D. Du, J. Gu, P. M. Pardalos (eds.) Satisfiability Problem: Theory and Applications, no. 35 in DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pp. 649-667. American Mathematical Society, Association for Computing Machinery, New York, NY (1997)
30. Battiti, R., Protasi, M.: Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem. Discrete Applied Mathematics 96-97, 3-27 (1999)
31. Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610-637 (2001)
32. Battiti, R., Tecchiolli, G.: Learning with first, second, and no derivatives: A case study in high energy physics. Neurocomputing 6, 181-206 (1994)
33. Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal on Computing 6(2), 126-140 (1994)
34. Battiti, R., Tecchiolli, G.: Simulated annealing and tabu search in the long run: A comparison on QAP tasks. Computer and Mathematics with Applications 28(6), 1-8 (1994)
35. Battiti, R., Tecchiolli, G.: Local search with memory: Benchmarking rts. Operations Research Spektrum 17(2/3), 67-86 (1995)
36. Battiti, R., Tecchiolli, G.: Training neural nets with the reactive tabu search. IEEE Transactions on Neural Networks 6(5), 1185-1200 (1995)
37. Battiti, R., Tecchiolli, G.: The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization. Annals of Operations Research-Metaheuristics in Combinatorial Optimization 63, 153-188 (1996)
38. Baxter, J.: Local optima avoidance in depot location. The Journal of the Operational Research Society 32(9), 815-819 (1981)
39. Bayer, R.: Symmetric binary b-trees: Data structure and maintenance algorithms. Acta Informatica 1, 290-306 (1972)
40. Bennett, K., Parrado-Hernández, E.: The interplay of optimization and machine learning research. The Journal of Machine Learning Research 7, 1265-1281 (2006)
41. Bentley, J.: Experiments on traveling salesman heuristics. In: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pp. 91-99 (1990)
42. Bertsekas, D., Tsitsiklis, J.: Neuro-Dynamic Programming. Athena Scientific, Belmont, MA (1996)
43. Biazzini, M., Brunato, M., Montresor, A.: Towards a decentralized architecture for optimization. In: Proceedings of the Twenty-Second IEEE International Parallel and Distributed Processing Symposium. Miami, FL (2008)
44. Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: W. Langdon et al. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11-18. Morgan Kaufmann, San Francisco, CA (2002). Also available as: AIDA-2002-01 Technical Report of Intellektik, Technische Universität Darmstadt, Darmstadt, Germany
45. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35(3), 268-308 (2003). DOI http://doi. acm. org/10. 1145/937503. 937505
46. de Boer, P., Kroese, D., Mannor, S., Rubinstein, R.: A tutorial on the cross-entropy method. Annals of Operations Research 134, 19-67 (2005). URL citeseer. ist. psu. edu/deboer02tutorial. html
47. Boese, K., Kahng, A., Muddu, S.: On the big valley and adaptive multi-start for discrete global optimizations. Operation Research Letters 16(2) (1994)
48. Bollobás: Random Graphs. Cambridge University Press, Cambridge (2001)
49. de Bonet, J. S., Jr., Isbell, C. L., Viola, P.: MIMIC: Finding optima by estimating probability densities. In: M. C. Mozer, M. I. Jordan, T. Petsche (eds.) Advances in Neural Information Processing Systems, vol. 9, p. 424. The MIT Press, Cambridge, MA (1997). URL citeseer. ist. psu. edu/debonet96mimic. html
50. Boyan, J., Moore, A.: Using prediction to improve combinatorial optimization search. In: Proceedings of AISTATS-6 (1997)
51. Boyan, J., Moore, A.: Learning evaluation functions to improve optimization by local search. The Journal of Machine Learning Research 1, 77-112 (2001)
52. Boyan, J. A., Moore, A. W.: Learning evaluation functions for global optimization and boolean satisfability. In: A. Press (ed.): Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI), pp. 3-10 (1998)
53. Braysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS Journal on Computing 15(4), 347-368 (2003)
54. Breimer, E., Goldberg, M., Hollinger, D., Lim, D.: Discovering optimization algorithms through automated learning. In: Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 69, pp. 7-27. American Mathematical Society (2005)
55. Brent, R. P.: Algorithms for Minimization Without Derivatives. Prentice-Hall, Englewood Cliffs, NJ (1973)
56. Brunato, M., Battiti, R.: Statistical learning theory for location fingerprinting in wireless LANs. Computer Networks 47(6), 825-845 (2005)
57. Brunato, M., Battiti, R.: The reactive affine shaker: A building block for minimizing functions of continuous variables. Tech. Rep. DIT-06-012, Università di Trento, Trento, Italy (2006)
58. Brunato, M., Battiti, R., Pasupuleti, S.: A memory-based rash optimizer. In: A. F. R. H. H. Geffner (ed.) Proceedings of AAAI-06 Workshop on Heuristic Search, Memory Based Heuristics and Their Applications, pp. 45-51. Boston, MA (2006). ISBN 978-1-57735-290-7
59. Burges, C. J. C.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2(2), 121-167 (1998)
60. Carchrae, T., Beck, J.: Applying machine learning to low-knowledge control of optimization algorithms. Computational Intelligence 21(4), 372-387 (2005)
61. Cheeseman, P., Kanefsky, B., Taylor, W.: Where the really hard problems are. In: Proceedings of the Twelfth IJCAI, pp. 331-337 (1991)
62. Chelouah, R., Siarry, P.: Tabu search applied to global optimization. European Journal of Operational Research 123, 256-270 (2000)
63. Cherny, V.: A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications 45, 41-45 (1985)
64. Chiang, T. S., Chow, Y.: On the convergence rate of annealing processes. SIAM Journal on Control and Optimization 26(6), 1455-1470 (1988)
65. Chiang, W., Russell, R.: A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing 9, 417-430 (1997)
66. Cicirello, V.: Boosting Stochastic Problem Solvers Through Online Self-Analysis of Performance. Ph. D. thesis, Carnegie Mellon University, Pittsburgh, PA (2003) Also available as Technical Report CMU-RI-TR-03-27
67. Cicirello, V., Smith, S.: The max k-armed bandit: A new model for exploration applied to search heuristic selection. In: Twentieth National Conference on Artificial Intelligence (AAAI-05) (2005). Best Paper Award
68. Cicirello, V. A., Smith, S. F.: Principles and practice of constraint programming CP 2004, LNCS, vol. 3258, chap. Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory, pp. 197-211. Springer, Berlin/Heidelberg (2004)
69. Clark, D. A., Frank, J., Gent, I. P., MacIntyre, E., Tomov, N., Walsh, T.: Local search and the number of solutions. In: Principles and Practice of Constraint Programming, pp. 119-133 (1996). URL citeseer. ist. psu. edu/article/clark96local. html
70. Clerc, M., Kennedy, J.: The particle swarm-Explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6(1), 58-73 (2002)
71. Cleveland, W. S., Devlin, S. J.: Locally-weighted regression: An approach to regression analysis by local fitting. Journal of the American Statistical Association 83, 596-610 (1988)
72. Codenotti, B., Manzini, G., Margara, L., Resta, G.: Perturbation: An efficient technique for the solution of very large instances of the euclidean tsp. INFORMS Journal on Computing 8(2), 125-133 (1996)
73. Connolly, D.: An improved annealing scheme for the QAP. European Journal of Operational Research 46(1), 93-100 (1990)
74. Conover, W. J.: Practical Nonparametric Statistics. Wiley, New York, NY (1999). URL http://www. amazon. co. uk/exec/obidos/ASIN/0471160687/citeulike-21
75. Corana, A., Marchesi, M., Martini, C., Ridella, S.: Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Transactions on Mathematical Software 13(3), 262-280 (1987). DOI http://doi. acm. org/10. 1145/29380. 29864
76. Cormen, T. H., Leiserson, C. E., Rivest, R. L.: Introduction to Algorithms. McGraw-Hill, New York (1990)
77. Cox, B. J.: Object Oriented Programming, an Evolutionary Approach. Addison-Wesley, Reading, MA (1990)
78. Crainic, T., Toulouse, M.: Parallel strategies for metaheuristics. In: F. Glover, G. Kochenberger (eds.) State-of-the-Art Handbook in Metaheuristics, chap. 1. Kluwer, Dordrecht (2002)
79. Crawford, J. M., Auton, L. D.: Experimental results on the crossover point in random 3-sat. Artificial Intelligence 81(1-2), 31-57 (1996). DOI http://dx. doi. org/10. 1016/0004-3702(95)00046-1
80. Daida, J., Yalcin, S., Litvak, P., Eickhoff, G., Polito, J.: Of metaphors and darwinism: Deconstructing genetic programmings chimera. In: Proceedings CEC-99: Congress in Evolutionary Computation, Piscataway, p. 453-462. IEEE Press, Piscataway, NY (1999)
81. Dammeyer, F., Voss, S.: Dynamic tabu list management using the reverse elimination method. Annals of Operations Research 41, 31-46 (1993)
82. Darwin, C.: On The Origin of Species. Signet Classic, reprinted 2003 (1859)
83. Dawkins, R.: The Selfish Gene. Oxford University, Oxford (1976)
84. Delmaire, H., Di{dotless}az, J., Fernandez, E., Ortega, M.: Reactive GRASP and Tabu Search based heuristics for the single source capacitated plant location problem. INFOR 37, 194-225 (1999)
85. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing (PODC'87), pp. 1-12. ACM Press, Vancouver, British Columbia, Canada (1987). URL http://doi. acm. org/10. 1145/41840. 41841
86. Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theoretical Computer Science 344(2-3), 243-278 (2005). DOI http://dx. doi. org/10. 1016/j. tcs. 2005. 05. 020
87. Driscoll, J. R., Sarnak, N., Sleator, D. D., Tarjan, R. E.: Making data structures persistent. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing. ACM, Berkeley, CA (1986)
88. Dubrawski, A., Schneider, J.: Memory based stochastic optimization for validation and tuning of function approximators. In: Conference on AI and Statistics (1997)
89. Duda, R., Hart, P., Stork, D.: Pattern Classification. Wiley-Interscience, New York, NY (2000)
90. Eiben, A., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2), 124-141 (1999)
91. Eiben, A., Horvath, M., Kowalczyk, W., Schut, M.: Reinforcement learning for online control of evolutionary algorithms. In: S. Brueckner, M. Hassas, D. Yamins Jelasity, (eds.) Proceedings of the Fourth InternationalWorkshop on Engineering Self-Organizing Applications (ESOA'06), LNAI. Springer, Berlin (2006)
92. Erdos, P., Renyi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290-297 (1959)
93. Faigle, U., Kern, W.: Some convergence results for probabilistic tabu search. ORSA Journal on Computing 4(1), 32-37 (1992)
94. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109-133 (1995)
95. Ferreira, A., Zerovnik, J.: Bounding the probability of success of stochastic methods for global optimization. Computers Mathematics with Applications 25(10/11), 1-8 (1993)
96. Fleischer, M. A.: Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control. Journal of Heuristics 1(2), 225-246 (1996)
97. Fong, P. W. L.: A quantitative study of hypothesis selection. In: International Conference on Machine Learning, pp. 226-234 (1995). URL citeseer. ist. psu. edu/fong95quantitative. html
98. Fortz, B., Thorup, M.: Increasing internet capacity using local search. Computational Optimization and Applications 29(1), 13-48 (2004)
99. Frank, J.: Weighting for godot: Learning heuristics for GSAT. In: Proceedings of the National Conference on Artificial Intelligence, vol. 13, pp. 338-343. Wiley, New York, NY (1996)
100. Frank, J.: Learning short-term weights for GSAT. In: Proceedings of the International Joint Conference on Artificial Intelligence, vol. 15, pp. 384-391. Lawrence Erlbaum Associates, Hillsdale, NJ (1997)
101. Fraser, A., Burnell, D.: Computer models in genetics. McGraw-Hill, New York (1970)
102. Fraser, A. M., Swinney, H. L.: Independent coordinates for strange attractors from mutual information. Physical Review A 33(2), 1134-1140 (1986). DOI 10. 1103/PhysRevA. 33. 1134
103. Gagliolo, M., Schmidhuber, J.: A neural network model for inter-problem adaptive online time allocation. In: W. Duch et al. (ed.) Proceedings Artificial Neural Networks: Formal Models and Their Applications-ICANN 2005, Fifteenth International Conference, vol. 2, pp. 7-12. Springer, Berlin, Warsaw (2005)
104. Gagliolo, M., Schmidhuber, J.: Dynamic algorithm portfolios. In: Proceedings AI and MATH'06, Ninth International Symposium on Artificial Intelligence and Mathematics. Fort Lauderdale, FL (2006)
105. Gagliolo, M., Schmidhuber, J.: Impact of censored sampling on the performance of restart strategies. In: CP 2006-Twelfth International Conference on Principles and Practice of Constraint Programming-Nantes, France, pp. 167-181. Springer, Berlin (2006)
106. Gent, I., Walsh, T.: Towards an understanding of hill-climbing procedures for sat. In: Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 28-33. AAAI Press/The MIT Press, San Jose, CA/Cambridge, MA (1993)
107. Glover, F.: Tabu search-part i. ORSA Journal on Computing 1(3), 190-260 (1989)
108. Glover, F.: Tabu search-part ii. ORSA Journal on Computing 2(1), 4-32 (1990)
109. Glover, F.: Tabu search: Improved solution alternatives. In: J. R. Birge, K. G. Murty (eds.) Mathematical Programming, State of the Art, pp. 64-92. University of Michigan, Press, Ann Arbor, MI (1994)
110. Glover, F.: Scatter search and star-paths: Beyond the genetic metaphor. Operations Research Spektrum 17(2/3), 125-138 (1995)
111. Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. Control and Cybernetics 39(3), 653-684 (2000)
112. Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1/2), 67-100 (2000)
113. Gomes, C. P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126(1-2), 43-62 (2001). DOI http://dx. doi. org/10. 1016/S0004-3702(00)00081-3
114. Gomes, F. C., Pardalos, P., Oliveira, C. S., Resende, M. G. C.: Reactive grasp with path relinking for channel assignment in mobile phone networks. In: DIALM'01: Proceedings of the Fifth international workshop on Discrete algorithms and methods for mobile computing and communications, pp. 60-67. ACM Press, New York, NY (2001). DOI http://doi. acm. org/10. 1145/381448. 381456
115. Greistorfer, P., VoS, S.: Controlled Pool Maintenance in Combinatorial Optimization, Operations Research/Computer Science Interfaces, vol. 30. Springer, Berlin (2005)
116. Gu, J.: Parallel algorithms and architectures for very fast ai search. Ph. D. thesis, University of Utah, Salt Lake City, UT (1989)
117. Gu, J.: Efficient local search for very large-scale satisfiability problem. ACM SIGART Bulletin 3(1), 8-12 (1992)
118. Guibas, L. J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science, pp. 8-21. IEEE Computer Society, Silver Spring, MD (1978)
119. Hagerup, T., Rueb, C.: A guided tour of chernoff bounds. Information Processing Letters 33, 305-308 (1989/90)
120. Hajek, B.: Cooling schedules for optimal annealing. Mathematics of Operations Research 13(2), 311-329 (1988)
121. Hamza, K., Mahmoud, H., Saitou, K.: Design optimization of N-shaped roof trusses using reactive taboo search. Applied Soft Computing Journal 3(3), 221-235 (2003)
122. Hamza, K., Saitou, K., Nassef, A.: Design optimization of a vehicle b-pillar subjected to roof crush using mixed reactive taboo search. In: Proceedings of the ASME 2003 Design Engineering and Technical Conference, Chicago, IL, pp. 1-9 (2003)
123. Hansen, N. M. P.: Variable neighborhood search. Computers and Operations Research 24(11), 1097-1100 (1997)
124. Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44, 279-303 (1990)
125. Hansen, P., Mladenovic, N.: Variable neighborhood search. In: E. Burke, G. Kendall (eds.) Search methodologies: Introductory tutorials in optimization and decision support techniques, pp. 211-238. Springer, Berlin (2005)
126. Heckendorn, R. B., Rana, S., Whitey, D. L.: Test function generators as embedded landscapes. In: W. Banzhaf, C. Reeves (eds.) Foundations of Genetic Algorithms 5, pp. 183-198. Morgan Kaufmann, San Francisco (1999)
127. Hertz, J., Krogh, A., Palmer, R.: Introduction to the Theory of Neural Computation. Addison-Wesley, Redwood City, CA (1991). URL citeseer. ist. psu. edu/hertz91introduction. html
128. Hifi, M., Michrafy, M.: A reactive local search-based algorithm for the disjunctively constrained knapsack problem. Journal of the Operational Research Society 57(6), 718-726 (2006)
129. Hifi, M., Michrafy, M., Sbihi, A.: A Reactive local search-based algorithm for the multiplechoice multi-dimensional knapsack problem. Computational Optimization and Applications 33(2), 271-285 (2006)
130. Hinterding, R., Michalewicz, Z., Eiben, A.: Adaptation in evolutionary computation: A survey. In: IEEE International Conference on Evolutionary Computation, pp. 65-69 (1997)
131. Hinton, G., Nowlan, S.: How learning can guide evolution. Complex Systems 1(1), 495-502 (1987)
132. Hogg, T.: Applications of Statistical Mechanics to Combinatorial Search Problems, vol. 2, pp. 357-406. World Scientific, Singapore (1995)
133. Hogg, T., Huberman, B. A., Williams, C. P.: Phase transitions and the search problem. Artificial Intelligence 81(1-2), 1-15 (1996). DOI http://dx. doi. org/10. 1016/0004-3702(95) 00044-5
134. Holland, J.: Adaptation in Nature and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975)
135. Hooker, J.: Testing heuristics: We have it all wrong. Journal of Heuristics 1(1), 33-42 (1995)
136. Hoos, H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of the National Conference on Artificial Intelligence, vol. 18, pp. 655-660. AAAI Press MIT Press, San Jose, CA/Cambridge, MA (1999)
137. Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Networks 2(5), 359-366 (1989)
138. Horvitz, E., Ruan, Y., Gomes, C., Kautz, H., Selman, B., Chickering, D. M.: A bayesian approach to tackling hard computational problems. In: Seventeenth Conference on Uncertainty in Artificial Intelligence, Seattle, WA, pp. 235-244 (2001)
139. Hu, B., Raidl, G. R.: Variable neighborhood descent with self-adaptive neighborhoodordering. In: C. Cotta, A. J. Fernandez, J. E. Gallardo (eds.) Proceedings of the Seventh EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics, Malaga, Spain (2006)
140. Huang, M., Romeo, F., Sangiovanni-Vincentelli, A.: An efficient general cooling schedule for simulated annealing. In: IEEE International Conference on Computer Aided Design, pp. 381-384 (1986)
141. Huberman, B., Hogg, T.: Phase transitions in artificial intelligence systems. Artificial Intelligence 33(2), 155-171 (1987)
142. Huberman, B. A., Lukose, R. M., Hogg, T.: An economics approach to hard computational problems. Science 275, 51-54 (1997)
143. Hutter, F., Hamadi, Y.: Parameter adjustment based on performance prediction: Towards an instance-aware problem solver. Tech. Rep. MSR-TR-2005-125, Microsoft Research, Cambridge, UK (2005)
144. Ingber, L.: Very fast simulated re-annealing. Mathematical and Computer Modelling 12(8), 967-973 (1989)
145. Ishtaiwi, A., Thornton, J. R., A. Anbulagan, S., Pham, D. N.: Adaptive clause weight redistribution. In: Proceedings of the Twelfth International Conference on the Principles and Practice of Constraint Programming, CP-2006, Nantes, France, pp. 229-243 (2006)
146. Gu, J., Du, B.: A multispace search algorithm (invited paper). DIMACS Monograph on Global Minimization of Nonconvex Energy Functions (1996)
147. Jacquet, W., Truyen, B., de Groen, P., Lemahieu, I., Cornelis, J.: Global optimization in inverse problems: A comparison of Kriging and radial basis functions (2005). http://arxiv. org/abs/math/0506440
148. Janis, I.: Victims of groupthink. Houghton Mifflin (1972)
149. Joachims, T.: Making large-scale SVM learning practical. In: B. Schölkopf, C. J. C. Burges, A. J. Smola (eds.) Advances in Kernel Methods-Support Vector Learning, chap. 11. MIT Press, Cambridge, MA (1999)
150. Johnson, D.: Local optimization and the travelling salesman problem. In: Proceedings of the Seventeenth Colloquium on Automata Languages and Programming, LNCS, vol. 447. Springer, Berlin (1990)
151. Johnson, D. S., Aragon, C. R., McGeoch, L. A., Schevon, C.: Optimization by simulated annealing: An experimental evaluation. part i, graph partitioning. Oper. Res. 37(6), 865-892 (1989)
152. Johnson, D. S., Aragon, C. R., McGeoch, L. A., Schevon, C.: Optimization by simulated annealing: An experimental evaluation; part ii, graph coloring and number partitioning. Operations Research 39(3), 378-406 (1991)
153. Jones, D.: A taxonomy of global optimization methods based on response surfaces. Journal of Global Optimization 21(4), 345-383 (2001)
154. Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the Sixth International Conference on Genetic Algorithms Table of Contents, pp. 184-192 (1995)
155. Jong, K. A. D., Potter, M. A., Spears, W. M.: Using problem generators to explore the effects of epistasis. In: T. Bäck (ed.) Proceedings of the Seventh intl. conference on genetic algorithms. Morgan Kaufmann, San Francisco (2007)
156. Kauffman, S. A., Levin, S.: Towards a general theory of adaptive walks on rugged landscapes. Journal of Theoretical Biology 128, 11-45 (1987)
157. Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic restart policies. In: Eighteenth national conference on Artificial intelligence, pp. 674-681. American Association for Artificial Intelligence, Menlo Park, CA (2002)
158. Kenney, J. F., Keeping, E. S.: Mathematics of Statistics, 2nd edn. Van Nostrand, Princeton, NJ (1951)
159. Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal 49, 291-307 (1970)
160. Kincaid, R. K., Labal, K. E.: Reactive tabu search and sensor selection in active structural acoustic control problems. Journal of Heuristics 4(3), 199-220 (1998)
161. Kirkpatrick, S., Jr Gelatt, C. D., Vecchi, M. P.: Optimization by simulated annealing. Science 220, 671-680 (1983)
162. Kirkpatrick, S., Selman, B.: Critical behavior in the satisfiability of random boolean expressions. Science 264, 1297-1301 (1994)
163. Kohavi, R., John, G.: Automatic parameter selection by minimizing estimated error. Machine Learning, pp. 304-312 (1995)
164. Krasnogor, N., Smith, J.: A tutorial for competent memetic algorithms: Model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation 9(5), 474-488 (2005)
165. Kuhn, T. S.: The Structure of Scientific Revolutions, 2nd edn. University of Chicago Press, Chicago, IL (1970)
166. Laarhoven, P. J. M., Aarts, E. H. L. (eds.): Simulated annealing: Theory and applications. Kluwer, Norwell, MA (1987)
167. Lagoudakis, M., Littman, M.: Algorithm selection using reinforcement learning. In: Proceedings of the Seventeenth International Conference on Machine Learning, pp. 511-518 (2000)
168. Lagoudakis, M., Littman, M.: Learning to select branching rules in the DPLL procedure for satisfiability. LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001) (2001)
169. Lagoudakis, M., Parr, R.: Least-squares policy iteration. Journal of Machine Learning Research 4(6), 1107-1149 (2004)
170. Levy, A., Montalvo, A.: The tunneling algorithm for the global minimization of functions. SIAM Journal on Scientific and Statistical Computing 6, 15-29 (1985)
171. Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: The case of combinatorial auctions. Proceedings of CP02 384 (2002)
172. Lin, S.: Computer solutions of the travelling salesman problems. Bell System Technical Journal 44(10), 2245-69 (1965)
173. Lourenco, H.: Job-shop scheduling: Computational study of local search and large-step optimization methods. European Journal of Operational Research 83, 347-364 (1995)
174. Lourenco, H. R., Martin, O. C., Stutzle, T.: Iterated local search. In: F. Glover, G. Kochenberger (eds.) Handbook of Metaheuristics, pp. 321-353. Springer, Berlin (2003)
175. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. Information Processing Letters 47(4), 173, 180 (1993)
176. Maier, D., Salveter, S. C.: Hysterical b-trees. Information Processing Letters 12(4), 199-202 (1981)
177. Maron, O., Moore, A. W.: The racing algorithm: Model selection for lazy learners. Artificial Intelligence Review 11(1-5), 193-225 (1997). URL citeseer. ist. psu. edu/maron97racing. html
178. Martin, O., Otto, S. W., Felten, E. W.: Large-step Markov chains for the traveling salesman problem. Complex Systems 5: 3, 299 (1991)
179. Martin, O., Otto, S. W., Felten, E. W.: Large-stepMarkov chains for the tsp incorporating local search heuristics. Operation Research Letters 11, 219-224 (1992)
180. Martin, O. C., Otto, S. W.: Combining simulated annealing with local search heuristics. Annals of Operations Research 63, 57-76 (1996)
181. McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of the national conference on Artificial Intelligence, 14, pp. 321-326. Wiley, New York, NY (1997)
182. McGeoch, C. C.: Toward an experimental method for algorithm simulation. INFORMS Journal on Computing 8(1), 1-28 (1996)
183. Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation 4(4), 337-352 (2000)
184. Metropolis, N., Rosenbluth, A. N., Rosenbluth, M. N., Teller, A. H. T. E.: Equation of state calculation by fast computing machines. Journal of Chemical Physics 21(6), 10871, 092 (1953)
185. Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58(1-3), 161-205 (1992)
186. Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 459-465. AAAI Press San Jose, CA (1992)
187. Mitra, D., Romeo, F., Sangiovanni-Vincentelli, A.: Convergence and finite-time behavior of simulated annealing. Advances in Applied Probability 18(3), 747-771 (1986)
188. Moore, A. W., Schneider, J.: Memory-based stochastic optimization. In: D. S. Touretzky, M. C. Mozer, M. E. Hasselmo (eds.) Advances in Neural Information Processing Systems, vol. 8, pp. 1066-1072. The MIT Press, Cambridge, MA (1996). URL citeseer. ist. psu. edu/moore95memorybased. html
189. van Moorsel, A., Wolter, K.: Analysis and algorithms for restart (2004). URL citeseer. ist. psu. edu/vanmoorsel04analysis. html
190. Morris, P.: The breakout method for escaping from local minima. In: Proceedings of the National Conference on Artificial Intelligence, 11, p. 40. Wiley, New York, NY (1993)
191. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 826 (1989)
192. Mühlenbein, H., Paa, G.: From recombination of genes to the estimation of distributions i. binary parameters. In: A. Eiben, T. Bäck, M. Shoenauer, H. Schwefel (eds.) Parallel Problem Solving from Nature, PPSN IV, p. 178187 (1996)
193. Muller, S., Schraudolph, N., Koumoutsakos, P.: Step size adaptation in evolution strategies using reinforcementlearning. Proceedings of the 2002 Congress on Evolutionary Computation, 2002. CEC'02. 1, 151-156 (2002)
194. Nahar, S., Sahni, S., Shragowitz, E.: Experiments with simulated annealing. In: DAC'85: Proceedings of the Twenty-second ACM/IEEE conference on Design automation, pp. 748-752. ACM Press, New York, NY (1985). DOI http://doi. acm. org/10. 1145/317825. 317977
195. Nahar, S., Sahni, S., Shragowitz, E.: Simulated annealing and combinatorial optimization. In: DAC'86: Proceedings of the Twenty-third ACM/IEEE Conference on Design Automation, pp. 293-299. IEEE Press, Piscataway, NJ (1986)
196. Nareyek, A.: Choosing search heuristics by non-stationary reinforcement learning. In: Metaheuristics: Computer Decision-Making, pp. 523-544. Kluwer, Norwell, MA (2004)
197. Nelson, W.: Applied Life Data Analysis. Wiley, New York, NY (1982)
198. Nonobe, K., Ibaraki, T.: A tabu search approach for the constraint satisfaction problem as a general problem solver. European Journal of Operational Research 106, 599-623 (1998)
199. Nudelm, E., Leyton-Brown, K., Hoos, H., Devk, A., Shoham Y.: Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. Principles and Practice of Constraint Programming-CP 2004: Tenth International Conference, CP 2004, Toronto, Canada, September 27-October 1, 2004: Proceedings (2004)
200. Oblow, E.: Pt: A stochastic tunneling algorithm for global optimization. Journal of Global Optimization 20(2), 191-208 (2001)
201. Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41(1-4), 421-451 (1993)
202. Osman, I. H., Wassan, N. A.: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. Journal of Scheduling 5(4), 287-305 (2002)
203. Osuna, E., Freund, R., Girosi, F.: Support vector machines: Training and applications. Tech. Rep. AIM-1602, MIT Artificial Intelligence Laboratory and Center for Biological and Computational Learning (1997)
204. Overmars, M. H.: Searching in the past ii: General transforms. Tech. Rep., Department of Computer Science, University of Utrecht, Utrecht, The Netherlands (1981)
205. Papadimitriou, C. H., Steiglitz, K.: Combinatorial Optimization, Algorithms and Complexity. Prentice-Hall, NJ (1982)
206. Parkes, A. J.: Clustering at the phase transition. In: AAAI/IAAI, pp. 340-345 (1997). URL citeseer. ist. psu. edu/parkes97clustering. html
207. Parr, R., Painter-Wakefield, C., Li, L., Littman, M.: Analyzing feature generation for valuefunction approximation. In: Proceedings of the Twenty-fourth International Conference on Machine Learning, pp. 737-744 (2007)
208. Patterson, D., Kautz, H.: Auto-walksat: A self-tuning implementation of walk-sat. Electronic Notes in Discrete Mathematics (ENDM) (2001)
209. Pelikan, M., Goldberg, D., Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21(1), 5-20 (2002)
210. Pelta, D., Sancho-Royo, A., Cruz, C., Verdegay, J.: Using memory and fuzzy rules in a cooperative multi-thread strategy for optimization. Information Sciences 176(13), 1849-1868 (2006)
211. Pincus, M.: A monte carlo method for the approximate solution of certain types of constrained optimization problems. Operations Research 18(6), 1225-1228 (1970)
212. Prais, M., Ribeiro, C. C.: Reactive grasp: An application to a matrix decomposition problem in tdma traffic assignment. Informs Journal on Computing 12(3), 164-176 (2000)
213. Quinlan, J. R.: Combining instance-based and model-based learning. In: Proceedings of the Tenth International Conference on Machine Learning, pp. 236-243. Morgan Kaufmann, Amherst, MA (1993). URL citeseer. ist. psu. edu/quinlan93combining. html
214. Rechenberg, I.: Evolutionsstrategie. Frommann-Holzboog (1973)
215. (reviewer), M. S.: The Wisdom of Crowds. American Journal of Physics 75, 190 (2007)
216. Robbins, H., Monro, S.: A stochastic approximation method. The Annals of Mathematical Statistics 22, 400-407 (1951)
217. Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1(1), 147-167 (1995)
218. Ruan, Y., Horvitz, E., Kautz, H.: Restart policies with dependence among runs: A dynamic programming approach. CP (2002). URL citeseer. ist. psu. edu/ruan02restart. html
219. Rubinstein, R.: Optimization of computer simulation models with rare events. European Journal of Operations Research 99, 89-112 (1997). URL citeseer. ist. psu. edu/rubinstein96optimization. html
220. Rubinstein, R.: The cross-entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability 1(2), 127-190 (1999)
221. Ryan, J., Bailey, T., Moore, J., Carlton, W.: Reactive tabu search in unmanned aerial reconnaissance simulations. In: Proceedings of the Thirtieth Conference on Winter Simulation, pp. 873-880 (1998)
222. Sarnak, N., Tarjan, R. E.: Planar point location using persistent search trees. Communications of the ACM 29(7), 669-679 (1986)
223. Schreiber, G. R., Martin, O. C.: Cut size statistics of graph bisection heuristics. SIAM Journal of Optimization 10(1), 231-251 (1999)
224. Schuurmans, D., Southey, F.: Local search characteristics of incomplete sat procedures. Artificial Intelligence 132(2), 121-150 (2001). DOI http://dx. doi. org/10. 1016/S0004-3702(01)00151-5
225. Schuurmans, D., Southey, F., Holte, R.: The exponentiated subgradient algorithm for heuristic boolean programming. In: Proceedings of the International Joint Conference on Artificial Intelligence, vol. 17, pp. 334-341. Lawrence Erlbaum associates, (2001)
226. Schwefel, H.: Numerical Optimization of Computer Models. Wiley, New York, NY (1981)
227. Selman, B., Kautz, H.: Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In: Proceedings of IJCAI-93, pp. 290-295 (1993)
228. Selman, B., Kautz, H.: An empirical study of greedy local search for satisfiability testing. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93). Washington, DC (1993)
229. Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the National Conference on Artificial Intelligence, vol. 12. Wiley, New York, NY (1994)
230. Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: M. Trick, D. S. Johson (eds.) Proceedings of the Second DIMACS Algorithm Implementation Challenge on Cliques, Coloring and Satisfiability, No. 26 in DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pp. 521-531 (1996)
231. Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 440-446. AAAI Press San Jose, CA (1992)
232. Selman, B., Mitchell, D. G., Levesque, H. J.: Generating hard satisfiability problems. Artificial Intelligence 81(1-2), 17-29 (1996). DOI http://dx. doi. org/10. 1016/0004-3702(95)00045-3
233. Siarry, P., Berthiau, G., Durdin, F., Haussy, J.: Enhanced simulated annealing for globally minimizing functions of many-continuous variables. ACM Transactions on Mathematical Software 23(2), 209-228 (1997). DOI http://doi. acm. org/10. 1145/264029. 264043
234. Singer, J., Gent, I., Smaill, A.: Backbone Fragility and the Local Search Cost Peak. Journal of Artificial Intelligence Research 12, 235-270 (2000). URL citeseer. ist. psu. edu/singer00backbone. html
235. Khanna, S., Motwani, R., Sudan, M., Vazirani, U.: On syntactic versus computational views of approximability. In: Proceedings of the Thirty-fifth Annual IEEE Symposium on Foundations of Computer Science, pp. 819-836 (1994)
236. Smith, B.: Phase transition and the mushy region in constraint satisfaction problems. In: Proceedings of the Eleventh European Conference on Artificial Intelligence, pp. 100-104 (1994)
237. Smith, R. E., Smith, J. E.: New methods for tunable random landscapes. In: W. N. Martin, W. M. Spears (eds.) Foundations of Genetic Algorithms 6. Morgan Kaufmann, Los Altos, CA (2001)
238. Smola, A. J., Schölkopf, B.: A tutorial on support vector regression. Tech. Rep. NeuroCOLT NC-TR-98-030, Royal Holloway College, University of London, UK (1998)
239. Southey, F.: Theory and Applications of Satisfiability Testing, chap. Constraint Metrics for Local Search, pp. 269-281. Springer, Berlin (2005)
240. de Souza, P. S., Talukdar, S. N.: Asynchronous organizations for multi-algorithm problems. In: SAC'93: Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing, pp. 286-293. ACM Press, New York, NY (1993). DOI http://doi. acm. org/10. 1145/162754. 162902
241. Steiglitz, K., Weiner, P.: Algorithms for computer solution of the traveling salesman problem. In: Proceedings of the Sixth Allerton Conference on Circuit and System Theory, Urbana, IL, pp. 814-821. IEEE, New York, NY (1968)
242. Streeter, M. J., Smith, S.: A simple distribution-free approach to the max k-armed bandit problem. In: Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP 2006) (2006)
243. Streeter, M. J., Smith, S. F.: An asymptotically optimal algorithm for the max k-armed bandit problem. In: AAAI (2006)
244. Strenski, P. N., Kirkpatrick, S.: Analysis of finite length annealing schedules. Algorithmica 6, 346-366 (1991)
245. Stutzle, T., Hoos, H., et al.: MAX-MIN ant system. Future Generation Computer Systems 16(8), 889-914 (2000)
246. Surowiecki, J.: The wisdom of crowds: Why the many are smarter than the few and how collective wisdom shapes business, economies, societies, and nations. Doubleday (2004)
247. Sutton, R., Barto, A.: Introduction to Reinforcement Learning. MIT Press Cambridge, MA (1998)
248. Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17, 443-455 (1991)
249. Talbi, E. G.: Parallel Combinatorial Optimization. Wiley, New York, NY (2006)
250. Tarjan, R. E.: Updating a balanced search tree in o(1) rotations. Information Processing Letters 16, 253-257 (1983)
251. Tompkins, D., Hoos, H.: Warped landscapes and random acts of SAT solving. In: Proceedings of the Eighth International Symposium on Artificial Intelligence and Mathematics (ISAIM-04) (2004)
252. Tompkins, F. H. D., Hoos, H.: Scaling and probabilistic smoothing: Efficient dynamic local search for sat. In: Proceedings of the Principles and Practice of Constraint Programming-CP 2002: Eighth International Conference, CP 2002, Ithaca, NY, September 9-13, LNCS, vol. 2470, pp. 233-248. Springer, Berlin (2002)
253. Toune, S., Fudo, H., Genji, T., Fukuyama, Y., Nakanishi, Y.: Comparative study of modern heuristic algorithms to service restoration in distribution systems. IEEE Transactions on Power Delivery 17(1), 173-181 (2002)
254. Valentini, G., Masulli, F.: Ensembles of learning machines. In: M. Marinaro, R. Tagliaferri (eds.) Neural Nets WIRN Vietri-02, LNCS. Springer, Heidelberg, Germany (2002). URL citeseer. ist. psu. edu/valentini02ensembles. html
255. Vapnik, V., Chervonenkis, A. J.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and Its Applications 16, 264-280 (1971)
256. Vapnik, V. N.: The Nature of Statistical Learning Theory. Springer, Berlin (1995)
257. Verhoeven, M., Aarts, E.: Parallel local search. Journal of Heuristics 1(1), 43-65 (1995)
258. Vossen, T., Verhoeven, M., ten Eikelder, H., Aarts, E.: A quantitative analysis of iterated local search. Computing Science Reports 95/06, Department of Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1995)
259. Voudouris, C., Tsang, E.: The tunneling algorithm for partial CSPs and combinatorial optimization problems. Tech. Rep. CSM-213 (1994). URL citeseer. ist. psu. edu/voudouris94tunneling. html
260. Voudouris, C., Tsang, E.: Partial constraint satisfaction problems and guided local search. In: Proceedings of Second International Conference on Practical Application of Constraint Technology (PACT 96), London, pp. 337-356 (1996)
261. Voudouris, C., Tsang, E.: Guided local search and its application to the traveling salesman problem. European Journal of Operational Research 113, 469-499 (1999)
262. Wah, B., Wu, Z.: Penalty formulations and trap-avoidance strategies for solving hard satisfiability problems. Journal of Computer Science and Technology 20(1), 3-17 (2005)
263. Wang, C., Tsang, E.: Solving constraint satisfaction problems using neural networks. In: Proceedings of the Second International Conference on Artificial Neural Networks, pp. 295-299 (1991)
264. Watson, J. P., Beck, J. C., Howe, A. E., Whitley, L. D.: Problem difficulty for tabu search in job-shop scheduling. Artificial Intelligence 143(2), 189-217 (2003). DOI http://dx. doi. org/10. 1016/S0004-3702(02)00363-6
265. Weinberger, E.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biologial Cybernetics 63, 325-336 (1990)
266. White, S.: Concepts of scale in simulated annealing. In: AIP Conference Proceedings, vol. 122, pp. 261-270 (1984)
267. Whitley, D., Gordon, V., Mathias, K.: Lamarckian Evolution, The Baldwin Effect and Function Optimization. In: Parallel Problem Solving from Nature-PPSN III: International Conference on Evolutionary Computation, Jerusalem, Israel. Springer, Berlin (1994)
268. Winter, T., Zimmermann, U.: Real-time dispatch of trams in storage yards. Annals of Operations Research 96, 287-315 (2000). URL citeseer. ist. psu. edu/winter00realtime. html
269. Wolpert, D. H., Macready, W. G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1), 67-82 (1997). URL citeseer. ist. psu. edu/wolpert96no. html
270. Woodruff, D. L., Zemel, E.: Hashing vectors for tabu search. Annals of Operations Research 41, 123-138 (1993)
271. Youssef, S., Elliman, D.: Reactive Prohibition-Based Ant Colony Optimization (RPACO): A New Parallel Architecture for Constrained Clique Sub-Graphs. In Proceedings of the Sixteenth IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04)0 pp. 63-71 (2004)
272. Zhang, Q.: On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm. IEEE Transactions on Evolutionary Computation 8(1), 80-93 (2004)
273. Zhang, Q., Muhlenbein, H.: On the convergence of a class of estimation of distribution algorithms. IEEE Transactions on Evolutionary Computation 8(2), 127-136 (2004)
274. Zhang, W., Dietterich, T.: A reinforcement learning approach to job-shop scheduling. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence 1114 (1995)
275. Zhang, W., Dietterich, T.: High-performance job-shop scheduling with a time-delay TD (λ) network. Advances in Neural Information Processing Systems 8, 1024-1030 (1996)
276. Zlochin, M., Birattari, M., Meuleau, N., Dorigo, M.: Model-based search for combinatorial optimization. Annals of Operations Research 131, 373-395 (2004)