An improved approach for determination of index positions on CNC magazines with cutting tool duplications by integrating shortest path algorithm

Optimisation of automatic tool changer (ATC) indexing problem, where cutting tools are allocated to the stations on a turret magazine of a CNC machine, is one of the challenging problems in machining. The aim of the problem is to minimise the total indexing time of ATC. This problem becomes even more challenging if duplication of cutting tools is allowed and a bidirectional ATC is used. The problem has a unique feature which has not been stressed yet by other researchers, that is, although ATC indexing (master problem) is the main optimisation problem, objective function evaluation of this problem is a standalone optimisation problem (sub problem) indeed. Although an approximation algorithm does not guarantee optimality for the master problem, the subproblem must be solved optimally; otherwise, deficiencies arising from ill-defined objective function might be encountered. Considering this interesting future, a novel methodology, which employs a shortest path algorithm, is developed. Thus, the subproblem of this complicated problem can be optimally solved. Moreover, two metaheuristics, based on threshold accepting and descent first improvement greedy methodologies, are proposed for generating efficient solutions. Finally, several benchmarking instances are generated and solved to test the proposed algorithms.

[1]  Kathryn E. Stecke,et al.  A synthesis of decision models for tool management in automated manufacturing , 1993 .

[2]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  Noureddine Bouhmala,et al.  A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems , 2014, TheScientificWorldJournal.

[5]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Türkay Dereli,et al.  Heuristic optimization system for the determination of index positions on CNC magazines with the consideration of cutting tool duplications , 2004 .

[8]  J M Wilson.  Formulation and Solution of a Set of Sequencing Problems for Flexible Manufacturing Systems , 1987 .

[9]  Cheng-Yan Kao,et al.  Applying the genetic approach to simulated annealing in solving some NP-hard problems , 1993, IEEE Trans. Syst. Man Cybern..

[10]  David Sinriech,et al.  Sequencing, scheduling and tooling single-stage multifunctional machines in a small batch environment , 2001 .

[11]  M. Selim Akturk,et al.  Integrated scheduling and tool management in flexible manufacturing systems , 2001 .

[12]  M. Selim Akturk,et al.  Tool magazine arrangement and operations sequencing on CNC machines , 1996, Comput. Oper. Res..

[13]  Türkay Dereli,et al.  Allocating optimal index positions on tool magazines using genetic algorithms , 2000, Robotics Auton. Syst..

[14]  Kathryn E. Stecke,et al.  Heuristics for minimizing tool switches when scheduling part types on a flexible machine , 1998 .

[15]  Adil Baykasoglu,et al.  A simulated annealing algorithm for dynamic layout problem , 2001, Comput. Oper. Res..

[16]  G. Laporte,et al.  Heuristics for minimizing tool switches when scheduling part types on a flexible machine , 1998 .

[17]  David Sinriech,et al.  Sequencing, Scheduling and Tooling Single-Stage Multifunctional Machines in a Small Batch Environment , 2001 .

[18]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .