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

Multi-objective invasive weeds optimisation algorithm for solving simultaneous scheduling of machines and multi-mode automated guided vehicles

Author

Listed:
  • Hojat Nabovati
  • Hassan Haleh
  • Behnam Vahdani

Abstract

In this paper, a novel model is presented for machines and automated guided vehicles' simultaneous scheduling, which addresses an extension of the blocking job shop scheduling problem, considering the transferring of jobs between different machines using a limited number of multi-mode automated guided vehicles. Since the model is strictly NP-hard, and because objectives contradict each other, a meta-heuristic algorithm called 'multi-objective invasive weeds optimisation algorithm' with a new chromosome structure which guarantees the feasibility of solutions is developed to solve the proposed problem. Two other meta-heuristic algorithms namely 'non-dominated sorting genetic algorithm' and 'multi-objective particle swarm optimisation algorithm' are applied to validate the solutions obtained by the developed multi-objective invasive weeds optimisation algorithm. A certain method was applied to select the algorithm with the best performance. The result of ranking the algorithms indicated that the developed multi-objective invasive weeds optimisation algorithm had the best performance in terms of solving the mentioned problems. [Received: 7 January 2017; Revised: 30 December 2017; Revised: 17 August 2018; Revised: 22 January 2019; Accepted: 26 July 2019]

Suggested Citation

  • Hojat Nabovati & Hassan Haleh & Behnam Vahdani, 2020. "Multi-objective invasive weeds optimisation algorithm for solving simultaneous scheduling of machines and multi-mode automated guided vehicles," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 14(2), pages 165-188.
    • Handle: RePEc:ids:eujine:v:14:y:2020:i:2:p:165-188
    as

    Download full text from publisher

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