TY - JOUR ID - 767 TI - Reservoir operation by ant colony optimization algorithms JO - Iranian Journal of Science and Technology Transactions of Civil Engineering JA - IJSTC LA - en SN - 2228-6160 Y1 - 2006 PY - 2006 VL - 30 IS - 1 SP - 107 EP - 117 KW - ant colony KW - Optimization KW - reservoir operation DO - 10.22099/ijstc.2006.767 N2 -  In this paper, ant colony optimization (ACO) algorithms are proposed for reservoir operation. Through a collection of cooperative agents called ants, the near optimum solution to the reservoir operation can be effectively achieved. To apply ACO algorithms, the problem is approached by considering a finite horizon with a time series of inflow, classifying the reservoir volume to several intervals, and deciding for releases at each period with respect to a predefined optimality criterion. Three alternative formulations of ACO algorithms for a reservoir operation are presented using a single reservoir, deterministic, finite-horizon problem and applied to the Dez reservoir in Iran. It is concluded that the ant colony system global-best algorithm provides better and more comparable results with known global optimum results. As with any direct search method, the model is quite sensitive to setup parameters, hence fine tuning of the parameters is recommended.            UR - https://ijstc.shirazu.ac.ir/article_767.html L1 - https://ijstc.shirazu.ac.ir/article_767_81399828a660c342046f2e89fc36ccb9.pdf ER -