Minimizing tool switching and indexing times with tool duplications in automatic machines.

Saved in:

Bibliographic Details
Title:	Minimizing tool switching and indexing times with tool duplications in automatic machines.
Authors:	Baykasoğlu, Adil¹ adil.baykasoglu@deu.edu.tr, Ozsoydan, Fehmi¹ burcin.ozsoydan@deu.edu.tr
Source:	International Journal of Advanced Manufacturing Technology. Mar2017, Vol. 89 Issue 5-8, p1775-1789. 15p. 10 Diagrams, 3 Charts, 1 Graph.
Subjects:	Automatic machinery, Machine tools -- Automatic control, Cutting tools, Structural optimization, Simulated annealing, Machining, Economics
Abstract:	Minimization of nonmachining time is a crucial issue for effective and profitable utilization of automatic machining centers. Most of the automatic machining centers contain an automatic tool changer (ATC) for holding multiple cutting tools. Effective operation of ATC in relation to the parts assigned for machining is critical in minimizing nonmachining times. There are actually two main operations on ATCs which can be reduced by making use of suitable optimization procedures. These operations are known as 'ATC indexing problem' and 'tool switching problem (ToSP).' These problems are separately addressed as NP-hard problems in the literature and mostly solved independently so far. In the present work, we made an attempt to solve these problems simultaneously by making use of a simulated annealing (SA) algorithm with novel solution coding/encoding strategies. The results are compared with the lower bounds obtained by a method proposed in the present work. Promising findings are expected to contribute to the possible future work of this research field. [ABSTRACT FROM AUTHOR]
	Copyright of International Journal of Advanced Manufacturing Technology is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Minimization of nonmachining time is a crucial issue for effective and profitable utilization of automatic machining centers. Most of the automatic machining centers contain an automatic tool changer (ATC) for holding multiple cutting tools. Effective operation of ATC in relation to the parts assigned for machining is critical in minimizing nonmachining times. There are actually two main operations on ATCs which can be reduced by making use of suitable optimization procedures. These operations are known as 'ATC indexing problem' and 'tool switching problem (ToSP).' These problems are separately addressed as NP-hard problems in the literature and mostly solved independently so far. In the present work, we made an attempt to solve these problems simultaneously by making use of a simulated annealing (SA) algorithm with novel solution coding/encoding strategies. The results are compared with the lower bounds obtained by a method proposed in the present work. Promising findings are expected to contribute to the possible future work of this research field. [ABSTRACT FROM AUTHOR]
ISSN:	02683768
DOI:	10.1007/s00170-016-9194-z