Skip to main content
SpringerLink
Log in

Particle Swarm Optimisation for Operational Planning: Unit Commitment and Economic Dispatch

  • Chapter
Evolutionary Scheduling

Part of the book series: Studies in Computational Intelligence ((SCI,volume 49))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Y.-H. Song, “Introduction” in Modern Optimisation Techniques in Power Ststems, Y.-H. Song, Ed.: Kluwer Academic Publishers, 1999, pp. 1-13.

    Google Scholar 

  2. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines: John Wiley & Sons, 1989.

    Google Scholar 

  3. P. Attaviriyanupap, H. Kita, E. Tanaka, and J. Hasegawa, “A hybrid EP and SQP for dynamic economic dispatch with nonsmooth fuel cost func-tion,” IEEE Trans. Power Syst., vol. 17, pp. 411-416, May 2002.

    Article  Google Scholar 

  4. T. A. A. Victoire and A. E. Jeyakumar, “Hybrid PSO-SQP for economic dispatch with valve-point effect, ”Electric Power Systems Research, vol. 71, pp. 51-59, 2004.

    Article  Google Scholar 

  5. K. Y. Lee and M. A. El-Sharkawa, A Tutorial Course on Evolutionary Computation Techniques for Power System Optimization. Seoul, Korea: IFAC Symposium on Power Plants and Power, Sep. 2003.

    Google Scholar 

  6. N. Sinha, R. Chakrabarti, and P. K. Chattopadhyay, “Evolutionary pro-gramming techniques for economic load dispatch, ”IEEE Trans. Evol. Comput., vol. 7, pp. 83-94, Feb. 2003.

    Article  Google Scholar 

  7. J.-B. Park, K.-S. Lee, J.-R. Shin, and Kwang Y. Lee, “A particle swarm optimization for economic dispatch with nonsmooth cost functions,” IEEE Trans. Power Syst, vol. 20, pp. 34-42, Feb. 2005.

    Article  Google Scholar 

  8. B. Zhao, C. X. Guo, and Y. J. Cao, “A multiagent-based particle swarm optimization approach for optimal reactive power dispatch, ”IEEE Trans. Power Syst, vol. 20, pp. 1070-1078, May 2005.

    Article  Google Scholar 

  9. Z.-L. Gaing, “Discrete particle swarm optimization algorithm for unit commitment, ”IEEE Power Eng. Soc. General Meeting, vol. 1, pp. 418-424, Jul. 2003.

    Google Scholar 

  10. M. A. Abido, “Optimal power flow using particle swarm optimization,” International Journal of Electrical Power & Energy Systems, vol. 24, pp. 563-571, 2002.

    Article  Google Scholar 

  11. J. Kennedy and R. Eberhart, “Particle swarm optimization, ”in Proc. IEEE Int. Conf. Neural Networks, vol. 4, pp. 1942 -1948, Nov. 1995.

    Article  Google Scholar 

  12. X. Hu, R. C. Eberhart, and Y. Shi, “Engineering optimization with parti-cle swarm,” in Proc. IEEE Swarm Intelligence Symposium(SIS’ 03), pp. 53-57, Apr. 2003.

    Google Scholar 

  13. R. C. Eberhart and Y. Shi, “Particle swarm optimization: developments, applications and resources,” in Proc. Congr. Evol. Comput., vol. 1, pp. 81-86, May 2001.

    Google Scholar 

  14. Y. Shi and R. C. Eberhart, “Empirical study of particle swarm optimiza-tion,” in Proc. Congr. Evol. Compt., vol. 3, pp. 1945-1950, Jul. 1999.

    Google Scholar 

  15. Y. Fukuyama, “Particle Swarm Optimization Techniques with applica-tions in Power System, ”in Evolutionary Computation Techniques for Power System Optimization, K. Y. Lee and M. A. El-Sharkawa, Eds. Seoul, Korea: Tutorial given at The IFAC Symposium on Power Plants and Power, Sep. 2003, pp. 45-62.

    Google Scholar 

  16. M. Clerc and J. Kennedy, “The particle swarm-explosion, stability, and convergence in a multidimensional complex space, ”IEEE Trans. on Evo-lutionary Computation, vol. 6, no. 1, pp. 58-73, February 2002.

    Article  Google Scholar 

  17. M. Clerc, “The swarm and the queen: towards a deterministic and adap-tive particle swarm optimization, ”in Proc. Congr. Evol. Compt., vol. 3, pp. 1951-1957, Jul. 1999.

    Google Scholar 

  18. R. C. Eberhart and Y. Shi, “Comparing inertia weights and constriction factors in particle swarm optimization, ”in Proc. Congr. Evol. Compt., vol. 1, pp. 84 -88, Jul. 2000.

    Google Scholar 

  19. N. Higashi and H. Iba, “Particle swarm optimization with Gaussian muta-tion,” in Proc. IEEE Swarm Intelligence Symposium (SIS’03), pp. 72-79 Apr, 2003.

    Google Scholar 

  20. A. J.Wood and B. F. Wollenberq, Power Generation, Operation & Con-trol, 2 ed. New York: John Wiley, 1984.

    Google Scholar 

  21. C.-P. Cheng, C.-W. Liu, and C.-C. Liu, “Unit commitment by Lagrangian relaxation and genetic algorithms,” vol. 15, pp. 707-714, May 2000.

    Google Scholar 

  22. K. A. Juste, H. Kita, E. Tunaka, and J. Hasegawa, “An evolutionary pro-gramming solution to the unit commitment problem, ”IEEE Trans. Power Syst, vol. 14, pp. 1452-1459 Nov. 1999.

    Article  Google Scholar 

  23. W. Ongsakul and N. Petcharaks, “Unit commitment by enhanced adap-tive Lagrangian relaxation,” IEEE Trans. Power Syst, vol. 19, pp. 620-628, Feb. 2004.

    Article  Google Scholar 

  24. S. O. Orero and M. R. Irving, “A combination of the genetic algorithm and lagrangian relaxation decomposition techniques for the generation unit commitment problem, ”Electric Power Systems Research, vol. 43, pp. 149-156, 1997.

    Article  Google Scholar 

  25. S. Sen and D. P. Kothari, “Optimal thermal generating unit commitment: a review, ”International Journal of Electrical Power & Energy Systems, vol. 20, pp. 443-451, 1998.

    Article  Google Scholar 

  26. P. Attaviriyanupap, H. Kita, E. Tanaka, and J. Hasegawa, “A hybrid LR-EP for solving new profit-based UC problem under competitive envi-ronment,” IEEE Trans. Power Syst, vol. 18, pp. 229-237 Feb. 2003.

    Article  Google Scholar 

  27. S. A. Kazarlis, A. G. Bakirtzis, and V. Petridis, “A genetic algorithm so-lution to the unit commitment problem, ”IEEE Trans. Power Syst, vol. 11, pp. 83-92, Feb. 1996.

    Article  Google Scholar 

  28. T.-O. Ting, M. V. C. Rao, C. K. Loo, and S. S. Ngu, “Solving Unitcom-mitment Problem Using Hybrid Particle Swarm Optimization, ”Journal of Heuristics, vol. 9, pp. 507-520, 2003.

    Article  MATH  Google Scholar 

  29. J.H. Park, Y.S. Kim, I.K. Eom, and K.Y. Lee, “Economic load dispatch for piecewise quadratic cost function using Hopfield neural network, ”IEEE Trans. Power Syst, vol. 8, pp. 1030-1038, Aug. 1993.

    Article  Google Scholar 

  30. D. C. Walters and G. B. Sheble, “Genetic algorithm solution of economic dispatch with valve point loading, ”IEEE Trans. Power Syst, vol. 8, pp. 1325-1332, Aug. 1993.

    Article  Google Scholar 

  31. Y.-M. Park, J. R. Won, and J. B. Park, “A new approach to economic load dispatch based on improved evolutionary programming, ”Eng. Intell. Syst. Elect. Eng. Commu., vol. 6, pp. 103-110, Jun. 1998.

    Google Scholar 

  32. W.-M. Lin, F.-S. Cheng, and M.-T. Tsay, “An improved tabu search for economic dispatch with multiple minima, ”IEEE Trans. Power Syst, vol. 17, pp. 108-112, Feb. 2002

    Article  Google Scholar 

  33. H.-T. Yang, P.-C. Yang, and C.-L. Huang, “Evolutionary programming based economic dispatch for units with non-smooth fuel cost functions, ” IEEE Trans. Power Syst, vol. 11, pp. 112-118, Feb. 1996

    Article  Google Scholar 

  34. D. Liu and Y. Cai, “Taguchi method for solving the economic dispatch problem with nonsmooth cost functions,. ”IEEE Trans. Power Syst, vol. 20, pp. 2006-2014, Nov. 2005.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Design, Brunel University, UB8 3PH, Uxbridge, UK

    P. Sriyanyong

  2. School of Engineering and Design, Brunel University, UB8 3PH, Uxbridge, UK

    Y. H. Song

  3. School of Engineering and Design, Brunel University, UB8 3PH, Uxbridge, UK

    P. J. Turner

Authors
  1. P. Sriyanyong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. H. Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. J. Turner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Modeling Optimisation Scheduling and Intelligent Control (MOSAIC), Research Centre, Department of Computing, University of Bradford, West Yorkshire, BD7 1DP, Bradford, UK

    Keshav P. Dahal

  2. Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore, Singapore

    Kay Chen Tan

  3. Modeling Optimisation Scheduling and Intelligent Control (MOSAIC), Research Centre, Department of Computing, University of Bradford, West Yorkshire, BD7 1DP, Bradford, UK

    Peter I. Cowling

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sriyanyong, P., Song, Y.H., Turner, P.J. (2007). Particle Swarm Optimisation for Operational Planning: Unit Commitment and Economic Dispatch. In: Dahal, K.P., Tan, K.C., Cowling, P.I. (eds) Evolutionary Scheduling. Studies in Computational Intelligence, vol 49. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48584-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48584-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48582-7

  • Online ISBN: 978-3-540-48584-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation