Multireservoir optimisation in discrete and continuous domains

In this paper, the honey-bee mating optimisation (HBMO) algorithm, which is based on the mating procedure of honey-bees in nature, is presented and tested with three benchmark multireservoir operation problems in both discrete and continuous domains. To test the applicability of the algorithm, results are compared with those from different analytical and evolutionary algorithms (linear programming, dynamic programming, differential dynamic programming, discrete differential dynamic programming and genetic algorithm). The first example is a multireservoir operation optimisation problem in a discrete domain with discrete decision and state variables. It is shown that the performance of the model compares well with results of the well-developed genetic algorithm. The second example is a four-reservoir problem in a continuous domain that has recently been approached with different evolutionary algorithms. The third example is a ten-reservoir problem in series and parallel. The best solution obtained is quite ...

[1]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[2]  Robert E. Larson,et al.  State increment dynamic programming , 1968 .

[3]  Roberto Baldacci,et al.  A Bionomic Approach to the Capacitated p-Median Problem , 1998, J. Heuristics.

[4]  Barry J. Adams,et al.  Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation , 2007, J. Frankl. Inst..

[5]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[6]  Luca Maria Gambardella,et al.  A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows , 1999 .

[7]  R. Wardlaw,et al.  EVALUATION OF GENETIC ALGORITHMS FOR OPTIMAL RESERVOIR SYSTEM OPERATION , 1999 .

[8]  Miguel A. Mariño,et al.  Design-Operation of Multi-Hydropower Reservoirs: HBMO Approach , 2008 .

[9]  Zbigniew Michalewicz,et al.  Evolutionary Computation 1 , 2018 .

[10]  Omid Bozorg Haddad,et al.  Honey-Bees Mating Optimization (HBMO) Algorithm: A New Heuristic Approach for Water Resources Optimization , 2006 .

[11]  S. Yakowitz,et al.  Constrained differential dynamic programming and its application to multireservoir control , 1979 .

[12]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[13]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[14]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[15]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[16]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[18]  V. T. Chow,et al.  Discrete Differential Dynamic Programing Approach to Water Resources Systems Optimization , 1971 .

[19]  É. Taillard,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[20]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[21]  V. T. Chow,et al.  Application of DDDP in water resources planning , 1974 .