アントコロニー最適化によるジョブショップスケジューリング問題の解法
Solving the Job Shop Scheduling Problem with Ant Colony Optimization
ジョブショップスケジューリング問題を完全グラフとしてモデル化し、アントコロニー最適化で実行可能解を生成する手法を提案し、複数の問題例で有効性を検証した。
分類: cs.MA, cs.RO
原文アブストラクト
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.
関連論文
- 不確実性を考慮した補給スケジューリング最適化による持続的自律運用スケジューリング最適化
