检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴佩佩 高岳林 WU Peipei1 GAO Yuelin 1
机构地区:[1]北方民族大学数学与信息科学学院,银川750021
出 处:《运筹学学报》2017年第3期111-118,共8页Operations Research Transactions
基 金:国家自然科学基金(Nos.61561001;11161001);北方民族大学重点科研项目(No.YCX1681)
摘 要:非线性整数规划问题是一类复杂的优化问题,填充函数算法是求解整数规划问题的一类有效方法.构造一个新的单参数填充函数,分析并证明了其填充性质;然后,基于该填充函数并结合离散最速下降法提出了一种新的填充函数算法;最后,采用新算法对6个测试函数进行数值实验,结果表明该算法具有良好的计算效果,是有效可行的.Nonlinear integer programming problem is a kind of complex optimization problem. The filled function algorithm is an effective method for solving integer programming problems. It involves an auxiliary function to move successively from one local minimum to another better one. At the same time, the method for using only the local minimization algorithm of mature and popular. However, most of the existing filled functions contain one or two interdependent parameters, which makes it difficult to select and adjust the parameters. And the filled function is a composite function of the objective function, and the objective function itself is more complex. Therefore, it is important to construct a filled function which is simple in form, with fewer parameters and good properties. To solve such problems, in this paper, firstly, we construct a new filled function with one parameter, analyze and prove its filling properties; then, the filled function combined with discrete steepest descent method and proposes a new filled function algorithm; finally, the implementation of the algorithms on six test problems show that the algorithm has good effect and is effective and feasible.
分 类 号:O221.2[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13