| 求解零空闲流水线调度问题的和声退火算法 |
| |
| 引用本文： | 武磊,潘全科,潘玉霞,桑红燕.求解零空闲流水线调度问题的和声退火算法[J].计算机工程与应用,2010,46(30):221-225. |
| |
| 作者姓名： | 武磊 潘全科 潘玉霞 桑红燕 |
| |
| 作者单位： | 聊城大学计算机学院,山东聊城252059 |
| |
| 基金项目： | 国家自然科学基金，数字制造装备与技术国家重点实验室开放课题(华中科技大学)，博士后科学基金 |
| |
| 摘 要： | 针对以最大完工时间为目标的零空闲流水线调度问题提出了和声退火算法。首先引入了基于ROV规则的编码方式,使和声搜索应用于离散问题,从初始化方法、参数调整、候选解的产生、和声记忆库的更新方法等四个方面对基本和声搜索算法进行了改进,基于此提出了改进的和声搜索算法;其次,结合和声搜索和模拟退火算法的优点,分别对和声搜索过程中的最优解、和声记忆库中的随机选中的解及一个新解分别进行模拟退火,提出了三种不同的和声退火算法。仿真实验表明所提算法的有效性和优越性。
|
| 关 键 词： | 零空闲流水线调度 和声搜索算法 最大完工时间 和声退火算法 |
Harmony-annealing optimization for no-idle flow shop scheduling |
| |
| WU Lei,PAN Quan-ke,PAN Yu-xia,SANG Hong-yan.Harmony-annealing optimization for no-idle flow shop scheduling[J].Computer Engineering and Applications,2010,46(30):221-225. |
| |
| Authors: | WU Lei PAN Quan-ke PAN Yu-xia SANG Hong-yan |
| |
| Affiliation: | School of Computer Science,Liaocheng University,Liaocheng,Shandong 252059,China |
| |
| Abstract: | An Improved Harmony Search（IHS） optimization algorithm is firstly presented to solve the No-Idle Flow Shop （NIFS） problem with the objective of minimizing the makespan of jobs in the literature.In the improved algorithm,a rule called the Ranked-Order-Value（ROV） is applied to enable the continuous harmony search algorithm to be used in all sequencing problems.Then three hybrid algorithms based on the IHS and the simulated annealing algorithm is studied for the NIFS in this literature.In the hybrid algorithms,several parts of the original harmony search are improved.Simulation results based on the well known benchmark suites in the literature show the effectiveness and superiority of the presented algorithms. |
| |
| Keywords: | no-idle flow shop harmony search makespan harmony-annealing optimization |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
