Combined heat and power economic dispatch problem using the invasive weed optimization algorithm
T. JAYABARATHI, Afshin YAZDANI, V. RAMESH, T. RAGHUNATHAN
Combined heat and power economic dispatch problem using the invasive weed optimization algorithm
Cogeneration units which produce both heat and electric power are found in many process industries. These industries also consume heat directly in addition to electricity. The cogeneration units operate only within a feasible zone. Each point within the feasible zone consists of a specific value of heat and electric power. These units are used along with other units which produce either heat or power exclusively. Hence the economic dispatch problem for these plants optimizing the fuel cost is quite complex and several classical and meta-heuristic algorithms have been proposed earlier. This paper applies the invasive weed optimization algorithm which is inspired by the ecological process of weed colonization and distribution. The results obtained have been compared with those obtained by other methods earlier and showed a marked improvement over earlier ones.
combined heat and power (CHP) / economic dispatch / meta-heuristic algorithm / invasive weed optimization / cogeneration
[1] |
Rooijers F J, van Amerongen R A M. Static economic dispatch for co-generation systems. IEEE Transactions on Power Systems, 1994, 9(3): 1392–1398
CrossRef
Google scholar
|
[2] |
Guo T, Henwood M I, van Ooijen M. An algorithm for combined heat and power economic dispatch. IEEE Transactions on Power Systems, 1996, 11(4): 1778–1784
CrossRef
Google scholar
|
[3] |
Vasebi A, Fesanghary M, Bathaee S M T. Combined heat and power economic dispatch by harmony search algorithm. International Journal of Electrical Power & Energy Systems, 2007, 29(10): 713–719
CrossRef
Google scholar
|
[4] |
Khorram E, Jaberipour M. Harmony search algorithm for solving combined heat and power economic dispatch problems. Energy Conversion and Management, 2011, 52(2): 1550–1554
CrossRef
Google scholar
|
[5] |
Wong K P, Algie C. Evolutionary programming approach for combined heat and power dispatch. Electric Power Systems Research, 2002, 61(3): 227–232
CrossRef
Google scholar
|
[6] |
Wang L F, Singh C. Stochastic combined heat and power dispatch based on multi-objective particle swarm optimization. International Journal of Electrical Power & Energy Systems, 2008, 30(3): 226–234
CrossRef
Google scholar
|
[7] |
Subbaraj P, Rengaraj R, Salivahanan S. Enhancement of combined heat and power economic dispatch using self adaptive real-coded genetic algorithm. Applied Energy, 2009, 86(6): 915–921
CrossRef
Google scholar
|
[8] |
Sinha N, Bhattacharya T. Genetic Algorithms for non-convex combined heat and power dispatch problems. In: Proceedings of TENCON 2008–2008 IEEE Region 10 Conference, Hyderabad, India, 2008, 1–5
|
[9] |
Sinha N, Saikia L C, Malakar T. Optimal solution for non-convex combined heat and power dispatch problems using differential evolution. In: Proceedings of 2010 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), Coimbatore, India, 2010, 1–5
|
[10] |
Sudhakaran M. Slochanal S M R. Integrating genetic algorithms and tabu search for combined heat and power economic dispatch. In: Proceedings of TENCON 2003-Conference on Convergent Technologies for Asia-Pacific Region, Bangalore, India, 2003, 67–71
|
[11] |
Song Y H, Chou C S, Stonham T J. Combined heat and power economic dispatch by improved ant colony search algorithm. Electric Power Systems Research, 1999, 52(2): 115–121
CrossRef
Google scholar
|
[12] |
Basu M. Bee colony optimization for combined heat and power economic dispatch. Expert Systems with Applications, 2011, 38(11): 13527–13531
|
[13] |
Rong A, Lahdelma R. Efficient algorithms for combined heat and power production planning under the deregulated electricity market. European Journal of Operational Research, 2007, 176(2): 1219–1245
CrossRef
Google scholar
|
[14] |
Hosseini S S S, Jafarnejad A, Behrooz A H, Gandomi A H. Combined heat and power economic dispatch by mesh adaptive direct search algorithm. Expert Systems with Applications, 2011, 38(6): 6556–6564
CrossRef
Google scholar
|
[15] |
Su C T, Chiang C L. An incorporated algorithm for combined heat and power economic dispatch. Electric Power Systems Research, 2004, 69(2,3): 187–195
|
[16] |
Mehrabian A R, Lucas C. A novel numerical optimization algorithm inspired from weed colonization. Ecological Informatics, 2006, 1(4): 355–366
CrossRef
Google scholar
|
[17] |
Ghosh A, Das S, Chowdhury A, Giri R. An ecologically inspired direct search method for solving optimal control problems with Bézier parameterization. Engineering Applications of Artificial Intelligence, 2011, 24(7): 1195–1203
CrossRef
Google scholar
|
[18] |
Mehrabian A R, Yousefi-Koma A. A novel technique for optimal placement of piezoelectric actuators on smart structures. Journal of the Franklin Institute, 2011, 348(1): 12–23
CrossRef
Google scholar
|
[19] |
Basak A, Pal S, Das S, Abraham A, Snasel V. A modified invasive weed optimization algorithm for time-modulated linear antenna array synthesis. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC). Barcelona, Spain, 2010, 1–8
|
[20] |
Kundu D, Suresh K, Ghosh S, Das S, Panigrahi B K, Das S. Multi-objective optimization with artificial weed colonies. Information Sciences, 2011, 181(12): 2441–2454
CrossRef
Google scholar
|
[21] |
Sedighy S H, Mallahzadeh A R, Soleimani M, Rashed-Mohassel J. Optimization of printed Yagi antenna using invasive weed optimization (IWO). IEEE Antennas and Wireless Propagation Letters, 2010, 9: 1275–1278
CrossRef
Google scholar
|
[22] |
Hajimirsadeghi H, Lucas C. A hybrid IWO/PSO algorithm for fast and global optimization. In: Proceedings of IEEE EUROCON 2009, St. Petersburg, Russia, 2009, 1964–1971
|
[23] |
Giri R, Chowdhury A, Ghosh A, Das S, Abraham A, Snasel V. A modified invasive weed optimization algorithm for training of feed-forward neural networks. In: Proceedings of 2010 IEEE International Conference on Systems Man and Cybernetics (SMC). Istanbul, Turkey, 2010, 3166–3173
|
/
〈 | 〉 |