Skip to main content
SpringerLink
Log in

The Importance of Being Careful

  • Conference paper
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (SLS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4638))

Abstract

Metaheuristic (and other) methods are often implemented using standardized parameter values. This is most often seen when comparing a favorite method with competing methods, but also when inexperienced researchers implement a method for the first time. Often the (hidden) correlations between the search method components and parameters are neglected or ignored, using only standardized templates. This paper looks at some of these pitfalls or hidden correlations, using the mechanisms of tabu search (TS) as examples. The points discussed are illustrated by examples from the authors experience.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Miller, G.A.: The Magical Number Seven, Plus or Minus Two: Some Limits on Our Capacity for Processing Information. The Psychological Review 63, 81–97 (1956)

    Article  Google Scholar 

  2. Gent, I.P., Grant, S.A., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: How Not To Do It. Research Report 97.27, School of Computer Studies, University of Leeds (1997)

    Google Scholar 

  3. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

  4. Hooker, J.N.: Testing Heuristics: We have it all wrong. Journal of Heuristics 1(1), 33–42 (1995)

    Article  MATH  Google Scholar 

  5. Hvattum, L.M., Løkketangen, A., Glover, F.: Adaptative Memory Search for Boolean Optimization Problems. Discrete Applied Mathematics 142, 99–109 (2004)

    Article  MATH  Google Scholar 

  6. Hasle, G., Haavardtun, L.J., Kloster, O., Løkketangen, A.: Interactive Planning for Sustainable Forest Harvesting. Annals of Operations Research 95, 19–40 (2000)

    Article  MATH  Google Scholar 

  7. Arntzen, H., Hvattum, L.M., Løkketangen, A.: Adaptive Memory Search for Multidemand Multidimensional Knapsack Problems. Computers & Operations Research 33, 2508–2525 (2006)

    Article  MATH  Google Scholar 

  8. Cappanera, P., Trubian, M.: A Local Search Based Heuristic for the Demand Constrained Multidimensional Knapsack Problem. INFORMS Journal on Computing 17(1), 82–98 (2005)

    Article  Google Scholar 

  9. Løkketangen, A., Glover, F.: Solving zero-one mixed integer programming problems using tabu search. European Journal of Operational Research 106, 624–658 (1998)

    Article  MATH  Google Scholar 

  10. Løkketangen, A., Glover, F.: Candidate List and Exploration Strategies for Solving 0/1 MIP Problems using a Pivot Neighborhood. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 141–155. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  11. Løkketangen, A., Glover, F.: Surrogate Constraint Analysis - New Heuristics and Learning Schemes for Satisfiability Problems. In: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35 (1997)

    Google Scholar 

  12. Løkketangen, A., Glover, F.: Adaptive Memory Search Guidance for Satisfiability Problems. In: Rego, C., Alidae, B. (eds.) Metaheuristic Optimization Via Adaptive Memory and Evolution: Tabu Search and Scatter Search, pp. 213–227. Kluwer Academic Publishers, Dordrecht (2005)

    Chapter  Google Scholar 

  13. Løkketangen, A., Glover, F.: Probabilistic Move Selection in Tabu Search for 0/1 Mixed Integer Programming Problems. In: Osman, I.H., Kelly, J.P. (eds.) Metaheuristics: Theory and Applications, Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

  14. Løkketangen, A., Glover, F.: Tabu Search for Zero/One Mixed Integer Programming with Advanced Level Strategies and Learning. International Journal of Operations and Quantitative Management 1(2), 89–109 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Molde University College, Molde, Norway

    Arne Løkketangen

Authors
  1. Arne Løkketangen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Stützle Mauro Birattari Holger H. Hoos

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Løkketangen, A. (2007). The Importance of Being Careful. In: Stützle, T., Birattari, M., H. Hoos, H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007. Lecture Notes in Computer Science, vol 4638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74446-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74446-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74445-0

  • Online ISBN: 978-3-540-74446-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation