An improved decomposition-based heuristic to design a water distribution network for an irrigation system

In this paper the authors address a pressurized water distribution network design problem for irrigation purposes. Two mixed binary nonlinear programming models are proposed for this NP-hard problem. Furthermore, a heuristic algorithm is presented for the problem, which considers a decomposition seq...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research Jg. 219; H. 1; S. 141 - 167
Hauptverfasser: Gonçalves, Graça Marques, Gouveia, Luís, Pato, Margarida Vaz
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Boston Springer US 01.08.2014
Springer
Springer Nature B.V
Schlagworte:
Algorithms
Business and Management
Combinatorics
Computer programs
Consumers
Costs
Decomposition
Decomposition (Mathematics)
Design
Design engineering
Heuristic
Heuristic programming
Hydraulics
Irrigation
Irrigation systems
Management
Mathematical models
Methods
Networks
Nonlinear programming
Operations research
Operations Research/Decision Theory
Pipes
Searching
Studies
Theory of Computation
Water
Water in agriculture
Water supply engineering
Water-supply, Agricultural
Mixed binary nonlinear programming problem
Pressurized water distribution network design problem
Heuristics
Linearization
ISSN:0254-5330, 1572-9338
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper the authors address a pressurized water distribution network design problem for irrigation purposes. Two mixed binary nonlinear programming models are proposed for this NP-hard problem. Furthermore, a heuristic algorithm is presented for the problem, which considers a decomposition sequential scheme, based on linearization of the second model, coupled with constructive and local search procedures designed to achieve improved feasible solutions. To evaluate the robustness of the method we tested it on several instances generated from a real application. The best solutions obtained are finally compared with solutions provided by standard software. These computational experiments enable the authors to conclude that the decomposition sequential heuristic is a good approach to this difficult real problem.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-011-1036-7