z-logo
open-access-imgOpen Access
0—1 integer linear programming for actively shielded magnetic resonance image (MRI) superconducting magnet design
Author(s) -
Guoqing Zhang,
Xiaoji Du,
Ling Zhao,
Feipeng Ning,
Wenjing Yao,
Zi Zhu
Publication year - 2012
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.61.228701
Subject(s) - magnet , superconductivity , shielded cable , superconducting magnet , superconducting wire , electromagnetic coil , half integer , nuclear magnetic resonance , physics , magnetic field , magnetic resonance imaging , computer science , computational physics , condensed matter physics , radiology , telecommunications , medicine , quantum mechanics
Here introduced is an optimization design method for actively shielded magnetic resonance image (MRI) superconducting magnet based on the integer linear programming. The feasible coil space is densely divided by an array of candidate squares and, its size is determined by the size of actual superconducting wire. The 0—1 integer linear programming method is adopted to obtain the initial wire concentrated region of coils by comprehensivly considering superconductivity wire consumption, magnetic field intensity inside the superconductors, homogeneity in imaging region and the range of leak fields. Then by reasonably adjusting the position and section size of the wire concentrated region for the next calculation, the final MRI superconducting magnet structure with rectangular section coils is obtained. The method is based on the full size of the superconducting wire, which makes the MRI superconducting magnet design more feasible and has greater advantage for the actual fabriction. With different constraints, the method can also be used for other superconducting magnet design. Finally an example of the MRI magnet optimal design is presented.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here