发表刊物:arXiv preprint
摘要:The global minimum point of an optimization problem is of interest in engineering fields and it is difficult to be solved, especially for a nonconvex large-scale optimization problem. In this article, we consider a new memetic algorithm for this problem. We compare it with the multi-start method (the built-in subroutine GlobalSearch.m of the MATLAB R2020a environment), the differential evolution algorithm (the DE method, the subroutine de.m of the MATLAB Central File Exchange 2021) and the branch-and-bound method (Couenne of the state-of-the-art open-source solver for mixed integer nonlinear
论文类型:期刊论文
第一作者:罗新龙
合写作者:肖航
学科门类:理学
一级学科:数学
文献类型:J
页面范围:1-23
是否译文:否
发表时间:2021-12-21
收录刊物:SCI