Optimization Algorithm of Holes Machining Path

DOI

10.2991/emeit.2012.414How to use a DOI?

Keywords

traveling salesman problem, path planning, genetic algorithm, group holes machining

Abstract

Holes machining path planning is of great significance to improve the efficiency and quality of the processing of porous parts. Hole group on the characteristics of size, shape, and location of different multi-bit processing optimization and process optimization, a reasonable choice of the machining path planning method. Verified by an example of this optimization method significantly improved in the holes machining CNC machining efficiency, reduce processing costs. Holes machining path optimization analysis and description of the problem, to clear this problem are essentially multi-point optimization method and process optimization, and the optimization method to determine the selection principle.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jing Zhang
PY  - 2012/09
DA  - 2012/09
TI  - Optimization Algorithm of Holes Machining Path
BT  - Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT 2012)
PB  - Atlantis Press
SP  - 1871
EP  - 1874
SN  - 1951-6851
UR  - https://doi.org/10.2991/emeit.2012.414
DO  - 10.2991/emeit.2012.414
ID  - Zhang2012/09
ER  -