Skip to main content
Log in

A novel optimization hardness indicator based on the relationship between optimization hardness and frequency features of real-parameter problems

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

For evolutionary algorithms with the ability to self-adapt, linking the algorithmic operators and the problem features is one of the most interesting topics. One of the best ways to begin a study of this topic is to explore the relationship between the optimization hardness and the problem features. This paper attempts to interpret the relationship between optimization hardness and frequency features of real-parameter problems through a qualitative analysis based on an idealized model. Based on the results of a theoretically qualitative analysis, the effective high-frequency ratio (EHFR) is subsequently proposed to measure the optimization hardness of real-parameter problems. Finally, three aspects to the performance of EHFR are evaluated: stability, precision and ability to distinguish. Test results show that the EHFR is relevant not only for the results of theoretical analysis, but also for the other features related to the optimization hardness.

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Auger A, Teytaud O (2007) Continuous Lunches are Free! Gecco 2007: genetic and evolutionary computation conference, vol 1 and 2, pp 916–922

  • Bao Y, Hu Z, Xiong T (2013) A PSO and pattern search based memetic algorithm for SVMs parameters optimization. Neurocomputing 117:98–106

    Article  Google Scholar 

  • Beyer H-G (2000) Evolutionary algorithms in noisy environments: theoretical issues and guidelines for practice. Computer Methods Appl Mech Eng 186(2–4):239–267

    Article  Google Scholar 

  • Borenstein Y, Poli R (2005) Information landscapes. In: Proceedings of the 2005 conference on genetic and evolutionary computation. ACM, Washington, DC, pp 1515–1522

  • Caraffini F, Neri F, Picinali L (2014) An analysis on separability for memetic computing automatic design. Inf Sci 265:1–22

    Article  MathSciNet  Google Scholar 

  • Chan KY, Aydin ME, Fogarty TC (2003) An epistasis measure based on the analysis of variance for the realcoded representation in genetic algorithms. In: Cec: 2003 Congress on evolutionary computation, vol 1–4, proceedings, pp 297–304

  • Chen J, Xin B, Peng Z, Dou L, Zhang J (2009) Optimal contraction theorem for exploration–exploitation tradeoff in search and optimization. IEEE Trans Syst Man Cybernet Part A—Syst Hum 39(3):680–691

    Article  Google Scholar 

  • Cook Z, Franks DW, Robinson EJH (2013) Exploration versus exploitation in polydomous ant colonies. J Theor Biol 323:49–56

    Article  Google Scholar 

  • Corne D, Oates M, Kell D (2003) Landscape state machines: tools for evolutionary algorithm performance analyses and landscape/algorithm mapping. In: Raidl G, Coimbra CS (eds) Applications of evolutionary computing, vol 2611. Springer, Portugal, pp 187–198

  • Crepinsek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):1–33

    Article  Google Scholar 

  • Davidor Y, Schwefel HP, Manner R (1991) Epistasis variance: a viewpoint on GA-hardness In foundations of genetic algorithms. Morgan Kauffman, San Mateo

    Google Scholar 

  • Gibbs MS, Maier HR, Dandy GC (2011) Relationship between problem characteristics and the optimal number of genetic algorithm generations. Eng Optim 43(4):349–376

    Article  Google Scholar 

  • González RC, Woods RE (2002) Digital image processing, 2nd edn. Prentice Hall, Upper Saddle River

    Google Scholar 

  • He J, Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell 127(1):57–85

    Article  MathSciNet  Google Scholar 

  • He J, Yao X (2003) An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems. In: Cec: 2003 Congress on evolutionary computation, vol 1–4, proceedings, pp 2004–2010

  • He J, Yao X (2003) Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artif Intell 145(1–2):59–97

    Article  MathSciNet  Google Scholar 

  • Hofmann K, Whiteson S, De Rijke M (2013) Balancing exploration and exploitation in listwise and pairwise online learning to rank for information retrieval. Inf Retrieval 16(1):63–90

    Article  Google Scholar 

  • Horn J, Goldberg DE (1994) Genetic algorithm difficulty and the modality of fitness landscapes. In: Foundations of genetic algorithms. Morgan Kaufmann, pp 243–269

  • Igel C, Toussaint M (2004) A No-Free-Lunch theorem for non-uniform distributions of target functions. J Math Model Alg 3:313– 322

  • Jin Y, Branke H (2005) Evolutionary optimization in uncertain environments—a survey. IEEE Trans Evol Comput 9(3):303– 317

  • Jones T (1996) One Operator one landscape, vol 15. Technical Reports 95-02-025, Santa Fe Institute

  • Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th International Conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 184–192

  • Kallel L, Naudts B, Reeves CR (2001) Properties of fitness functions and search landscapes. In: Kallel L, Naudts B, Rogers A (eds) Theoretical aspects of evolutionary computing. Springer, Berlin, pp 175– 206

  • Kauffman S, Levin S (1987) Towards a general theory of adaptive walks on rugged landscapes. J Theor Biol 128(1):11–45

    Article  MathSciNet  Google Scholar 

  • Khor S (2009) Exploring the influence of problem structural characteristics on evolutionary algorithm performance. In: 2009 IEEE Congress on evolutionary computation, vol 1–5. IEEE, Trondheim, pp 3345–3352

  • Levitan B, Kauffman S (1995) Adaptive walks with noisy fitness measurements. Mol Divers 1(1):53–68

    Article  Google Scholar 

  • Li J (2003) Research on fitness landscapes of genetic algorithms and GA-hardness. Tianjin University, Tian Jin

  • Li K, Li M, Chen H (2013) An estimation method of optimal feature factor based on the balance of exploration and exploitation. In: Information and automation (ICIA), IEEE International Conference on 2013

  • Lipsitch M (1991) Adaptation on rugged landscapes generated by local interactions of neighboring genes. In: Belew RK, Booker LB (eds) Proceedings of the 4th International Conference on genetic algorithms. Morgan Kaufmann, San Diego, pp 128–135

  • Malan KM, Engelbrecht AP (2009) Quantifying ruggedness of continuous landscapes using entropy. In: 2009 IEEE Congress on evolutionary computation, vol 1–5. Trondheim, Norway, pp 1440– 1447

  • Malan KM, Engelbrecht AP (2013) A survey of techniques for characterising fitness landscapes and some possible ways forward. Inf Sci 241:148–163

    Article  Google Scholar 

  • Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337–352

    Article  Google Scholar 

  • Merz P, Freisleben B (2000) Fitness landscapes, memetic algorithms, and Greedy operators for graph bipartitioning. Evol Comput 8(1):61–91

    Article  Google Scholar 

  • Merz P, Freisleben B (2001) Memetic algorithms for the traveling salesman problem. Complex Syst 13(4):279–345

  • Molina D, Herrera F, Lozano M (2005) Adaptive local search parameters for real-coded memetic algorithms. In: Evolutionary computation, 2005. The 2005 IEEE Congress

  • Naudts B, Kallel L (2000) A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Trans Evol Comput 4(1):1–15

    Article  Google Scholar 

  • Naudts B, Suys D, Verschoren A (1997) Epistasis as a basic concept in formal landscape analysis. In: Proceedings of the 7th International Conference on genetic algorithms. Morgan Kaufmann, pp 65–72

  • Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1–14

    Article  Google Scholar 

  • Neri F, Cotta C, Moscato P (2012) Handbook of memetic algorithm. Springer, Berlin, Heidelberg

    Book  Google Scholar 

  • Neri F, Mininno E, Lacca G (2013) Compact particle swarm optimization. Inf Sci 239:96–121

    Article  Google Scholar 

  • Nguyen QH, Ong YS, Krasnogor N (2007) A study on the design issues of memetic algorithm. In: Evolutionary computation, 2007. CEC 2007. IEEE Congress

  • Ong Y-S, Lim M-H, Chen X (2010) Memetic computation: past, present and future (Research Frontier). Comput Intell Mag IEEE 5(2):24–31

    Article  Google Scholar 

  • Ong Y-S, Lim M-H, Zhu N, Wong K-W (2006) Classification of adaptive memetic algorithms: a comparative study. Syst Man Cybernet Part B: Cybernet IEEE Trans 36(1):141–152

    Article  Google Scholar 

  • Oppenheim AV, Willsky AS, Hamid S (1996) Signals and systems. Prentice Hall, Upper Saddle River, New Jersey, US

  • Piotrowski AP (2013) Adaptive memetic differential evolution with global and local neighborhood-based mutation operators. Inf Sci 241:164–194

    Article  Google Scholar 

  • Reeves CR, Wright CC (1995) Epistasis in genetic algorithms: an experimental design perspective. In: Proceedings of the 6th International Conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 217–224

  • Reidys CM, Stadler PF (2001) Neutrality in fitness landscapes. Appl Math Comput 117(2–3):321–350

    Article  MathSciNet  Google Scholar 

  • Rowe W, Corne D, Knowles J (2006) Predicting stochastic search algorithm performance using landscape state machines. In: 2006 IEEE Congress on evolutionary computation, vol 1–6, pp 2929–2936

  • Seo DI, Choi SS, Moon BR (2004) New epistasis measures for detecting independently optimizable partitions of variables. In: Kalyanmoy D, Harman M, Holland O (eds) Genetic and evolutionary computation Conference 2004. Seattle, pp 26–30

  • Seo DI, Kim Y-H, Moon B-R (2003) New entropy-based measures of gene significance and epistasis. Genetic Evol Comput—Gecco 2003 Pt Ii Proc E CantuPaz FJA 2724:1345–1356

    Article  Google Scholar 

  • Seo DI, Moon BR (2005) Computing the epistasis variance of large-scale traveling salesman problems. In: Beyer HG (ed) Gecco 2005: genetic and evolutionary computation Conference, vols 1 and 2. Assoc Computing Machinery, New York, pp 1169–1176

  • Smith T, Husbands P, Layzell P, O’shea M (2002) Fitness landscapes and evolvability. Evol Comput 10(1):1–34

    Article  Google Scholar 

  • Stadler P, Institute S (1995) Towards a theory of landscapes. In: López-Peña R, Waelbroeck H, Capovilla R, García-Pelayo R, Zertuche F (eds) Complex systems and binary networks, vol 461–461. Springer, Berlin, Heidelberg, pp 78–163

  • Stadler PF (1996) Landscapes and their correlation functions. J Math Chem 20(1):1–45

    Article  MathSciNet  Google Scholar 

  • Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y-P, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Singapore

  • Sutton AM, Whitley D, Lunacek M, Howe A (2006) PSO and multi-funnel landscapes: how cooperation might limit exploration. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation. ACM, Seattle, Washington, pp 75–82

  • Vassilev V, Fogarty T, Miller J (2003) Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application. In: Ghosh A, Tsutsui S (eds) Advances in evolutionary computing. Springer, Berlin, Heidelberg, pp 3–44

  • Vassilev VK, Fogarty TC, Miller JF (2000) Information characteristics and the structure of landscapes. Evol Comput 8(1):31–60

    Article  Google Scholar 

  • Volchenkov D, Helbach J, Tscherepanow M, Kuehnel S (2013) Exploration–exploitation trade-off features a saltatory search behaviour. J R Soc Interface 10(85):1–12

    Article  Google Scholar 

  • Weinberger E (1990) Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol Cybernet 63(5):325–336

    Article  Google Scholar 

  • Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82

    Article  Google Scholar 

  • Yang H, Li J, Li M (2012) Evolutionary algorithms: schema, emergence and hardness. Science Press, Beijing

    Google Scholar 

