Title: An improved discrete pigeon-inspired optimisation algorithm for flexible job shop scheduling problem

Authors: Xiuli Wu; Xianli Shen; Ning Zhao; Shaomin Wu

Addresses: School of Mechanic Engineering, University of Science and Technology Beijing, Beijing, China ' School of Mechanic Engineering, University of Science and Technology Beijing, Beijing, China ' School of Mechanic Engineering, University of Science and Technology Beijing, Beijing, China ' Kent Business School, University of Kent, Canterbury, UK

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.

Keywords: discrete pigeon-inspired optimisation algorithm; flexible job shop scheduling problem; discretisation; map and compass operator; landmark operator.

DOI: 10.1504/IJBIC.2020.111278

International Journal of Bio-Inspired Computation, 2020 Vol.16 No.3, pp.181 - 194

Accepted: 15 May 2020
Published online: 03 Nov 2020 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article