Data-mining-driven neighborhood search

INFORMS Journal on Computing

Volumn 24, Issue 2, 2012, Pages 210-227

  Samorani, Michele ^a   Laguna, Manuel ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Data mining; Metaheuristic optimization; Neighborhood search; Off line learning

Indexed keywords

ACCEPTANCE CRITERIA; BANDWIDTH MINIMIZATION PROBLEM; COMPUTATIONAL RESULTS; CONSTRAINED TASKS; GENERAL APPROACH; LEARNING PROCESS; LOCAL OPTIMA; LOCAL OPTIMALITY; META-HEURISTIC APPROACH; METAHEURISTIC OPTIMIZATION; NEIGHBORHOOD SEARCH; OFF-LINE LEARNING; SIMPLE TABU SEARCH; SOLUTION PROCESS; STATE-OF-THE-ART METHODS; VARIABLE NEIGHBORHOOD SEARCH;

DATA MINING; SIMULATED ANNEALING;

TABU SEARCH;

EID: 84862009190     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1110.0451     Document Type: Article

References (23)

1. Better, M., F. Glover, M. Samorani. 2010. Classification by vertical and cutting multi-hyperplane decision tree induction. Decision Support Systems 48 (3) 430-436.
2. Boyan, J., W. Buntine, A. Jagota, eds. 2000. Statistical Machine Learning for Large-Scale Optimization. Neural Computing Surveys, Vol. 3. http://ftp.icsi.berkeley.edu/ftp/pub/ai/jagota/vol3-1.pdf
3. Chen, W.-H., C.-S. Lin. 2000. A hybrid heuristic to solve a task allocation problem. Comput. Oper. Res. 27 (3) 287-303.
4. Domingos, P. 1999. The role of Occam's razor in knowledge discovery. Data Mining Knowledge Discovery 3 (4) 409-425.
5. Ernst, A., H. Jiang, M. Krishnamoorthy. 2006. Exact solutions to task allocation problems. Management Sci. 52 (10) 1634-1646. (Pubitemid 44556066)
6. Fawcett, T. 2006. An introduction to ROC analysis. Pattern Recogn. Lett. 27 (8) 861-874.
7. Feo, T. A., M. G. C. Resende. 1995. Greedy randomized adaptive search procedures. J. Global Optim. 6 (2) 109-133.
8. Glover, F. 1990. Improved linear programming models for discriminant analysis. Decision Sci. 21 (4) 771-785.
9. Glover, F., G. A. Kochenberger, eds. 2003. Handbook of Metaheuristics, Vol. 57. Springer, New York.
10. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Boston.
11. Glover, F., D. Klingman, N. V. Phillips. 1989. A network-related nuclear power plant model with an intelligent branch-andbound solution approach. Ann. Oper. Res. 21 (1) 317-331.
12. Glover, F., M. Laguna, R. Marti. 2003. Scatter search and path relinking: Advances and applications. F. Glover, G. A. Kochenberger, eds. Handbook of Metaheuristics, Vol. 57. Springer, New York, 1-36.
13. Hadj-Alouane, A. B., J. C. Bean, K. G. Murty. 1999. A hybrid genetic/optimization algorithm for a task allocation problem. J. Scheduling 2 (4) 189-201. (Pubitemid 129633853)
14. Höhn, C., C. R. Reeves. 1996. The crossover landscape for the onemax problem. J. Alander, ed. Proc. 2nd Nordic Workshop Genetic Algorithms Their Appl. University of Vaasa Press, Vaasa, Finland, 27-43.
15. Jourdan, L., C. Dhaenens, E.-G. Talbi. 2006. Using datamining techniques to help metaheuristics: A short survey. F. Almeida, M. J. Blesa Aguilera, C. Blum, J. M. Moreno Vega, M. Pérez Pérez, A. Roli, M. Sampels, eds. Hybrid Metaheuristics. Lecture Notes in Computer Science, Vol. 4030. Springer, Berlin, 57-69. (Pubitemid 44577448)
16. Lusa, A., C. N. Potts. 2008. A variable neighbourhood search algorithm for the constrained task allocation problem. J. Oper. Res. Soc. 59 (6) 812-822. (Pubitemid 351641214)
17. Martí, R., V. Campos, E. Piñana. 2008. A branch and bound algorithm for the matrix bandwidth minimization. Eur. J. Oper. Res. 186 (2) 513-528. (Pubitemid 47615316)
18. Martí, R., M. Laguna, F. Glover, V. Campos. 2001. Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135 (2) 450-459. (Pubitemid 32842079)
19. Mladenović, N., P. Hansen. 1997. Variable neighborhood search. Comput. Oper. Res. 24 (11) 1097-1100.
20. Padmanabhan, B., A. Tuzhilin. 2003. On the use of optimization for data mining: Theoretical interactions and eCRM opportunities. Management Sci. 49 (10) 1327-1343.
21. Piñana, E., I. Plana, V. Campos, R. Martí. 2004. GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153 (1) 200-210.
22. Santos, L. F., S. L. Martins, A. Plastino. 2008. Applications of the DM-GRASP heuristic: A survey. Internat. Trans. Oper. Res. 15 (4) 387-416.
23. Witten, I. H., E. Frank. 2005. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann, Amsterdam.