Time complexity of proposed evolutionary algorithm in artificial neural network

  • Authors

    • G. G.V.R. Sagar ProfessorRavindra College of Engineering for women
    • IEEE Member
    https://doi.org/10.14419/ijet.v8i3.27503

    Received date: February 18, 2019

    Accepted date: June 12, 2019

    Published date: August 25, 2019

  • Evolutionary Algorithms, Take-Over Time, Wide-Gap Problem, ANOVA

  • Abstract

    The important issue in Evolutionary Algorithms (EAs)analysis, is time-complexity. Here to obtain the mean hitting time of EA the concept of take-overtime is considered. The time complexity of the EA such as the takeover time is considered, i.e.the concept of the takeover time is generalized rather thana selection of operator alone. This generalization is applied to benchmark problems like N-Bit parity. For various input sizes N, the time complexity in terms of number of generations is estimated. An empirical model is also generated for proposed EA using statistical tool.

  • References

    1. Chen et al, “New Approach for analyzing average time complexity of EAs on Unimodal problems”, IEEE Transactions on systems, Man, and Cy-bernetics – Part B, Cybernetics, Vol.39, No.5, October – 2009.
    2. He, X. Yao, Drift analysis and average time complexity of evolutionary algorithms, Artif. Intell. 127 (1) (2001) 57_85.https://doi.org/10.1016/S0004-3702(01)00058-3.
    3. J. Garnier and L. Kallel, “Statistical distribution of the convergence time of evolutionary algorithms for long path problems,” IEEE Trans. Evol. Comput., vol. 4, no. 1, pp. 16–30, Apr. 2000.https://doi.org/10.1109/4235.843492.
    4. Tianshi Chen et al., “Choosing selection pressure for wide-gap problems, Theoretical Computer Science”, 411 (2010) 926_934https://doi.org/10.1016/j.tcs.2009.12.014.
    5. J. He, X. Yao, Drift analysis and average time complexity of evolutionary algorithms, Artif. Intell. 127 (1) (2001) 57_85.https://doi.org/10.1016/S0004-3702(01)00058-3.
    6. S. Khuri, T. Bäck, J. Heitkotter, An evolutionary approach to combinatorial optimization problems, in: D. Cizmar (Ed.), Proc. 22nd Ann. ACM Comput. Sci. Conf., ACM Press, New York, 1994, pp. 66_73.https://doi.org/10.1145/197530.197558.
    7. J. He, C. Reeves, X. Yao, A discussion on posterior and prior measures of problem diffciulties, in: Proc. PPSN IX Workshop on Evolutionary Algo-rithms Bridging Theory and Practice, 2006.
    8. T. Jansen, K.A.D. Jong, I. Wegener, On the choice of the offspring population size in evolutionary algorithms, Evol. Comput. 13 (4) (2005) 413_440.https://doi.org/10.1162/106365605774666921.
    9. Davison, A. C., 2003. Statistical Models. New York: Cambridge University Press.https://doi.org/10.1017/CBO9780511815850.
    10. Rice, John A., 1995. Mathematical Statistics and Data Analysis. Belmont: Duxbury Press.

  • Downloads

  • How to Cite

    G.V.R. Sagar, G., & Member, I. (2019). Time complexity of proposed evolutionary algorithm in artificial neural network. International Journal of Engineering and Technology, 8(3), 210-215. https://doi.org/10.14419/ijet.v8i3.27503