IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i15p4633-4648.html
   My bibliography  Save this article

Optimising cutting conditions for minimising cutting time in multi-pass milling via weighted superposition attraction-repulsion (WSAR) algorithm

Author

Listed:
  • Adil Baykasoğlu

Abstract

Milling is one of the most frequently used machining operations in manufacturing industry. In order to remove cutting stocks economically and effectively, it is typically necessary to employ a multi-pass milling plan. Nevertheless, an optimisation practice is desirable in order to decide the most appropriate cutting plan (cutting speeds and feed rates) in each cutting pass to minimise the total machining time. In this study, optimisation of cutting conditions in multi-pass milling is achieved by utilising an improved version of a recently developed swarm intelligence based metaheuristic algorithm, which is known as a weighted superposition attraction algorithm. All of the cutting constraints are successfully satisfied and the results obtained from the proposed optimisation algorithm are compared with other optimisation approaches. The proposed optimisation algorithm is able to provide the best solutions for all test cases with reasonable computational time.

Suggested Citation

  • Adil Baykasoğlu, 2021. "Optimising cutting conditions for minimising cutting time in multi-pass milling via weighted superposition attraction-repulsion (WSAR) algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 59(15), pages 4633-4648, August.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:15:p:4633-4648
    DOI: 10.1080/00207543.2020.1767313
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1767313
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1767313?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:59:y:2021:i:15:p:4633-4648. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.