|
|||||
|
|
| 求解模糊作业车间调度问题的群体邻域搜索算法 | |
| 引用本文： | 郑友莲,李元香,雷德明.求解模糊作业车间调度问题的群体邻域搜索算法[J].电子学报,2011,39(10):2454-2458. |
| 作者姓名： | 郑友莲 李元香 雷德明 |
| 作者单位： | 1. 湖北大学数学与计算机科学学院,湖北武汉430062;武汉大学软件工程国家重点实验室,湖北武汉430072 2. 武汉大学软件工程国家重点实验室,湖北武汉,430072 3. 武汉理工大学自动化学院,湖北武汉,430070 |
| 基金项目： | 国家863计划(No.2007AA01Z290); 国家自然科学基金(No.60773009) |
| 摘 要： | 本文提出一种群体邻域搜索算法(Swarm-based Neighborhood Search,SNS),用于最小化模糊作业车间调度问题(Fuzzy Job Shop Scheduling Problem,FJSSP)的模糊makespan.该算法使用基于有序工序的编码,通过锦标赛选择和概率为1的动态调整互换操作更新群体.对调度结果的理论分析表明,模糊makespan能反映解的优劣.理论分析及大量实验证明,SNS具有较强的全局和局部优化能力,以及较快的收敛速度,在求解FJSSP方面具有较强的优势. |
| 关 键 词： | 模糊作业车间调度 群体邻域搜索 互换 |
| 收稿时间： | 2010-09-27 |
Solving Fuzzy Job Shop Scheduling Problems Through Swarm-Based Neighborhood Search Algorithm |
|
| ZHENG You-lian,LI Yuan-xiang,LEI De-ming.Solving Fuzzy Job Shop Scheduling Problems Through Swarm-Based Neighborhood Search Algorithm[J].Acta Electronica Sinica,2011,39(10):2454-2458. | |
| Authors: | ZHENG You-lian LI Yuan-xiang LEI De-ming |
| Affiliation: | ZHENG You-lian1,2,LI Yuan-xiang2,LEI De-ming3(1.Faculty of Mathematics & Computer Science,Hubei University,Wuhan,Hubei 430062,China,2.State Key Laboratory of Software Engineering,Wuhan University,Hubei 430072,3.School of Automation,Wuhan University of Technology,Hubei 430070,China) |
| Abstract: | This paper presents a swarm-based neighbourhood search algorithm(SNS) to minimize the maximum completion time of fuzzy job shop scheduling problem(FJSSP).SNS uses an ordered operation-based representation,tournament selection and swap operation in which probability is 1 and swap-time is adjusted dynamically.The theoretical analyses on scheduling results show that fuzzy makespan can be used to evaluate the quality of solution.Theoretical analysis and a large number of experiments demonstrate that SNS has str... |
| Keywords: | fuzzy job shop scheduling swarm-based neighborhood search swap |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《电子学报》浏览原始摘要信息 | |
| 点击此处可从《电子学报》下载全文 | |