Two heuristic algorithms were proposed to solve the tool path optimization problem, encountered in layered manufacturing. One of the solution methods required the solving of an integer program and an asymmetric traveling salesman problem. In another method there was a local improvement heuristic which incorporated the 2-opt and 3-opt search procedures into a genetic algorithm. It was demonstrated that the problem could be formulated as a symmetric traveling salesman problem, which could be solved by traditional traveling salesman solution methods.
|Number of pages||2|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|Publication status||Published - 1 Jan 2003|
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering