A DYNAMIC PROGRAMMING ALGORITHM FOR SYSTEMATIC OPTIMIZATION OF BRIDGE STRUCTURES

A THEORY FOR THE SYSTEMATIC MINIMIZATION OF THE TOTAL COST OF A SIMPLE SPAN DECK AND GIRDER, HIGHWAY BRIDGE STRUCTURE IS PRESENTED. DYNAMIC PROGRAMMING, A MATHEMATICAL TECHNIQUE APPLICABLE TO THE OPTIMIZATION OF SERIAL SYSTEMS, IS EMPLOYED IN DEVELOPING THE MODEL AND ITS SOLUTION. THE GEOMETRIC ALLOCATION OF TOTAL BRIDGE LENGTH INTO N SPANS (DECISIONS CONCERNING INDIVIDUAL SPAN LENGTHS) AND THE SELECTION OF STRUCTURAL COMPONENTS FOR EACH OF THE SPANS ARE IMPLEMENTED SIMULTANEOUSLY. FOR THIS REASON, THE SET OF OPTIMAL DECISIONS GENERATES A BRIDGE DESIGN OF MINIMUM OVERALL COST. ALL PARAMETERS THAT AFFECT BRIDGE STRUCTURE ECONOMICS, COLLECTIVELY OR INDIVIDUALLY, CAN BE READILY INCORPORATED IN THE MATHEMATICAL MODEL. THE SET OF PARAMETERS INCLUDES, BUT IS NOT RESTRICTED TO, BRIDGE GEOMETRY, TYPES OF SUPERSTRUCTURE AND SUBSTRUCTURE COMPONENTS, MATERIAL TYPES AND STRENGTHS, SOIL AND TERRAIN CONDITIONS, AND CONSTRUCTION COSTS. THE OPTIMIZATION PROCEDURE RESULTED IN AN ALGORITHM SUITABLE FOR COMPUTER PROGRAMMING. AN EXTENSIVE COMPUTER PROGRAM WAS DEVELOPED TO IMPLEMENT THE OPTIMIZATION METHOD. THE OPTIMIZATION THEORY AND THE ALGORITHM ARE INDEPENDENT OF DESIGN PROCEDURES. THUS, NO PARTICULAR METHOD OF STRUCTURAL DESIGN FOR INDIVIDUAL BRIDGE COMPONENTS WAS EMPHASIZED. THE COMPUTER PROGRAM IS MODULAR AND ANY RECENT OR ESTABLISHED STRUCTURAL DESIGN PROCEDURE CAN BE INCORPORATED WITH MINIMUM PROGRAMMING EFFORT. THE PROGRAM IS CAPABLE OF GENERATING SEVERAL OPTIMUM BRIDGE STRUCTURES BASED ON THE USER'S SPECIFICATION OF INPUT DATA. /AUTHOR/

  • Supplemental Notes:
    • 33 Pp, 5 FiG, 9 TAB, 10 REF
  • Corporate Authors:

    American Association of State Highway Officials

    57th Annual Meeting
    ,   USA 
  • Authors:
    • Aguilar, R J
  • Publication Date: 1971-12

Subject/Index Terms

Filing Info

  • Accession Number: 00209581
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Apr 2 1972 12:00AM