Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization

Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization

0.00 Avg rating0 Votes
Article ID: iaor20043517
Country: United Kingdom
Volume: 42
Issue: 3
Start Page Number: 473
End Page Number: 491
Publication Date: Jan 2004
Journal: International Journal of Production Research
Authors: ,
Keywords: programming: travelling salesman
Abstract:

A new heuristic approach for minimizing the operating path of automated or computer numerically controlled drilling operations is described. The operating path is first defined as a travelling salesman problem. The new heuristic, particle swarm optimization, is then applied to the travelling salesman problem. A model for the approximate prediction of drilling time based on the heuristic solution is presented. The new method requires few control variables: it is versatile, robust and easy to use. In a batch production of a large number of items to be drilled such as in printed circuit boards, the travel time of the drilling device is a significant portion of the overall manufacturing process, hence the new particle swarm optimization–travelling salesman problem heuristic can play a role in reducing production costs.

Reviews

Required fields are marked *. Your email address will not be published.