An Approach of Process Planning Using Ant Colony Optimization Algorithm

Article Preview

Abstract:

An ant colony optimization (ACO) approach has been developed to deal with process planning problem to achieve the optimal process plan. A disjunctive weighted directed graph is conducted to describe the operations, precedence constraints between operations, and the possible visited path between operation nodes. A represent of process plan is described based on the disjunctive weighted directed graph. Ant colony goes through the necessary nodes on the graph to achieve the optimal solution with the objective of minimizing Total Production Costs (TPC). Extensive comparative experiments have been carried out to demonstrate the feasibility and efficiency of the proposed approach.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

209-212

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] F. Cay and C. Chassapis: COMPUT. IND. Vol 34 (1997), p.307.

Google Scholar

[2] W.B. Zhang, Z.H. Lu and G.Y. Zhu: ROBOT CIM-INT MANUF Vol. 22 (2006), p.180.

Google Scholar

[3] W.D. Li, S.K. Ong and A.Y.C. Nee: INT J PROD RES Vol. 40 (2002), p.1899.

Google Scholar

[4] W.D. Li, S.K. Ong and A.Y.C. Nee: INT J PROD RES Vol. 42 (2004), p. (1955).

Google Scholar

[5] F. Zhang, Y.F. Zhang and A.Y.C. Nee: IEEE T EVOLUT COMPUT Vol. 1 (1997), p.278.

Google Scholar

[7] X.J. Liu and H. Yi and Z.H. Ni: J INTELL MANUF Vol. 24 (2013), p.1.

Google Scholar