|
|
|
| Optimal methods and its application of large pumping station operation |
| Feng Xiaoli, Qiu Baoyun, Yang Xingli, Shen Jian, Pei Bei |
| (School of Energy and Power Engineering, Yangzhou University, Yangzhou, Jiangsu 225127, China) |
|
|
|
|
Abstract In order to master modern optimal methods, which are suitable for solving large pumping stationoptimal operation with multivariables. Basic principles of genetic algorithms(GA), particle swarm optimization(PSO) and simulated annealing particle swarm optimization(SA-PSO) were introduced, and the similarities and differences were analyzed. It is concluded that PSO is more simple and efficient than GA. Taking Jiangdu pumping station system in Eastern Route of South to North Water Transfer Projectas an example, under the circumstances of certain pump assembly head, selecting the number of running pump units and blade setting angles of water pumps as variables, optimal mathematical models for pumping station operation schemes were established aiming at the least operation cost, meeting the constraint conditions such as total pumping discharge, allowed discharge of single pump and the number of running pump units. GA, PSO and SA-PSO were applied to solve the models respectively to determinethe number of running pump units, operation duties of pump units and daily operation cost of each pumping station. Constraint conditions were used to deal with feasible rules, and calculating procedurewas programmed with Matlab. The results indicate that the operation costs of the optimum schemes by adjusting pump blade setting angles with SA-PSO are 0.99％-4.22％ less than that of the conventional schemes under design blade angles, and among the three optimum schemes, the operation cost of the optimum scheme based on SA-PSO is about 0.22％-2.80％, 0.02％-0.40％ less than that based on GA and PSO respectively. Computing times of the three optimizing algorithms are 30, 52 and 25 s respectively. Therefore, SA-PSO is more suitable for solving large pumping station operation optimization problems.
|
|
Received: 07 August 2010
Published: 30 March 2011
|
|
|
|
| ［1］陈媛媛,吴先策,纪荣亮.动态规划法在西南管道泵站优化运行中的应用［J］.油气储运,2009,28(8):13-15.Chen Yuanyuan,Wu Xiance,Ji Rongliang. Application of dynamic programming theory in optimized operation of pump station over westsouth oil product pipeline［J］. Oil＆ Gas Storage and Transportation ,2009,28(8):13-15.(in Chinese)［2］Feng Xiaoli,Qiu Baoyun,Cao Haihong,et al. Optimal operation for Baoying pumping station in East Route Project of South-to-North Water Transfer［J］. ChineseJournal of Mechanical Engineering ,2009,22(1):78-83.［3］Xin Kunlun,Liu Suiqing,Tao Tao,et al. Application of pseudo parallel genetic algorithm in optimal operation of multisource water supply network［C］∥Proceedings of the 8th Annual Water Distribution Systems Analysis Symposium .Cincinnati,Ohio,USA. Reston: ASCE,2007:163.［4］鄢碧鹏,成 立.供水泵站优化运行的混沌算法［J］. 排灌机械工程学报,2010,28(1):56-58.Yan Bipeng,Cheng Li. Optimal operation of water supply pumping station by chaos［J］. Journal of Drainage and Irrigation Machinery Engineering ,2010,28(1): 56-58.(in Chinese)［5］Pulido Calvo I,Gutiérrez Estrada J C, Asensio Fernndez R. Optimal design of pumping stations of inland intensive fishfarms［J］. Aquacultural Engineering ,2006,35(3): 283-291.［6］Zecchin A C,Simpson A R,Maier H R,et al. Application of two ant colony optimisation algorithms to water distribution system optimisation［J］. Mathematical and Computer Modelling, 2006,44(5／6):451-468.［7］Ostfeld A,Tubaltzev A. Ant colony optimization for leastcost design and operation of pumping water distribution systems［J］. Journal of Water Resources Planning and Management ,2008,134(2):107-118.［8］Kennedy J,Eberhart R. Particle swarm optimization［C］∥ Proceedings of IEEE International Conference on Neural Networks. Piscataway: IEEE Service Center, 1995,IV:1942-1948.［9］康立山,谢 云,尤矢勇,等.非数值并行算法(第1册):模拟退火算法［M］.北京:科学出版社,1994.［10］Ratnaweera A,Halgamuge S K,Watson H C. Selforganizinghierarchical particle swarm optimizer with timevarying acceleration coefficients［J］. IEEE Transaction on Evolutionary Computation ,2004,8(3):240-255. |
|
|
|
