Applications of Genetic Algorithms in Process-Planning: Tool Sequence Selection for 2.5D Pocket Machining

Author(s):  
Roshan M. D’Souza ◽  
Zaryab Ahmad

Rapid tool change mechanisms in modern CNC machines have enabled the use of multiple tools (sequence of tools) to machine a given pocket. Larger diameter tools that have higher material removal rates are used to clear large open spaces, smaller tools are used for clean up. The challenge lies in selecting that particular combination of tools that minimizes total cost. Previously, we developed algorithms based on network optimization to find the best tool sequence given a list of cutters, cutting parameters and pocket geometry. The formulation was based on certain assumptions that did not account for tool holder geometry. It also required the evaluation of all possible tool-pair combinations for a given tool set. This can get time consuming if the tool set is large. In this paper, we present a genetic algorithm based method to select optimal tool sequences. The algorithm was implemented and bench marked against the graph algorithm. We have found that the GA based method is able to find a near optimal tool sequence without evaluating up to 30% of all possible tool-pairs.

Author(s):  
Roshan M. D’Souza ◽  
Carlo Se´quin ◽  
Paul Wright

This paper describes algorithms for efficiently machining an entire setup. A setup consists of a set of features with precedence constraints, that are machined when the stock is clamped in a particular orientation. This work extends earlier research which addressed the issue of selecting an cheapest tool sequence for a single pocket.


Author(s):  
Roshan M. D’Souza ◽  
Paul K. Wright ◽  
Carlo Se´quin

Significant cycle time saving can be achieved in 2.5-D milling by intelligently selecting tool sequences. The problem of finding the optimal tool sequence was reduced to finding the shortest path in a single-source single-sink directed acyclic graph. The nodes in the graph represented the state of the stock after the tool named in the node was done machining and the edges represented the cost of machining. In this paper a novel method for handling tool holder collision in the graph-based algorithm for optimal tool sequence selection has been developed. The method consists of iteratively solving the graph for the shortest path, validating the solution by checking for tool holder collisions and eliminating problematic edges in the graph. Also described is a method to intelligently build the graph such that in presence of tool holder collisions, the complexity of building the graph is greatly reduced.


2002 ◽  
Vol 2 (4) ◽  
pp. 345-349 ◽  
Author(s):  
Roshan M. D’Souza ◽  
Paul K. Wright ◽  
Carlo Se´quin

Significant cycle time saving can be achieved in 2.5-D milling by intelligently selecting tool sequences. The problem of finding the optimal tool sequence was formulated as finding the shortest path in a single-source single-sink directed acyclic graph. The nodes in the graph represented the state of the stock after the tool named in the node was done machining and the edges represented the cost of machining. In this paper a novel method for handling tool holder collision in the graph-based algorithm for optimal tool sequence selection has been developed. The method consists of iteratively solving the graph for the shortest path, validating the solution by checking for tool holder collisions and eliminating problematic edges in the graph. Also described is a method to reduce the complexity of building the tool sequence graph in case there are tool holder collisions.


2011 ◽  
Vol E94-B (5) ◽  
pp. 1495-1497 ◽  
Author(s):  
Yue XIAO ◽  
Qihui LIANG ◽  
Peng CHENG ◽  
Lilin DAN ◽  
Shaoqian LI

Sign in / Sign up

Export Citation Format

Share Document