Moth optimisation algorithm with local search for the permutation flow shop scheduling problem
by Anmar Abuhamdah; Malek Alzaqebah; Sana Jawarneh; Ahmad Althunibat; Mustafa Banikhalaf
International Journal of Computer Applications in Technology (IJCAT), Vol. 65, No. 3, 2021

Abstract: This work investigates the use of the Moth-Flame Optimisation (MFO) algorithm in solving the Permutation Flow Shop Scheduling Problem and proposes further optimisations. MFO is a population-based approach that simulates the behaviour of real moths by exploiting the search space randomly without employing any local searches that may stick in local optima. Therefore, we propose a Hybrid Moth Optimisation Algorithm (HMOA) that is embedded within a local search to better exploit the search space. HMOA entails employing three search procedures to intensify and diversify the search space in order to prevent the algorithm's becoming trapped in local optima. Furthermore, HMOA adaptively selects the search procedure based on improvement ranks. In order to evaluate the performances of MFO and HMOA, we perform a comparison against other approaches drawn from the literature. Experimental results demonstrate that HMOA is able to produce better-quality solutions and outperforms many other approaches on the Taillard benchmark.

Online publication date: Tue, 06-Jul-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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