摘要
针对于多目标0-1规划问题,设计了一种和声算法对其进行求解,并在计算机上予以实现.经一系列算例测试,表明算法可行有效,可求解实际应用中的相应问题.由于和声搜索算法的时间复杂度较小,在计算效率上具有明显的优势.
This paper designed a Harmony Search Algorithm to solve the multi-bbjective 0-1 programming problem. This proposed algorithm is coded and implemeflted in the microcomputer. It is shown by the numerical result that this algorithm is effective and can find solution for some models in practical application. Also the Harmony Search Algorithm has the advantage in computation time for its low time complexity.
出处
《数学的实践与认识》
CSCD
北大核心
2012年第17期178-181,共4页
Mathematics in Practice and Theory
基金
国家自然科学基金资助项目(70871081)
上海市重点学科建设项目(S30504)
关键词
多目标
0—1规划
和声搜索算法
multi-objective
0-1 programming
Harmony Search Algorithm
