| 整数规划的旋转矢量法 |
| |
| 引用本文： | 李忠明,刘伟,焦宗夏.整数规划的旋转矢量法[J].系统工程与电子技术,2012,34(5):1058-1061. |
| |
| 作者姓名： | 李忠明 刘伟 焦宗夏 |
| |
| 作者单位： | 1. 北京邮电大学自动化学院， 北京 100876；
2. 北京航空航天大学自动化科学与电气工程学院， 北京 100191 |
| |
| 基金项目： | 国家自然科学基金(81102666);中央高校基本科研业务费专项资金(2009RC0607)资助课题 |
| |
| 摘 要： | 针对整数规划问题的求解，改造了基本旋转矢量方法中的旋转因子和收缩因子。旋转因子的选取保证了矢量旋转过程中矢径长度不变，矢径的收缩策略的选取能保证最大范围地搜索解空间。多点旋转矢量法采用多矢量同时旋转的思想，在算法实施中基于优胜劣汰的原则引入了矢径舍弃系数和种群保留系数两个控制参数，极大地提高了计算效率和求解精度。最后,通过整数规划算例验证了该方法的有效性，表明对于维数较高的整数规划问题效果也很好。
|
| 关 键 词： | 整数规划 启发式算法 旋转矢量 |
Rotate-vector method for integer programming |
| |
| LI Zhong-ming
,
LIU Wei
,
JIAO Zong-xia.Rotate-vector method for integer programming[J].System Engineering and Electronics,2012,34(5):1058-1061. |
| |
| Authors: | LI Zhong-ming LIU Wei JIAO Zong-xia |
| |
| Institution: | 1. School of Automation, Beijing University of Posts and Telecommunications, Beijing 100876, China；;
2. School of Automation Science and Electrical Engineering, Beihang University， Beijing 100191, China |
| |
| Abstract: | A rotating vector optimization method for integer programming is presented based on the basic rotate-vector method.Rotation coefficient and contract coefficient are rebuilt.The length of the radius vector is ensured to be constant in the process of rotation.The strategy for contraction can search an optimal solution exhaustively in the space.The method of multi vectors and the principle of "survival of the fittest" are used.The rejection coefficient of radius vectors and the retained coefficient of vectors are introduced as control parameters.As a result,computational efficiency and accuracy are improved evidently.The effectiveness is tested by solving two examples of integer programming.The method is also efficient for integer programming with higher dimensional space. |
| |
| Keywords: | integer programming heuristic algorithm rotate-vector |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程与电子技术》浏览原始摘要信息 |
| 点击此处可从《系统工程与电子技术》下载免费的PDF全文 |
