| Foreword | p. xi |
| Preface | p. xv |
| Acknowledgments | p. xvii |
| Introduction | p. 1 |
| Historical Background | p. 4 |
| Original Proposal - 1977 | p. 4 |
| Scatter / Tabu Search Hybrid - 1990 | p. 6 |
| Scatter Search Template - 1998 | p. 8 |
| Basic Design | p. 11 |
| Summary of Notation | p. 14 |
| C Code Conventions | p. 16 |
| Tutorial: Unconstrained Nonlinear Optimization | p. 23 |
| Diversification Generation Method | p. 24 |
| Computer Code | p. 26 |
| Improvement Method | p. 28 |
| Computer Code | p. 29 |
| Reference Set Update Method | p. 31 |
| Computer Code | p. 33 |
| Subset Generation Method | p. 37 |
| Computer Code | p. 38 |
| Combination Method | p. 39 |
| Computer Code | p. 40 |
| Overall Procedure | p. 41 |
| Computer Code | p. 44 |
| Summary of C Functions | p. 46 |
| Tutorial: 0-1 Knapsack Problems | p. 49 |
| Diversification Generation Method | p. 50 |
| Computer Code | p. 52 |
| Improvement Method | p. 55 |
| Computer Code | p. 57 |
| Reference Set Update Method | p. 59 |
| Computer Code | p. 61 |
| Subset Generation Method | p. 62 |
| Combination Method | p. 63 |
| Computer Code | p. 64 |
| Overall Procedure | p. 65 |
| Computer Code | p. 66 |
| Summary of C Functions | p. 67 |
| Tutorial: Linear Ordering Problem | p. 69 |
| The Linear Ordering Problem | p. 69 |
| Diversification Generation Method | p. 71 |
| Computer Code | p. 74 |
| Improvement Method | p. 76 |
| Computer Code | p. 79 |
| Reference Set Update Method | p. 82 |
| Combination Method | p. 83 |
| Computer Code | p. 85 |
| Summary of C Functions | p. 86 |
| Advanced Scatter Search Designs | p. 89 |
| Reference Set | p. 90 |
| Dynamic Updating | p. 91 |
| Rebuilding and Multi-Tier Update | p. 93 |
| Rebuilding | p. 94 |
| 2-Tier Update | p. 95 |
| 3-Tier Update | p. 99 |
| Solution Duplication and Diversity Control | p. 102 |
| Minimum Diversity Test | p. 103 |
| Hashing | p. 105 |
| Subset Generation | p. 107 |
| Specialized Combination Methods | p. 112 |
| Variable Number of Solutions | p. 114 |
| Binary Variables | p. 116 |
| Diversification Generation | p. 118 |
| Experimental Design | p. 118 |
| GRASP Constructions | p. 120 |
| Use of Memory in Scatter Search | p. 123 |
| Tabu Search | p. 124 |
| Explicit Memory | p. 128 |
| Attributive Memory | p. 130 |
| Diversification | p. 131 |
| Computer Code | p. 133 |
| Intensification | p. 135 |
| Computer Code | p. 136 |
| Reference Set | p. 138 |
| Connections with Other Population-Based Approaches | p. 141 |
| Genetic Algorithms | p. 142 |
| SS and GA Comparison | p. 146 |
| Improvement Method | p. 149 |
| Combination Method | p. 150 |
| Computational Testing | p. 154 |
| Path Relinking | p. 160 |
| Simultaneous Relinking | p. 166 |
| Dealing with Infeasibility | p. 167 |
| Extrapolated Relinking | p. 168 |
| Multiple Guiding Solutions | p. 170 |
| Constructive Neighborhoods | p. 172 |
| Vocabulary Building | p. 173 |
| Computer Code | p. 177 |
| Intensification and Diversification | p. 180 |
| Scatter Search Applications | p. 185 |
| Neural Network Training | p. 185 |
| Computer Code | p. 187 |
| Multi-Objective Bus Routing | p. 189 |
| Arc Crossing Minimization in Graphs | p. 191 |
| Maximum Clique | p. 193 |
| Graph Coloring | p. 195 |
| Periodic Vehicle Loading | p. 197 |
| Capacitated Multicommodity Network Design | p. 198 |
| Job-Shop Scheduling | p. 201 |
| Capacitated Chinese Postman Problem | p. 202 |
| Testing Population Designs | p. 204 |
| Vehicle Routing | p. 206 |
| Binary Mixed Integer Programming | p. 208 |
| Pivot Based Search with Branch and Bound | p. 208 |
| Generate Diverse Solutions | p. 210 |
| Iterated Re-start Procedures | p. 212 |
| Parallelization for the P-Median | p. 215 |
| OptQuest Application | p. 217 |
| Commercial Scatter Search Implementation | p. 219 |
| General OCL Design | p. 223 |
| Constraints and Requirements | p. 225 |
| OCL Functionality | p. 227 |
| Defining Constraints and Requirements | p. 232 |
| Boundary Search Strategy | p. 235 |
| Computational Experiments | p. 239 |
| Conclusions | p. 245 |
| Appendix | p. 246 |
| Experiences and Future Directions | p. 255 |
| Experiences and Findings | p. 256 |
| Diversification Generation | p. 256 |
| Improvement Method | p. 258 |
| Reference Set Update Method | p. 260 |
| Subset Generation Method | p. 263 |
| Combination Method | p. 264 |
| Multi-Objective Scatter Search | p. 266 |
| Independent Sampling Technique | p. 269 |
| Criterion Selection Technique | p. 269 |
| Aggregation Selection Technique | p. 270 |
| Pareto Sampling | p. 270 |
| Maximum Diversity Problem | p. 271 |
| Implications for Future Developments | p. 274 |
| References | p. 277 |
| Index | p. 285 |
| Table of Contents provided by Ingram. All Rights Reserved. |