메뉴 건너뛰기




Volumn 20, Issue 7, 2011, Pages 1357-1376

Unit commitment with security assessment using chaotic PSO algorithm

Author keywords

chaotic map; economic dispatch; particle swarm optimization; security constraint; Unit commitment

Indexed keywords

CHAOTIC MAP; ECONOMIC DISPATCH; PARTICLE SWARM; SECURITY CONSTRAINT; UNIT COMMITMENTS;

EID: 83455200020     PISSN: 02181266     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021812661100792X     Document Type: Article
Times cited : (12)

References (16)
  • 1
    • 0028480021 scopus 로고
    • Ramp-rate limits in unit commitment and economic dispatch incorporating rotor fatigue e®ect
    • C. Wang and S. M. Shahidehpour, Ramp-rate limits in unit commitment and economic dispatch incorporating rotor fatigue e®ect, IEEE Trans. Power Syst. 9 (1994) 1539-1545.
    • (1994) IEEE Trans. Power Syst. , vol.9 , pp. 1539-1545
    • Wang, C.1    Shahidehpour, S.M.2
  • 2
    • 0029356616 scopus 로고
    • Short-term generation scheduling with transmission and environmental constraints using augmented lagrangian relaxation
    • S. J. Wang, S. M. Shahidehpour, D. S. Kirschen, S. Mokhtari and G. D. Irisarri, Short-term generation scheduling with transmission and environmental constraints using augmented lagrangian relaxation, IEEE Trans. Power Syst. 10 (1994) 1294-1301.
    • (1994) IEEE Trans. Power Syst. , vol.10 , pp. 1294-1301
    • Wang, S.J.1    Shahidehpour, S.M.2    Kirschen, D.S.3    Mokhtari, S.4    Irisarri, G.D.5
  • 3
    • 0036474326 scopus 로고    scopus 로고
    • Unit commitment solution methodology using genetic algorithm
    • DOI 10.1109/59.982197, PII S0885895002007800
    • K. S. Swarup and S. Yamashiro, Unit commitment solution methodology using genetic algorithm, IEEE Trans. Power Syst. 17 (2002) 87-91. (Pubitemid 34255075)
    • (2002) IEEE Transactions on Power Systems , vol.17 , Issue.1 , pp. 87-91
    • Swarup, K.S.1    Yamashiro, S.2
  • 4
    • 1442288866 scopus 로고    scopus 로고
    • An evolutionary programming-based tabu search method for solving the unit commitment problem
    • C. C. A. Rajan and M. R. Mohan, An evolutionary programming-based tabu search method for solving the unit commitment problem, IEEE Trans. Power Syst. 19 (2004) 577-585.
    • (2004) IEEE Trans. Power Syst. , vol.19 , pp. 577-585
    • Rajan, C.C.A.1    Mohan, M.R.2
  • 5
    • 32144445924 scopus 로고    scopus 로고
    • Unit commitment by an enhanced simulated annealing algorithm
    • DOI 10.1109/TPWRS.2005.860922
    • D. N. Simopoulos, S. D. Kavatza and C. D. Vournas, Unit commitment by an enhanced simulated annealing algorithm, IEEE Trans. Power Syst. 21 (2006) 68-76. (Pubitemid 43204704)
    • (2006) IEEE Transactions on Power Systems , vol.21 , Issue.1 , pp. 68-76
    • Simopoulos, D.N.1    Kavatza, S.D.2    Vournas, C.D.3
  • 7
    • 0031352450 scopus 로고    scopus 로고
    • A discrete binary version of the particle swarm optimization
    • Perth, Australia
    • J. Kennedy and R. Eberhart, A discrete binary version of the particle swarm optimization, Proc. IEEE Int. Conf. Neural Networks, Vol. IV, Perth, Australia (1997), pp. 4104-4108.
    • (1997) Proc. IEEE Int. Conf. Neural Networks , vol.4 , pp. 4104-4108
    • Kennedy, J.1    Eberhart, R.2
  • 9
    • 36148988439 scopus 로고    scopus 로고
    • A particle swarm optimization approach to nonlinear rational filter modeling
    • DOI 10.1016/j.eswa.2006.12.004, PII S0957417406004064
    • Y.-L. Lin, W.-D. Chang and J.-G. Hsieh, A particle swarm optimization approach to nonlinear rational filter modeling, Expert Syst. Appl. 34 (2008) 1194-1199. (Pubitemid 350117488)
    • (2008) Expert Systems with Applications , vol.34 , Issue.2 , pp. 1194-1199
    • Lin, Y.-L.1    Chang, W.-D.2    Hsieh, J.-G.3
  • 10
    • 3142768423 scopus 로고    scopus 로고
    • Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coe±cients
    • A. Ratnaweera, S. K. Halgamuge and H. C. Watson, Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coe±cients, IEEE Trans. Evolutionary Computation 8 (2004) 240-255.
    • (2004) IEEE Trans. Evolutionary Computation , vol.8 , pp. 240-255
    • Ratnaweera, A.1    Halgamuge, S.K.2    Watson, H.C.3
  • 11
    • 18444389480 scopus 로고    scopus 로고
    • Improved particle swarm optimization combined with chaos
    • DOI 10.1016/j.chaos.2004.11.095, PII S0960077905000330
    • B. Liu, L. Wang and Y. H. Jin, Improved particle swarm optimization combined with chaos, Chaos, Solutions Fractals 25 (2005) 1261-1271. (Pubitemid 40643077)
    • (2005) Chaos, Solitons and Fractals , vol.25 , Issue.5 , pp. 1261-1271
    • Liu, B.1    Wang, L.2    Jin, Y.-H.3    Tang, F.4    Huang, D.-X.5
  • 12
    • 40949088103 scopus 로고    scopus 로고
    • A quantum particle swarm optimizer with chaotic mutation operator
    • L. D. S. Coelho, A quantum particle swarm optimizer with chaotic mutation operator, Chaos, Solutions Fractals 37 (2008) 1409-1418.
    • (2008) Chaos, Solutions Fractals , vol.37 , pp. 1409-1418
    • Coelho, L.D.S.1
  • 14
    • 56749181464 scopus 로고    scopus 로고
    • A perturbation based chaotic particle swarm optimization using multi-type swarms
    • Osaka, Japan
    • K. Tatsumi, H. Yamamoto and T. Tanino, A perturbation based chaotic particle swarm optimization using multi-type swarms, Proc. SICE Annual Conf. 2008, Osaka, Japan (2008), pp. 1199-1203.
    • (2008) Proc. SICE Annual Conf. 2008 , pp. 1199-1203
    • Tatsumi, K.1    Yamamoto, H.2    Tanino, T.3
  • 15
    • 77951456898 scopus 로고    scopus 로고
    • A new chaotic PSO with dynamic inertia weight for economic dispatch problem
    • T. Zhang and J. D. Cai, A new chaotic PSO with dynamic inertia weight for economic dispatch problem, Proc. Int. Conf. SUPERGEN 2009 (2009), pp. 1-6.
    • (2009) Proc. Int. Conf. SUPERGEN 2009 , pp. 1-6
    • Zhang, T.1    Cai, J.D.2
  • 16
    • 57649210808 scopus 로고    scopus 로고
    • A precise chaotic particle swarm optimization algorithm based on improved tent map
    • Y. He, J. Zhou, C. Li, J. Yang and Q. Li, A precise chaotic particle swarm optimization algorithm based on improved tent map, Proc. 4th Int. Conf. Natural Computation (2008), pp. 569-573.
    • (2008) Proc. 4th Int. Conf. Natural Computation , pp. 569-573
    • He, Y.1    Zhou, J.2    Li, C.3    Yang, J.4    Li, Q.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.