Abstract
Faced with the challenge of solving hard optimization problems that abound in the real world, classical methods often encounter great difficulty. Vitally important applications in business, engineering, economics and science cannot be tackled with any reasonable hope of success, within practical time horizons, by solution methods that have been the predominant focus of academic research throughout the past three decades (and which are still the focus of many textbooks).
The material of this chapter is principally adapted from the book Tabu Search, by Fred Glover and Manuel Laguna, Kluwer Academic Publishers, 1997.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackley, D. (1987) “A Connectionist Model for Genetic Hillclimbing,” Kluwer, Dordrecht. Academic Publishers.
Bäck, T., F. Hoffmeister and H. Schwefel (1991) “A Survey of Evolution Strategies,” Proceedings of the Fourth International Conference on Genetic Algorithms, R. Belew and L. Booker (eds.), pp. 2–9.
Battiti, R. and G. Tecchiolli (1992) “Parallel Based Search for Combinatorial Optimization: Genetic Algorithms and Tabu Search,” Microprocessor and Microsystems, Vol. 16, pp. 351–367.
Battiti, R. and G. Tecchiolli (1994a) “The Reactive Tabu Search,” ORSA Journal on Computing, Vol. 6, No. 2, pp. 126–140.
Beyer, D. and R. Ogier (1991) “Tabu Learning: A Neural Network Search Method for Solving Nonconvex Optimization Problems,” Proceedings of the International Conference in Neural Networks, IEEE and INNS, Singapore.
Consiglio, A. and S.A. Zenios (1996) “Designing Portfolios of Financial Products via Integrated Simulation and Optimization Models,” Report 96–05, Department of Public and Business Administration, University of Cyprus, Nicosia, CYPRUS, to appear in Operations Research.
Cung, V-D., T. Mautor, P. Michelon, A. Tavares (1996) “Scatter Search for the Quadratic Assignment Problem,” Laboratoire PRiSM-CNRS URA 1525.
Davis, L. (1989) “Adapting Operator Probabilities in Genetic Algorithms,” Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, pp. 61–69.
Eiben, A. E., P-E Raue and Zs. Ruttkay (1994) “Genetic Algorithms with Multi-Parent Recombination,” Proceedings of the Third International Conference on Parallel Problem Solving from Nature (PPSN), Y. Davidor, H-P Schwefel and R. Manner (eds.), New York: Springer-Verlag, pp. 78–87.
Eschelman, L. J. and J. D. Schaffer (1992) “Real-Coded Genetic Algorithms and Interval-Schemata,” Technical Report, Phillips Laboratories.
Feo, T. and M. G. C. Resende (1989) “A probabilistic Heuristic for a Computationally Difficult Set Covering Problem,” Operations Research Letters, Vol. 8, pp. 67–71.
Feo, T. and M. G. C. Resende (1995) “Greedy Randomized Adaptive Search Procedures,” Journal of Global Optimization, Vol. 2, pp. 1–27.
Fleurent, C., F. Glover, P. Michelon and Z. Valli (1996) “A Scatter Search Approach for Unconstrained Continuous Optimization,” Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, 643–648.
Freville, A. and G. Plateau (1986) “Heuristics and Reduction Methods for Multiple Constraint 0–1 Linear Programming Problems,” European Journal of Operational Research, 24, 206–215.
Freville, A. and G. Plateau (1993) “An Exact Search for the Solution of the Surrogate Dual of the 0–1 Bidimensional Knapsack Problem,” European Journal of Operational Research, 68, 413–421.
Glover, F. (1963) “Parametric Combinations of Local Job Shop Rules,” Chapter IV, ONR Research Memorandum no. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA.
Glover, F. (1968) “Surrogate Constraints,” Operations Research, 16, 741–749.
Glover, F. (1975) “Surrogate Constraint Duality in Mathematical Programming,” Operations Research, 23, 434–451.
Glover, F. (1977) “Heuristics for Integer Programming Using Surrogate Constraints,” Decision Sciences, Vol 8, No 1, 156–166.
Glover, F. (1989) “Tabu Search-Part I,” ORSA Journal on Computing, Vol. 1, pp. 190–206.
Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems,” University of Colorado. Shortened version published in Discrete Applied Mathematics, 1996, 65, 223–253.
Glover, F. (1994a) “Genetic Algorithms and Scatter Search: Unsuspected Potentials,” Statistics and Computing, 4, 131–140.
Glover, F. (1995a) “Scatter Search and Star-Paths: Beyond the Genetic Metaphor,” OR Spektrum, Vol. 17, pp. 125–137.
Glover, F. (1997) “A Template for Scatter Search and Path Relinking,” to appear in Lecture Notes in Computer Science, J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D. Snyers (Eds.).
Glover, F. and H. Greenberg (1989) “New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence,” European Journal of Operational Research, Vol. 39, No. 2, pp. 119–130.
Glover, F., J. P. Kelly and M. Laguna (1996) “New Advances and Applications of Combining Simulation and Optimization,” Proceedings of the 1996 Winter Simulation Conference, J. M. Charnes, D. J. Morrice, D. T. Brunner, and J. J. Swain (Eds.), 144–152.
Glover, F. and G. Kochenberger (1996) “Critical Event Tabu Search for Multidimensional Knapsack Problems,” Meta-Heuristics: Theory and Applications, I. H. Osman and J. P. Kelly (eds.), Kluwer Academic Publishers, pp. 407–427.
Glover, F., G. Kochenberger and B. Alidaee (1997) “Adaptive Memory Tabu Search for Binary Quadratic Programs,” to appear in Management Science.
Glover, F. and M. Laguna (1997a) Tabu Search,Kluwer Academic Publishers.
Glover, F. and M. Laguna (1997b) “Properties of Optimal Solutions to the Min k-Tree Problem,” Graduate School of Business, University of Colorado at Boulder.
Glover, F., J. M. Mulvey and D. Bai (1996) “Improved Approaches to Optimization Via Integrative Population Analysis,” Graduate School of Business, University of Colorado at Boulder.
Greenberg, H. J. and Pierskalla, W.P. (1970) “Surrogate Mathematical Programs,” Operations Research, 18, 924–939.
Greenberg, H. J. and W. P. Pierskalla (1973) “Quasi-conjugate Functions and Surrogate Duality,” Cahiers du Centre d’Etudes de Recherche Operationelle, Vol. 15, pp. 437–448.
Holland, J.H. (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI.
Hong, I., A. B. Kahng and B-R Moon (1997) “Improved Large-Step Markov Chain Variants for Symmetric TSP,” to appear in Journal of Heuristics.
Johnson, D. S. (1990) “Local Optimization and the Traveling Salesman Problem,” Proc. 17th Intl. Colloquium on Automata, Languages and Programming, pp. 446–460.
Karwan, M.H. and R.L. Rardin (1976) “Surrogate Dual Multiplier Search Procedures in Integer Programming,” School of Industrial Systems Engineering, Report Series No. J-77–13, Georgia Institute of Technology.
Karwan, M.H. and R.L. Rardin (1979) “Some Relationships Between Lagrangean and Surrogate Duality in Integer Programming,” Mathematical Programming, 17, 230–334.
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.
Kraay, D. and P. Harker (1996) “Case-Based Reasoning for Repetitive Combinatorial Optimization Problems, Part I: Framework,” Journal of Heuristics, Vol. 2, No. 1, pp. 55–86.
Kraay, D. and P. Harker (1997) “ Case-Based Reasoning for Repetitive Combinatorial Optimization Problems, Part II: Numerical Results,” to appear in Journal of Heuristics.
Laguna, M. (1997) “ Optimizing Complex Systems with OptQuest,” Research Report, University of Colorado
Laguna, M., T. Feo and H. Elrod (1994) “A Greedy Randomized Adaptive Search Procedure for the 2-Partition Problem,” Operations Research, Vol. 42, No. 4, pp. 677–687.
Laguna, M., J. P. Kelly, J. L. Gonzalez-Velarde, and F. Glover (1995) “Tabu Search for the Multilevel Generalized Assignment Problem,” European Journal of Operations Research, Vol. 82, pp. 176–189.
Laguna, M. and R. Marti (1997) “GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization,” Research Report, University of Colorado.
Laguna, M., R. Marti and V. Campos (1997) “Tabu Search with Path Relinking for the Linear Ordering Problem,” Research Report, University of Colorado.
Laguna M., R. Marti and V. Valls (1995) “Arc Crossing Minimization in Hierarchical Digraphs with Tabu Search,” to appear in Computers and Operations Research.
Lokketangen, A. K. Jornsten and S. Storoy (1994) “Tabu Search within a Pivot and Complement Framework,” International Transactions in Operations Research, Vol. 1, No. 3, pp. 305–316.
Lokketangen, A. and F. Glover (1996) “Probabilistic Move Selection in Tabu Search for 0/1 Mixed Integer Programming Problems,” Meta-Heuristics: Theory and Applications, I. H. Osman and J. P. Kelly (eds.), Kluwer Academic Publishers, pp. 467–488.
Lokketangen, A. and Glover, F. (1997b) “Surrogate Constraint Analysis-New Heuristics and Learning Schemes for Satisfiability Problems,” Proceedings of the DIMACS workshop on Satisfiability Problems: Theory and Applications, D-Z. Du, J. Gu and P. Pardalos (eds.).
Lourenco, H. R. and M. Zwijnenburg (1996) “Combining the Large-Step Optimization with Tabu Search: Application to the Job Shop Scheduling Problem,” Meta-Heuristics: Theory and Applications, I. H. Osman and J. P. Kelly (eds.), Kluwer Academic Publishers, pp. 219–236.
Martin, O., S. W. Otto and E. W. Felten (1991) “Large-Step Markov Chains for the Traveling Salesman Problem,” Complex Systems, Vol. 5, No. 3, pp. 299–326.
Martin, O., S. W. Otto and E. W. Felten (1992) “Large-Step Markov Chains for TSP Incorporating Local Search Heuristics,” Operations Research Letters, Vol. 11, No. 4, pp. 219–224.
Michalewicz, Z. and C. Janikow (1991) “Genetic Algorithms for Numerical Optimization,” Statistics and Computing, Vol. 1, pp. 75–91.
Mühlenbein, H., M. Gorges-Schleuter, and O. Krämer (1988) “Evolution Algorithms in Combinatorial Optimization,” Parallel Computing, Vol. 7, pp. 65–88.
Mühlenbein, H. and D. Schlierkamp-Voosen (1994) “The Science of Breeding and its Application to the Breeder Genetic Algorithm,” Evolutionary Computation, Vol. 1, pp. 335–360.
Mühlenbein, H. and H-M Voigt (1996) “Gene Pool Recombination in Genetic Algorithms,” Meta-Heurisitics: Theory and Applications, I. H. Osman and J. P. Kelly (eds.), Kluwer Academic Publishers, pp. 53–62.
Mulvey, J. (1995) “Generating Scenarios for the Towers Perrin Investment Systems,” to appear in Interfaces.
Nonobe, K. and T. Ibaraki (1997) “A Tabu Search Approach to the CSP (Constraint Satisfaction Problem) as a General Problem Solver,” to appear in European Journal of Operational Research.
Punnen, A. P. and F. Glover (1997) “Ejection Chains with Combinatorial Leverage for the Traveling Salesman Problem,” Graduate School of Business, University of Colorado at Boulder.
Rana, S. and D. Whitley (1997) “Bit Representations with a Twist,” Proc. 7th International Conference on Genetic Algorithms, T. Baeck (ed.) pp: 188–196, Morgan Kaufman.
Rego, C. (1996a) “Relaxed Tours and Path Ejections for the Traveling Salesman Problems,” to appear in European Journal of Operational Research.
Rochat, Y. and É. D. Taillard (1995) “Probabilistic diversification and intensification in local search for vehicle routing”. Journal of Heuristics, 1, 147–167.
Spears, W.M. and K.A. DeJong (1991) “On the Virtues of Uniform Crossover,” 4th International Conference on Genetic Algorithms, La Jolla, CA.
Taillard, É. D. (1996) “A heuristic column generation method for the heterogeneous VRP”, Publication CRT-96–03, Centre de recherche sur les transports, Université de Montréal. To appear in RAIRO-OR.
Trafalis, T., and I. Al-Harkan (1995) “A Continuous Scatter Search Approach for Global Optimization,” Extended Abstract in: Conference in Applied Mathematical Programming and Modeling (APMOD’95), London, UK, 1995.
Ulder, N. L. J., E. Pesch, P. J. M. van Laarhoven, H. J. Bandelt and E. H. L. Aarts (1991) “Genetic Local Search Algorithm for the Traveling Salesman Problem,” Parallel Problem Solving from Nature, R. Maenner and H. P. Schwefel (eds.), Springer-Verlag, Berlin, pp. 109–116.
De Werra, D. and A. Hertz (1989) “Tabu Search Techniques: A Tutorial and Applications to Neural Networks,” OR Spectrum, Vol. 11, pp. 131–141.
Whitley, D., V. S. Gordon and K. Mathias (1994) “Lamarckian Evolution, the Baldwin Effect and Function Optimization,” Proceedings of the Parallel Problem Solving from Nature, Vol. 3, New York: Springer-Verlag, pp. 6–15.
Wright, A. H. (1990) “Genetic Algorithms for Real Parameter Optimization,” Foundations of Genetic Algorithms, G. Rawlins (ed.), Morgan Kaufmann, Los Altos, CA, pp. 205–218.
Yamada, T. and C. Reeves (1997) “Permutation Flowshop Scheduling by Genetic Local Search,” 2nd IEE/IEEE Int. Conf. on Genetic Algorithms in Engineering Systems (GALESIA’97), pp. 232–238, Glasglow, UK.
Yamada, T. and R. Nakano (1996) “Scheduling by Genetic Local Search with Multi-Step Crossover,” 4th International Conference on Parallel Problem Solving from Nature, 960–969.
Zenios, S. (1996) “Dynamic Financial Modeling and Optimizing the Design of Financial Products,” Presented at the National INFORMS Meeting, Washington, D.C.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Kluwer Academic Publishers
About this chapter
Cite this chapter
Glover, F., Laguna, M. (1998). Tabu Search. In: Du, DZ., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0303-9_33
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0303-9_33
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7987-4
Online ISBN: 978-1-4613-0303-9
eBook Packages: Springer Book Archive