### Abstract

critically reviews research publications on drilling path optimization. In particular, this review focuses on three aspects; problem modeling, objective functions, and optimization algorithms.

We conclude that most papers being published on hole drilling are simply basic Traveling Salesman Problems (TSP) for which extremely powerful heuristics exist and for which source code is readily available. Therefore, it is remarkable that many researchers continue developing “novel” metaheuristics for hole drilling without properly situating those approaches in the larger TSP literature. Consequently, more challenging hole drilling applications that are modeled by the Precedence Constrained TSP or hole drilling with sequence dependent drilling times do not much research focus. Sadly, these many low quality hole drilling research publications drown out the occasional high quality papers that describe specific problematic problem constraints or objective functions. It is our hope through this review paper that researchers’ efforts can be refocused on these problem aspects in order to minimize production costs in the general sense.

Language | English |
---|---|

Pages | 1 |

Number of pages | 11 |

Journal | Archives of Computational Methods in Engineering |

DOIs | |

State | Accepted/In press - 2019 |

### Fingerprint

### Keywords

- path optimizatoin
- hole drilling

### Cite this

*Archives of Computational Methods in Engineering*, 1. DOI: 10.1007/s11831-018-9251-x

}

*Archives of Computational Methods in Engineering*, pp. 1. DOI: 10.1007/s11831-018-9251-x

**A Critical Review of Multi-hole Drilling Path Optimization.** / Dewil, R.R.H.; Küçükoglu, Ilker; Luteyn, Corrinne; Cattrysse, Dirk.

Research output: Contribution to Journal › Review article › Academic › peer-review

TY - JOUR

T1 - A Critical Review of Multi-hole Drilling Path Optimization

AU - Dewil,R.R.H.

AU - Küçükoglu,Ilker

AU - Luteyn,Corrinne

AU - Cattrysse,Dirk

PY - 2019

Y1 - 2019

N2 - Hole drilling is one of the major basic operations in part manufacturing. It follows without surprise then that the optimization of this process is of great importance when trying to minimize the total financial and environmental cost of part manufacturing. In multi-hole drilling, 70 % of the total process time is spent in tool movement and tool switching. Therefore, toolpath optimization in particular has attracted significant attention in cost minimization. This papercritically reviews research publications on drilling path optimization. In particular, this review focuses on three aspects; problem modeling, objective functions, and optimization algorithms. We conclude that most papers being published on hole drilling are simply basic Traveling Salesman Problems (TSP) for which extremely powerful heuristics exist and for which source code is readily available. Therefore, it is remarkable that many researchers continue developing “novel” metaheuristics for hole drilling without properly situating those approaches in the larger TSP literature. Consequently, more challenging hole drilling applications that are modeled by the Precedence Constrained TSP or hole drilling with sequence dependent drilling times do not much research focus. Sadly, these many low quality hole drilling research publications drown out the occasional high quality papers that describe specific problematic problem constraints or objective functions. It is our hope through this review paper that researchers’ efforts can be refocused on these problem aspects in order to minimize production costs in the general sense.

AB - Hole drilling is one of the major basic operations in part manufacturing. It follows without surprise then that the optimization of this process is of great importance when trying to minimize the total financial and environmental cost of part manufacturing. In multi-hole drilling, 70 % of the total process time is spent in tool movement and tool switching. Therefore, toolpath optimization in particular has attracted significant attention in cost minimization. This papercritically reviews research publications on drilling path optimization. In particular, this review focuses on three aspects; problem modeling, objective functions, and optimization algorithms. We conclude that most papers being published on hole drilling are simply basic Traveling Salesman Problems (TSP) for which extremely powerful heuristics exist and for which source code is readily available. Therefore, it is remarkable that many researchers continue developing “novel” metaheuristics for hole drilling without properly situating those approaches in the larger TSP literature. Consequently, more challenging hole drilling applications that are modeled by the Precedence Constrained TSP or hole drilling with sequence dependent drilling times do not much research focus. Sadly, these many low quality hole drilling research publications drown out the occasional high quality papers that describe specific problematic problem constraints or objective functions. It is our hope through this review paper that researchers’ efforts can be refocused on these problem aspects in order to minimize production costs in the general sense.

KW - path optimizatoin

KW - hole drilling

U2 - 10.1007/s11831-018-9251-x

DO - 10.1007/s11831-018-9251-x

M3 - Review article

SP - 1

JO - Archives of Computational Methods in Engineering

T2 - Archives of Computational Methods in Engineering

JF - Archives of Computational Methods in Engineering

SN - 1134-3060

ER -