NON-OPTIMAL DYNAMIC PROGRAMMING ALGORITHMS IN THE DESIGN OF MINIMUM COST DRAINAGE SYSTEMS

Underground drainage systems for stormwater or foul waste may be efficiently designed for minimum construction cost by dynamic programming. Several previous authors have described optimum design algorithms. A practical design requirement for drainage systems is that pipe diameters must not decrease in a downstream sense through the system. This requirement is much more difficult to incorporate in a rigorous dynamic programming algorithm than it appears at first sight. The present authors have examined several algorithms proposed by previous authors and have found that they all handle this requirement in a fundamentally invalid fashion. Consequently previous dynamic programming algorithms are incorrect, leading to feasible though possible nonoptimal designs. This paper describes how the error arises in present algorithms and presents a simple example which shows the non-optimality of the algorithms. Finally, the correct handling of the requirement for non-decreasing pipe sizes is discussed and a rigorous dynamic programming algorithm for practical minimum cost drainage design is presented. (a) (TRRL)

  • Availability:
  • Corporate Authors:

    GORDON AND BREACH SCIENCE PUB.

    AMSTERDAM:
    ,    
  • Authors:
    • Walters, G A
    • Templeman, A B
  • Publication Date: 1979

Media Info

  • Features: Figures; References;
  • Pagination: p. 139-148
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00312291
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Files: ITRD, TRIS
  • Created Date: Oct 8 1980 12:00AM