Multi-Start and Strategic Oscillation Methods — Principles to Exploit Adaptive Memory

A Tutorial on Unexplored Opportunities
  • Fred Glover
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 12)


We propose approaches for creating improved forms of constructive multi-start and strategic oscillation methods, based on the search principles of persistent attractiveness and marginal conditional validity. These approaches embody adaptive memory processes by drawing on combinations of recency and frequency information, which can be monitored to encompass varying ranges of the search history. In addition, we propose designs for investigating these approaches empirically, and indicate how a neglected but important kind of memory called conditional exclusion memory can be implemented within the context of these methods.


Tabu Search Early Decision Constructive Method Construction Sequence Adaptive Memory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Amini, M., B. Alidaee and G. Kochenberger (1999). “A Scatter Search Approach to Unconstrained Quadratic Binary Programs,” to appear in New Methods in Optimization, McGraw Hill.Google Scholar
  2. Campos, V., F. Glover, M. Laguna and R. Marti (1999). “An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem,” Universitat de Valencia and University of Colorado.Google Scholar
  3. Fleurent, C. and F. Glover (1998). “Improved Constructive Multistart Strategies for the Quadratic Assignment Problem,” Research Report, University of Colorado, to appear in the INFORMS Journal on Computing.Google Scholar
  4. Glover, F. (1965). “A Multiphase-dual Algorithm for the Zero-One Integer Programming Problem,” Operations Research, 13, 879–919.MathSciNetMATHCrossRefGoogle Scholar
  5. Glover, F. (1977). “Heuristics for Integer Programming Using Surrogate Constraints,” Decision Sciences, 8, 156–166.CrossRefGoogle Scholar
  6. Glover, F. (1978). “Parametric Branch and Bound,” Omega, Vol. 6, No. 0, 1–9.Google Scholar
  7. Glover, F., A. Amini, G. Kochenberger, B. Alidaee (1999). “A New Evolutionary Scatter Search Metaheuristic for Unconstrained Quadratic Binary Programming,” Research Report, University of Mississippi, Univesity, MS.Google Scholar
  8. Glover, F. and M. Laguna (1997). Tabu Search, Kluwer Academic Publishers.Google Scholar
  9. Glover, F. and L. Tangedahl (1976). “Dynamic Strategies for Branch and Bound,” Omega, Vol. 4, No. 5, 1–6.CrossRefGoogle Scholar
  10. Laguna, M. and R. Marti (1998). “Local Search and Path Relinking for the Linear Ordering Problem,” Research Report, University of Colorado.Google Scholar
  11. Rolland, E., R. Patterson and H. Pirkul (1999). “Memory Adaptive Reasoning and Greedy Assignment Techniques for the CMST.” In Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I. Osman & C. Roucairol (eds.), Norwell, Massachusets: Kluwer Academic Publishers, pp. 487–498.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Fred Glover
    • 1
  1. 1.University of ColoradoUSA

Personalised recommendations