| 一类解决作业车间调度问题的遗传退火算法 |
| |
| 引用本文： | 潘全科,朱剑英.一类解决作业车间调度问题的遗传退火算法[J].聊城大学学报(自然科学版),2005,18(1):20-22,29. |
| |
| 作者姓名： | 潘全科 朱剑英 |
| |
| 作者单位： | 聊城大学,计算机学院,山东,聊城,252059;南京航空航天大学,机电学院,江苏,南京,210016 |
| |
| 基金项目： | 国家自然科学基金资助项目（50275078）、山东省自然科学基金资助项目（2004ZX14） |
| |
| 摘 要： | 将遗传算法与模拟退火相结合，提出了一种新调度算法，算法分成两步，首先利用遗传算法快速搜索一组较好解，然后利用模拟退火进行群体寻优，这样，既能克服遗传算法过早收敛的弱点，又能加快模拟退火的收敛速度，实验表明，该算法具有较高的求解质量和效率。
|
| 关 键 词： | 遗传算法 模拟退火 作业调度 |
| 文章编号： | 1672-6634（2005）01-0020-03 |
| 收稿时间： | 2005-01-10 |
| 修稿时间： | 2005-01-10 |
A Classic Genetic-Annealing Algorithm for Job Shop Scheduling |
| |
| PAN Quan-ke,ZHU Jian-ying.A Classic Genetic-Annealing Algorithm for Job Shop Scheduling[J].Journal of Liaocheng University:Natural Science Edition,2005,18(1):20-22,29. |
| |
| Authors: | PAN Quan-ke ZHU Jian-ying |
| |
| Abstract: | As a class of the hardest combinatorial optimization problems, job shop scheduling problem has been a major target for many researchers, for which an effective and robust procedure combined with genetic algorithm (GA) and simulated annealing algorithm (SA) is proposed. The procedure can be divided into two steps: first, GA is used to find a group of chromosomes, which have shorter makespans ; second, SA is applied to the chromosomes to find the best shortest makespan. Simulation results demonstrate the effectiveness of the proposed procedure. |
| |
| Keywords: | genetic algorithm simulated annealing job shop scheduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
