Reactive search: Machine learning for memory-based heuristics

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 21-1-21-18

  Battiti, Roberto ^a   Brunato, Mauro ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84978737128     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (70)

1. Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., and Stewart, W., Designing and reporting on computational experiments with heuristic methods, J. Heuristics, 1(1), 9, 1995.
2. Hooker, J. N., Testing heuristics: we have it all wrong, J. Heuristics, 1(1), 33, 1995.
3. McGeoch, C. C., Toward an experimental method for algorithm simulation, INFORMS J. Comput., 8(1), 1, 1996.
4. Valiant, L. G., A theory of the learnable, CACM, 27(11), 1134, 1984.
5. Kearns, M. J. and Vazirani, U. V., An Introduction to Computational Learning Theory, The MIT Press, Cambridge, MA, 1994.
6. Kirkpatrick, S., Jr., Gelatt, C. D., and Vecchi, M. P., Optimization by simulated annealing, Science, 220, 671, 1983.
7. Battiti, R. and Tecchiolli, G., Simulated annealing and tabu search in the long run: a comparison on QAP tasks, Comput. Math. Appl., 28(6), 1, 1994.Most of the Battiti’s papers are available in postscript form at http://rtm.science.unitn.it/˜battiti/battiti-publications.html.
8. Battiti, R. and Tecchiolli, G., Local search with memory: benchmarking RTS, Oper. Res. Spektrum, 17(2/3), 67, 1995.
9. Aarts, E. H. L., Korst, J. H. M., and Zwietering, P. J., Deterministic and randomized local search, in Mathematical Perspectives on Neural Networks, Mozer, M., Smolensky, P., and Rumelhart, D., Eds., Lawrence Erlbaum Publishers, Hillsdale, NJ, 1995.
10. Ferreira, A. G. and Zerovnik, J., Bounding the probability of success of stochastic methods for global optimization, Comput. Math. Appl., 25, 1, 1993.
11. Chiang, T. S. and Chow, Y., On the convergence rate of annealing processes, SIAM J. Control and Optimization, 26(6), 1455, 1988.
12. Strenski, P. N. and Kirkpatrick, S., Analysis of finite length annealing schedules, Algorithmica, 6, 346, 1991.
13. Glover, F., Tabu search—part I, ORSA J. Comput., 1(3), 190, 1989.
14. Steiglitz, K. and Weiner, P., Algorithms for computer solution of the traveling salesman problem, in Proc. 6th Allerton Conf. on Circuit and System Theory, Urbana, Illinois, 1968, p. 814.
15. Lin, S., Computer solutions of the travelling salesman problems, Bell Syst. Tech. J., 44(10), 2245, 1965.
16. Papadimitriou, C. H. and Steiglitz, K., Combinatorial Optimization, Algorithms and Complexity, Prentice-Hall, New Jersey, 1982.
17. Glover, F., Tabu search—part II, ORSA J. Comput., 2(1), 4, 1990.
18. Hansen, P. and Jaumard, B., Algorithms for the maximum satisfiability problem, Computing, 44, 279, 1990.
19. Glover, F., Tabu search: improved solution alternatives, in Mathematical Programming, State of the Art, Birge, J. R. and Murty, K. G., Eds., The University of Michigan, Michigan, 1994, p. 64.
20. Battiti, R. and Tecchiolli, G., The reactive tabu search, ORSA J. Comput., 6(2), 126, 1994.
21. Woodruff, D. L. and Zemel, E., Hashing vectors for tabu search, Ann. Oper. Res., 41, 123, 1993.
22. Battiti, R., Time- and Space-Efficient Data Structures for History-Based Heuristics, Technical report UTM-96-478, Dip. di Matematica, Univ. di Trento, 1996.
23. Battiti, R., Partially persistent dynamic sets for history-sensitive heuristics, in Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Challenges, Johnson, D. S., Goldwasser, M. H., and McGeoch, C. C., Eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 59, AMS, Providence, RI, 2002, p. 1.
24. Driscoll, J. R., Sarnak, N., Sleator, D. D., and Tarjan, R. E., Making data structures persistent, in Proc. of STOC, 1986.
25. Overmars, M. H., Searching in the Past II: General Transforms, Technical report, Department of Computer Science, University of Utrecht, The Netherlands, 1981.
26. Bayer, R., Symmetric binary B-trees: data structure and maintenance algorithms, Acta Inform., 1, 290, 1972.
27. Guibas, L. J. and Sedgewick, R., A dichromatic framework for balanced trees, in Proc. of FOCS, 1978, p. 8.
28. Tarjan, R. E., Updating a balanced search tree in O(1) rotations, Inf. Process. Lett., 16, 253, 1983.
29. Maier, D., and Salveter, S. C., Hysterical B-trees, Inf. Process. Lett., 12(4), 199, 1981.
30. Dammeyer, F. and Voss, S., Dynamic tabu list management using the reverse elimination method, Ann. Oper. Res., 41, 31, 1993.
31. Sarnak, N. and Tarjan, R. E., Planar point location using persistent search trees, CACM, 29(7), 669, 1986.
32. Johnson, D. S., Aragon, C. R., McGeoch, L. A., and Schevon, C., Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning, Oper. Res., 39(3), 378, 1991.
33. Battiti, R. and Protasi, M., Reactive local search for the maximum clique problem, Algorithmica, 29(4), 610, 2001.
34. Fox, B. L., Simulated annealing: folklore, facts, and directions, in Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Niederreiter, H. and Shiue, P. J.-S., Eds., Springer, Berlin, 1995.
35. Battiti, R. and Tecchiolli, G., Training neural nets with the reactive tabu search, IEEE Trans. Neural Networks, 6(5), 1185, 1995.
36. Chiang, W. C. and Russell, R. A., A reactive tabu search metaheuristic for the vehicle routing problem with time windows, INFORMS J. Comput., 9, 417, 1997.
37. Osman, I. H. and Wassan, N. A., Areactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, J. Scheduling, 5(4), 287, 2002.
38. Bräysy, O., A reactive variable neighborhood search for the vehicle-routing problem with time windows, INFORMS J. Comput., 15(4), 347, 2003.
39. Kincaid, R. K. and Labal, K. E., Reactive tabu search and sensor selection in active structural acoustic control problems, J. Heuristics, 4(3), 199, 1998.
40. Anzellotti, G., Battiti, R., Lazzizzera, I., Soncini, G., Zorat, A., Sartori, A., Tecchiolli, G., and Lee, P., TOTEM: a highly parallel chip for triggering applications with inductive learning based on the reactive tabu search, Int. J. Mod. Phys. C, 6(4), 555, 1995.
41. Battiti, R. and Bertossi, A. A., Greedy, prohibition, and reactive heuristics for graph partitioning, IEEE Trans. Comput., 48(4), 361, 1999.
42. Toune, S., Fudo, H., Genji, T., Fukuyama, Y., and Nakanishi, Y., Comparative study of modern heuristic algorithms to service restoration in distribution systems, IEEE Trans. Power Delivery, 17(1), 173, 2002.
43. Battiti, R. and Protasi, M., Reactive search, a history-sensitive heuristic for MAX-SAT, ACM J. Exp. Algorithmics, 2, 1997.
44. Battiti, R. and Protasi, M., Reactive local search techniques for themaximumk-conjunctive constraint satisfaction problem, Discrete Appl. Math., 96–97, 3, 1999.
45. Nonobe, K. and Ibaraki, T., A tabu search approach for the constraint satisfaction problem as a general problem solver, Eur. J. Oper. Res., 106, 599, 1998.
46. Battiti, R. and Tecchiolli, G., The continuous reactive tabu search: blending combinatorial optimization and stochastic search for global optimization, Ann. Oper. Res.—Metaheuristics Comb. Optimization, 63, 153, 1996.
47. Chelouah, R. and Siarry, P., Tabu search applied to global optimization, Eur. J. Oper. Res., 123, 256, 2000.
48. Battiti, R. and Brunato, M., Reactive search for traffic grooming in WDM networks, in Evolutionary Trends of the Internet, IWDC2001, Palazzo, S., Ed., Lecture Notes in Computer Science, Vol. 2170, Springer, Berlin, 2001, p. 56.
49. Winter, T. and Zimmermann, U., Real-time dispatch of trams in storage yards, Ann. Oper. Res., 96, 287, 2000.
50. Fortz, B. and Thorup, M., Increasing Internet capacity using local search, Comput. Optimization Appl., 29(1), 13, 2004.
51. Ausiello, G., Crescenzi, P., and Protasi, M., Approximate solution of NP optimization problems, Theor. Comput. Sci., 150, 1, 1995.
52. Crescenzi, P. and Kann, V., A Compendium of NP Optimization Problems, Technical report, 1996, electronic notes: http://www.nada.kth.se/˜viggo/problemlist/compendium.html.
53. Bellare, M., Goldreich, O., and Sudan, M., Free bits, PCP and non-approximability—towards tight results, Proc. of FOCS, 1995, p. 422.
54. Hastad, J., Clique is hard to approximate within n1−ϵ, Proc. of FOCS, 1996, p. 627.
55. Johnson, D. S. and Trick, M., Eds., Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, AMS, Providence, RI, 1996.
56. Pardalos, P. M. and Xu, J., The maximum clique problem, J. Global Optimization, 4, 301, 1994.
57. Soriano, P. and Gendreau, M., Tabu Search Algorithms for the Maximum Clique Problem, Technical report CRT-968, Centre de Recherche sur les Transports, Universite de Montreal, Canada, 1994.
58. Pelikan, M., Goldberg, D. E., and Lobo, F., Asurvey of optimization by building and using probabilistic models, Comput. Optimization Appl., 21(1), 5, 2002.
59. Baluja, S. and Davies, S., Using optimal dependency trees for combinatorial optimization: learning the structure of the search space, in Proc. 14th Int. Conf.Machine Learning, Fisher, D. H., Ed., Morgan Kaufmann, San Mateo, CA, 1997, p. 30.
60. Syswerda, G., Simulated crossover in genetic algorithms, in Foundations of Genetic Algorithms, Whitley, D. L., Ed., Morgan Kaufmann, San Mateo, CA, 1993, p. 239.
61. Eiben, A. E., Hinterding, R., and Michalewicz, Z., Parameter control in evolutionary algorithms, IEEE Trans. Evol. Comput., 3(2), 124, 1999.
62. Merz, P. and Freisleben, B., Fitness landscape analysis and memetic algorithms for the quadratic assignment problem, IEEE Trans. Evol. Comput., 4(4), 337, 2000.
63. Moore, A. W. and Schneider, J., Memory-based stochastic optimization, in Advances in Neural Information Processing Systems, Vol. 8, Touretzky, D. S., Mozer, M. C., and Hasselmo, M. E., Eds., The MIT Press, Cambridge, MA, 1996, p. 1066.
64. Dubrawski, A. and Schneider, J., Memory based stochastic optimization for validation and tuning of function approximators, Conference on AI and Statistics, 1997.
65. Voudouris, Ch. and Tsang, E., Guided local search and its application to the traveling salesman problem, Eur. J. Oper. Res., 113, 469, 1999.
66. Boyan, J. A. and Moore, A. W., Learning evaluation functions for global optimization and boolean satisfiability, Proc. 15th National Conf. on Artificial Intelligence (AAAI), AAAI Press, Menlo Park, CA, USA, 1998, p. 3.
67. Dorigo, M., Maniezzo, V., and Colorni, A., Ant system: optimization by a colony of cooperating agents, IEEE Trans. Syst., Man Cybernetics, Part B, 26(1), 29, 1996.
68. Gambardella, L. M., Taillard, E. D., and Dorigo, M., Ant colonies for the quadratic assignment problem, J. Oper. Res. Soc., 50(2), 167, 1999.
69. Hutter, F., Tompkins, D. A.D., and Hoos, H.H., Scaling and probabilistic smoothing: efficient dynamic local search for SAT, in Proc. of CP-02, Lecture Notes on Computer Science, Vol. 2470, Springer, Berlin, 2002, p. 233.
70. Hoos, H. H. and Stuetzle, T., Stochastic Local Search: Foundations and Applications, Morgan Kaufmann, San Mateo, CA, 2005.