IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v14y2020i2p247-264.html
   My bibliography  Save this article

Optimisation of cost efficient robotic assembly line using metaheuristic algorithms

Author

Listed:
  • Mukund Nilakantan Janardhanan
  • Peter Nielsen

Abstract

Robotic assembly lines (RALs) are utilised due to the flexibility it provides to the overall production system. Industries mainly focus on reducing the operation costs involved. From the literature survey it can be seen that only few research has been reported in the area of cost related optimisation in RALs. This paper focuses on proposing a new model in RALs with the main objective of maximising line efficiency by minimising total assembly line cost. The proposed model can be used production managers to balance a RAL in an efficient manner. Since simple assembly line balancing problem is classified as NP-hard, proposed problem due to additional constraints also falls under the same category. Particle swarm optimisation (PSO) and differential evolution (DE) are applied as the optimisation tool to solve this problem. The performances of this proposed algorithm are tested on a set of reported benchmark problems. From the comparative study, it is found that the proposed DE algorithm obtain better solutions for the majority of the problems tested. [Received: 2 July 2018; Revised: 16 December 2018; Revised: 8 May 2019; Accepted: 2 August 2019]

Suggested Citation

  • Mukund Nilakantan Janardhanan & Peter Nielsen, 2020. "Optimisation of cost efficient robotic assembly line using metaheuristic algorithms," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 14(2), pages 247-264.
  • Handle: RePEc:ids:eujine:v:14:y:2020:i:2:p:247-264
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=105698
    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.

    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:eujine:v:14:y:2020:i:2:p:247-264. 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=210 .

    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.