Constructing uniform design tables based on restart discrete dynamical evolutionary algorithm

被引:0
作者
Zhao, Yuelin [1 ]
Wu, Feng [1 ]
Yang, Yuxiang [1 ]
Wei, Xindi [1 ]
Hu, Zhaohui [1 ]
Yan, Jun [1 ]
Zhong, Wanxie [1 ]
机构
[1] State Key Laboratory of Structural Analysis, Optimization and CAE Software for Industrial Equipment, Department of Engineering Mechanics, Faculty of Vehicle Engineering and Mechanics, Dalian University of Technology, Dalian
基金
中国国家自然科学基金;
关键词
Discrete rounding; Dynamical optimization algorithm; Multi-objective optimization; Simulated annealing; Uniform design table;
D O I
10.1007/s00500-024-09890-x
中图分类号
学科分类号
摘要
Generating uniform design tables (UDTs) is the first step to experimenting efficiently and effectively, and is also one of the most critical steps. Thus, the construction of uniform design tables has received much attention over the past decades. This paper presents a new algorithm for constructing uniform design tables: restart discrete dynamical evolutionary algorithm (RDDE). This algorithm is based on a well-designed dynamical evolutionary algorithm and utilizes discrete rounding technology to convert continuous variables into discrete variables. Considering the optimization of UDT is a multi-objective optimization problem, RDDE uses Friedman rank to select the optimal solution with better comprehensive comparison ranking. RDDE also utilizes a simulated annealing-based restart technology to select control parameters, thereby increasing the algorithm's ability to jump out of local optima. Comparisons with state-of-the-art UDTs and two practical engineering examples are presented to verify the uniformity of the design table constructed by RDDE. Numerical results indicate that RDDE can indeed construct UDTs with excellent uniformity at different levels, factors, and runs. Especially, RDDE can flexibly construct UDTs with unequal intervals of factors that cannot be directly processed by other designs of experiment. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.
引用
收藏
页码:11515 / 11534
页数:19
相关论文
共 68 条
  • [31] Kim D., Hofstaedter C.E., Zhao C., Mattei L., Tanes C., Clarke E., Lauder A., Sherrill-Mix S., Chehoud C., Kelsen J., Conrad M., Collman R.G., Baldassano R., Bushman F.D., Bittinger K., Optimizing methods and dodging pitfalls in microbiome research, Microbiome, 5, 1, (2017)
  • [32] Kitayama S., Arakawa M., Yamazaki K., Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization, Struct Multidiscipl Optim, 32, 3, pp. 191-202, (2006)
  • [33] Lee C.Y., Kang H.G., Cell planning with capacity expansion in mobile communications: a Tabu search approach, IEEE Trans Veh Technol, 49, 5, pp. 1678-1691, (2000)
  • [34] Li X., Zhang S., Shao P., Discrete artificial bee colony algorithm with fixed neighborhood search for traveling salesman problem, Eng Appl Artif Intell, 131, (2024)
  • [35] Lin C.J., Wu C.H., Sun C.C., Lin C.H., Uniform experimental design for optimizing the parameters of multi-input convolutional neural networks, Sens Mater, 32, 10, (2020)
  • [36] Lu X., Guo J.F., Chen F., Tian M.K., Synthesis of ternary geopolymers using prediction for effective solidification of mercury in tailings, J Environ Sci, 147, pp. 392-403, (2025)
  • [37] Mallipeddi R., Suganthan P., Differential evolution algorithm with ensemble of parameters and mutation strategies, Swarm, Evolutionary, and Memetic Computing - First International Conference on Swarm, Evolutionary, and Memetic Computing, SEMCCO 2010, Chennai, India, 16–18 December, (2010)
  • [38] Mckay M.D., Beckman R.J., Conover W.J., A comparison of three methods for selecting values of input variables in the analysis of output from a computer code, Technometrics, 21, 2, pp. 239-245, (1979)
  • [39] Mirjalili S., Jangir P., Mirjalili S.Z., Saremi S., Trivedi I.N., Optimization of problems with multiple objectives using the multi-verse optimization algorithm, Knowl Based Syst, 134, pp. 50-71, (2017)
  • [40] Poitras G.J., Cormier G., Nabolle A.S., Peloton dynamics optimization: algorithm for discrete structural optimization, J Struct Eng, 147, (2021)