Skip to main content

Two Look-Ahead Strategies for Local-Search Metaheuristics

  • Conference paper
  • First Online:
Book cover Learning and Intelligent Optimization (LION 2014)

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

Included in the following conference series:

Abstract

The main principle of a look-ahead strategy is to inspect a few steps ahead before taking a decision on the direction to choose. We propose two original look-ahead strategies that differ in the object of inspection. The first method introduces a look-ahead mechanism at a superior level for selecting local-search operators. The second method uses a look-ahead strategy on a lower level in order to detect promising solutions for further improvement. The proposed approaches are implemented using a hyper-heuristic framework and tested against alternative methods. Furthermore, a more detailed investigation of the second method is added and gives insight on the influence of parameter values. The experiments reveal that the introduction of a simple look-ahead strategy into an iterated local-search procedure significantly improves the results over tested problem instances.

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

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    The benchmark for determining the time limit is available at: http://www.asap.cs.nott.ac.uk/external/chesc2011/benchmarking.html, (Accessed November 2013).

References

  1. Bertsekas, D.P., Tsitsiklis, J.N., Wu, C.: Rollout algorithms for combinatorial optimization. J. Heuristics 3, 245–262 (1997)

    Article  MATH  Google Scholar 

  2. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)

    Article  Google Scholar 

  3. Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., McCollum, B., Ochoa, G., Parkes, A.J., Petrovic, S.: The cross-domain heuristic search challenge – an international research competition. In: Coello, C.A.C. (ed.) LION 5. LNCS, vol. 6683, pp. 631–634. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 449–468. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Duin, C., Voß, S.: The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34, 181–191 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Frost, D., Dechter, R.: Look-ahead value ordering for constraint satisfaction problems. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 572–578 (1995)

    Google Scholar 

  7. Hansen, P., Mladenović, N., Brimberg, J., Pérez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 61–86. Springer, New York (2010)

    Chapter  Google Scholar 

  8. Lourenço, H., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 320–353. Springer, Heidelberg (2003)

    Google Scholar 

  9. Ochoa, G., et al.: HyFlex: a benchmark framework for cross-domain heuristic search. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 136–147. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Ochoa, G., Walker, J., Hyde, M., Curtois, T.: Adaptive evolutionary algorithms and extensions to the hyflex hyper-heuristic framework. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part II. LNCS, vol. 7492, pp. 418–427. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Schwarze, S., Voß, S.: Look ahead hyper heuristics. In: Fink, A., Geiger, M. (eds.) Proceedings of the 14th EU/ME Workshop, pp. 91–97 (2013)

    Google Scholar 

  12. Voß, S., Fink, A., Duin, C.: Looking ahead with the pilot method. Ann. Oper. Res. 136, 285–302 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Silvia Schwarze .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Meignan, D., Schwarze, S., Voß, S. (2014). Two Look-Ahead Strategies for Local-Search Metaheuristics. In: Pardalos, P., Resende, M., Vogiatzis, C., Walteros, J. (eds) Learning and Intelligent Optimization. LION 2014. Lecture Notes in Computer Science(), vol 8426. Springer, Cham. https://doi.org/10.1007/978-3-319-09584-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09584-4_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09583-7

  • Online ISBN: 978-3-319-09584-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics