University of Ottawa - Carleton University
Ottawa-Carleton Institute for Computer Science (OCICS) Presentation
|
March 8, 2013 @ 10:00
A Combinatorial Optimization Approach to Maximize Productivity in Computer Aided Manufacturing
|
Speaker: Azarmehr Ramin
Location: 240 TB (Tory Building) |
ABSTRACT
Time and Power efficiency play a vital role in mass production with high speed CNC machine tools in industrial environments. To achieve this goal, we propose a heuristic approach to minimize the non-productive traveling time (Airtime) of tool path in CNC Machines. Our method involves different variants of the well-known Traveling Salesman Problem (TSP) and a special form of precedence constraint. We assume that the optimization algorithm has to deal with polygons or polylines or their combination. Thus, polygons are modeled as Generalized TSP (GTSP), and polylines are formulated as a variation of Clustered TSP (CTSP). These variants are transformed into asymmetric TSP, and then they are solved using a heuristic method. The optimized tool path minimizes power consumption and production time of CNC machines in manufacturing. |
| Return to Schedule |
|
