Abstract
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.
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
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.
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.
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.
Glover, F. (1965). “A Multiphase-dual Algorithm for the Zero-One Integer Programming Problem,” Operations Research, 13, 879–919.
Glover, F. (1977). “Heuristics for Integer Programming Using Surrogate Constraints,” Decision Sciences, 8, 156–166.
Glover, F. (1978). “Parametric Branch and Bound,” Omega, Vol. 6, No. 0, 1–9.
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.
Glover, F. and M. Laguna (1997). Tabu Search, Kluwer Academic Publishers.
Glover, F. and L. Tangedahl (1976). “Dynamic Strategies for Branch and Bound,” Omega, Vol. 4, No. 5, 1–6.
Laguna, M. and R. Marti (1998). “Local Search and Path Relinking for the Linear Ordering Problem,” Research Report, University of Colorado.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Glover, F. (2000). Multi-Start and Strategic Oscillation Methods — Principles to Exploit Adaptive Memory. In: Laguna, M., Velarde, J.L.G. (eds) Computing Tools for Modeling, Optimization and Simulation. Operations Research/Computer Science Interfaces Series, vol 12. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4567-5_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4567-5_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7062-8
Online ISBN: 978-1-4615-4567-5
eBook Packages: Springer Book Archive