Tabu Search

F. Glover and M. Laguna
Kluwer Academic Publishers, Boston, July 1997.

horizontal rule

 

Table of Contents

 
bullet TABU SEARCH BACKGROUND
bulletGeneral Tenets
bulletUse of Memory
bulletIntensification and Diversification
bulletAdaptive Memory Programming
bulletIs Memory Really a Good Idea?
bulletPoints of Departure
bulletElements of Adaptive Memory
bulletHistorical Note on Tabu Search
bulletHistorical Note on Meta-Heuristics
bulletDiscussion Questions and Exercises

 

bulletTS FOUNDATIONS: SHORT TERM MEMORY
bulletMemory and Tabu Classifications
bulletRecency-Based Memory
bulletA First Level Tabu Search Approach
bulletRecency-Based Memory for Add/Drop Moves
bulletTabu Tenure
bulletDiscussion Questions and Exercises

 

bulletTS FOUNDATIONS: ADDITIONAL ASPECTS OF SHORT TERM MEMORY
bulletTabu Search and Candidate List Strategies
bulletSome General Classes of Candidate List Strategies
bulletConnections Between Candidate Lists, Tabu Status and Aspiration Criteria
bulletLogical Restructuring
bulletSpecial Cases and Extensions of Recency-Based Implementations
bulletDiscussion Questions and Exercises

 

bulletTS FOUNDATIONS: LONGER TERM MEMORY
bulletFrequency-Based Approach
bulletIntensification Strategies
bulletDiversification Strategies
bulletStrategic Oscillation
bulletPath Relinking
bulletThe Intensification / Diversification Distinction
bulletSome Basic Memory Structures for Longer Term Strategies
bulletDiscussion Questions and Exercises

 

bulletTABU SEARCH PRINCIPLES
bulletInfluence and Measures of Distance and Diversity
bulletThe Principle of Persistent Attractiveness
bulletThe Principle of Persistent Voting
bulletCompound Moves, Variable Depth and Ejection Chains
bulletThe Proximate Optimality Principle
bulletThe Principle of Congenial Structures
bulletThe Pyramid Principle
bulletThe Space/Time Principle
bulletDiscussion Questions and Exercises

 

bulletTABU SEARCH IN INTEGER PROGRAMMING
bulletA Tabu Branching Method
bulletTabu Search and Cut Search
bulletCut Search
bulletStar Paths for Integer Programs
bulletBranching on Created Variables
bulletDiscussion Questions and Exercises

 

bulletSPECIAL TABU SEARCH TOPICS
bulletProbabilistic Tabu Search
bulletTabu Thresholding
bulletSpecial Dynamic Tabu Tenure Strategies
bulletHash Functions
bulletEjection Chains
bulletVocabulary Building
bulletParallel Processing
bulletDiscussion Questions and Exercises

 

bulletTABU SEARCH APPLICATIONS
bulletPlanning and Scheduling
bulletTelecommunications
bulletParallel Computing
bulletTransportation, Routing and Network Design
bulletOptimization on Structures
bulletOptimization on Graphs
bulletNeural Networks and Learning
bulletContinuous and Stochastic Optimzation
bulletManufacturing
bulletFinancial Analysis
bulletSpecialized Techniques and General Zero-One Solvers
bulletConstraint Satisfaction and Satisfiability

 

bulletCONNECTIONS, HYBRID APPROACHES AND LEARNING
bulletSimulated Annealing
bulletGenetic Algorithms
bulletScatter Search
bulletGreedy Randomized Adaptive Search Procedures
bulletNeural Networks
bulletTarget Analysis
bulletDiscussion Questions and Exercises
bulletAppendix: Illustrative Version of Nonlinear Scatter Search

 

bulletNEGLECTED TABU SEARCH STRATEGIES
bulletCandidate List Strategies
bulletProbabilistic Tabu Search
bulletIntensification Approaches
bulletDiversification Approaches
bulletClustering and Conditional Analysis
bulletReferent-Domain Optimization
bulletDiscussion Questions and Exercises

 

bulletREFERENCES
bulletINDEX

 

horizontal rule