A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem (Q2627273)

Summary: The crew scheduling problem is a set covering or set partitioning problem. It schedules the crew members so that all flights are covered, while the cost is minimised. The crew scheduling is an non-deterministic polynomial-time hard constrained combinatorial optimisation problem, so it cannot be exactly solved in a reasonable computation time. This paper presents a particle swarm optimisation (PSO) algorithm for simulating and solving the crew scheduling problem. The proposed algorithm is extended from the discrete version of PSO. By applying PSO to the crew scheduling problem, the cost is improved when compared with other well-known algorithms. This is the first study that introduces PSO for simulation and optimisation of the crew scheduling problem.