A constrained topology optimization methodology based on budget constrained min-cut

• Meng Xia ^[1] ; Jan Sykulski ^[2]
  1. [1] Zhejiang University

     Zhejiang University

     China

     
  2. [2] Southampton University, UK
• Localización: Compel: International journal for computation and mathematics in electrical and electronic engineering, ISSN 0332-1649, Vol. 42, Nº Extra 1, 2023, págs. 81-89
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Purpose The purpose of this paper is to propose a novel methodology based on budget constrained Min-Cut theorem to solve constrained topology optimization (TO).

    Design/methodology/approach This paper establishes a weighted network with budget, which is derived from the sensitivity with respect to the constraint function. The total budget carried by the topology evaluates the extent to which the constraint is satisfied. By finding the Min-Cut under budget constraint in each step, the proposed method is able to solve constrained TO problem.

    Findings The results obtained from a magnetic actuator including a yoke, a coil and an armature have demonstrated that the proposed method is effective to solve constrained TO problem.

    Originality/value A novel methodology based on budget constrained Min-Cut is proposed to solve constrained TO problem.