Skip to main content

Quadratic Approximation PSO for Economic Dispatch Problems with Valve-Point Effects

  • Conference paper
Book cover Swarm, Evolutionary, and Memetic Computing (SEMCCO 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6466))

Included in the following conference series:

Abstract

Quadratic Approximation Particle Swarm Optimization (qPSO) is a variant of Particle Swarm Optimization (PSO) which hybridize Quadratic Approximation Operator (QA) with PSO. qPSO is already proven to be cost effective and reliable for the test problems of continuous optimization. Economic dispatch (ED) problem is one of the fundamental issues in power system operations. The problem of economic dispatch turns out to be a continuous optimization problem which is solved using original PSO and its variant qPSO in expectation of better results. Results are also compared with the earlier published results.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liang, Z.X., Glover, J.D.: A zoom feature for a dynamic programming solution to economic dispatch including transmission losses. IEEE Trans. on Power Systems 7(2), 544–550 (1992)

    Article  Google Scholar 

  2. Walters, D.C., Sheble, G.B.: Genetic algorithm solution of economic dispatch with the valve point loading. IEEE Trans. on Power Systems 8(3), 1325–1332 (1993)

    Article  Google Scholar 

  3. Yang, H.T., Yang, P.C., Huang, C.L.: Evolutionary programming based economic dispatch for units with non-smooth fuel cost functions. IEEE Trans. on Power Systems 11(1), 112–118 (1996)

    Article  Google Scholar 

  4. Sinha, N., Chakrabarti, R., Chattopadhyay, P.K.: Evolutionary programming techniques for economic load dispatch. IEEE Trans. On Evolutionary Computations 7(1), 83–94 (2003)

    Article  Google Scholar 

  5. Lin, W.M., Cheng, F.S., Tsay, M.T.: An improved Tabu search for economic dispatch with multiple minima. IEEE Trans. on Power Systems 17(1), 108–112 (2002)

    Article  Google Scholar 

  6. Lee, K.Y., Sode-Yome, A., Park, J.H.: Adaptive Hopfield neural network for economic load dispatch. IEEE Trans. on Power Systems 13(2), 519–526 (1998)

    Article  Google Scholar 

  7. Park, J.B., Lee, K.S., Shin, J.R., Lee, K.Y.: A particle swarm optimization for economic dispatch with nonsmooth cost functions. IEEE Trans. on Power Systems 20(1), 34–42 (2005)

    Article  Google Scholar 

  8. Victoire, T.A.A., Jeyakumar, A.E.: Hybrid PSO-SQP for economic dispatch with valve-point effect. Electric Power Systems Research 71(1), 51–59 (2004)

    Article  Google Scholar 

  9. Jong-Bae, P., Yun-Won, J., Hyun-Houng, K., Joong-Rin, S.: An Improved Particle Swarm Optimization for Economic Dispatch With Valve Point Effect. International Journal of Innovations in Energy Systems and Power 1(1) (November 2006)

    Google Scholar 

  10. Park, J.B., Jeong, Y.W., Shin, J.R., Lee, K.Y., Kim, J.H.: A Hybrid Particle Swarm Optimization Employing Crossover Operation for Economic Dispatch Problems with Valve-point Effects. In: International Conference Intelligent Systems Applications to Power Systems, ISAP 2007, pp. 281–286 (2007)

    Google Scholar 

  11. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings IEEE International Conference Neural Network, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

  12. Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proc. IEEE International Conference on Evolutionary Computation, Piscataway, NJ, pp. 69–73. IEEE Press, Los Alamitos (1998)

    Google Scholar 

  13. Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. In: 2000 Congress on Evolutionary Computing, vol. 1, pp. 84–88 (2000)

    Google Scholar 

  14. Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proc. ICEC 1999, Washington, DC, pp. 1951–1957 (1999)

    Google Scholar 

  15. Deep, K., Bansal, J.C.: Hybridization of Particle Swarm Optimization with Quadratic Approximation. In: OPSEARCH, vol. 46(1), pp. 3–24. Springer, Heidelberg (2009)

    Google Scholar 

  16. Deep, K., Thakur, M.: A new crossover operator for real coded genetic algorithms. Applied Mathematics and Computation 188, 895–911 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms, ch. 4. Wiley, Chichester (2001)

    MATH  Google Scholar 

  18. Deep, K., Das, K.N.: Quadratic approximation based hybrid genetic algorithm for function optimization. Applied Mathematics and Computation 203(1), 86–98 (2008)

    Article  MATH  Google Scholar 

  19. Mohan, C., Shanker, K., Deep, K.: A random search technique for global optimization based on quadratic approximation. Asia Pacific Journal of Operations Research 11, 93–101 (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bansal, J.C., Deep, K. (2010). Quadratic Approximation PSO for Economic Dispatch Problems with Valve-Point Effects. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2010. Lecture Notes in Computer Science, vol 6466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17563-3_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17563-3_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17562-6

  • Online ISBN: 978-3-642-17563-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics