Multi-objective invasive weeds optimisation algorithm for solving simultaneous scheduling of machines and multi-mode automated guided vehicles Online publication date: Mon, 09-Mar-2020
by Hojat Nabovati; Hassan Haleh; Behnam Vahdani
European J. of Industrial Engineering (EJIE), Vol. 14, No. 2, 2020
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]
Online publication date: Mon, 09-Mar-2020
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 European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and 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 firstname.lastname@example.org