摘要
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.
学科与关键词
- Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problemZhong, Yiwen*; Wang, Lijin; Lin, Min; Zhang, HuiSwarm and Evolutionary Computation, 2019, 48: 134-144.被引 42
- A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMSGe, H. W.; Liang, Y. C.*; Zhou, Y.; Guo, X. C.International Journal of Computational Methods, 2005, 2(3): 419-430.被引 20
- A Modified Biogeography-Based Optimization for the Flexible Job Shop Scheduling ProblemYang, Yuzhen*MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015: 184643.被引 8
