Proposals for chunking and tabu search

European Journal of Operational Research

Volumn 106, Issue 2-3, 1998, Pages 585-598

  Woodruff, David L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Heuristics; Multivariate statistics; Optimization; Solution space metrics; Tabu search

Indexed keywords

COMPUTATIONAL METHODS; DECISION THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SIMULATED ANNEALING; STATISTICAL METHODS;

CHUNKING; MULTIVARIATE STATISTICS; SOLUTION SPACE METRICS; TABU SEARCH METHODS;

OPERATIONS RESEARCH;

EID: 0032049133     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00293-2     Document Type: Article

References (34)

1. T.W. Anderson, An Introduction to Multivariate Statistical Analysis, Wiley, New York, 1984.
2. R. Battiti, G. Tecchiolli, The reactive tabu search, ORSA Journal on Computing 6 (1994) 126-140.
3. P. Billingsley, Probability and Measure, Wiley, New York, 1979.
4. L. Breiman, Probability and Stochastic Processes, Houghton Mifflin, Boston, MA, 1969.
5. L. Davis (Ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
6. A.J. Duncan, Quality Control and Industrial Statistics, Irwin, Homewood, IL, 1986.
7. F. Glover, Tabu search - Part I, ORSA Journal on Computing 1 (3) (1989) 190-206.
8. F. Glover, Tabu search Part II, ORSA Journal on Computing 2(1) (1990) 4-32.
9. F. Glover, Candidate list strategies and tabu search. Technical Report, Center for Applied Artificial Intelligence, Box 419, University of Colorado, Boulder, CO, 80309, 1989.
10. F. Glover, Tabu thresholding: Improved search by non-monotonic trajectories, ORSA Journal on Computing 4 (1995) 426-442.
11. F. Glover, Tabu search and adaptive memory programming - advances, applications and challenges, in R.S. Barr et al. (Eds.), Interfaces in Computer Science and Operations Research, Kluwer, 1997.
12. F. Glover, J. Kelly, M. Laguna, Genetic algorithms and tabu search: Hybrids for optimization. Technical Report, Campus Box 419, University of Colorado. Boulder CO 80309-0419, 1992.
13. F. Glover, Scatter search and star-paths: Beyond the genetic metaphor, Technical Report, Campus Box 419, University of Colorado, Boulder CO 80309-0419, 1993.
14. B. Hajek, Cooling schedules for optimal annealing, Mathematics of Operations Research 13 (1988) 311-329.
15. A.P. Hurter, M.G. Van Buer, The newspaper production/ distribution problem: Medium sized newspapers, Working Paper, IE/MS, Northwestern University, 1993.
16. A.P. Hurter, M.G. Van Buer, The newspaper production/ distribution problem, Journal of Business Logistics 17 (1996) 85-105.
17. L. Ingber, B. Rosen, Very Fast Simulated Annealing, AT&T Bell Labs, Murray Hill, NJ, 1992.
18. J.P. Kelly, J. Xu, Tabu search and vocabulary building for routing problems, Graduate School of Business Administration, University of Colorado at Boulder, 1995.
19. J. Laird, P. Rosenbloom, A. Newell, Chunking in soar: The anatomy of a general learning mechanism. Machine Learning 1 (1982) 11-46.
20. J. Laird, P. Rosenbloom, A. Newell, Universal Subgoaling and Chunking, Kluwer Academic Publishers, Dordrecht, 1986.
21. R.S. Michalski, Inferential theory of learning as a conceptual basis for multistrategy learning, Machine Learning 11 (1993) 111-151.
22. G.A. Mitchell, The magic number seven, plus or minus two: Some limits on our capacity for processing information. Psychological Review 63 (1956) 81-97.
23. D.F. Morrison, Multivariate Statistical Methods, McGraw Hill, New York, 1990.
24. H. Mühlenbein, D. Schlierkamp-Vosen, The science of breeding and its application to the breeder genetic algorithm, Evolutionary Computation 1 (1994) 335-360.
25. J. Nieverget, Information content of chess positions: Implications for game-specific knowledge of chess players, Machine Intelligence 12 (1991) 283-289.
26. Y. Rochat, E.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167.
27. M.M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research 35 (1987) 254-265.
28. K.Y. Tam, Automated construction of knowledge-Bases from examples, Information Systems Research 1 (1990) 144-167.
29. E.D. Taillard, G. Laporte, M. Gendreau, A new neighbourhood structure for the vehicle routing problem with time windows, Publication DRT-95-66, Centre de recherche sur les transports, Université dé Montréal, 1995.
30. M. Tambe, A. Newell, P. Rosenbloom, The problem of expensive chunks and its solution by restricting expressiveness, Machine Learning 5 (1990) 299-348.
31. D.L. Woodruff, Ghost image processing for minimum covariance determinants, ORSA Journal on Computing 4 (1995) 468-473.
32. D.L. Woodruff, E. Zemel, Hashing vectors for tabu search, Annals of Operations Research 41 (1993) 123-137.
33. D.L. Woodruff, D.M. Rocke, Computable robust estimation of multivariate location and shape in high dimension using compound estimators, Journal of the American Statistical Association 89 (1994) 888-896.
34. D.L. Woodruff, Chunking applied to reactive tabu search, in: I.H. Osman, J.P. Kelly (Eds.), Metaheuristics: Theory and Application, 1995, pp. 555-570.