To optimize MFJSSP, this paper presented an improved method based on ant colony algorithm. In the approved algorithm, defined subsets number according to jobs number. Discribed the method of constructing allowing set. Used an effective local search method for a better scheduling. Discussed the problem of choosing suitable parameters in ant colony algorithm. Improved the ant colony algorithm for MFJSSP. Applied the improved ant colony algorithm in the problem of 4 × 5 and problem 8 × 8. It achieved satisfactory results. The obtained results indicate that the proposed approach is feasible and effective for MFJSSP.%为了对MFJSSP进行优化,给出了改进的基于蚁群算法的MFJSSP解决方法.改进后的算法根据工件数量确定子集数量.给出了可选工作集的构建方法及在寻优过程中的邻域搜索策略,并对蚁群算法的参数选择问题进行了讨论.完成了MFJSSP中蚁群算法的改进,并将改进后的蚁群算法应用于解决4×5和8×8问题,取得了较理想的结果.实验结果证明所提出的算法在解决MFJSSP上是一种可行、有效的解决方法.
展开▼
