Scatter search: Methodology and implementations in C

Operations Research/ Computer Science Interfaces Series

Volumn 24, Issue , 2003, Pages 1-283

  Laguna, Manuel ^a   Marti, Rafael ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF VALENCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80052267674     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-0337-8     Document Type: Article

References (122)

1. Aggarwal, C. C., J. B. Orlin and R. P. Tai (1997) "Optimized Crossover for the Independent Set Problem," Operations Research, vol. 45, pp. 226-234.
2. Aiex, R.M., M.G.C. Resende, P.M. Pardalos and G. Toraldo (2000) "GRASP with Path Relinking for the Three-index Assignment Problem," Technical Report.
3. Aiex, R.M., M.G.C. Resende and C.C. Ribeiro (2002) "Probability Distribution of Solution Time in GRASP: An Experimental Investigation," Journal of Heuristics, vol. 8, pp. 343-373.
4. Atan, T. and N. Secomandi (1999) "A Rollout-Based Application of the Scatter Search/Path Relinking Template to the Multi-Vehicle Routing Problem with Stochastic Demands and Restocking," Technical Report, PROS Revenue Management Inc., Houston, TX.
5. Balas, E. and W. Niehaus (1998) "Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems," Journal of Heuristics, vol. 4, no. 2, pp. 107-124.
6. Barnes, J. W. and L. K. Vanston (1981) "Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs," Operations Research, vol. 29, no. 1.
7. Becker, O. (1967) "Das Helmstadtersche Reihenfolgeproblem - die Effizienz verschiedener Naherungsverfahren," in Computer Uses in the Social Sciences, Berichteiner Working Conference, Wien.
8. Bulut, G. (2001) "Robust Multi-Scenario Optimization of an Air Expeditionary Force Structure Applying Scatter Search to the Combat Forces Assessment Model," M.S. Thesis, AFIT/GOR/ENS/01M-05, Air Force Institute of Technology.
9. Campos, V., M. Laguna and R. Marti (1999) "Scatter Search for the Linear Ordering Problem," in New Ideas in Optimization, Come, Dorigo and Glover (Eds.), McGraw-Hill, pp. 331-341.
10. Campos, V., F. Glover, M. Laguna and R. Marti (2001) "An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem," Journal of Global Optimization, vol. 21, no. 4, pp. 397-414.
11. Campos, V., M. Laguna and R. Marti (2001) "Context-Independent Scatter and Tabu Search for Permutation Problems," University of Colorado at Boulder, http://leeds.colorado.edu/faculty/laguna/articles/sstsperm.html.
12. Cavique, L., C. Rego and I. Themido (2001) "A Scatter Search Algorithm for the Maximum Clique Problem," in Essays and Surveys in Metaheuristics, C.C. Ribeiro and P. Hansen (Eds.), Kluwer Academic Publishers.
13. Canuto, S.A. (2000) "Local Search for the Prize-collecting Steiner Tree Problem," (in Portuguese), M.S. Thesis, Department of Computer Science, Catholic University of Rio de Janeiro.
14. Canuto, S. A., M. G. C. Resende and C. C. Ribeiro (2001) "Local Search with Perturbations for the Prize-Collecting Steiner Tree Problem in Graphs," Networks, vol. 38, pp. 50-58.
15. Chanas, S. and P. Kobylanski (1996) "A New Heuristic Algorithm Solving the Linear Ordering Problem," Computational Optimization and Applications, vol. 6, pp. 191-205.
16. Coello, C. A., D. A. Van Veldhuizen and G. B. Lamont (2002) Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic / Plenum Publishers, New York.
17. Consiglio, A. and S. A. Zenios (1999) "Designing Portfolios of Financial Products via Integrated Simulation and Optimization Models," Operations Research, vol. 47, pp. 195-208.
18. Corberan, A., E. Femandez, M. Laguna and R. Marti (2002) "Heuristic Solutions to the Problem of Routing School Buses with Multiple Objectives," Journal of the Operational Research Society, vol. 53, no. 4, pp. 427-435.
19. Cung, V-D., T. Mautor, P. Michelon and A. Tavares (1996) "Scatter Search for the Quadratic Assignment Problem," Technical Report #1996/37, Laboratoire PRiSM, http://www.prism.uvsq.fr/rapports/1996/docuemtn199637.ps.
20. Cung, V.-D., T. Mautor, P. Michelon and A. Tavares (1997) "A Scatter Search Based Approach for the Quadratic Assignment Problem," in Proceedings of IEEE-ICEC-EPS'97, IEEE International Conference on Evolutionary Computation and Evolutionary Programming Conference, T. Back, Z. Michalewicz and X. Yao (Eds.), pp. 165-170.
21. Cung, V.D., S.L. Martins, C.C. Ribeiro and C. Roucairol (2001) "Strategies for the Parallel Implementation of Metaheuristics," in Essays and Surveys in Metaheuristics, C.C. Ribeiro and P. Hansen (Eds.), Kluwer Academic Publishers, pp. 263-308.
22. Delgado, C., M. Laguna and J. Pacheco (2002) "Minimizing Labor Requirements in a Periodic Vehicle Loading Problem," Technical Report, University of Burgos, Spain.
23. Dome, R. and J.K. Hao (1998) "Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings," in Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I.H. Osman and C. Roucairol (Eds.), Kluwer Academic Publishers, pp. 77-92.
24. Dueck, G. H. and J. Jeffs (1995) "A Heuristic Bandwidth Reduction Algorithm," J. of Combinatorial Math, and Comp., vol. 18, pp. 97-108.
25. Eades, P. and D. Kelly (1986) "Heuristics for Drawing 2-Layered Networks," Ars Combinatoria, vol. 21, pp. 89-98.
26. Everett, H. (1963) "Generalized Lagrangean Multiplier Method for Solving Problems of Optimal Allocation of Resources," Operations Research, vol. 11, pp. 399-417.
27. Festa, P. and M. G. C. Resende (2001) "GRASP: An Annotated Bibliography," in Essays and Surveys in Metaheuristics, C. C. Ribeiro and P. Hansen (Eds.), Kluwer Academic Publishers, pp. 325-367.
28. Fleurent, C. and F. Glover (1997) "Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory," Technical Report, University of Colorado.
29. Fleurent, C., F. Glover, P. Michelon and Z. Valli (1996) "A Scatter Search Approach for Unconstrained Continuous Optimization," in Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pp. 643-648.
30. Fogel, D. B. (1998) "An Introduction to Evolutionary Computation," in Evolutionary Computation: The Fossil Record, D. B. Fogel (Ed.), IEEE Press, pp. 1-2.
31. Fonseca, C. M. and P. J. Fleming (1993) "Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization," in Proceedings of the Fifth International Conference on Genetic Algorithms, S. Forrest (Ed.), San Mateo California, pp. 416-423.
32. Funabiki, N. and T. Higashino (2000) "A Minimal-State Processing Search Algorithm for Graph Colorings Problems," IEICE Transactions on Fundamentals, vol. E83, no. A7, pp. 1420-1430.
33. Garcia-Lpez, F., B. Melian-Batista, J. A. Moreno-Perez and J. M. Moreno-Vega (2002a) "Parallelization of the Scatter Search," Technical Report, Dpto. de E.I.O. y Computation, Universidad de La Laguna.
34. Garcia-Lopez, F., B. Melian-Batista, J. A. Moreno-Perez and J. M. Moreno-Vega (2002b) "The Parallel Variable Neighborhood Search for the p-Median Problem," Journal of Heuristics, vol. 8, pp. 375-388.
35. Galinier, P. and J.K. Hao (1999) "Hybrid Evolutionary Algorithms for Graph Coloring", Journal of Combinatorial Optimization, vol. 3, no. 4, pp. 379-397.
36. Glover, F. (1965) "A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem," Operations Research, vol. 13, pp. 879-919.
37. Glover, F. (1977) "Heuristics for Integer Programming Using Surrogate Constraints," Decision Sciences, vol. 8, pp. 156-166.
38. Glover, F. (1992) "Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems," Technical Report, University of Colorado. Shortened version published in (1996) Discrete Applied Mathematics, vol. 65, pp. 223-253.
39. Glover, F. (1994a) "Genetic Algorithms and Scatter Search: Unsuspected Potentials," Statistics and Computing, vol. 4, pp. 131-140.
40. Glover, F. (1994b) "Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms)," Discrete Applied Mathematics, vol. 49, pp. 231-255.
41. Glover, F. (1995) "Scatter Search and Star Paths: Beyond the Genetic Metaphor," OR Spektrum, vol. 17, pp. 125-137.
42. Glover, F. (1998) "A Template for Scatter Search and Path Relinking," in Artificial Evolution, Lecture Notes in Computer Science 1363, J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (Eds.), Springer, pp. 13-54.
43. Glover, F. (1999) "Scatter Search and Path Relinking," in New Methods in Optimization, D. Come, M. Dorigo and F. Glover (Eds.), McGraw-Hill, London, pp. 297-316.
44. Glover, F. and G. Kochenberger (1996) "Critical Event Tabu Search for Multidimensional Knapsack Problems," in Meta-heuristics: Theory and Applications, I. H. Osman and J. P. Kelly (Eds.), Kluwer Academic Publishers, Boston, pp. 407-427.
45. Glover, F., C.C. Kuo and K.S. Dhir (1998) "Heuristic Algorithms for the Maximum Diversity Problem," Journal of Information & Optimization Sciences, vol. 19, pp. 109-132.
46. Glover, F. and M. Laguna (1997) Tabu Search, Kluwer Academic Publishers, Boston.
47. Glover, F., M. Laguna and R. Marti (2000) "Fundamentals of Scatter Search and Path Relinking," Control and Cybernetics, vol. 39, no. 3, pp. 653-684.
48. Glover, F., A. Lokketangen and D. L. Woodruff. (2000) "Scatter Search to Generate Diverse MIP Solutions," in OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, M. Laguna and J.L. Gonzalez-Velarde (Eds.), Kluwer Academic Publishers, pp. 299-317.
49. Ghamlouche, I., T.G. Crainic and M. Gendreau (2001) "Cycle-based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Technical Report CRT-2001-01, Centre de recherche sur les transports, Universite de Montreal.
50. Ghamlouche, I., T.G. Crainic and M. Gendreau (2002) "Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design," Technical Report CRT-2002-01, Centre de recherche sur les transports, University de Montreal.
51. Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishing Company, Reading, Massachusetts.
52. Gonzalez-Velarde, J.L. and M. Laguna (2001) "Tabu Search with Simple Ejection Chains for Coloring Graphs," Annals of Operations Research, forthcoming.
53. Grant, R. S. (1998) "Evaluating the Use of Genetic Algorithms, Evolution Strategies, and Scatter Search for Performing Simulation Optimization," Ph.D. Dissertation, Mississippi State University.
54. Grabowski, J. and M. Wodecki (2001) "A New Very Fast Tabu Search Algorithm for the Job Shop Problem," Technical Report 21/2001, Instytut Cybemetyki Techncznej Politechniki Wroclawskiej, Wroclaw.
55. Grotschel, M., M. Junger and G. Reinelt (1984) "A Cutting Plane Algorithm for the Linear Ordering Problem," Operations Research, vol. 32, no. 6, pp. 1195-1220.
56. Greistorfer, P. (1995) "Computational Experiments with Heuristics for a Capacitated Arc Routing Problem," in Operations Research Proceedings 1994, U. Derigs, A. Bachem and A. Drexl, (Eds.), Springer-Verlag, Berlin, pp. 185-190.
57. Greistorfer, P. (1999) "Tabu and Scatter Search Combined for Arc Routing," presented at MIC'99 - 3rd Metaheuristics International Conference, Brazil, July 19-22,1999.
58. Greistorfer, P. (2001a) "A Tabu Scatter Search Metaheuristic for the Arc Routing Problem," Computers & Industrial Engineering, forthcoming.
59. Greistorfer, P. (2001b) "Testing Population Designs," in 4th Metaheuristics International Conference Proceedings MIC'2001, pp. 713-717.
60. Gutin, G. and A. P. Punnen (2002) The Traveling Salesman Problem and its Variations, Kluwer Academic Publishers, Boston.
61. Hamiez, J.P. and J.K. Hao (2001) "Scatter Search for Graph Coloring," LNCS series, Springer, forthcoming.
62. Hansen, P., N. Mladenovi'c and D. Perez-Brito (2001), "Variable Neighborhood Decomposition Search," Journal of Heuristics, vol. 7, pp. 335-350.
63. Hart, J. P. and A. W. Shogan (1987) "Semi-greedy Heuristics: An Empirical Study," Operations Research Letters, vol. 6, pp. 107-114.
64. Hill, R. R. and G. McIntyre. (2000) "A Methodology for Robust, Multi-Scenario Optimization," Phalanx, vol. 33, no. 3.
65. Holland, J. H. (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.
66. Johnson, D.S. and M.A. Trick (1996) Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challenge, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society.
67. Kelly, J., B. Rangaswamy and J. Xu (1996) "A Scatter Search-Based Learning Algorithm for Neural Network Training," Journal of Heuristics, vol. 2, pp. 129-146.
68. Kuo, C.C., F. Glover and K.S. Dhir (1993) "Analyzing and Modeling the Maximum Diversity Problem by Zero-One Programming," Decision Sciences, vol. 24, pp. 1171-1185.
69. Laguna, M., J. W. Barnes and F. Glover (1993) "Intelligent Scheduling with Tabu Search: An Application to Jobs With Linear Delay Penalties and Sequence-Dependent Setup Costs and Times," Journal of Applied Intelligence, vol. 3, pp. 159-172.
70. Laguna, M. and F. Glover (1993) "Integrating Target Analysis and Tabu Search for Improved Scheduling Systems," Expert Systems with Applications, vol. 6, pp. 287-297.
71. Laguna, M., P. Lino, A. Perez, S. Quintanilla and V. Vails (2000) "Minimizing Weighted Tardiness of Jobs with Stochastic Interruptions in Parallel Machines," European Journal of Operational Research, vol. 127, no. 2, pp. 444-457.
72. Laguna, M. and R. Marti (1999) "GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization," INFORMS Journal on Computing, vol. 11, no. 1, pp. 44-52.
73. Laguna, M. and R. Marti (2000) "Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions," Technical Report, University of Colorado at Boulder, http://leeds.colorado.edu/faculty/laguna/articles/advss.html.
74. Laguna, M. and R. Marti (2001a) "A GRASP for Coloring Sparse Graphs," Computational Optimization and Applications, vol. 19, pp. 165-178.
75. Laguna, M. and R. Marti (2001b) "Neural Network Prediction in a System for Optimizing Simulations," HE Transactions, forthcoming.
76. Laguna, M. and R. Marti (2002) "The OptQuest Callable Library," Optimization Software Class Libraries, S. Voss and D. L. Woodruff (Eds.), Kluwer Academic Publishers, Boston, pp. 193-218.
77. Laguna, M., R. Marti and V. Campos (1999) "Intensification and Diversification with Elite Tabu Search Solutions for the Linear Ordering Problem," Computers and Operations Research, vol. 26, pp. 1217-1230.
78. Lawler, Lenstra, Rinnoy Kan and Shmoys (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley and Sons.
79. Lokketangen, A. and F. Glover (1995) "Tabu Search for Zero/One Mixed Integer Programming with Advanced Level Strategies and Learning," International Journal of Operations and Quantitative Management, vol. 1, no. 2, pp 89-109.
80. Lokketangen, A. and F. Glover (1996) "Probabilistic Move Selection in Tabu Search for 0/1 Mixed Integer Programming Problems," in Metaheuristics: Theory and Applications, I.H. Osman and J.P. Kelly (Eds.), Kluwer Academic Publishers, pp. 467-488.
81. Lokketangen, A. and F. Glover (1998) "Solving Zero-One Mixed Integer Programming Problems Using Tabu Search," European Journal of Operational Research, vol. 106, pp 624-658.
82. Lokketangen, A. and F. Glover (1999) "Candidate List and Exploration Strategies for Solving 0/1 MIP Problems using a Pivot Neighborhood," in Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. VoB, S. Martello, I.H. Osman and C. Roucairol (Eds.), Kluwer Academic Publishers, pp 141-155.
83. Lokketangen, A. and D. Woodruff. (2000) "Integrating Pivot Based Search with Branch and Bound for Binary MIP's," Control and Cybernetics, vol. 29, no. 3, pp 741-760.
84. LOLIB (1997) http://www.iwr.imi-heidelberg.de/groiips/comopt/software/LOLIB/index.html
85. Loureno, H. R., J. P. Paixao and R. Portugal (2001) "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, vol. 35, no. 3, pp. 331-343.
86. Martello, S. and P. Toth (1989) Knapsack Problems, John Wiley and Sons, Ltd., New York.
87. Marti, R. (1998) "A Tabu Search Algorithm for The Bipartite Drawing Problem," European Journal of Operational Research, vol. 106, pp. 558-569.
88. Marti, R. and M. Laguna (1997) "Heuristics and Metaheuristics for 2-Layer Straight Line Crossing Minimization," Discrete and Applied Mathematics, forthcoming.
89. Marti, R., M. Laguna and V. Campos (2002) "Scatter Search vs. Genetic Algorithms: An Experimental Evaluation with Permutation Problems," in Adaptive Memory and Evolution: Tabu Search and Scatter Search, C. Rego and B. Alidaee (Eds.), Kluwer Academic Publishers, forthcoming.
90. Marti, R., M. Laguna and H. Lourenpo (2000) "Assigning Proctors to Exams with Scatter Search," in Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, M. Laguna and J. L. Gonzalez-Velarde (Eds.), Kluwer Academic Publishers, Boston, pp. 215-227.
91. Marti, R., M. Laguna, F. Glover and V. Campos (2001) "Reducing the Bandwidth of a Sparse Matrix with Tabu Search," European Journal of Operational Research, vol. 135, pp. 450-459.
92. Mazzini, R. (1998) "Estudo de Meta-Heuristicas Populacionais para a Programâao de Maquinas Paralelas com Tempos de Preparagao Dependentes da Sequencia e Datas de Entrega", Ph.D. Dissertation, Faculdade de Engenharia Eletrica e de Computâao, Universidade Estadual de Campinas.
93. Michalewicz, Z. and T. D. Logan (1994) "Evolutionary Operators for Continuous Convex Parameter Spaces," in Proceedings of the 3rd Annual Conference on Evolutionary Programming, A. V. Sebald and L. J. Fogel (Eds.), World Scientific Publishing, River Edge, NJ, pp. 84-97.
94. Michalewicz, Z. (1996) Genetic Algorithms + Data Structures = Evolution Programs, 3rd edition, Springer-Verlag, Berlin.
95. Morgenstem, C.A. (1996) "Distributed Coloration Neighborhood Search," in Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challenge, 1993, Johnson and Trick (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 335-357.
96. Nelder, J. A. and R. Mead (1965) "A Simplex Method for Function Minimization," Computer Journal, vol. 7, p. 308.
97. Nowicki, E. and C. Smutnicki (1996) "A Fast Tabu Search Algorithm for the Job-Shop Problem," Management Science, vol. 42, no. 6, pp. 797-813.
98. Nowicki, E. and C. Smutnicki (2001a). "New Ideas in Tabu Search for Job-Shop Scheduling," Technical Report 50/2001.
99. Nowicki, E. and C. Smutnicki (2001b) "New Tools to Solve the Job-Shop Problem," Technical Report 51/2001.
100. Ochi, L. S., D. S. Vianna, L. M. A. Drummond and A. O. Victor (1998) "A Parallel Evolutionary Algorithm for the Vehicle Routing Problem with Heterogeneous Fleet," Future Generation Computer Systems, vol. 14, no. 5, pp. 285-292.
101. Oliva San Martin, C. (2000) "Scatter Search Pour le Probleme du Voyageur de Commerce," M.S. Thesis, Universite de Montreal.
102. Pinana, E., I. Plana, V. Campos and R. Marti (2001) GRASP and Path Relinking for the Matrix Bandwidth Minimization, European Journal of Operational Research, forthcoming.
103. Prais, M. and C. C. Ribeiro (2000) "Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment," INFORMS Journal on Computing, vol. 12, pp. 164-176.
104. Press, W. H., S. A. Teukolsky, W. T. Vetterling and B. P. Flannery (1992) Numerical Recipes: The Art of Scientific Computing, Cambridge University Press (www.nr.com).
105. Rana, S. and D. Whitley (1997) "Bit Representations with a Twist," in Proceedings of the 7th International Conference on Genetic Algorithms, T. Baeck (Ed.), Morgan Kaufman, pp. 188-196.
106. Rego, C. and P. Leao (2000) "A Scatter Search Tutorial for Graph Based Permutation Problems," Technical Report, Hearin Center for Enterprise Science, School of Business Administration, University of Mississippi, USA.
107. Reinelt, G. (1985) The Linear Ordering Problem: Algorithms and Applications, Research and Exposition in Mathematics, vol. 8, H. H. Hofmann and R. Wille (Eds.), Heldermann Verlag Berlin.
108. Reinelt, G. (1994) The Traveling Salesman: Computational Solutions for TSP applications, Lecture Notes in Computer Science, Springer Verlag, Berlin.
109. Resende, M. G. C. and C. C. Ribeiro (2001) "Greedy Randomized Adaptive Search Procedures," in State-ofthe-Art Handbook in Metaheuristics, F. Glover and G. Kochenberger (Eds.), Kluwer Academic Publishers, Boston, forthcoming.
110. Ribeiro, C.C., E. Uchoa and R.F. Wemeck (2002) "A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs," INFORMS Journal on Computing, forthcoming.
111. Rochat, Y. and E. D. Taillard (1995) "Probabilistic Diversification and Intensification in Local Search for Vehicle Routing," Journal of Heuristics, vol. 1, no. 1, pp. 147-167.
112. Roy, R. K. (1990) A Primer on the Taguchi Method, Van Nostrand Reinhold, New York.
113. Souza, M.C., C. Duhamel, and C.C. Ribeiro (2002) "A GRASP Heuristic Using a Path-Based Local Search for the Capacitated Minimum Spanning Tree Problem", Technical Report.
114. Ugray, Z., L. Lasdon, J. Plummer, F. Glover, J. Kelly and R. Marti (2002) "A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems," in Adaptive Memory and Evolution: Tabu Search and Scatter Search, C. Rego and B. Alidaee (Eds.), Kluwer Academic Publishers, forthcoming.
115. Vails, V., M. Laguna, P. Lino, A. Perez and S. Quintanilla (1998) "Project Scheduling with Stochastic Activity Interruptions," in Project Scheduling: Recent Models, Algorithms and Applications, Jan Weglarz (Ed.), Kluwer Academic Publishers, pp. 333-353.
116. Verhoeven, M.G.A. and E.H.L. Aarts (1995) "Parallel Local Search," Journal of Heuristics, vol. 1, pp. 43-65.
117. Voss, S., A. Martin and T. Koch (2001) "SteinLib Testdata Library," online document at http://elib.zib.de/steinlib/steinlib.html.
118. Woodruff, D. L. and E. Zemel (1993) "Hashing Vectors for Tabu Search," Annals of Operations Research, vol. 41, pp. 123-137.
119. Woodruff, D. L. (1996) "Chunking Applied to Reactive Tabu Search," in Metaheuristics: Theory and Applications, I.H. Osman and J.P. Kelly (Eds.), pp 555-570.
120. Woodruff, D. L. (1998) "Proposals for Chunking and Tabu Search," European Journal of Operational Research, vol. 106, pp. 585-598.
121. Woodruff, D. L. (2001) "General Purpose Metrics for Solution Variety," Technical Report, Graduate School of Management, UC Davis, Davis CA 95616, USA.
122. Xu, J., S. Chiu and F. Glover (2000) "Tabu Search and Evolutionary Scatter Search for 'Tree-Star' Network Problems, with Applications to Leased Line Network Design," in Telecommunications Optimization: Heuristic and Adaptive Techniques, D. W. Come, M. J. Oates and G. D. Smith (Eds.), Wiley.