论文标题
通过优化蚂蚁殖民地解决车间调度问题
Solving the Job Shop Scheduling Problem with Ant Colony Optimization
论文作者
论文摘要
作业车间时间表问题（JSSP）是指代理商分配应从集群中在计算机中指定时间执行的任务的能力。可以从几种方法中实现任务分配，但是，该报告探讨了蚂蚁菌落优化为多种JSSP实例生成可行解决方案的能力。该建议将JSSP建模为完整的图形，因为分离模型可以防止ACO探索所有搜索空间。 JSSP的几个实例用于评估该提案。结果表明，该算法可以通过选择参数来达到最佳解决方案，以便于更轻松，更难实例。
The Job Shop Schedule Problem (JSSP) refers to the ability of an agent to allocate tasks that should be executed in a specified time in a machine from a cluster. The task allocation can be achieved from several methods, however, this report it is explored the ability of the Ant Colony Optimization to generate feasible solutions for several JSSP instances. This proposal models the JSSP as a complete graph since disjunct models can prevent the ACO from exploring all the search space. Several instances of the JSSP were used to evaluate the proposal. Results suggest that the algorithm can reach optimum solutions for easy and harder instances with a selection of parameters.