Download references

Acknowledgments

This work is partially supported by the national natural science foundation of China (NSFC) under Granted No. 61262019 and No. 61202112.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kun Li.

Additional information

Communicated by V. Loia.

Appendices

Appendix A: Discussion of general solutions to \(f'_{i+j=0}\)

The imaginary unit is denoted by \(I\) in this appendix, and Eq. (21a) is the decomposed form of Eq. (5) using the Euler equation.

$$\begin{aligned}&\frac{1}{{2I}}\left\{ - iw_{1} c_{i} \mathrm{e}^{{I\left( {iw_{1} x + \varphi _{i} } \right) }} + iw_{1} c_{i} \mathrm{e}^{{ - I\left( {iw_{1} x + \varphi _{i} } \right) }}\right. \nonumber \\&\quad \left. - jw_{1} c_{i} \mathrm{e}^{{I\left( {jw_{1} x + \varphi _{j} } \right) }} + jw_{1} c_{j} \mathrm{e}^{{ - I\left( {jw_{1} x + \varphi _{j} } \right) }} \right\} = 0\end{aligned}$$
(21a)
$$\begin{aligned}&\frac{1}{2I}\left\{ iw_1 c_i \mathrm{e}^{-Iiw_1 x} \mathrm{e}^{-I\varphi _i }+jw_1 c_j \mathrm{e}^{-Ijw_1 x} \mathrm{e}^{-I\varphi _j }\right. \nonumber \\&\quad \left. -iw_1 c_i e^{Iiw_1 x} \mathrm{e}^{I\varphi _i }-jw_1 c_i \mathrm{e}^{Ijw_1 x} \mathrm{e}^{I\varphi _j } \right\} =0 \end{aligned}$$
(21b)
$$\begin{aligned}&Q= \mathrm{e}^{I({w_1 x})}\end{aligned}$$
(21c)
$$\begin{aligned}&x=\frac{\ln Q}{Iw_1 } \end{aligned}$$
(21d)
$$\begin{aligned}&\frac{1}{2I}\left\{ iw_1 c_i Q^{-i} \mathrm{e}^{-I\varphi _i }+jw_1 c_j Q^{-j} \mathrm{e}^{-I\varphi _j }\right. \nonumber \\&\quad \left. -iw_1 c_i Q^ie^{I\varphi _i }-jw_1 c_j Q^j \mathrm{e}^{I\varphi _j } \right\} =0 \end{aligned}$$
(21e)
$$\begin{aligned}&\frac{-1}{2IQ^j}\left\{ jw_1 c_j \mathrm{e}^{I\varphi _j }Q^{2j}+iw_1 c_i \mathrm{e}^{I\varphi _i }Q^{j+i}\right. \nonumber \\&\quad \left. -iw_1 c_i \mathrm{e}^{-I\varphi _i }Q^{j-i}-jw_1 c_j \mathrm{e}^{-I\varphi _j } \right\} =0 \end{aligned}$$
(21f)

According to Sect. 3.1, \(j\) and \(i\) are natural numbers and \(j>i>0\), and \(2j\) is the largest exponent of \(Q\). Evidently, Eq. (21f) is a high-order equation of \(Q\). According to the Abel–Ruffini theorem, the general solution for Eq. (21f) does not exist when \(j>2\). In the idealized model, \(j\) cannot be restricted below two, and arithmetical solutions to Eq. (21f) are useless for the analysis in Sect. 3. Thus, defining the intermediate variable \(t\) is a necessary step in the theoretical analysis of Sect. 3.

Appendix B: Details of the OR estimating method

The method for estimating the OR begins from the global optimum of the test function. Each dimension of the global optimum will be searched in two directions to find the points of inflection, which are found within the boundary of the OSC. The OSC for the test functions can be estimated with the coordinates of these inflecting points. The ratio for the estimated size of OSC to the size of the entire search space is the estimated value of OR. This method, however, leads unavoidably to the OR that is inaccurate. Two reasons example the inaccuracy: (1) the real points of inflection may be in the interval of two sampling points, and (2) the real figure of the OSC may differ from the estimation. These two reasons are illustrated in Fig. 11.

Fig. 11
figure 11

Reasons for inaccuracy with the OR estimating method

In Fig. 11a, the solid line denotes the real curve of the fitness function, and the dashed line denotes the false curve of the sampling process. In Fig. 11b, the solid line denotes the real region of the OSC, and the dashed line denotes the estimated OSC results. Given the first reason for the inaccuracy, increasing the sampling point is an effective way to solve the problem, but with high computational costs. Increasing the search directions can partially resolve the inaccuracy, given the second reason. This, however, also comes at the price of increased computational costs.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, K., Li, M. & Chen, H. A novel optimization hardness indicator based on the relationship between optimization hardness and frequency features of real-parameter problems. Soft Comput 19, 2287–2303 (2015). https://doi.org/10.1007/s00500-014-1419-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-014-1419-1

Keywords

Navigation