Skip to main content

A Look-Ahead Based Meta-heuristics for Optimizing Continuous Optimization Problems

  • Conference paper
  • First Online:
Optimization, Learning Algorithms and Applications (OL2A 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1488))

  • 1252 Accesses

Abstract

In this paper, the famous kernighan-Lin algorithm is adjusted and embedded into the simulated annealing algorithm and the genetic algorithm for continuous optimization problems. The performance of the different algorithms are evaluated using a set of well known optimization test functions.

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

Similar content being viewed by others

References

  1. Ardia, D., Boudt, K., Carl, P., Mullen, K., Peterson, B.G.: Differential evolution with DEoptim: an application to non-convex portfolio optimization. R J. 3(1), 27–34 (2011)

    Article  Google Scholar 

  2. Ardia, D., David, J., Arango, O., Gómez, N.D.G.: Jump-diffusion calibration using differential evolution. Wilmott 2011(55), 76–79 (2011)

    Article  Google Scholar 

  3. Arun, N., Ravi, V.: ACONM: A Hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search. Institute for Development and Research in Banking Technology (IDRBT), India (2009)

    Google Scholar 

  4. Bouhmala, N.: Combining simulated annealing with local search heuristic for MAX-SAT. J. Heuristics 25(1), 47–69 (2019). https://doi.org/10.1007/s10732-018-9386-9

    Article  Google Scholar 

  5. Chelouah, R., Siarry, P.: Tabu search applied to global optimization. Eur. J. Oper. Res. 123(2), 256–270 (2000)

    Article  MathSciNet  Google Scholar 

  6. Chelouah, R., Siarry, P.: Genetic and Nelder-mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. Eur. J. Oper. Res. 148(2), 335–348 (2003)

    Article  MathSciNet  Google Scholar 

  7. De Castro, L.N., Von Zuben, F.J.: Learning and optimization using the clonal selection principle. IEEE Trans. Evol. Comput. 6(3), 239–251 (2002)

    Article  Google Scholar 

  8. Goldberg, D.E.: Genetic algorithms in search. Optimization, and Machine Learning (1989)

    Google Scholar 

  9. Holland John, H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    MATH  Google Scholar 

  10. Jensen, B., Bouhmala, N., Nordli, T.: A novel tangent based framework for optimizing continuous functions. J. Emerg. Trends Comput. Inf. Sci. 4(2), 239–247 (2013)

    Google Scholar 

  11. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)

    Article  Google Scholar 

  12. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  13. Surjanovic, S., Bingham, D.: Virtual library of simulation experiments: Test functions and datasets. http://www.sfu.ca/~ssurjano

  14. Tank, M.: An ant colony optimization and Nelder-mead simplex search hybrid algorithm for unconstrained optimization (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Noureddine Bouhmala .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nordli, T., Bouhmala, N. (2021). A Look-Ahead Based Meta-heuristics for Optimizing Continuous Optimization Problems. In: Pereira, A.I., et al. Optimization, Learning Algorithms and Applications. OL2A 2021. Communications in Computer and Information Science, vol 1488. Springer, Cham. https://doi.org/10.1007/978-3-030-91885-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-91885-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-91884-2

  • Online ISBN: 978-3-030-91885-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics