Minimising tool switching and indexing times by ant colony optimisation in automatic machining centres

Maghsud Solimanpur and Reza Rastgordani

International Journal of Operational Research, 2012, vol. 13, issue 4, 465-479

Abstract: This paper proposes an ant algorithm to minimise the total summation of tool switching and indexing times. The objective of interest is to determine optimal sequence of jobs and position of cutting tools on the tool magazine based on minimum tool switching and rotation of tool magazine. It is shown that this problem is strongly NP-hard and therefore it is computationally intractable to determine global optimum solution of this problem even for medium-sized problems. An ant algorithm is proposed in this paper to solve this problem. Performance of the proposed algorithm is compared with multiple start greedy (MSG) heuristic through solving nine-test problems. The results indicate that the proposed algorithm yields promising solutions to the problem of interest.

Keywords: tool switching time; indexing time; ant colony optimisation; ACO; machining centres; job sequencing; tool positioning; cutting tools. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=46228 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:13:y:2012:i:4:p:465-479

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().