4.6 Article

Optimisation of operations sequence in CAPP using an ant colony algorithm

出版社

SPRINGER LONDON LTD
DOI: 10.1007/s00170-004-2491-y

关键词

ant colony algorithm; computer-aided process planning (CAPP); feasibility constraints; operation sequence

向作者/读者索取更多资源

Computer-aided process planning (CAPP) forms an important interface between Computer-aided design (CAD) and Computer-aided manufacturing (CAM). It is concerned with determining the sequence of individual manufacturing operations required to produce a product as per technical specifications given in the part drawing. Any sequence of manufacturing operations that is generated in a process plan cannot be the best possible sequence every time in a changing production environment. As the complexity of the product increases, the number of feasible sequences increases exponentially, and there is a need to choose the best among them. This paper presents an application of a newly developed metaheuristic called the ant colony algorithm as a global search technique for the quick identification of the optimal operations sequence by considering various feasibility constrains. A couple of case studies are taken from the literature to comparing the results obtained by the proposed method.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据