Advertisement

Applied Intelligence

, Volume 47, Issue 2, pp 409–429 | Cite as

A variant of environmental adaptation method with real parameter encoding and its application in economic load dispatch problem

  • Bhavna SharmaEmail author
  • Ravi Prakash
  • Shailesh Tiwari
  • K. K. Mishra
Article

Abstract

Environmental Adaptation Method (EAM) and Improved Environmental Adaptation Method (IEAM) were proposed to solve optimization problems with the biological theory of adaptation in mind. Both of these algorithms work with binary encoding, and their performance is comparable with other state-of-art algorithms. To further improve the performance of these algorithms, some major changes are incorporated into the proposed algorithm. The proposed algorithm works with the real value parameter encoding, and, in order to maintain significant convergence rate and diversity, it maintains a balance between exploitation and exploration. The choice to explore or exploit a solution depends on the fitness of the individual. The performance of the proposed algorithm is compared with 17 state-of-art algorithms in 2-D, 3-D, 5-D, 10-D and 20-D dimensions using the COCO (COmparing Continuous Optimisers) framework with Black-Box Optimization Benchmarking (BBOB) functions. It outperforms all other algorithms in 3-D and 5-D, and its performance is comparable to other algorithms for other dimensions. In addition, IEAM-R has been applied to the real world problem of economic load dispatch, and its results demonstrate that it gives minimum fuel cost when compared to other algorithms in different cases.

Keywords

Real parameter encoding Adaptation Economic load dispatch problem 

Notes

Acknowledgments

We are thankful to Mr. Mathew J. Lane (University of Missouri-St. Louis) and Mr. Rahul Dey (Birla Institute of Technology, Mesra), for their help in correcting the grammatical errors in the paper. We are indebted to the reviewers and the editor of the Applied Intelligence journal for their valuable help in improving the quality of manuscript.

