| 0-1线性规划的连续化及其遗传算法解法 |
| |
| 引用本文： | 隋允康,贾志超. 0-1线性规划的连续化及其遗传算法解法[J]. 数学的实践与认识, 2010, 40(6) |
| |
| 作者姓名： | 隋允康 贾志超 |
| |
| 作者单位： | 北京工业大学,机械工程与应用电子技术学院,北京,100022 |
| |
| 基金项目： | 国家自然科学基金委(10872012); 北京市自然科学基金委(3093019); 大连理工大学工业装备结构分析国家重点实验室基金(GZ0819); 高校博士点基金(20060005010) |
| |
| 摘 要： | 将0-1离散规划通过一个非线性等式约束表示为[0,1]区间上等价的连续变量非线性规划列式.对非线性等式约束的问题进行了两种方法的处理.第一种方法使用乘子法,第二种方法将非线性的等式约束近似为一个非线性的不等式约束,均利用遗传算法程序GENOCOP进行了求解.对多个算例进行了计算,结果表明了该方法的可行性和有效性.
|
| 关 键 词： | 0-1规划 连续化方法 遗传算法 GENOCOP |
A Continuous Approach to 0-1 Linear Problem and Its Solution with Genetic Algorithm |
| |
| SUI Yun-kang,JIA Zhi-chao. A Continuous Approach to 0-1 Linear Problem and Its Solution with Genetic Algorithm[J]. Mathematics in Practice and Theory, 2010, 40(6) |
| |
| Authors: | SUI Yun-kang JIA Zhi-chao |
| |
| Affiliation: | SUI Yun-kang,JIA Zhi-chao (The College of Mechanical Engineering & Applied Electronics Technology:Beijing University of Technology Beijing 100022,China) |
| |
| Abstract: | In this paper,a 0-1 discrete programming problem is converted to an equivalent continuous nonlinear programming formulation on the domain of[0,1]by a nonlinear equality constraint.The nonlinear equality constraint problem is solved by two methods.One is multiplier method and the other is transforming the nonlinear equality constraint into an inequality constraint.Then the Genetic Algorithm GENOCOP is used to solve them.Some examples are presented and the numerical results show that the approach is effective... |
| |
| Keywords: | 0-1 programming continuous approach genetic algorithm GENOCOP |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
