To read this content please select one of the options below:

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

Meng Xia (Department of, Zhejiang University, Hangzhou, China)
Jan Sykulski (Department of Electronics and Computer Science, Southampton University, Southampton, UK)

COMPEL - The international journal for computation and mathematics in electrical and electronic engineering

ISSN: 0332-1649

Article publication date: 3 June 2022

Issue publication date: 12 January 2023

20

Abstract

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.

Keywords

Citation

Xia, M. and Sykulski, J. (2023), "A constrained topology optimization methodology based on budget constrained min-cut", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 42 No. 1, pp. 81-89. https://doi.org/10.1108/COMPEL-01-2022-0056

Publisher

:

Emerald Publishing Limited

Copyright © 2022, Emerald Publishing Limited

Related articles