Short-term optimal dispatch of cascaded hydropower stations based on improved ant algorithm

Tianjin Daxue Xuebao (Ziran Kexue yu Gongcheng Jishu Ban)/Journal of Tianjin University Science and Technology

Volumn 39, Issue 3, 2006, Pages 264-268

  Lian, Ji Jian ^a   Ma, Chao ^a   Zhang, Zhuo ^a  

^a TIANJIN UNIVERSITY   (China)

Author keywords

Cascaded hydropower stations; Genetic algorithm; Improved ant algorithm; Short term optimal dispatch; Start up and shut down optimization

Indexed keywords

ECONOMICS; ELECTRIC LOAD DISPATCHING; GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; WATER POWER;

CASCADED HYDROPOWER STATIONS; IMPROVED ANT ALGORITHM (IAA); SHORT TERM OPTIMAL DISPATCH; START UP SHUT DOWN OPTIMIZATION;

HYDROELECTRIC POWER;

EID: 33646731795     PISSN: 04932137     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Nilsson O, Sjelvgren D. Hydro unit start-up costs and their impact on the short term scheduling strategies of Swedish power producers[J]. IEEE Transactions on Power Systems, 1997, 12(1): 38-44.
2. Arce A, Ohishi T, Scares S. Optimal dispatch of generating unit of Itaipu Hydroelectric Plant[J]. IEEE Transaction on Power Systems, 2002, 17(2): 154-158.
3. Li Hongbin, Li Chengjun, Zhou Yanping. A practical unit commitment and load distribution model for hydropower plants[J]. Hydropower Automation and Dam Monitoring, 2003, 27(2): 1-4 (in Chinese).
4. Shang Jincheng, Zhang Yongchuan. The model and optimality conditions for cascaded plants short-term optimal operation[J]. International Journal Hydroelectric Energy, 1998, 16(3): 1-9 (in Chinese).
5. Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperating agents[J]. IEEE Trans on System, Man and Cybernetics, 1997, 26(1): 29-41.
6. Gambardella L M, Dorigo M. Ant-Q: A reinforcement learning approach to the traveling salesman problem[C] // Proceedings of the 12th International Conference on Machine Learning. Tahoe City, CA: Morgan Kaufmann, 1995: 252-260.
7. Ding Jianli, Chen Zengqiang, Yuan Zhuzhi. On the combination of genetic algorithm and ant algorithm[J]. Journal of Computer Research and Development, 2003, 40(9): 1351-1356 (in Chinese).
8. Colorni A, Dorigo M, Maffioli F, et al. Heuristics from nature for hard combinatorial optimization problems[J]. Int Trans in Opnl Res, 1996, 3(1): 1-21.
9. Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1): 622-627.
10. Colorni A, Dorigo M, Maniezzo V, et al. Ant system for job-shop scheduling[J]. Belgian Journal of Operations Research, Statistics and Computer Science, 1994, 34(1): 39-53.
11. Ma Liang, Jiang Fu. Solving multi-criteria traveling salesman problem by ant algorithm[J]. Systems Engineering-Theory Methodology Applications, 1999, 8(4): 23-27 (in Chinese).
12. Yang Dong, Wang Zheng'ou. Improved ant algorithm for assignment problem[J]. Journal of Tianjin University, 2004, 37(4): 373-376 (in Chinese).
13. Ma Liang, Xiang Peijun, Application of the ant algorithm to combinatorial optimization[J]. Journal of Management Sciences in China, 2001, 4(2): 32-37 (in Chinese).
14. Ma Liang. Ant algorithm-optimization strategy from the insect colony[J]. Ziran Zazhi, 1999, 21(3): 161-163 (in Chinese).
15. Lian Jijian, Qin Liang. Research of Site Test in Two-Row Placed Units of Lijiaxia Hydropower Plant[R]. Tianjin, 2004, 3 (in Chinese).