An improved whale optimisation algorithm for distributed assembly flow shop with crane transportation
by Qing-Hua Li; Jun-Qing Li; Qing-Ke Zhang; Peng Duan; Tao Meng
International Journal of Automation and Control (IJAAC), Vol. 15, No. 6, 2021

Abstract: In this study, we investigate a classical distributed assembly flow shop scheduling problem with crane transportation. The objectives are to minimise the weighted value of the makespan and the energy consumptions. An improved whale optimisation algorithm (IWOA) which is embedded with a simulated annealing (SA) algorithm is proposed to solve the considered problem. First, a clustering method is applied to divide the solutions to improve the performance of the algorithm. Then, a right shift heuristic is developed to reduce the number of machine switches, therefore decreasing the energy consumption. In addition, two novel crossover operators, namely, factory crossover and solution crossover, are designed to increase the overall performance of the proposed algorithm. Furthermore, a SA-based global search heuristic is embedded in the algorithm to enhance its exploration abilities. Finally, several real-world instances were generated to test the performance of the proposed algorithm. The experimental results show that this algorithm performs better than other comparable algorithms.

Online publication date: Thu, 28-Oct-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 Automation and Control (IJAAC):
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 subs@inderscience.com