Artificial bee colony

optimization for multi-area

economic dispatch
Author: m. basu

Presented by:
PRANAY M. SEN(18MEEE15) 1
 CONTENTS

• Abstract/Introduction
• Problem formulation
• Artificial bee colony optimization(ABCO)
• Implementation of ABCO
• Simulation
• Conclusion

2
 Abstract/Introduction

• Artificial bee colony optimization for solving multi-area economic

dispatch (MAED) problem with tie line constraints considering
transmission losses, multiple fuels, valve-point loading and prohibited
operating zones.
• Artificial bee colony optimization is a swarm-based algorithm inspired
by the food foraging behavior of honey bees.
• The effectiveness of the proposed algorithm has been verified on
different test systems and compared with Differential evolution (DE),
evolutionary programming (EP) and real coded genetic algorithm
(RCGA).

3
 Problem formulation
Constraints used:
1. Real power balance constraints
𝑀𝑖

෍ 𝑃𝑖𝑗 = 𝑃𝐷𝑖 + 𝑃𝐿𝑖 + ෍ 𝑇𝑖𝑘

𝑘,𝑘≠𝑖
𝑗=1
2. Tie line capacity constraints
𝑚𝑎𝑥 𝑚𝑎𝑥
−𝑇𝑖𝑘 ≤ 𝑇𝑖𝑘 ≤ 𝑇𝑖𝑘
3. Real power generation capacity constraints
𝑃𝑖𝑗𝑚𝑖𝑛 ≤ 𝑃𝑖𝑗 ≤ 𝑃𝑖𝑗𝑚𝑎𝑥
4. Prohibited operating zone
𝑃𝑖𝑗𝑚𝑖𝑛 ≤ 𝑃𝑖𝑗 ≤ 𝑃𝑖𝑗,1
𝑙
𝑢 𝑙
𝑃𝑖𝑗,𝑚−1 ≤ 𝑃𝑖𝑗 ≤ 𝑃𝑖𝑗,𝑚
𝑢 𝑚𝑎𝑥
𝑃𝑖𝑗,𝑛 𝑖𝑗
≤ 𝑃𝑖𝑗 ≤ 𝑃𝑖𝑗 4
 Problem formulation (contd.)
The objective of MAED is to minimize the total production cost of
supplying loads to all areas while satisfying different constraints.

MAED problems considered:

1. MED with quadratic cost function, prohibited operating zones and

transmission losses (MAEDQCPOZTL)
𝑀𝑖 𝑀𝑖
𝐹𝑡 = σ𝑖=1 σ𝑗=1 𝐹𝑖𝑗 𝑃𝑖𝑗 = σ𝑖=1 σ𝑗=1 𝑎𝑖𝑗 +𝑏𝑖𝑗 𝑃𝑖𝑗 +𝑐𝑖𝑗 𝑃𝑖𝑗2
𝑁 𝑁

2. MAED with valve point loading (MAEDVPL)

𝑁 𝑀𝑖
𝐹𝑡 = σ𝑖=1 σ𝑗=1 𝐹𝑖𝑗 𝑃𝑖𝑗 =
𝑀𝑖 𝑚𝑖𝑛
σ𝑁 σ 𝑎 +𝑏 𝑃 +𝑐 𝑃 2
𝑖=1 𝑗=1 𝑖𝑗 𝑖𝑗 𝑖𝑗 𝑖𝑗 𝑖𝑗 +|𝑑𝑖𝑗 ∗ sin 𝑒𝑖𝑗 ∗ 𝑃𝑖𝑗 − 𝑃𝑖𝑗 | 5
 Problem formulation (contd.)

3. MAED with valve point loading multiple fuel sources and

transmission losses (MAEDVPLMFTL)

𝐹𝑖𝑗 𝑃𝑖𝑗 = 𝑎𝑖𝑗𝑚 +𝑏𝑖𝑗𝑚 𝑃𝑖𝑗 +𝑐𝑖𝑗𝑚 𝑃𝑖𝑗2 +|𝑑𝑖𝑗 ∗ sin 𝑒𝑖𝑗 ∗ 𝑃𝑖𝑗𝑚𝑖𝑛 − 𝑃𝑖𝑗 |

𝑚𝑖𝑛 𝑚𝑎𝑥
If 𝑃𝑖𝑗𝑚 ≤ 𝑃𝑖𝑗 ≤ 𝑃𝑖𝑗𝑚 for fuel type m

𝐹𝑡 = 𝐹𝑖𝑗 𝑃𝑖𝑗

6
Artificial bee colony optimization

7
 Implementation of ABCO for MAED problem

• Initialization
pn= [(P11,P12,…,P1m1),…, (Pi1,Pi2,…,Pim1),…, (PN1,PN2,…, 𝑃𝑁𝑀𝑁 ),…,
(T12,T13,…,T1N), (T23,T24,…,T2N),…,(T(N-1)N)]

• Evaluation of fitness
1
fitness =
Ft

• Selection of initial population

Select m best solutions on the basis of highest fitness for
neighborhood search
8
 Implementation of ABCO for MAED problem

• Generation of neighborhood solution (nb)

𝑃𝑟𝑖𝑗 =𝑃𝑛𝑖𝑗 + 𝑚𝑢𝑙𝐺 ∗ 𝑁 0,1 ∗ (𝑃𝑖𝑗𝑚𝑎𝑥 − 𝑃𝑖𝑗𝑚𝑖𝑛 )
𝑚𝑎𝑥 𝑚𝑎𝑥
𝑇𝑟𝑖𝑘 =𝑇𝑛𝑖𝑘 + 𝑚𝑢𝑙 𝑇 ∗ 𝑁 0,1 ∗ (𝑇𝑖𝑘 − (−𝑇𝑖𝑘 ))

