| Job-Shop调度问题的量子蚁群算法求解* |
| |
| 引用本文： | 刘长平,叶春明,唐海波.Job-Shop调度问题的量子蚁群算法求解*[J].计算机应用研究,2011,28(12):4507-4509. |
| |
| 作者姓名： | 刘长平 叶春明 唐海波 |
| |
| 作者单位： | 1. 上海理工大学管理学院,上海200093;淮阴工学院,江苏淮安223001
2. 上海理工大学管理学院,上海,200093 |
| |
| 基金项目： | 国家教育部人文社会科学规划基金资助项目（10YJA630187)；高校博士点专项科研基金项目（20093120110008）；上海市重点学科建设资助项目（S30504） |
| |
| 摘 要： | 针对最小化最大完工时间的作业车间调度问题,提出了一种量子蚁群调度算法.该算法结合了量子计算中量子旋转门的量子信息和蚁群寻优的特点,通过作业车间调度问题的析取图表示,将原问题转换为求解析取图的关动路径,并利用量子蚁群算法进行求解.采用该算法对作业车间调度问题的基准数据进行测试,仿真结果表明了该算法的可行性和有效性.
|
| 关 键 词： | 作业车间调度 量子蚁群算法 析取图 关键路径 最大完工时间 |
Solving Job-Shop scheduling problem by quantum-inspired ant colony optimization algorithm |
| |
| LIU Chang-ping,YE Chun-ming,TANG Hai-bo.Solving Job-Shop scheduling problem by quantum-inspired ant colony optimization algorithm[J].Application Research of Computers,2011,28(12):4507-4509. |
| |
| Authors: | LIU Chang-ping YE Chun-ming TANG Hai-bo |
| |
| Affiliation: | LIU Chang-ping1,2,YE Chun-ming1,TANG Hai-bo1(1.College of Management,University of Shanghai for Science & Technology,Shanghai 200093,China,2.College of Economics & Management,Huaiyin Institute of Technology,Huaian Jiangsu 223001,China) |
| |
| Abstract: | Aiming at JSP with the criterion for minimizing the maximum completion time(makespan),this paper proposed a hybrid algorithm,which combined the quantum information rules of quantum rotation gate with the characteristics of ant colony optimization.It transformed solving makespan into finding the critical path in disjunctive graph based on the representation of JSP,then used QACO algorithm to find the critical path.The simulation results for benchmark problems show the feasibility and effectiveness of QACO co... |
| |
| Keywords: | Job-Shop scheduling quantum-inspired ant colony optimization(QACO) disjunctive graph critical path makespan |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
