Abstract

By setting up the 'point milling process-TSPPC' model, this study firstly is to further discreteness the point milling process and then successfully transforms it into a traveling salesman problem with precedence constraints through setting the tabu list to record manufacturing procedures. Based on characteristics of the constraints, the tabu list is used to further expand the Bee Colony algorithm and get the Dynamic Tabu Artificial Bee Colony algorithm (DTABC-algorithm) which can dynamically update the solution space. The DTABC-algorithm is used to solve the 'point milling process-TSPWTR' model. By testing, not only the 'point milling process-TSPPC' model can effectively simplify the problem of point milling process, but also the DTABC-algorithm can show outstanding properties through the solving process.

Keywords:

Dynamic tabu artificial bee colony algorithm, hole machining path planning optimization, the traveling salesman problem with precedence constraints,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.