• Selection
Select the best solution from nb * m

• Termination
The search process is stopped as the count of generations reaches
Nmax otherwise select best m solutions to generate neighborhood
solutions. 9
Simulation Result 1

10
Simulation Result 2

11
Simulation Result 2

12
Simulation Result 3

13
Simulation Result 3

14
 CONCLUSION

• In this paper, ABCO has been successfully implemented to solve MAED

problems.

• The effectiveness of the proposed method is illustrated by using three

different test systems and the test results are compared with the results
obtained from DE, EP and RCGA.

• It is seen from the comparison that the proposed ABCO has the ability
to converge to a better quality solution than DE, EP and RCGA.

15
 References
[1] Chowdhury BH, Rahman S. A review of recent advances in [8] Wang C, Shahidehpour SM. A decomposition approach to non-
economic dispatch. IEEE Trans Power Syst 1990;5(4):1248–59. linear multi area generation scheduling with tie-line constraints
[2] Shoults RR, Chang SK, Helmick S, Grady WM. A practical using expert systems. IEEE Trans Power Syst 1992;7(4):1409–18.
approach to unit commitment, economic dispatch and savings [9] Streiffert D. Multi-area economic dispatch with tie line
allocation for multiple-area pool operation with import/export constraints. IEEE Trans Power Syst 1995;10(4):1946–51.
constraints. IEEE Trans Power Apparat Syst 1980;99(2):625–35. [10] Wernerus J, Soder L. Area price based multi-area economic
[3] Romano R, Quintana VH, Lopez R, Valadez V. Constrained dispatch with tie line losses and constraints. In: IEEE/KTH
economic dispatch of multi-area systems using the Dantzig–Wolfe Stockholm power tech conference, Sweden; 1995. p. 710–5.
decomposition principle. IEEE Trans Power Apparat Syst [11] Yalcinoz T, Short MJ. Neural networks approach for solving
1981;100(4):2127–37. economic dispatch problem with transmission capacity
[4] Doty KW, McEntire PL. An analysis of electric power brokerage constraints. IEEE Trans Power Syst 1998;13(2):307–13.
systems. IEEE Trans Power Apparat Syst 1982;101(2):389–96. [12] Jayabarathi T, Sadasivam G, Ramachandran V. Evolutionary
[5] Desell AL, McClelland EC, Tammar K, Van Horne PR. programming based multi-area economic dispatch with tie line
Transmission constrained production cost analysis in power constraints. Electr Mach Power Syst 2000;28:1165–76.
system planning. IEEE Trans Power Apparat Syst [13] Chen CL, Chen N. Direct search method for solving economic
1984;103(8):2192–8. dispatch problem considering transmission capacity constraints.
[6] Helmick SD, Shoults RR. A practical approach to an interim IEEE Trans Power Syst 2001;16(4):764–9.
multi-area economic dispatch using limited computer resources. [14] Manoharan PS, Kannan PS, Baskar S, Willjuice Iruthayarajan
IEEE Trans Power Apparat Syst 1985;104(6):1400–4. M. Evolutionary algorithm solution and KKT based optimality
[7] Ouyang Z, Shahidehpour SM. Heuristic multi-area unit verification to multi-area economic dispatch. Int J Electr Power
commitment with economic dispatch. IEE Proc-C Energy Syst 2009;31(7–8): 16
References
[15] Wang Lingfeng, Singh Chanan. Reserve-constrained [20] Camazine S, Deneubourg J, Franks NR, Sneyd J,
multiarea environmental/ economic dispatch based on Theraula G, Bonabeau E. Selforganization in biological
particle swarm optimization with local search. systems. Princeton: Princeton University Press; 2003.
Eng Appl Artif Intell 2009;22(2):298–307. [21] Karaboga D. An idea based on honey bee swarm for
[16] Sharma Manisha, Pandit Manjaree, Srivastava Laxmi. numerical optimization, Technical Report-Tr06t, Erciyes
Reserve constrained multi-area economic dispatch University, Engineering faculty, Computer Engineering
employing differential evolution with timevarying Department, Turkey; 2005.
mutation. Int J Electr Power Energy Syst 2011;33(3): [22] Walter DC, Sheble GB. Genetic algorithm solution of
[17] Jain Kalpana, Pandit Manjaree. Discussion of ‘‘Reserve economic dispatch with valve point loading. IEEE Trans
constrained multi-area economic dispatch employing Power Syst 1993;8:1325–32.
differential evolution with time-varying mutation’’ by [23] Gaing Z-L. particle swarm optimization to solving the
Manisha Sharma et al. ‘‘International Journal of Electrical economic dispatch considering the generator constraints.
Power and Energy Systems’’, 33 March (2011) 753–766. Int IEEE Trans Power Syst 2003;18(3):1187–95.
J Electr Power Energy Syst 2012;39(1):68–9. [24] Sinha N, Chakrabarti R, Chattopadhyay PK.
[18] Bonabeau E, Dorigo M, Theraulaz G. Swarm Evolutionary programming techniques for economic load
intelligence: from natural to artificial systems. New York: dispatch. IEEE Trans Evol Comput 2003;7(1):83–94.
Oxford University Press; 1999. [25] Chiang C-L. Improved genetic algorithm for power
[19] Eberhart R, Shi Y, Kennedy J. Swarm intelligence. San economic dispatch of units with valve-point effects and
Francisco: Morgan Kaufmann; 2001. multiple fuels. IEEE Trans Power Syst 2005;20(4):1690–9.
17
 THANK YOU
ANY QUESTIONS?
18