A new Branch and Bound method for a discrete truss topology design problem

Our paper considers a classic problem in the field of Truss Topology Design, the goal of which is to determine the stiffest truss, under a given load, with a bound on the total volume and discrete requirements in the cross-sectional areas of the bars. To solve this problem we propose a new two-stage Branch and Bound algorithm.In the first stage we perform a Branch and Bound algorithm on the nodes of the structure. This is based on the following dichotomy study: either a node is in the final structure or not. In the second stage, a Branch and Bound on the bar areas is conducted. The existence or otherwise of a node in this structure is ensured by adding constraints on the cross-sectional areas of its incident bars. In practice, for reasons of stability, free bars linked at free nodes should be avoided. Therefore, if a node exists in the structure, then there must be at least two incident bars on it, unless it is a supported node. Thus, a new constraint is added, which lower bounds the sum of the cross-sectional areas of bars incident to the node. Otherwise, if a free node does not belong to the final structure, then all the bar area variables corresponding to bars incident to this node may be set to zero. These constraints are added during the first stage and lead to a tight model. We report the computational experiments conducted to test the effectiveness of this two-stage approach, enhanced by the rule to prevent free bars, as compared to a classical Branch and Bound algorithm, where branching is only performed on the bar areas.

[1]  Mathias Stolpe,et al.  A note on stress-constrained truss topology optimization , 2003 .

[2]  Günter Leugering,et al.  Multidisciplinary Free Material Optimization , 2010, SIAM J. Appl. Math..

[3]  Günter Leugering,et al.  Free Material Optimization with Fundamental Eigenfrequency Constraints , 2009, SIAM J. Optim..

[4]  Wolfgang Achtziger,et al.  Global optimization of truss topology with discrete bar areas—Part I: theory of relaxed problems , 2008, Comput. Optim. Appl..

[5]  Wolfgang Achtziger.  Optimization with Variable Sets of Constraints and an Application to Truss Design , 2000, Comput. Optim. Appl..

[6]  Adelaide Cerveira,et al.  Semidefinite relaxations and lagrangean duality in truss topology design problem , 2011 .

[7]  M. Zhou,et al.  Difficulties in truss topology optimization with stress and local buckling constraints , 1996 .

[8]  Martin P. Bendsøe,et al.  A New Method for Optimal Truss Topology Design , 1993, SIAM J. Optim..

[9]  M. Stolpe,et al.  Truss topology optimization with discrete design variables—Guaranteed global optimality and benchmark examples , 2007 .

[10]  G. I. N. Rozvany,et al.  Difficulties in truss topology optimization with stress, local buckling and system stability constraints , 1996 .

[11]  Mathias Stolpe,et al.  Global optimization of discrete truss topology design problems using a parallel cut-and-branch method , 2008 .

[12]  J. A. Gromicho Dos Santos,et al.  Using optimization to solve truss topology design problems , 2005 .

[13]  Srinivas Bollapragada,et al.  Optimal Design of Truss Structures by Logic-Based Branch and Cut , 2001, Oper. Res..

[14]  Héctor Ramírez Cabrera,et al.  Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines , 2010, Optim. Methods Softw..

[15]  Mathias Stolpe,et al.  Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound , 2004 .

[16]  C. Roos,et al.  Semi-definite problems in truss topology optimization , 2007 .

[17]  Joaquim J. Júdice,et al.  An integer programming model for truss topology optimization , 2006 .

[18]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[19]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..

[20]  Arkadi Nemirovski,et al.  Potential Reduction Polynomial Time Method for Truss Topology Design , 1994, SIAM J. Optim..

[21]  Wolfgang Achtziger,et al.  Global optimization of truss topology with discrete bar areas—Part II: Implementation and numerical results , 2009, Comput. Optim. Appl..

[22]  Brian Borchers.  CSDP 2.3 user's guide , 1999 .

[23]  Arkadi Nemirovski,et al.  Robust Truss Topology Design via Semidefinite Programming , 1997, SIAM J. Optim..