Tabu search algorithms for water network optimization

• Autor(es): Cunha, Maria da Conceição ; Ribeiro, Luísa
• Data: 2004
• Identificador Persistente: http://hdl.handle.net/10316/3985
• Origem: Estudo Geral - Universidade de Coimbra
• Assunto(s): Heuristics; Tabu search; Water distribution networks design; Optimization
• Tipo de Documento: Artigo
• Idioma: Inglês

Descrição

In this paper we propose a tabu search algorithm to find the least-cost design of looped water distribution networks. The mathematical nature of this optimization problem, a nonlinear mixed integer problem, is at the origin of a multitude of contributions to the literature in the last 25 years. In fact, exact optimization methods have not been found for this type of problem, and, in the past, classical optimization methods, like linear and nonlinear programming, were tried at the cost of drastic simplifications. Tabu search is a valuable heuristic technique for solving problems cast in combinatorial form. This is based on the human memory process and uses an iterative neighborhood search procedure in an attempt to avoid becoming trapped in local optima. The use of such a heuristic procedure to solve the aforementioned problem needs particular tailoring to produce high quality solutions. In this paper we present the essential features of the algorithm and the results obtained when it is applied to some of the classical water distribution network case studies appearing in the literature. The results are very promising and demonstrate the usefulness of tabu search algorithms in solving this kind of optimization problem. http://www.sciencedirect.com/science/article/B6VCT-498TY6T-9/1/d69a0ed8e8ed7fbd715e23eaaca78556