References

  1. 1.
    Mishra K, Shailesh Tiwari K, Misra AK (2011) A bio inspired algorithm for solving optimization problems. In: 2011 2nd International Conference on IEEE Computer and Communication Technology (ICCCT)Google Scholar
  2. 2.
    Storn Rainer, Price Kenneth (1997) Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95–99CrossRefGoogle Scholar
  4. 4.
    Baldwin JM (1896) A new factor in evolution (Continued). Am Nat:536–553Google Scholar
  5. 5.
    Mishra KK, Tiwari S, Misra AK (2012) Improved environmental adaption method for solving optimization problems. In: Computational Intelligence and Intelligent Systems. Springer, Berlin Heidelberg, pp 300–313CrossRefGoogle Scholar
  6. 6.
    Mishra KK, Tiwari S, Misra AK (2014) Improved environmental adaption method and its application in test case generation. Journal of Intelligent &, Fuzzy Systems: Applications in Engineering and Technology 27(5):2305–2317Google Scholar
  7. 7.
    Tang L, Dong Y, Liu J (2015) Differential evolution with an individual-dependent mechanism. IEEE Trans Evol Comput 19(4):560–574CrossRefGoogle Scholar
  8. 8.
    Storn R, Price K (1995) Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces, vol 3. ICSI, BerkeleyzbMATHGoogle Scholar
  9. 9.
    Guo S-M, Yang C-C, Hsu P-H, Tsai JS-H (2014) Improving differential evolution with successful-parent-selecting framework. IEEE Trans Evol Comput 19(5):717–730CrossRefGoogle Scholar
  10. 10.
    Qin A, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417CrossRefGoogle Scholar
  11. 11.
    Mallipeddi R, Suganthan PN, Pan Q-K, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput 11(2):1679–1696CrossRefGoogle Scholar
  12. 12.
    Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15(1):55–66CrossRefGoogle Scholar
  13. 13.
    Zhang J, Sanderson AC (2009) Jade: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958CrossRefGoogle Scholar
  14. 14.
    Kennedy, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE Interational Conference Neutral Network. Perth, Australia, vol 4, pp 1942–1948Google Scholar
  15. 15.
    Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of the IEEE International Conference Evolutionary Computation, pp 69–73Google Scholar
  16. 16.
    Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proceeding of the Congress on Evolutionary Computation, vol 3, p 19451950Google Scholar
  17. 17.
    Ratnaweera A, Halgamuge SK, Watson HC (2004) Self organizing hierarchical particle swarm optimizer with Time-Varying acceleration coefficients. IEEE Trans Evol Comput 8(3):240–255CrossRefGoogle Scholar
  18. 18.
    Pant M, Thangaraj R, Abraham A (2011) DE-PSO: a new hybrid meta-heuristic for solving global optimization problems. New Mathematics and Natural Computation 7(03):363–381MathSciNetCrossRefGoogle Scholar
  19. 19.
    Ingo R (1989) Evolution strategy: Nature’s way of optimization. Optimization: Methods and applications, possibilities and limitations Springer Berlin Heidelberg:106–126Google Scholar
  20. 20.
    Hansen N (2005) The CMA evolution strategy: a tutorial. Vu le 29Google Scholar
  21. 21.
    Hoffmeister F, Bäck T (1991) Genetic algorithms and evolution strategies. Similarities and differences. Springer, Berlin HeidelbergGoogle Scholar
  22. 22.
    Hansen N, Müller SD, Koumoutsakos P (2003) Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol Comput 11Google Scholar
  23. 23.
    Auger A, Hansen N (2005) A restart cma evolution strategy with increasing population size. In: IEEE Congress on Evolutionary Computation. IEEE Press, pp 1769–1776Google Scholar
  24. 24.
    Hansen N (2009) Benchmarking a BI-population CMA-ES on the BBOB- 2009 function testbed. In: GECCO Companion, pp 2389–2396Google Scholar
  25. 25.
    Loshchilov I (2013) CMA-ES With restarts for solving CEC 2013 benchmark problems. 2013 IEEE Congress on Evolutionary Computation (CEC), IeeeGoogle Scholar
  26. 26.
    Hansen N, Auger A, Finck S, Ros R (2009) Real-parameter black-box optimization benchmarking 2009: experimental setup. Technical Report RR-6828. INRIAGoogle Scholar
  27. 27.
    Hansen N, Auger A, Finck S, Ros R (2010) Real-parameter black-box optimization benchmarking: Experimental setup. Technical Report RR-7215. INRIA:2010Google Scholar
  28. 28.
    Hansen N, Finck S, Ros R, Auger A (2009) Real-Parameter black-box optimization benchmarking 2009: noiseless functions definitions. INRIA Technical Report RR-6829Google Scholar
  29. 29.
    Finck S, Hansen N, Ros R, Auger A (February 2010) Real-parameter black-box optimization benchmarking 2009: Presentation of the noiseless functions. Technical Report 2009/20, Research Center PPE, 2009 UpdatedGoogle Scholar
  30. 30.
    Pošík P, Klemš V (2012) Benchmarking the differential evolution with adaptive encoding on noiseless functions. In: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation. ACMGoogle Scholar
  31. 31.
    Loshchilov I, Schoenauer M, Sebag M (2012) Alternative restart strategies for CMA-ES. Parallel Problem Solving from Nature-PPSN XII Springer Berlin Heidelberg:296–305Google Scholar
  32. 32.
    Pošík P, Klemš V (2012) Jade, an adaptive differential evolution algorithm, benchmarked on the bbob noiseless testbed. In: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation. ACMGoogle Scholar
  33. 33.
    Pál L (2013) Benchmarking a hybrid multi level single linkage algorithm on the bbob noiseless testbed. In: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation. ACMGoogle Scholar
  34. 34.
    El-Abd M, Kamel MS (2009) Black-box optimization benchmarking for noiseless function testbed using particle swarm optimization. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers. ACMGoogle Scholar
  35. 35.
    García-Nieto J, Alba E, Apolloni J (2009) Noiseless functions black-box optimization: evaluation of a hybrid particle swarm with differential operators. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers. ACMGoogle Scholar
  36. 36.
    Kern S, Hansen N, Koumoutsakos P (2006) Local meta-models for optimization using evolution strategies. Parallel Problem Solving from Nature-PPSN IX Springer Berlin Heidelberg:939–948Google Scholar
  37. 37.
    Auger A, Brockhoff D, Hansen N, Brockhoff D, Hansen N (2013) Benchmarking the local metamodel CMA-ES on the noiseless BBOB’2013 test bed. In: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation ACMGoogle Scholar
  38. 38.
    Bajer L, Pitra Z, Holeňa M (2015) Benchmarking gaussian processes and random forests surrogate models on the BBOB noiseless testbed. In: Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference. ACMGoogle Scholar
  39. 39.
    Hansen N (2009) Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers. ACMGoogle Scholar
  40. 40.
    Loshchilov I, Schoenauer M, Sebag M, Schoenauer M, Sebag M (2012) Self-adaptive surrogate-assisted covariance matrix adaptation evolution strategy. In: Proceedings of the 14th annual conference on Genetic and evolutionary computation. ACMGoogle Scholar
  41. 41.
    Loshchilov I, Schoenauer M, Sebag M (2012) Black-box optimization benchmarking of IPOP-saACM-ES and BIPOP-saACM-ES on the BBOB-2012 noiseless testbed. In: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation. ACMGoogle Scholar
  42. 42.
    Munos R (2011) Optimistic optimization of deterministic functions without the knowledge of its smoothness. Adv Neural Inf Proces SystGoogle Scholar
  43. 43.
    Pošík P, Huyer W, Pál L (2012) A comparison of global search algorithms for continuous black box optimization. Evol Comput 20(4):509–541CrossRefGoogle Scholar
  44. 44.
    Holtschulte NJ, Moses M (2013) Benchmarking cellular genetic algorithms on the BBOB noiseless testbed. In: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation. ACMGoogle Scholar
  45. 45.
    Sinha N, Chakrabarti R, Chattopadhyay PK (2003) Evolutionary programming techniques for economic load dispatch. IEEE Trans Evol Comput 7(1):83–94CrossRefGoogle Scholar
  46. 46.
    Karthikeyan V, Senthilkumar S, Vijayalakshmi VJ (2013) A new approach to the solution of economic dispatch using particle swarm optimization with simulated annealing. arXiv:1307.3014
  47. 47.
    Chen W-N, et al (2013) Particle swarm optimization with an aging leader and challengers. IEEE Trans Evol Comput 17(2):241–258CrossRefGoogle Scholar
  48. 48.
    Liu D, Cai Y (2005) Taguchi method for solving the economic dispatch problem with nonsmooth cost functions. IEEE Trans Power Syst 20(4):2006–2014CrossRefGoogle Scholar
  49. 49.
    Rahmani R, et al (2012) Solving economic dispatch problem using particle swarm optimization by an evolutionary technique for initializing particles. Journal of Theoretical and Applied Information Technology 46(2):526–536MathSciNetGoogle Scholar
  50. 50.
    dos Santos Coelho (2008) Solving economic load dispatch problems in power systems using chaotic and Gaussian particle swarm optimization approaches. Int J Electr Power Energy Syst 30(5):297–307, Lee, C-SCrossRefGoogle Scholar
  51. 51.
    Roy R, Ghoshal SP (2008) A novel crazy swarm optimized economic load dispatch for various types of cost functions. Int J Electr Power Energy Syst 30(4):242–253CrossRefGoogle Scholar
  52. 52.
    Dewangan SK, Jain A, Huddar AP A Traditional Approach to Solve Economic Load Dispatch Problem Considering the Generator Constraints. IOSR J Electron Electr Eng (IOSR-JEEE) e-ISSN: 2278-1676Google Scholar
  53. 53.
    Gaing Z-L (2003) Particle swarm optimization to solving the economic dispatch considering the generator constraints. IEEE Trans Power Syst 18(3):1187–1195CrossRefGoogle Scholar
  54. 54.
    Jeyakumar DN, Jayabarathi T, Raghunathan T (2006) Particle swarm optimization for various types of economic dispatch problems. Int J Electr Power Energy Syst 28(1):36–42CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  • Bhavna Sharma
    • 1
    Email author
  • Ravi Prakash
    • 2
  • Shailesh Tiwari
    • 3
  • K. K. Mishra
    • 4
  1. 1.Oracle India Private Limited, HyderabadAndhra PradeshIndia
  2. 2.Computer Science & Engineering DepartmentMotilal Nehru National Institute of Technology AllahabadAllahabadIndia
  3. 3.Computer Science & Engineering DepartmentABES Engineering CollegeGhaziabadIndia
  4. 4.Department of Mathematics and Computer ScienceUniversity of MissouriSt. LouisUSA

Personalised recommendations