z-logo
Premium
Aeration optimization of a wastewater treatment plant using genetic algorithm
Author(s) -
Holenda B.,
Domokos E.,
Rédey Á.,
Fazakas J.
Publication year - 2007
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.796
Subject(s) - aeration , mathematical optimization , genetic algorithm , process (computing) , computer science , sewage treatment , optimization problem , environmental engineering , engineering , waste management , mathematics , operating system
This paper discusses the aeration optimization problem of an intermittently aerated wastewater treatment plant by the application of a stochastic optimization approach, genetic algorithm (GA). In this process, the alternating aerobic and anoxic conditions needed for nitrogen removal are realized in a single basin by switching the aeration sequentially on and off. Since the operation of these plants may be challenging both for economical and technical reasons, several previous studies have investigated the possibility of reduction of the operating cost, however, it turned out that for long‐term application these methods can save only limited per cent of the cost. Furthermore, these investigations also had to make problem simplifications in order to use optimization methods which usually need significant computational effort to give—only a local optimum—of the problem. The objective of this paper is to demonstrate an optimization procedure to minimize the pollution load in the receiving water body, rather than the operational cost, using a complete model of the treatment process. The results were evaluated based on rigorous evaluation criteria and showed that using GA‐based optimization strategy an optimal solution can be efficiently found where both pollution load and energy consumption savings can reach up to 10% compared to traditional control strategies. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here