An improved discrete pigeon-inspired optimisation algorithm for flexible job shop scheduling problem
by Xiuli Wu; Xianli Shen; Ning Zhao; Shaomin Wu
International Journal of Bio-Inspired Computation (IJBIC), Vol. 16, No. 3, 2020

Abstract: The pigeon-inspired optimisation (PIO) algorithm, which is a new promising optimisation algorithm, has successfully solved many continuous optimisation problems. In the literature, however, little research has been conducted on its application to the combinational optimisation problems. This paper therefore tries to fill in this gap and applies the PIO algorithm to solve the flexible job shop scheduling problem (FJSP), which is a typical combinational optimisation problem. It proposes an improved discrete PIO (IDPIO) algorithm to minimise the makespan of FJSP and develops methods to optimise the time to carry out the map and compass operator or the landmark operator with the PIO. The discrete map, compass operator, and the discrete landmark operator are developed respectively. The experiment results show that the IDPIO algorithm can solve the FJSP effectively and efficiently.

Online publication date: Tue, 17-Nov-2020

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 Bio-Inspired Computation (IJBIC):
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