Advertisement

Soft Computing

, Volume 15, Issue 11, pp 2275–2285 | Cite as

EM323: a line search based algorithm for solving high-dimensional continuous non-linear optimization problems

  • Vincent Gardeux
  • Rachid Chelouah
  • Patrick Siarry
  • Fred Glover
Focus

Abstract

This paper presents a performance study of a one-dimensional search algorithm for solving general high-dimensional optimization problems. The proposed approach is a hybrid between a line search algorithm of Glover (The 3-2-3, stratified split and nested interval line search algorithms. Research report, OptTek Systems, Boulder, CO, 2010) and an improved variant of a global method of Gardeux et al. (Unidimensional search for solving continuous high-dimensional optimization problems. In: ISDA ’09: Proceedings of the 2009 ninth international conference on intelligent systems design and applications, IEEE Computer Society, Washington, DC, USA, pp 1096–1101, 2009) that uses line search algorithms as subroutines. The resulting algorithm, called EM323, was tested on 19 scalable benchmark functions, with a view to observing how optimization techniques for continuous optimization problems respond with increasing dimension. To this end, we report the algorithm’s performance on the 50, 100, 200, 500 and 1,000-dimension versions of each function. Computational results are given comparing our method with three leading evolutionary algorithms. Statistical analysis discloses that our method outperforms the other methods by a significant margin.

Keywords

Metaheuristic Line search Optimization Continuous High-dimension 

References

  1. Auger A, Hansen N (2005) A restart CMA evolution strategy with increasing population size. In: The 2005 IEEE congress on evolutionary computation, vol 2, pp 1769–1776Google Scholar
  2. Eshelman L, Schaffer J (1993) Real-coded genetic algorithms and interval-schemata. Foundation of Genetic Algorithms 2:187–202Google Scholar
  3. García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15(6):617–644MATHCrossRefGoogle Scholar
  4. Gardeux V, Chelouah R, Siarry P, Glover F (2009) Unidimensional search for solving continuous high-dimensional optimization problems. In: ISDA ’09: Proceedings of the 2009 ninth international conference on intelligent systems design and applications, IEEE Computer Society, Washington, DC, USA, pp 1096–1101Google Scholar
  5. Glover F (1995) Tabu thresholding: improved search by nonmonotonic trajectories. ORSA J Comput 7(4):426–442MATHGoogle Scholar
  6. Glover F (2010) The 3-2-3, stratified split and nested interval line search algorithms. Research report, OptTek Systems, Boulder, COGoogle Scholar
  7. Grosan C, Abraham A (2007) Modified line search method for global optimization. In: AMS ’07: Proceedings of the first Asia international conference on modelling & simulation, IEEE Computer Society, Washington, DC, USA, pp 415–420Google Scholar
  8. Herrera F, Lozano M (2009) Benchmark functions 7–11. In: Tech. rep., Workshop: evolutionary algorithms and other metaheuristics for continuous optimization problems—a scalability test. http://sci2s.ugr.es/programacion/workshop/functions7-11.pdf
  9. Hestenes MR, Stiefel E (1952) Methods of conjugate gradients for solving linear systems. J Res Natl Bureau Standards 49(6):409–436MATHGoogle Scholar
  10. Lee E (2007) Large-scale optimization-based classification models in medicine and biology. Ann Biomed Eng 35:1095–1109CrossRefGoogle Scholar
  11. Marti R, Laguna M, Glover F (2006) Principles of scatter search. Eur J Oper Res 169:359–372MATHCrossRefGoogle Scholar
  12. Nasiri JA, Fard AM, Naghibzadeh M, Rouhani M (2009) High dimensional problem optimization using distributed multi-agent PSO. In: EMS ’09: Proceedings of the 2009 third UKSim European symposium on computer modeling and simulation, IEEE Computer Society, Washington, DC, USA, pp 245–250Google Scholar
  13. Storn R, Price K (1997) Differential evolution, a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MATHCrossRefGoogle Scholar
  14. Tang K, Yao X, Suganthan PN, MacNish C, Chen YP, Chen CM, Yang Z (2007) Benchmark functions for the CEC’2008 special session and competition on large scale global optimization. Tech. rep., Nature Inspired Computation and Applications Laboratory, USTC , China, http://nical.ustc.edu.cn/cec08ss.php
  15. Tseng LY, Chen C (2008) Multiple trajectory search for large scale global optimization. In: IEEE congress on evolutionary computation, pp 3052–3059Google Scholar
  16. Whitley D, Beveridge R, Graves C, Mathias K (1995) Test driving three 1995 genetic algorithms: new test functions and geometric matching. J Heuristics 1:77–104MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  • Vincent Gardeux
    • 1
  • Rachid Chelouah
    • 1
  • Patrick Siarry
    • 2
  • Fred Glover
    • 3
  1. 1.EISTI, L@risCergy-PontoiseFrance
  2. 2.Université de Paris 12, LiSSiCréteilFrance
  3. 3.OptTek Systems, Inc.BoulderUSA

Personalised recommendations