Informations et ressources scientifiques
sur le développement des zones arides et semi-arides

Accueil du site → Doctorat → Inde → 2000 → Conjunctive And Multipurpose Operation Of Reservoirs Using Genetic Algorithms

Indian Institute of Science (2000)

Conjunctive And Multipurpose Operation Of Reservoirs Using Genetic Algorithms

Seetha Ram, Katakam V

Titre : Conjunctive And Multipurpose Operation Of Reservoirs Using Genetic Algorithms

Auteur : Seetha Ram, Katakam V

Organisme de soutenance : Indian Institute of Science

Grade : Doctoral PhD 2000

Résumé partiel
Optimal operation of reservoir systems is necessary for better utilizing the limited water resources and to justify the high capital investments associated with reservoir projects. However, finding optimal policies for real-life problems of reservoir systems operation (RSO) is a challenging task as the available analytical methods can not handle the arbitrary functions of the problem and almost all methods employed are numerical or iterative type that are computer dependent. Since the computer resources in terms of memory and CPU time are limited, a limit exists for the size of the problem, in terms of arithmetic and memory involved, that can be handled. This limit is approached quickly as the dimension and the nonlinearity of the problem increases. In encountering the complex aspects of the problem all the traditionally employed methods have their own drawbacks. Linear programming (LP), though very efficient in dealing with linear functions, can not handle nonlinear functions which is the case mostly in real-life problems. Attempting to approximate nonlinear functions to linear ones results in the problem size growing enormously. Dynamic programming (DP), though suitable for most of the RSO problems, requires exponentially increasing computer resources as the dimension of the problem increases and at present many high dimensional real-life problems can not be solved using DP. Nonlinear programming (NLP) methods are not known to be efficient in RSO problems due to slow rate of convergence and inability to handle stochastic problems. Simulation methods can, practically, explore only a small portion of the search region. Many simplifications in formulations and adoption of approximate methods in literature still fall short in addressing the most critical aspects, namely multidimensionality, stochasticity, and additional complexity in conjunctive operation, of the problem. As the problem complexity increases and the possibility of arriving at the solution recedes, a near optimal solution with the best use of computational resources can be very valuable. In this context, genetic algorithms (GA) can be a promising technique which is believed to have an advantage in terms of efficient use of computer resources. GA is a random search method which find, in general, near optimal solutions using evolutionary mechanism of natural selection and natural genetics. When a pool of feasible solutions, represented in a coded form, are given fitness according to a objective function and explored by genetic operators for obtaining new pools of solutions, then the ensuing trajectories of solutions come closer and closer to the optimal solution which has the greatest fitness associated with it. GA can be applied to arbitrary functions and is not excessively sensitive to the dimension of the problem. Though in general GA finds only the near optimal solutions trapping in local optima is not a serious problem due to global look and random search. Since GA is not fully explored for RSO problems two such problems are selected here to study the usefulness and efficiency of GA in obtaining near optimal solutions. One

Mots clés : Reservoirs – Management ; Genetic Algorithms ; Reservoirs – Optimization ; Reservoirs - Operation Models ; Reservoir Systems Operation (RSO) ; Multipurpose Reservoir

Présentation (ETD IISC)

Page publiée le 17 octobre 2013, mise à jour le 16 février 2021