Optimization of sewer networks using the mixed-integer linear programming

This paper introduces a method for optimizing sewer networks using the mixed-integer linear programming (MILP) for a given layout. The objective function is defined as the sum of the costs for pipe purchase, pipe-laying, and manhole construction expressed in linear terms and subject to minimum and m...

Full description

Saved in:
Bibliographic Details
Published in:Urban water journal Vol. 14; no. 5; pp. 452 - 459
Main Authors: Safavi, Hamidreza, Geranmehr, Mohammad A.
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 28.05.2017
Taylor & Francis Ltd
Subjects:
Benchmarking
Elevation
Linear programming
mixed integer linear programming
Networks
Objective function
Optimization
Pipe
Sewage
Sewer networks
Sewers
Slopes
ISSN:1573-062X, 1744-9006
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper introduces a method for optimizing sewer networks using the mixed-integer linear programming (MILP) for a given layout. The objective function is defined as the sum of the costs for pipe purchase, pipe-laying, and manhole construction expressed in linear terms and subject to minimum and maximum allowable slopes, velocities, and relative depths for both minimum and maximum sewage discharge rates in each pipe. Additionally, provisions are made as constraints or conditions to ensure that a minimum pipe cover is required, that pipe diameters do not decrease in the flow direction, and that pipes maintain a steady elevation at each manhole. All the non-linear constraints are transformed into the linear format. Pipe slope, binary variables accounting for commercial pipe diameters and average implemented depths have also been considered as decision variables. Finally, the performance of the proposed optimization method is evaluated in a benchmark sewer network from the literature.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1573-062X
1744-9006
DOI:10.1080/1573062X.2016.1176222