【摘要】 打洞函数方法作为求解全局优化问题的一种有效方法，其跳出局部极值的能力深受打洞函数性质的影响。随着实际优化问题的复杂化，其对应的打洞函数形式更加复杂。因此，构造形式简单且性质良好的打洞函数是打洞函数方法的主要研究目标之一。为了提高打洞函数方法求解多峰函数的效率，提出了一个新型的打洞函数，其局部极小点不仅是比目标函数当前局部极小点更优的可行点，同时也是更优的局部极小点，即打洞函数和目标函数具有相同的局部极小点。于是，只需极小化打洞函数即可直接求得比目标函数更优的局部极小点。基于此特点，设计了一个新的打洞函数算法，该算法改进了传统打洞函数法的算法框架，克服了交替极小化目标函数和打洞函数的局面，有效地减少了局部寻优的次数，加快了全局寻优的速度。理论分析和数值实验验证了算法的可行性和有效性。更多还原

【Abstract】 Tunneling function method is an effective method for global optimization problems.Its ability to jump out of the local minimizer is deeply affected by the properties of the tunneling function. With the complexity of practical optimization problems, the corresponding forms of tunneling functions become more complex. Therefore, constructing tunneling functions with simple form and good properties is one of the main research objectives of the tunneling function method. In order to improve the efficiency of the tunneling function method for solving multi-modal functions, a new tunneling function is constructed. Its minimizers are not only the better feasible points of the objective function than the current local minimizer, but also the better local minimizers, i.e., the tunneling function and the objective function have the same local minimizers. Thus, the better local minimizer of the objective function can be obtained directly by minimizing the tunneling function. Based on this feature, a new tunneling function algorithm is designed. It changes the frame of conventional tunneling function methods that objective function and tunneling function are minimized alternately, and can effectively reduce the iterations of local optimization and accelerate the speed of global optimization. Theoretical analysis and numerical experiments exhibit the feasibility and effectiveness of the algorithm.更多还原