Minimising tool switching and indexing times by ant colony optimisation in automatic machining centres
by Maghsud Solimanpur; Reza Rastgordani
International Journal of Operational Research (IJOR), Vol. 13, No. 4, 2012

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.

Online publication date: Sun, 11-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com