Skip to main content
SpringerLink
Log in
Book cover

Handbook of Heuristics pp 1–16Cite as

Restart Strategies

  • Living reference work entry
  • First Online:

  • 464 Accesses

Abstract

This chapter is focused on restart strategies in optimization, which often provide a substantial algorithmic acceleration for randomized optimization procedures. Theoretical models that describe optimal restart strategies are presented alongside with their relations to parallel computing implementations.

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

References

  1. Chabrier A, Danna E, Pape CL, Perron L (2004) Solving a network design problem. Ann Oper Res 130:217–239

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen H, Gomes CP, Selman B (2001) Formal models of heavy-tailed behavior in combinatorial search. In: CP ’01: proceedings of the 7th international conference on principles and practice of constraint programming. Springer, London, pp 408–421

    Google Scholar 

  3. D’apuzzo MM, Migdalas A, Pardalos PM, Toraldo G (2006) Parallel computing in global optimization. In: Kontoghiorghes E (ed) Handbook of parallel computing and statistics. Chapman & Hall/CRC, Boca Raton, pp 225–258

    Google Scholar 

  4. Glover F, Laguna M (1997) Tabu Search. Kluwer Academic, Norwell

    Book  MATH  Google Scholar 

  5. Gomes CP, Selman B (2001) Algorithm portfolios. Artif Intell 126(1–2):43–62

    Article  MathSciNet  MATH  Google Scholar 

  6. Gomes CP, Selman B, Kautz H (1998) Boosting combinatorial search through randomization. In: Proceedings of the 15th national conference on artificial intelligence. AAAI Press, Madison, pp 431–437

    Google Scholar 

  7. Gupta AK, Zeng WB, Wu Y, Gupta AK, Zeng WB, Wu Y (2010) Parametric families of lifetime distributions. In: Gupta AK, Zeng W-B, Wu Y (eds) Probability and statistical models. Birkhäuser, Boston, pp 71–86

    Chapter  Google Scholar 

  8. Huberman BA, Lukose RM, Hogg T (1997) An economics approach to hard computational problems. Science 275(5296):51–54

    Article  Google Scholar 

  9. Luby M, Ertel W (1994) Optimal parallelization of Las Vegas algorithms. In: Proceedings of the 11th annual symposium on theoretical aspects of computer science, STACS ’94. Springer, London, pp 463–474

    Google Scholar 

  10. Luby M, Sinclair A, Zuckerman D (1993) Optimal speedup of Las Vegas algorithms. Inf Process Lett 47:173–180

    Article  MathSciNet  MATH  Google Scholar 

  11. Mostovyi O, Prokopyev OA, Shylo OV (2013) On maximum speedup ratio of restart algorithm portfolios. INFORMS J Comput 25(2):222–229. doi:10.1287/ijoc.1120.0497

    Article  MathSciNet  Google Scholar 

  12. Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. J Sched 8(2):145–159. doi:http://dx.doi.org/10.1007/s10951-005-6364-5

  13. Nowicki E, Smutnicki C (2005) Some new ideas in TS for job shop scheduling. In: Operations research/computer science interfaces series, vol 30, Part II. Springer, pp 165–190

    Google Scholar 

  14. Palubeckis G, Krivickiene V (2004) Application of multistart tabu search to the max-cut problem. Inf Technol Control 31(2):29–35

    Google Scholar 

  15. Pardalos PM, Rodgers GP (1992) A branch and bound algorithm for the maximum clique problem. Comput Oper Res 19:363–375

    Article  MATH  Google Scholar 

  16. Resende MG, Ribeiro CC (2011) Restart strategies for grasp with path-relinking heuristics. Optim Lett 5(3):467–478

    Article  MathSciNet  MATH  Google Scholar 

  17. Ross SM (1996) Stochastic processes. Wiley, New York

    MATH  Google Scholar 

  18. Sergienko IV, Shilo VP, Roshchin VA (2000) Restart technology for solving discrete optimization problems. Cybern Syst Anal 36(5):659–666

    Article  MathSciNet  MATH  Google Scholar 

  19. Sergienko IV, Shilo VP, Roshchin VA (2004) Optimization parallelizing for discrete programming problems. Cybern Syst Anal 40(2):184–189

    Article  MathSciNet  MATH  Google Scholar 

  20. Shylo V, Shylo OV (2011) Path relinking scheme for the max-cut problem within global equilibrium search. IJSIR 2(2):42–51

    MATH  Google Scholar 

  21. Shylo O, Prokopyev O, Rajgopal J (2011) On algorithm portfolios and restart strategies. Oper Res Lett 39(1):49–52

    Article  MathSciNet  MATH  Google Scholar 

  22. Shylo OV, Middelkoop T, Pardalos PM (2011) Restart strategies in optimization: parallel and serial cases. Parallel Comput 37:60–68

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Tennessee, 851 Neyland Drive, 37996, Knoxville, TN, USA

    Oleg V. Shylo

  2. University of Pittsburgh, 1048 Benedum Hall, 15261, Pittsburgh, PA, USA

    Oleg A. Prokopyev

Authors
  1. Oleg V. Shylo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oleg A. Prokopyev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oleg V. Shylo .

Editor information

Editors and Affiliations

  1. Department of Statistics and Operations, University of Valencia, Valencia, Spain

    Rafael Martí

  2. University of Florida Industrial and Systems Engineering, Gainesville, Florida, USA

    Pardalos Panos

  3. AT & T Labs Research, Florham Park, New Jersey, USA

    Mauricio G.C. Resende

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing AG

About this entry

Cite this entry

Shylo, O.V., Prokopyev, O.A. (2015). Restart Strategies. In: Martí, R., Panos, P., Resende, M. (eds) Handbook of Heuristics. Springer, Cham. https://doi.org/10.1007/978-3-319-07153-4_15-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07153-4_15-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Cham

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

  • eBook Packages: Springer Reference MathematicsReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation