非线性整数规划问题的无参数填充函数算法

doi:10.15960/j.cnki.issn.1007-6093.2020.04.005

运筹学学报 ›› 2020, Vol. 24 ›› Issue (4): 63-73.doi: 10.15960/j.cnki.issn.1007-6093.2020.04.005

非线性整数规划问题的无参数填充函数算法

赵丹^1,2, 高岳林^1,2,3,*

1. 北方民族大学数学与信息科学学院, 银川 750021;
2. 宁夏科学计算与智能信息处理协同创新中心, 银川 750021;
3. 宁夏智能与大数据处理重点实验室, 银川 750021

收稿日期:2019-01-11 发布日期:2020-11-18
通讯作者: 高岳林 E-mail:gaoyuelin@263.net
基金资助:
国家自然科学基金（No.11961001），宁夏高等教育一流学科建设基金（No.NXYLXK2017B09）

Non-parameter filled function method for nonlinear integer programming

ZHAO Dan^1,2, GAO Yuelin^1,2,3,*

1. School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China;
2. Ningxia Collaborative Innovation Center of Scientific Computing and Intelligent Information Processing, Yinchuan 750021, China;
3. Ningxia Province Key Laboratory of Intelligent Information and Data Processing, Yinchuan 750021, China

Received:2019-01-11 Published:2020-11-18

摘要/Abstract

摘要： 为解决无约束非线性整数规划问题，提出了一个新的无参数填充函数算法。构造的填充函数与原函数有相同的局部极小点，因此可以通过不断极小化填充函数从而找到全局最优解，极大地减少计算量，提高计算效率。通过对六个测试函数进行数值实验，结果表明这个算法是有效可行的。

关键词: 全局优化, 填充函数, 非线性整数规划

Abstract: In this paper, we proposed a new non-parameter filled function method to solve unconstrained nonlinear integer programming. The filled function we constructed has the same local minimizer with the original objective function, so the computation cost is greatly reduced and the efficiency is improved. In this paper, the numerical experiments of six test functions are carried out, and the results show that the algorithm is effective and feasible.

Key words: global optimization, filled function method, nonlinear integer programming

中图分类号:

O221.2

赵丹, 高岳林. 非线性整数规划问题的无参数填充函数算法[J]. 运筹学学报, 2020, 24(4): 63-73.

ZHAO Dan, GAO Yuelin. Non-parameter filled function method for nonlinear integer programming[J]. Operations Research Transactions, 2020, 24(4): 63-73.

参考文献

