改进和声搜索算法求解一般整数规划问题  

Solving general integer programming problem by improved harmony search algorithm

作　　者：黄帅[1] 马良[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《计算机工程与应用》2014年第3期250-252,255,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.70871081);上海市重点学科建设项目(No.S30504);上海市研究生创新基金项目(No.JWCXSL1102)

摘　　要：设计了一种改进的和声搜索算法对一般的整数规划问题进行求解,在计算机上予以实现。经实验测试,相对遗传模拟退火算法和混合遗传算法,获得了同样甚至更好的解。由于改进和声搜索算法使用灵活,因此对于线性和非线性的整数规划问题都能进行求解。In order to solve the general integer programming problem, this paper designs an Improved Harmony Search Algorithm. The proposed algorithm is coded and implemented on micro-computer. The experiment gets the same or better optimal solution compared with that of Genetic Simulated Annealing algorithm and Hybrid Genetic algorithm. The Improved Harmony Search Algorithm can be used to solve both the linear and the nonlinear integer programming problems in general for its flexibility.

关 键 词：改进和声搜索算法 整数规划 非线性 

分 类 号：O22[理学—运筹学与控制论]