Skip to main content
Log in

Three new stochastic local search algorithms for continuous optimization problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper introduces three new stochastic local search metaheuristics algorithms namely, the Best Performance Algorithm (BPA), the Iterative Best Performance Algorithm (IBPA) and the Largest Absolute Difference Algorithm (LADA). BPA and IBPA are based on the competitive nature of professional athletes, in them desiring to improve on their best recorded performances. LADA is modeled on calculating the absolute difference between two numbers. The performances of the algorithms have been tested on a large collection of benchmark unconstrained continuous optimization functions. They were benchmarked against two well-known local-search metaheuristics namely, Tabu Search (TS) and Simulated Annealing (SA). Results obtained show that each of the new algorithms delivers higher percentages of the best and mean function values found, compared to both TS and SA. The execution times of these new algorithms are also comparable. LADA gives the best performance in terms of execution time.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Krauth, W.: Introduction to Monte Carlo algorithms. In: Kertesz, J., Kondor, I. (eds.) Advances in Computer Simulation. Lecture Notes in Physics. Springer, Berlin (1998)

    Google Scholar 

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

    Google Scholar 

  3. Storn, R., Price, K.: Differential evolution — a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Price, K., Storn, R., Lampinen, A.: Differential Evolution: a Practical Approach to Global Optimization. Springer Natural Computing Series (2005)

    Google Scholar 

  5. Dorigo, M.: Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italie (1992)

  6. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)

    Article  Google Scholar 

  7. Krishnand, K.N., Ghose, D.: Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intell. 3, 87–124 (2009)

    Article  Google Scholar 

  8. Krishnand, K.N., Ghose, D.: Glowworm Swarm Optimisation: a new method for optimizing multimodal functions. Int. J. Comput. Intell. Stud. 1(1), 93–119 (2009)

    Google Scholar 

  9. Glover, F.: Tabu search—part 1. ORSA J. Comput. 1(2), 190–206 (1989)

    Article  MATH  Google Scholar 

  10. Glover, F.: Tabu search - part 2. ORSA J. Comput. 2(1), 4–32 (1990)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Tan, C. M.: Simulated Annealing. In-Tech 2008, ISBN-13: 978-953-7619-07-7 (2008)

  13. Ali, M.M., Khompatraporn, C., Zabinsky, Z.: A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems. Journal of Global Optimization 31, 635–672 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aderemi Oluyinka Adewumi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chetty, S., Adewumi, A.O. Three new stochastic local search algorithms for continuous optimization problems. Comput Optim Appl 56, 675–721 (2013). https://doi.org/10.1007/s10589-013-9566-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-013-9566-3

Keywords

Navigation