Genetic algorithms in agent-based manufacturing scheduling systems
Genetic algorithms in agent-based manufacturing scheduling systems
复制标题
DOI：
10.3233/ica-2002-9302
复制
发表时间：
2002-08
期刊：
影响因子：
--
通讯作者：
W. Shen
中科院分区：
文献类型：
--
作者：
W. Shen
制造计划是从备选计划中进行选择并将制造资源和时间分配给计划中的一组制造过程的过程。它是一个优化过程，有限的制造资源分配之间的并行和顺序的活动随着时间的推移。本文提出了一种新的方法，结合遗传算法的搜索和基于Agent的协商制造调度。由于基于Agent的方法强调灵活性和响应性，而遗传算法追求解的最优性，基于Agent的方法和遗传算法的组合提供了一个有前途的方法来提高制造调度系统的性能。经过简短的研究文献回顾，本文介绍了所提出的集成方法，并描述了在基于代理的制造调度系统中实现遗传算法的方法和算法。最后给出了一些实验结果。
Manufacturing scheduling is the process of selecting from alternative plans and assigning manufacturing resources and time to the set of manufacturing processes in the plan. It is an optimization process by which limited manufacturing resources are allocated over time among parallel and sequential activities. This paper presents a new approach by combining genetic algorithms based search and agent-based negotiation for manufacturing scheduling. Since agent-based approaches emphasize on flexibility and responsiveness and genetic algorithms pursue the optimality of solutions, a combination of agent-based approaches and genetic algorithms provides a promising way to enhance the performance of manufacturing scheduling systems. After a brief research literature review, the paper introduces the proposed integration approach and describes the methods and algorithms for implementing a genetic algorithm in an agent-based manufacturing scheduling system. Some experimental results are also presented.