Name
Abstract | ||
|---|---|---|
This paper presents a method for the process planning of prismatic part, where the machining operations of a manufacturing feature can be done by different machine, set-ups, and tools. The optimization objective is to minimize the total cost which includes the Preparing Cost and the Machining Cost. Here, process planning is modeled as a constraint-based traveling salesman problem (TSP), and an ant colony algorithm is developed and embedded in the optimization algorithm. A case study and comparisons with the genetic algorithm approaches show that the ant algorithm can significantly reduce the machining cost and be better. © 2010 IEEE. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICCA.2010.5524370 | ICCA |
Keywords | Field | DocType |
machining,process planning,travelling salesman problems,ANT-Q algorithm,ant colony algorithm,constraint based traveling salesman problem,machining operations,optimization algorithm,process planning optimization | Ant colony optimization algorithms,Mathematical optimization,Meta-optimization,Algorithm,Machining,Travelling salesman problem,Optimization algorithm,Engineering,Total cost,Genetic algorithm | Conference |
Volume | Issue | Citations |
null | null | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaojun Liu | 1 | 0 | 2.03 |
| Zhonghua Li | 2 | 1 | 1.39 |