[1] Ge R P. A filled function method for finding a global minimizer of a function of several variables[J]. Mathematical Programming, 1990, 50(1-3):191-204.
[2] Ge R P, Qin Y F. A class of filled functions for finding global minimizers of a function of several variables[J]. Journal of Optimization Theory & Applications, 1987, 54(2):241-252.
[3] Levy A V, Montalvo A. The tunneling algorithm for the global minimization of functions[J]. SIAM Journal on Scientific and Statistical Computing, 1985, 6(1):15-29.
[4] 申培萍. 全局优化方法[M]. 北京:科学出版社, 2006.
[5] 邬冬华, 田蔚文, 张连生, 等. 一种修正的求总极值的积分-水平集方法的实现算法收敛性[J]. 应用数学学报, 2001, 24(1):100-110.
[6] 陈华根, 吴健生, 王家林, 等. 模拟退火算法机理研究[J]. 同济大学学报(自然科学版), 2004, 32(6):802-805.
[7] 邢文训, 谢金星. 现代优化计算方法[M]. 北京:清华大学出版社, 2006.
[8] Leung Y W, Wang Y. Multiobjective programming using uniform design and genetic algorithm[J]. IEEE-transactions on Systems, Man, and Cybernetics, 2000, 30(3):293-304.
[9] Michel L, Hentenryck P V. A simple tabu search for warehouse location[J].European Journal of Operational Research, 2004, 157(3):576-591.
[10] Zhu W X. An approximate algorithm for nonlinear integer programming[J]. European Journal of Operational Research, 1997, 74(1):170-178.
[11] Shang Y L, Zhang L S. A filled function method for finding a global minimizer on global integer optimization[J]. Journal of Computational & Applied Mathematics, 2005, 181(1):200-210.
[12] Ng C K, Zhang L S, Li D, et al. Discrete filled function method for discrete global optimization[J]. Computational Optimization & Applications, 2005, 31(1):87-115.
[13] Ng C K, Li D, Zhang L S. Discrete global descent method for discrete global optimization and nonlinear integer programming[J]. Journal of Global Optimization, 2007, 37(1):357-379.
[14] Yang Y, Liang Y. A new discrete filled function algorithm for discrete global optimization[J]. Journal of Computational & Applied Mathematics, 2007, 202(2):280-291.
[15] Yang Y J, Wu Z Y, Bai F S. A filled function method for constrained nonlinear integer programming[J]. Journal of Industrial & Management Optimization, 2017, 4(2):353-362.
[16] Woon S F, Rehbock V. A critical review of discrete filed function methods solving nonlinear discrete optimization problems[J]. Application Mathematics and Computer Science, 2010, 271(1):25-41.
[17] Yang Y J, He M L, Gao Y L. Discrete global optimization problems with a modified discrete filled function[J]. Journal of the Operations Research Society of China, 2015, 3(3):297-315.
[18] Wei F, Wang Y, Lin H. A new filled function method with two parameters for global optimization[J]. Journal of Optimization Theory & Applications, 2014, 163(2):510-527.
[19] 高岳林, 吴佩佩. 非线性整数规划的一个新的无参数填充函数算法[J]. 计算数学, 2017, 39(3):321-327.

非线性整数规划问题的无参数填充函数算法

Non-parameter filled function method for nonlinear integer programming

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

编辑推荐

Metrics

本文评价

[1]	白富生, 冯丹, 张柯. 求解昂贵黑箱全局优化问题的自适应采样组合响应面方法[J]. 运筹学学报, 2021, 25(2): 1-14.
[2]	陈佳利, 张莹, 王胜刚, 谢笑盈. 一个新的填充函数及其在数据拟合问题中的应用[J]. 运筹学学报, 2021, 25(1): 81-88.
[3]	屈德强, 尚有林, 詹悦, 吴丹. 全局优化问题的一个新的无参数填充函数[J]. 运筹学学报, 2021, 25(1): 89-95.
[4]	陈永, 王薇, 徐以汎. 具有间断扩散性质的线性约束全局优化随机算法[J]. 运筹学学报, 2020, 24(1): 88-100.
[5]	王伟祥, 尚有林, 王朵. 求解带箱子集约束的非光滑全局优化问题的填充函数方法[J]. 运筹学学报, 2019, 23(1): 28-34.
[6]	郑跃, 庄道元, 万仲平. 求解弱线性双层规划问题的一种全局优化方法[J]. 运筹学学报, 2017, 21(3): 86-94.
[7]	吴佩佩, 高岳林. 一个新的非线性整数规划问题的单参数填充函数算法[J]. 运筹学学报, 2017, 21(3): 111-118.
[8]	石礼堂, 陈伟. 非线性无约束优化问题的滤子填充函数算法[J]. 运筹学学报, 2017, 21(1): 55-64.
[9]	胡铨, 王薇. 求解带箱式约束全局优化问题的滤子填充函数方法[J]. 运筹学学报, 2016, 20(3): 57-67.
[10]	戴彧虹，刘新为. 线性与非线性规划算法与理论[J]. 运筹学学报, 2014, 18(1): 69-92.
[11]	汤丹. 基于模拟退火的CRS算法[J]. 运筹学学报, 2011, 15(4): 124-128.
[12]	张丽丽, 李建宇, 李兴斯. 全局优化问题的一类积分型最优性条件 (英)[J]. 运筹学学报, 2011, 15(1): 1-10.