IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v13y2012i4p465-479.html
   My bibliography  Save this article

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

Author

Listed:
  • Maghsud Solimanpur
  • Reza Rastgordani

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.

Suggested Citation

  • Maghsud Solimanpur & Reza Rastgordani, 2012. "Minimising tool switching and indexing times by ant colony optimisation in automatic machining centres," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 13(4), pages 465-479.
    • Handle: RePEc:ids:ijores:v:13:y:2012:i:4:p:465-479
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=46228
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Akhundov, Najmaddin & Ostrowski, James, 2024. "Exploiting symmetry for the job sequencing and tool switching problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 976-987.
    2. Dang, Quang-Vinh & van Diessen, Thijs & Martagan, Tugce & Adan, Ivo, 2021. "A matheuristic for parallel machine scheduling with tool replacements," European Journal of Operational Research, Elsevier, vol. 291(2), pages 640-660.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:13:y:2012:i:4:p:465-479. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.