For a quadratic unconstrained binary optimization problem, a robust optimization method that can obtain highly robust solutions in real-world scenarios where unpredictable fluctuations occur is proposed. This method is applied to the optimal permanent magnet design problem of an electromagnetic device, and a solution with high robustness can be obtained even during local fluctuations in the magnetization of the permanent magnet.
ClarichAPoloniCPedirodaV. A competitive game approach for multi objective robust design optimization. In: AIAA 1st intelligent systems technical conference, 2004 September 20–22, 2012 June 19, p.6511. Chicago, Illinois: AIAA.
2.
TsutsuiSGhoshA. Genetic algorithms with a robust solution searching scheme. IEEE Trans Evol Comput1997; 1: 201–208.
3.
YamazakiTMaruoAHasomeA, et al.Study on sequence problem optimization using variation-robust multi-objective optimization genetic algorithm. J Adv Mech Des Syst Manuf2022; 16: JAMDSM0049.
4.
MaruoAItaniNHasomeA, et al.Multi-objective topology design optimization combined with robust optimization. J Adv Mech Des Syst Manuf2023; 17: JAMDSM0038.
5.
MaruoASoedaTIgarashiH. Topology optimization of electromagnetic devices using digital annealer. IEEE Trans Magn2022; 58: 7001504.
6.
MatsubaraSTakatsuMMiyazawaT, et al.Digital annealer for high-speed solving of combinatorial optimization problems and its applications. In: 2020 25th Asia and South Pacific design automation conference (ASP-DAC), 2020 January 13–16, 2020 March 26, pp.9C–2. Beijing, China: IEEE.
7.
YoshimuraCHayashiMTakemotoT, et al.CMOS annealing machine: a domain-specific architecture for combinatorial optimization problem. In: 2020 25th Asia and South Pacific design automation conference (ASP-DAC), 2020 January 13–16, 2020 March 26, pp.9C–3. Beijing, China: IEEE.
