OPTIMAL COST DESIGN OF BRANCHED SEWER SYSTEMS.

Larry Mays, Ben Chie Yen

Research output: Contribution to journalArticle

54 Citations (Scopus)

Abstract

Techniques using dynamic programming (DP) and discrete differential dynamic programming (DDDP) to achieve optimal cost design of pipe sizes and elevations of branched sewer systems have been developed and demonstrated by an example. The branched system is decomposed into equivalent serial subsystems, which are then solved in sequence. DDDP requires less computer time than DP, although it cannot guarantee global optimization. Major factors affecting the efficiency in using DDDP are the location and width of the initial trial trajectory corridor, the number of states (lattice points) used, and the reduction rate of the state increment during iterations.

Original languageEnglish (US)
Pages (from-to)37-47
Number of pages11
JournalWater Resources Research
Volume11
Issue number1
StatePublished - Feb 1975
Externally publishedYes

Fingerprint

sewer systems
dynamic programming
Sewers
Dynamic programming
pipe
trajectory
cost
Costs
Global optimization
pipes
trajectories
Pipe
Trajectories
corridor
rate
trial

ASJC Scopus subject areas

  • Aquatic Science
  • Environmental Science(all)
  • Environmental Chemistry
  • Water Science and Technology

Cite this

OPTIMAL COST DESIGN OF BRANCHED SEWER SYSTEMS. / Mays, Larry; Yen, Ben Chie.

In: Water Resources Research, Vol. 11, No. 1, 02.1975, p. 37-47.

Research output: Contribution to journalArticle

Mays, Larry ; Yen, Ben Chie. / OPTIMAL COST DESIGN OF BRANCHED SEWER SYSTEMS. In: Water Resources Research. 1975 ; Vol. 11, No. 1. pp. 37-47.
@article{bdd4b1ff39e64c14a6e4449f1ef3c384,
title = "OPTIMAL COST DESIGN OF BRANCHED SEWER SYSTEMS.",
abstract = "Techniques using dynamic programming (DP) and discrete differential dynamic programming (DDDP) to achieve optimal cost design of pipe sizes and elevations of branched sewer systems have been developed and demonstrated by an example. The branched system is decomposed into equivalent serial subsystems, which are then solved in sequence. DDDP requires less computer time than DP, although it cannot guarantee global optimization. Major factors affecting the efficiency in using DDDP are the location and width of the initial trial trajectory corridor, the number of states (lattice points) used, and the reduction rate of the state increment during iterations.",
author = "Larry Mays and Yen, {Ben Chie}",
year = "1975",
month = "2",
language = "English (US)",
volume = "11",
pages = "37--47",
journal = "Water Resources Research",
issn = "0043-1397",
publisher = "American Geophysical Union",
number = "1",

}

TY - JOUR

T1 - OPTIMAL COST DESIGN OF BRANCHED SEWER SYSTEMS.

AU - Mays, Larry

AU - Yen, Ben Chie

PY - 1975/2

Y1 - 1975/2

N2 - Techniques using dynamic programming (DP) and discrete differential dynamic programming (DDDP) to achieve optimal cost design of pipe sizes and elevations of branched sewer systems have been developed and demonstrated by an example. The branched system is decomposed into equivalent serial subsystems, which are then solved in sequence. DDDP requires less computer time than DP, although it cannot guarantee global optimization. Major factors affecting the efficiency in using DDDP are the location and width of the initial trial trajectory corridor, the number of states (lattice points) used, and the reduction rate of the state increment during iterations.

AB - Techniques using dynamic programming (DP) and discrete differential dynamic programming (DDDP) to achieve optimal cost design of pipe sizes and elevations of branched sewer systems have been developed and demonstrated by an example. The branched system is decomposed into equivalent serial subsystems, which are then solved in sequence. DDDP requires less computer time than DP, although it cannot guarantee global optimization. Major factors affecting the efficiency in using DDDP are the location and width of the initial trial trajectory corridor, the number of states (lattice points) used, and the reduction rate of the state increment during iterations.

UR - http://www.scopus.com/inward/record.url?scp=0016470166&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0016470166&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0016470166

VL - 11

SP - 37

EP - 47

JO - Water Resources Research

JF - Water Resources Research

SN - 0043-1397

IS - 1

ER -