首页> 外文会议>Intelligent Agents and Multi-Agent Systems >On the Pheromone Update Rules of Ant Colony Optimization Approaches for the Job Shop Scheduling Problem

【24h】

On the Pheromone Update Rules of Ant Colony Optimization Approaches for the Job Shop Scheduling Problem

机译：车间调度问题的蚁群优化方法信息素更新规则

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

Ant Colony Optimization (ACO) system is an intelligent multi-agent system of the interacting artificial ants to solve the combinatorial optimization problems. Applying ACO approach in the typical NP-hard problem like job shop scheduling (JSS) problem is still an impressive and attractive challenge with the community. This paper proposes two improvements of ACO algorithm based on the convergence property of pheromone trails. Our improvements are better in both terms of accuracy and running time than the state-of-the-art Max-Min ant system by the simulation with the standard data sets.

机译：蚁群优化（ACO）系统是相互作用的人工蚂蚁的智能多智能体系统，旨在解决组合优化问题。在典型的NP难题（如车间调度（JSS）问题）中应用ACO方法仍然是社区一个令人印象深刻且有吸引力的挑战。基于信息素轨迹的收敛性，提出了两种改进的ACO算法。通过使用标准数据集进行仿真，我们的改进在准确性和运行时间上都比最新的Max-Min蚂蚁系统要好。

著录项

来源
《Intelligent Agents and Multi-Agent Systems》|2008年|153-160|共8页
会议地点 Hanoi(VN);Hanoi(VN)
作者
Dong Do Due; Huy Q. Dinh; Huan Hoang Xuan;
展开▼
作者单位

Department of Computer Science, College of Technology, Vietnam National University, Hanoi, 144 Xuan Thuy, Hanoi, Vietnam;

Gregor Mendel Institute of Molecular Plant Biology, Vienna, Austria Center for Integrative Bioinformatics Vienna, Vienna, Austria;

Department of Computer Science, College of Technology, Vietnam National University, Hanoi, 144 Xuan Thuy, Hanoi, Vietnam;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类信息处理（信息加工）;
关键词
ant colony optimization algorithm; job shop scheduling problem; ACO convergence;

机译：蚁群优化算法；作业车间调度问题； ACO融合;

相似文献

外文文献
中文文献
专利

1. Solving Job Shop Scheduling Problem using Sequence and Parallel Pheromone Updating Strategy in Ant Colony Optimization [J] . J. Anitha, M. Karpagam Journal of applied sciences research . 2012,第11期

机译：蚁群优化中使用序列和并行信息素更新策略解决车间作业调度问题
2. Solving Job-shop Scheduling Problem with an Ant Colony Optimization Algorithm Based on Mutation and Dynamic Pheromone Updating [J] . Jia Na Journal of Systems Science and Information . 2006,第3期

机译：基于突变和动态信息素更新的蚁群优化算法求解作业车间调度问题
3. Solving Job-shop Scheduling Problem with an Ant Colony Optimization Algorithm Based on Mutation and Dynamic Pheromone Updating [J] . Jia, Na 系统科学与信息学报：英文版 . 2006,第003期

机译：基于突变和动态信息素更新的蚁群优化算法求解作业车间调度问题
4. On the Pheromone Update Rules of Ant Colony Optimization Approaches for the Job Shop Scheduling Problem [C] . Dong Do Duc, Huy Q. Dinh, Huan Hoang Xuan Pacific Rim International Conference on Multi-Agents . 2008

机译：关于作业商店调度问题的蚁群优化方法的信息素更新规则
5. Parallel machine scheduling with sequence dependent setup times using ant colony optimization heuristics in a GPU environment [D] . Mishra, Anjali 2009

机译：在GPU环境中使用蚁群优化启发式算法进行具有顺序依赖的设置时间的并行机器调度
6. An improved ant colony optimization algorithm with fault tolerance for job scheduling in grid computing systems [O] . Hajara Idris, Absalom E. Ezugwu, Sahalu B. Junaidu, -1

机译：网格计算系统中一种具有容错能力的蚁群优化算法
7. Ant colony optimization for job shop scheduling using multi-attribute dispatching rules [O] . Przemysław Korytkowski, Szymon Rymaszewski, Tomasz Wiśniewski 2013

机译：基于多属性调度规则的作业车间调度蚁群优化

On the Pheromone Update Rules of Ant Colony Optimization Approaches for the Job Shop Scheduling Problem

摘要

著录项

相似文献

相关主题

期刊订阅