ABSTRACT
Optimization of the idle time is the objective of the present work which is done by
minimizing the idle tool path in drilling on CNC machining centres to improve productivity
as a result of reducing the idle path time. The case is formulated as a traveling
salesman problem and is solved using the Genetic Algorithm (GA). The Branch and
Bound (B&B) optimization method was used for the sake of comparison with the Genetic
Algorithm. The working mechanism of the GA was inspired by the nature which is based
on the evolutionary process of biological organisms. The work is done in three steps,
first step is the parameterization of the GA parameters (population size, replacement,
crossover and mutation); Second step is the numerical study for the GA validation, for
comparison between the GA and B&B and comparison between the GA and the current
practice, the third step is the experimental verification of GA results.